# Deterministic factorization: exact guard and bounded conventional audit

The driver uses its new construction only for p>B^200000. The degree-two upper-endpoint threshold is 4,753,080 bits; practical ordinary-size primes stay in its older scalar-search branch. Numeric auxiliary-prime dependence and the uniform Hecke assumption remain material. A separate classical verifier adds 456 finite controls, without accepting or implementing the new source backend.

[Detailed review, exact scope and evidence](../../../../prototypes/finite-field-factorization-2026-10-09-v1/report.md). [Updated opportunity 016](../../../../opportunities/016-deterministic-finite-field-factorization/2026-10-09-v2.md). Source revision `fd4aeeb2ee4fc729c18d98444fed42fd0529eeeb`. No source proof/kernel/program acceptance, customer study or new revenue claim.