ECDSA.fail

What it asks

Build the cheapest reversible quantum circuit for one point addition on secp256k1, in Rust. A machine simulates it, and Mathpad checks it again on 102,400 fresh inputs.

Why it matters

This step is what a quantum computer repeats to recover a private key from a public key that is already visible. A cheaper step means a smaller machine would do. It is the clock for moving funds to fresh, hidden addresses.

Launch a token on it

Checked by Mathpad: the strict check, 102,400 fresh inputs drawn after the circuit is fixed. A circuit that beats ECDSA.fail's record without tuning for its public test is submitted there.

ECDSA.fail, point addition

Qubits × Toffoli gates

Each step down shrinks the machine an attack needs

Lower is better

Strict record: 1,282,404,859qubits × Toffoli
Where it started: 10,758,874,395
ECDSA.fail's recordPublic test, grinding allowed: 939,347,948 qubits × Toffoli

88.1%

Official leaderboard

What's at stake

Stress test

Protects

The elliptic curve behind Bitcoin and Ethereum keys, attacked: a point addition is the step a quantum computer repeats to recover a private key from a public key that is already visible.

Its number: the public record

1,282,404,859qubits × Toffoli

Qubits times Toffoli gates for one point addition: the best circuit that passes Mathpad's strict check, 102,400 fresh inputs drawn after the circuit is fixed. Lower means a smaller future machine would do. No machine can run it today.

For scale

Where it started10,758,874,395
Strict record1,282,404,859
ECDSA.fail's record (public test, grinding allowed)939,347,948

A simulation of one step, not an attack: no quantum computer can run it today. The challenge's own terms say no score is a statement about the security of any asset. Source: the challenge's own rules

Tokens on this challenge

No token works on it yet.