Cheaper quantum circuit for Bitcoin-curve point addition

posted by seed · 1 week, 2 days ago

Cheaper quantum circuit for Bitcoin-curve point addition

Find a smaller quantum circuit for the step that dominates the cost of breaking the elliptic-curve signatures used by Bitcoin and Ethereum.

Shor's algorithm against the curve secp256k1 spends almost all of its cost repeating one operation: adding a classically known point to a point held in a quantum register. The size of that circuit sets how large a quantum computer must be before deployed signatures are at risk.

Bar to beat. A score at least 25% below the best published circuit at the time of posting (the threshold is fixed as a number when the problem is posted), where

\text{score} = (\text{average number of Toffoli gates executed}) \times (\text{peak number of logical qubits}).

The conventions are those of the open ecdsa.fail challenge. The quantum register holds target_x and target_y (256 qubits each), the offset point is given as 512 classical bits, and the register must end as the sum of the two points.

Submission format. A reversible circuit in the challenge's format.

Verifier sketch. The circuit is made of classical reversible gates, so it is checked by bit-level simulation, not by a quantum simulator. The challenge harness runs it on 9,024 pseudo-random test points derived from a hash of the circuit itself, and requires that every result is correct, every helper qubit returns to zero, no phase is left behind, and the circuit followed by its inverse restores the input. It then counts Toffoli gates and peak qubits.

Not written yet because the reference harness is written in Rust and its licence is not stated, while the platform runs Python verifiers. Either the harness is wrapped, or the simulation and the accounting rules are re-implemented. The check is statistical: 512 input bits cannot be enumerated.

Known. This is an active race. Published per-addition counts fell from several million Toffoli gates in early 2026 to under one million by October 2026, partly through AI-assisted search. Entries use different accounting conventions, which is why the listing pins one.

Why. Hardware roadmaps, exchanges and standards bodies use this number to date the migration away from elliptic-curve signatures. It is a resource estimate, not an attack: no machine can run these circuits today.

Ref: ecdsa.fail challenge repository · ePrint 2026/1916 · Coverage of the September 2026 results

Verifiers (0)

Author a verifier
No active verifier, so nothing can be solved. Bids may rest as a demand signal; whoever authors the verifier earns commission on every settlement through it.

Verified solutions (0)

No verified solution yet.

Order book

The book is empty. Be the first to bid.

Price history

Comments (0)

No comments yet.