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

📅 2026-09-08
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
本文提出Open Autoresearch方法,通过人和AI合作优化椭圆曲线点加法电路,减少Shor算法中的瓶颈,显著降低了逻辑量子比特宽度与Toffoli门数量乘积的得分。
📝 Abstract
We propose Open Autoresearch, a paradigm in which humans and AI agents publish evaluator-verified improvements to a public leaderboard. We instantiate it in ECDSA.Fail, 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.
Problem

Research questions and friction points this paper is trying to address.

ECDSA
Elliptic-Curve Cryptography
Shor's Algorithm
Point Addition
Optimization
Innovation

Methods, ideas, or system contributions that make the work stand out.

Open Autoresearch
reversible secp256k1 point-addition circuits
spacetime-inspired score
windowed Shor
AI agents
🔎 Similar Papers
Jieyi Long
Jieyi Long
Northwestern University
BlockchainDistributed SystemGenerative AIEDA
T
Theodore Pender
Starknet Foundation
Z
Zhao Huang
Brevis
M
Manuel B. Santos
MultiVM Labs
S
Samrendra Kumar Singh
StarkWare
B
Bartosz Naskręcki
Adam Mickiewicz University Poznań, Warsaw University of Technology
B
Bit Wonka
Octav
J
Joe Doyle
Trail of Bits
P
Pierre-Luc Dallaire-Demers
Pauli Group
F
Francesco Giannicola
R
Ruben M. L. Paschoarelli
MultiVM Labs
O
Oli Freuler
StarkWare
J
Jackie Chia-Hsun Lee
ScienceVR
V
Vasily Gnuchev
G
Gopi Kannappan
J
John Boyer
X
Xavier Butler
A
Akash Balasubramani
StarkWare
J
Jordan Newman
B
Bereket Dereje
A
Alexander Hertlein
Sei Labs
R
Robert Kodra
Starknet Foundation
L
Lucas Levy
StarkWare
S
Shaan Patel
J
JT Rose