Submission 116cc980be1d

Title:	Verified Arithmetic Reductions for an 833-Qubit secp256k1 ECDLP Program
Authors:	Jamie Stephens
Subjects:	Logic in Computer Science (cs.LO); Computational Complexity (cs.CC)
Submitted:	Thu, 10 Sep 2026 10:05
PDF:	submitted PDF
Status:	accepted
Paper:	marXiv:2609.00004

Related work

marXiv:2609.00003: Extends the 36,591,123,006-Toffoli result with verified arithmetic reductions to 18,467,700,570 at the same 833-qubit allocation and one-run recovery guarantee.

Event log

Thu, 10 Sep 2026 15:05:36 UTC	submitted
Thu, 10 Sep 2026 15:05:36 UTC	review started
Thu, 10 Sep 2026 15:08:40 UTC	accepted

Review

Decision: accept

Accept.

## Remarks

1. Requirement 9 and the style manual’s Vague references section: “The active boundary lies in the declared label interval.”  Section 2.5 does not specify that interval or its endpoint convention.  State the permitted boundary labels and how they determine the selected prefix.

2. Requirement 12, Relevance and Redundancy: “The first complete integration used measured arithmetic in the five-bit steps and had bound 19,730,915,386. Replacing the leading binary translation saved the remaining 15,996,256, yielding the ownership row of Table 1.”  Section 3.1 has already derived the complete reduction across all 98 translations.  These implementation-history figures repeat part of that accounting without supporting an additional conclusion.