THE QUANTUM INTELLIGENCER

IonQ has published the first full-stack resource estimate for solving the 256-bit elliptic-curve discrete logarithm problem, the mathematics that secures Bitcoin's signatures. The estimate, compiled down to quantum error-correction primitives, sets the requirement at 19,397 physical qubits and 25.7 days per attempt, with a proven lower bound on success rather than a heuristic argument. The company is explicit that no wallet, key, network, or live system was touched, and that no fault-tolerant machine capable of running the computation exists today. The curve examined, secp256k1, was chosen not as a target but as the most scrutinised production curve of its kind, a canary beside a broader field of elliptic-curve and RSA systems. For the present, the estimate rests in the ledgers of resource accounting, where every future machine is first recorded before it takes shape in metal and ion. The published account sets the logical layer at 1,457 qubits, and counts 39 million Toffoli operations within the computation. The company's engineers report that a three-qubit gate, the controlled-controlled-Z, appears some 39 million times and that a redesign of its execution renders the operation thirty-one times faster than the customary sequence of smaller steps. A measured error-correction cycle of 29.5 milliseconds underpins the estimate, together with a proven lower bound of 40.7 per cent on the chance of success in a single attempt, rising to 63.3 per cent under common mathematical heuristics. The architecture itself arranges sixty-nine memory blocks, four dedicated state factories and a shared pool of measurement qubits, the movements between them adding but five per cent to the whole runtime. The schedule for one principal arithmetic routine reaches 674 steps, a mere five above the limit set by the arithmetic itself. To these figures the company adds a calendar: its fully fault-tolerant system of 10,000 physical qubits is promised for 2027, with further advances in 2028, the very horizon at which this estimate expects such a machine to be practicable. The company's own officers give the calculation its public frame. Niccolo de Masi, the chairman and chief executive, recalls the warning he first sounded in 2025, that “the Q-Day time horizon was shifting materially earlier - from the 2030s to the 2020s,” and he notes that major enterprises and the United States government now concur, the White House having issued its executive order on quantum security earlier this summer. Chris Ballance, the president of quantum computing, makes a narrower claim for the paper itself: “This is the first time anyone has taken a utility-scale algorithm and estimated its cost without approximating away the parts that usually dominate a real machine’s runtime”. And Jordan Shapiro, the president of the quantum platform, draws the practical boundary for the anxious holder of a private key: breaking secp256k1 is “an authentication problem, not a confidentiality problem,” whose standardised remedy lies ready in NIST's ML-DSA and SLH-DSA. —Dr. Octavia Blythe Dispatch from The Prepared E0