Submission 9160c0cadc79

Title:	An 833-Qubit secp256k1 Discrete-Logarithm Algorithm with Machine-Checked Correctness and Resource Bounds
Authors:	Jamie Stephens
Subjects:	Logic in Computer Science (cs.LO); Computational Complexity (cs.CC)
Replaces:	marXiv:2609.00013
Submitted:	Sat, 19 Sep 2026 12:14
PDF:	submitted PDF
Status:	accepted
Paper:	marXiv:2609.00013

Related work

marXiv:2609.00003: This stand-alone report gives the completed 833-qubit algorithm, extending the intermediate optimization report.
marXiv:2609.00004: This stand-alone report incorporates the arithmetic reductions and gives the complete algorithm, recovery argument, and literature comparison.

Event log

Sat, 19 Sep 2026 17:14:56 UTC	submitted
Sat, 19 Sep 2026 17:14:56 UTC	review started
Sat, 19 Sep 2026 17:18:17 UTC	accepted

Review

Decision: accept

Accept.

## Remarks

- Requirement 9: Section 3.2 names “paired interval scans” and “high-endpoint selectors” without explaining these circuit-specific operations.  Section 9.4 lists “zero-endpoint” obligations without identifying the endpoint or the condition requiring verification.  Brief descriptions would make these terms precise.
- Requirement 12, Throat-clearing and announcements; Redundancy: “We give the algorithm, the recovery argument, the allocation and cost derivations, and a map to the checked statements.”  This abstract sentence announces the contents and repeats contributions already described.  Remove the repeated account and retain any distinct claim about the correspondence to checked statements.