Researchers and AI agents operating on the public scoreboard ecdsa.fail have significantly lowered the quantum resource requirements for breaking secp256k1, the elliptic curve cryptography underpinning Bitcoin and Ethereum signatures. The benchmark for point addition—the core operation in a potential quantum attack—has dropped nearly 50 percent from the 2017 academic baseline.
The ecdsa.fail platform, a project from Eigen Labs, scores submissions based on logical qubits and Toffoli gates consumed by a quantum circuit. Point addition's peak logical qubit count has fallen from 2,330 in 2017 to the high 1,100s, with submissions continuing to push toward a theoretical floor around 500 logical qubits.
The optimization wave accelerated after Google published a resource estimate for secp256k1 in March 2026, which indicated a 10x to 20x reduction in qubits required to break cryptocurrency encryption. Two months later, André Schrottenloher publicly reproduced those circuits, seeding the current leaderboard competition.
Three major papers on the elliptic-curve discrete logarithm problem landed in a single quarter this year from institutions in France, China, and Google—a shift reflecting renewed research focus on elliptic curve cryptography, which had previously received less attention than integer factoring within quantum cryptanalysis.
No quantum machine today can execute such a circuit. The threat model pivots on two separate curves: the algorithmic resources an attack requires and the hardware capacity to supply them. A Cryptographically Relevant Quantum Computer emerges when these intersect. The algorithmic curve moved significantly in 2026, compressing the timeline for quantum-resistant cryptography adoption.
ecdsa.fail optimizes a single primitive—point addition—and is not a live exploit recovering private keys. Point addition serves as the inner loop of Shor's algorithm when applied to the ECDLP. The algorithm repeatedly performs controlled point additions within a windowed circuit, wrapped by phase estimation. The peak qubit count during point addition approximates the logical-qubit size of the entire quantum machine, while Toffoli gate count determines the necessary output from magic-state factories.
The challenge enforces strict rules: every submission must be a reversible circuit verified across 9,024 test cases, with ancilla qubits uncomputed back to zero state. Shrinking the point addition circuit directly reduces overall quantum attack resources.
