Skip to content
Preprint

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

Sep 2026 · 1 citation · ⚡ 1 influential
Physics Computer Science

TL;DR

The public record shows AI agents complementing human judgment, providing evidence for open autoresearch on efficiently evaluable, machine-checkable objectives.

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.

View source

Similar papers

Preprint Sep 2026

Efficient Record-and-Replay Arithmetic for Quantum Elliptic-Curve Point Addition

We study reversible secp256k1 point-addition circuits developed through ECDSA.Fail for Shor's elliptic-curve discrete-logarithm algorithm. Two complementary constructions improve record-and-replay GCD arithmetic: Jump-2 groups binary-GCD steps and compresses their decisions using base-5 encoding, while ping-pong uses f...

Jie-Yi Long, Theodore Pender, Zhao-Feng Huang et al. · 1 citation
Preprint Sep 2026

Computing 256-bit elliptic curve discrete logarithms in 26 days on a fault-tolerant trapped-ion quantum computer with 20,000 qubits

It is concluded that a trapped-ion quantum computer based on the Walking Cat Architecture can solve the ECDLP onsecp256k1 in approximately 25.7 days using 19,397 physical qubits with an estimated success probability of 63%.

Thomas Häner, Felix Tripier, Jacob Young et al. · 2 citations · ⚡1
Preprint Aug 2026

Ancilla-mediated fixed-point quantum search using Grover iterations

Grover's quantum search algorithm provides a fundamental quadratic speedup for unstructured datasets, reducing query complexity from $\mathcal{O}(N)$ to $\mathcal{O}(\sqrt{N})$. However, the algorithm's reliance on precise iteration counts leads to the ``souffl\'e problem,''where over-rotation results in a sharp declin...

Yash Prabhat, S. Thakur, Ankur Raina · 0 citations
#machine learning Preprint Oct 2026

Where Quantum Fourier Sampling Stops Short: A Three-Gate Audit Protocol for Delay-PUF Security Models

Quantum Fourier sampling may help audit the spectral learnability of delay-based physical unclonable functions (PUFs). We ask whether that promise survives access matching, a strong classical comparator, and oracle synthesis. Three gates structure the evaluation. Structure: low degree is not small support at reachable...

Owen Friedewald, Ali Shiri Sichani, Chi-Ren Shyu · 0 citations
Preprint Sep 2026

Quantum ROP: Using Quantum Algorithms for ROP Chain Selection in Exploit Construction

The quantum computing threat to cybersecurity is nowadays predominantly framed around Shor's algorithm and its eventual capacity to break asymmetric cryptography. Beyond cryptanalysis, however, quantum computing may also enable other capabilities in offensive security. This work explores one such direction: the applica...

Carlos Benitez · 0 citations
Preprint Oct 2026

Protecting Quantum Computers against Untrusted Users

It is shown that security of the restricted model of computation, 1/2BQP_1, is built on not only classical hardness for factoring, but also conjectured circuit lowerbounds for rational reconstruction, which permits arbitrary circuits and system sizes.

S. A. Yadavalli, Joel Rajakumar, A. Schuckert et al. · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.