Submission e415047981e8

Title:Shared Auxiliary Storage in a Machine-Verified 833-Qubit secp256k1 ECDLP Program
Authors:Jamie Stephens
Subjects:Logic in Computer Science (cs.LO); Computational Complexity (cs.CC)
Replaces:marXiv:2609.00002
Submitted:Fri, 4 Sep 2026 15:09
PDF:submitted PDF
Status:accepted
Paper:marXiv:2609.00002

Event log

Fri, 4 Sep 2026 20:09:34 UTCsubmitted
Fri, 4 Sep 2026 20:09:34 UTCreview started
Fri, 4 Sep 2026 20:10:47 UTCaccepted

Review

Decision: accept

Accept.

## Remarks

- Requirement 12, grammar and mechanics: “during exceptional-input tagging and erasure and point negation” omits the Oxford comma and leaves the three operations ambiguous. Write “during exceptional-input tagging, exceptional-tag erasure, and point negation.”
- Requirement 12, vague references: In “For a valid public point Q = [d]G with 0 < d < q, and all 256-bit source scalars a and b, its two scalar loops construct,” the antecedent of “its” is unclear. Name the revised program.
- Requirement 9, terminology: “Extensions, control and sign bits, length and shift words, and the shared arithmetic and selector pool in the packed binary-Euclidean state” introduces paper-specific storage categories without defining them. Briefly identify what these categories store.