Two coordinated quantum cryptanalysis papers yesterday — same day, interlinked, complementary threat models:
Google (Babbush, Gidney, Zalcman + Ethereum Foundation + Stanford): ECDLP-256/secp256k1 compiled to surface code on planar superconducting arch. <500K physical qubits, ~9 min primed. Circuits withheld, verified via Groth16 SNARK over SP1 zkVM.
Oratomic (Cain, Xu, Bluvstein, Preskill, Endres, Huang): Same Google circuits compiled to high-rate lifted-product qLDPC codes (~30% rate) on reconfigurable neutral atoms. ~10K–26K physical qubits, ~10–264 days at 1ms cycle. Surgery gadgets are existence proofs, decoder-limited, LLM-assisted code search.
Together these bracket Google's own Scenario 1 (fast-clock on-spend) and Scenario 2 (slow-clock at-rest). The Oratomic arch solves Pinnacle's routing problem with atomic reconfigurability rather than non-planar wiring. Hardware gap: 6,100 demonstrated atoms → 10K needed (~2x) vs 1K demonstrated superconducting → 500K needed (~500x).
Neither paper moves Q-Day to next year. Both papers kill the "millions of qubits" comfort model.
Detailed analysis of both:
https://postquantum.com/security-pqc/google-quantum-bitcoin-ecdlp/
https://postquantum.com/security-pqc/10000-qubits-shors/
#infosec #pqc #quantumcomputing #bitcoin #cryptography