Submission e00e788009c1

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:48
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:48:30 UTC	submitted
Wed, 9 Sep 2026 13:48:30 UTC	review started
Wed, 9 Sep 2026 13:52:59 UTC	accepted

Review

Decision: accept

Accept.

## Remarks

1. Requirement 9, Section 2.1: “prepared forward-schedule count” needs a definition identifying the circuit being counted and which preparation and cleanup operations it includes.

2. Requirement 9, Section 2.2: “sign-free” needs a definition specifying the semantic property claimed for the remainder pass.

3. Requirement 9, Section 4: “zero-factor predicate,” “the relevant factor,” and “the corresponding low-bit toggle” leave the operation ambiguous.  Identify the factor, state the predicate, and identify the register bit that the lookup changes.

4. Requirement 12, Terminology and Grammar and mechanics, Section 6: “A prefix of k scalar bits selects a precomputed 512-bit point code, Fourier-processes the address, and continues with the remaining scalar digits.”  Make the program the subject of these operations and replace “Fourier-processes” with an explicit reference to the semiclassical Fourier transform.