{
  "generated_at_utc": "2026-10-09T02:35:09.183964+00:00",
  "source_commit": "fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb",
  "files": [
    {
      "path": "research/prototypes/finite-field-factorization-2026-10-09-v1/archived-source/finite_field_factorization_audit.py",
      "bytes": 10552,
      "sha256": "54b21b7a3f12ff124e03dc406ba0df3c2be79f60b53275624c053c97f929e8b4"
    },
    {
      "path": "research/prototypes/finite-field-factorization-2026-10-09-v1/archived-source/publish_finite_field_factorization_2026_10_09.py",
      "bytes": 23900,
      "sha256": "768f4e5aaa8cdb2ee10819ceb849cfb672ea1f7aea06df07a724fe11c854b4f7"
    },
    {
      "path": "research/prototypes/finite-field-factorization-2026-10-09-v1/archived-source/validate_finite_field_factorization_2026_10_09.py",
      "bytes": 10986,
      "sha256": "0d39020114f326f4987a0acd785b3bf0e1f7771dba0ad26bb49c7c797d7e8a9a"
    },
    {
      "path": "research/prototypes/finite-field-factorization-2026-10-09-v1/cli-valid-report.json",
      "bytes": 924,
      "sha256": "cf3315317b441865d1712cbe05966254c88beaa0120f4b621b3c8e8d2d19313d"
    },
    {
      "path": "research/prototypes/finite-field-factorization-2026-10-09-v1/multiply-back-false-confidence-input.json",
      "bytes": 254,
      "sha256": "355a25d80524256526937b37e61ba551f5bce29826d498d5c2130a6a5f7690b7"
    },
    {
      "path": "research/prototypes/finite-field-factorization-2026-10-09-v1/multiply-back-false-confidence-report.json",
      "bytes": 913,
      "sha256": "0ebc8d56f1848161a7e240c0ae0223c188495084c36aa2527ddd1504240b93ec"
    },
    {
      "path": "research/prototypes/finite-field-factorization-2026-10-09-v1/repeated-valid-input.json",
      "bytes": 243,
      "sha256": "ebaed3a1664f1c9bad62dbf773640f366574aded9f153bdef43840cd638777f3"
    },
    {
      "path": "research/prototypes/finite-field-factorization-2026-10-09-v1/repeated-valid-report.json",
      "bytes": 695,
      "sha256": "e1e4ed08347d4dfbf6efa5ae0426c3705f90c90ad78db541a2df1859b23fab91"
    },
    {
      "path": "research/prototypes/finite-field-factorization-2026-10-09-v1/report.md",
      "bytes": 9064,
      "sha256": "3e2b866ae40711ad7fc3e04736de0bea80e2f6790b7ea97001500d5db3bf07b8"
    },
    {
      "path": "research/prototypes/finite-field-factorization-2026-10-09-v1/scalar-scan-comparisons.json",
      "bytes": 3440,
      "sha256": "f7927a3137ceab86e6febe58069657e05e2e5cf1755909f471a56ef9223b7f1f"
    },
    {
      "path": "research/prototypes/finite-field-factorization-2026-10-09-v1/source-guard-analysis.json",
      "bytes": 1022,
      "sha256": "0a66ba60dbe6a60429328361df019566bcd470ce1d84f564b21151078885cd62"
    },
    {
      "path": "research/prototypes/finite-field-factorization-2026-10-09-v1/source-location-supplement.json",
      "bytes": 3749,
      "sha256": "28803eb99386257cf61bf3d27f290716ff9c6e7dfb862ccd76d3b51edefbb2ad"
    }
  ],
  "source_files": [
    {
      "path": "preprints/Deterministic-Polynomial-Factorization-over-Prime-Fields-October-4-2026/Deterministic-Polynomial-Factorization-over-Prime-Fields.pdf",
      "bytes": 662250,
      "sha256": "ed88aa5ba802311a21c4f265bcef43515a16019f4b5afdd7f52ecbd36ce0204d",
      "extent": "48-page PDF; visual pages 1,38,41,45. Selected construction details read from matching tracked TeX, not a full PDF/proof review.",
      "note": "Selected source reading only; no source proof/kernel/program acceptance."
    },
    {
      "path": "preprints/Deterministic-Polynomial-Factorization-over-Prime-Fields-October-4-2026/README.md",
      "bytes": 730,
      "sha256": "925be7c0279cf5a4a67441c6e930b8c8a5d742c2042d335fd871799da16f73e3",
      "extent": "Complete bibliographic README.",
      "note": "Selected source reading only; no source proof/kernel/program acceptance."
    },
    {
      "path": "preprints/Deterministic-Polynomial-Factorization-over-Prime-Fields-October-4-2026/build/sections/00-introduction.tex",
      "bytes": 15019,
      "sha256": "a7048b62d7a31c5029827ad5db7e32187f5d29035138d6cc0677d48309a05af9",
      "extent": "Complete 278-line introduction, statement, auxiliary-prime reduction and construction overview.",
      "note": "Selected source reading only; no source proof/kernel/program acceptance."
    },
    {
      "path": "preprints/Deterministic-Polynomial-Factorization-over-Prime-Fields-October-4-2026/build/sections/01-table.tex",
      "bytes": 10335,
      "sha256": "3cec5c2a6de5fe8b8759cdc20fd2c11723de54774c7e385626e3caa60ad92639",
      "extent": "Complete auxiliary-prime/primary-generator table section.",
      "note": "Selected source reading only; no source proof/kernel/program acceptance."
    },
    {
      "path": "preprints/Deterministic-Polynomial-Factorization-over-Prime-Fields-October-4-2026/build/sections/08-driver.tex",
      "bytes": 10716,
      "sha256": "2424818377cd664f42cf95da862733ad28932c525ce0b2fac18830443709440e",
      "extent": "Complete driver section; square-free reduction, Berlekamp algebra, scalar scan and recursion.",
      "note": "Selected source reading only; no source proof/kernel/program acceptance."
    },
    {
      "path": "preprints/Deterministic-Polynomial-Factorization-over-Prime-Fields-October-4-2026/build/sections/09-complexity.tex",
      "bytes": 16081,
      "sha256": "b9b69f8a0515a2af0d9b2a8e037809bab138aef74b0388b6ce74d8df3efb045a",
      "extent": "Complete bit-complexity section; representation sizes and branch/auxiliary-prime costs.",
      "note": "Selected source reading only; no source proof/kernel/program acceptance."
    },
    {
      "path": "preprints/Deterministic-Polynomial-Factorization-over-Prime-Fields-October-4-2026/build/sections/10-analytic.tex",
      "bytes": 7603,
      "sha256": "61a920fb8ef1e22d487b8dbeaaf3d3bd98328d08992807b40ed20b467ce0645e",
      "extent": "Complete analytic implication section; exact companion assumption and auxiliary-prime bound.",
      "note": "Selected source reading only; no source proof/kernel/program acceptance."
    },
    {
      "path": "preprints/Primitive-roots-for-every-admissible-integer-base-October-4-2026/primitive-roots-all-integer-bases.pdf",
      "bytes": 891737,
      "sha256": "671ac4b3ece879f614ed8f4b782e61a07805e533f385a694fe4d7afbda3c9365",
      "extent": "92-page PDF; visual page 3, including Theorem 1.2 and discussion. Full proof not reviewed.",
      "note": "Selected source reading only; no source proof/kernel/program acceptance."
    },
    {
      "path": "preprints/Primitive-roots-for-every-admissible-integer-base-October-4-2026/README.md",
      "bytes": 649,
      "sha256": "020f0a3a37ffb00137c31fb151117eff68dddb447a108674c24587212e3b4079",
      "extent": "Complete bibliographic README.",
      "note": "Selected source reading only; no source proof/kernel/program acceptance."
    },
    {
      "path": "preprints/Primitive-roots-for-every-admissible-integer-base-October-4-2026/build/sections/01-introduction.tex",
      "bytes": 11406,
      "sha256": "5cb01a814c568efa5bb6324ecfb9d556ea367e11fa5d59f455a5b203f9ce390d",
      "extent": "Lines 1-180: main statements, uniform Hecke scope, historical distinction and proof/dependency overview.",
      "note": "Selected source reading only; no source proof/kernel/program acceptance."
    },
    {
      "path": "preprints/Primitive-roots-for-every-admissible-integer-base-October-4-2026/build/sections/06-zero-free.tex",
      "bytes": 32624,
      "sha256": "c565166640d5e8210a2af70f00f6b9072112033a182ec7dede17e1517e76be33",
      "extent": "Lines 1-160: opening zero-detection setup and conductor large-sieve lemma/proof. Remaining section and upstream lemmas not checked.",
      "note": "Selected source reading only; no source proof/kernel/program acceptance."
    }
  ],
  "scope": "Selected source feasibility and conventional bounded audit. Inert archived tools are never executed."
}