Metraipolis › archive › dc_5599becccfb6

ECDSA.Fail: Open Autoresearch for Optimizing Elliptic-Curve Point Addition in Shor's Algorithm — arXiv:2609.09582

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.09582
License (as archived)
CC0-1.0
Archived
2026-10-16T07:54:49.301Z
SHA-256 of the archived text
28001a63ccdeee5e01d6f372f3940567d58cfa59ec4ed299a65e5e4a178898d1
Stable URL of this page
https://metraipolis.com/documento/dc_5599becccfb6

How to cite

ECDSA.Fail: Open Autoresearch for Optimizing Elliptic-Curve Point Addition in Shor's Algorithm — arXiv:2609.09582 — arXiv (en), https://arxiv.org/abs/2609.09582 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5599becccfb6 (Metraipolis archive dc_5599becccfb6, sha256 28001a63ccdeee5e01d6f372f3940567d58cfa59ec4ed299a65e5e4a178898d1)
BibTeX
@misc{dc5599becccfb6,
  title = {ECDSA.Fail: Open Autoresearch for Optimizing Elliptic-Curve Point Addition in Shor's Algorithm — arXiv:2609.09582},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.09582},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5599becccfb6; sha256 28001a63ccdeee5e01d6f372f3940567d58cfa59ec4ed299a65e5e4a178898d1},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.09582. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We propose Open Autoresearch, a paradigm in which humans and AI agents publish evaluator-verified improvements to a public leaderboard. We instantiate it in this http URL , optimizing reversible secp256k1 point-addition circuits, a bottleneck in Shor's algorithm for elliptic-curve cryptography. The benchmark minimizes the spacetime-inspired score $S=Q\times T$, where $Q$ is peak logical qubit width and $T$ is average executed Toffoli count. Participants reduced $S$ by 86.1%. At the data cutoff (26 July 2026), the best-scoring circuit uses 1,151 qubits and 1,299,453 average executed Toffoli gates, giving $Q\times T\approx1.496$ billion. This is more than 50% below Google's published point-addition score thresholds ( arXiv:2603.28846 ), under different accounting conventions. Because the benchmark supplies one addend classically, we construct a coherent windowed-addition-compatible variant implementing the single-call interface required by windowed Shor. It uses 1,162 qubits and 1,684,161 average executed Toffoli gates. On 100,000 random inputs, its empirical success probability is $\hat{p}=0.99809$, giving $Q\times T/\hat{p}\approx1.961$ billion under an independently rerunnable per-call sensitivity model, not a full-Shor success estimate. Its qubit and Toffoli counts lie below Google's published thresholds and Schrottenloher's reported operating points ( arXiv:2606.02235 ), although differing interfaces, accounting conventions, and validation scope preclude formal dominance. After the cutoff, the score was further reduced to 1.259 billion, while a separate low-width circuit reached 813 qubits. The public record shows AI agents complementing human judgment, providing evidence for open autoresearch on efficiently evaluable, machine-checkable objectives.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-10 in cs.CR).
Categorie arXiv: Quantum Physics (quant-ph) ; Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2609.09582 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T07:37:41.596Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).