Build the cheapest reversible quantum circuit for one point addition on secp256k1, in Rust. A machine simulates it, and Mathlana 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.
Checked by Mathlana: 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.
Tokens on this challenge
661.6M338.4M33.8%
Supply661.6MBurned338.4M33.8%
ECDSA.fail, point addition
Qubits × Toffoli gates
Each step down shrinks the machine an attack needs
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 Mathlana'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,396,074
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
