Submission 21919c6e38d7

Title:A Formal, Statistical, and Source Audit of Schrottenloher’s Optimized Point-Addition Circuits for Elliptic-Curve Discrete Logarithms
Authors:Jamie Stephens
Subjects:Logic in Computer Science (cs.LO); Computational Complexity (cs.CC)
Replaces:marXiv:2608.00044
Submitted:Fri, 21 Aug 2026 15:24
PDF:submitted PDF
Status:accepted
Paper:marXiv:2608.00044

Event log

Fri, 21 Aug 2026 20:24:15 UTCsubmitted
Fri, 21 Aug 2026 20:24:15 UTCreview started
Fri, 21 Aug 2026 20:24:31 UTCsubject assigned
Fri, 21 Aug 2026 20:34:14 UTCaccepted

Review

Decision: accept
Classification (automatic): Logic in Computer Science (cs.LO); Computational Complexity (cs.CC)

Accept.

Remarks

- Requirement 9, terms and notation: “IPModMul_inv,” “WindowAffAddSpaceOpt,” “currentWidth,” “ArtifactTraceDomain,” and “PaddingSafeAt” appear without definitions before use.
- Requirement 9, terms and notation: Section 2.3 uses “affineResult,” “decide(address ≠ 0),” “selectedX,” “GroupValid,” “recovery-noncollision,” and “groupAddValue” without defining them.
- Requirement 9, terms and notation: Define “bitLength,” the generator G in “(0G, G),” “qc” in “qc SWAP events,” and the probability variable q in “the composite null q ≥ 1/10100.” The last also reuses a letter previously associated with the source paper’s modulus.
- Requirement 12, vague quantifiers: “some arithmetic stages differ” and “Several obligations needed by the paper’s whole oracle” replace quantities or specific names available to the author.
- Requirement 12, throat-clearing and announcements: “The retained source and statistical records are listed below,” “The source-derived surcharge has three parts,” and “The exact names are:” announce the material that follows.
- Requirement 12, metaphor: Replace the repeated figurative “bridge,” including “a bridge … proves the transfer,” “checked bridge,” “secp256k1 bridge,” “such a bridge,” and “fixed bridge.” The same issue occurs in “downstream recovery,” “downstream audit,” “fill this circuit gap,” “close unresolved claims,” “inheriting the paper’s resource row,” “dormant defect,” and “provenance anchors.”
- Requirement 12, register and accuracy: “its input-pair theorem equals the mathematical pair,” “its cleanup theorem returns the four temporary decision wires to zero,” and “Its circuit theorem implements the intended equality-aware sum” attribute circuit behavior to theorems. State that each theorem proves the corresponding circuit behavior.
- Requirement 12, grammar and explicitness: “These results hold for a parameter rounds” is malformed. “Grouped baseline counts reproduce” and “The factor 28 and core arithmetic reproduce” omit the object of “reproduce.”
- Requirement 12, relevance and precision: “completed 4,596 of 4,596 build jobs” gives a count beyond the conclusion that all jobs completed. Appendix D’s p-value and Clopper–Pearson decimal bounds carry dozens of digits beyond the comparisons the paper makes.