Submission 8b1199cf2ca3

Title:	Toffoli Reductions and Single-Run Recovery for an 833-Qubit secp256k1 ECDLP Program
Authors:	Jamie Stephens
Subjects:	Logic in Computer Science (cs.LO); Computational Complexity (cs.CC)
Replaces:	marXiv:2609.00003
Submitted:	Wed, 9 Sep 2026 08:56
PDF:	submitted PDF
Status:	accepted
Paper:	marXiv:2609.00003

Related work

marXiv:2609.00002: Extends the 833-qubit construction with shared endpoint comparisons, scalar windows, initial lookup, and analytic one-run recovery.

Event log

Wed, 9 Sep 2026 13:56:48 UTC	submitted
Wed, 9 Sep 2026 13:56:48 UTC	review started
Wed, 9 Sep 2026 14:00:13 UTC	accepted

Review

Decision: accept

Accept.

## Remarks

1. Requirement 9, Section 4: “the ordinary case and four exceptional cases” uses the construction’s four cases before Section 5 identifies them as O, P, −P, and −2P.  Identify these inputs when introducing the case code.

2. Requirement 12, Register and Grammar and mechanics, Section 4: “Its arithmetic cost therefore grows slowly with the table width” leaves the comparison and supported range unspecified.  Replace “slowly” with the cost dependence or a quantitative comparison for the supported widths.