Manuscript Oai279-A@1 · Oai279-A.tex · remark · a1abc73f
Remark: What this theorem deliberately does not exercise
Stage 6: the explicit circuit for the frozen input › The one completed next theorem · lines 1064–1073
The circuit is a finite reversible lookup, not the source's order-finding or completion circuit. Its transparent exactness does not test the hardest interfaces of that construction.
This is not disguised as a new asymptotic result. Scaling the same lookup method to all -bit inputs introduces exponentially many rows. Polynomial bounds on this partial family do not turn that exponential construction into a general factoring algorithm.