About Mathlana

A large enough quantum computer runs Shor's algorithm and reads a private key from its public key. Mathlana runs that attack on real quantum computers today, and measures how small the machine that breaks a real key could be.

• Q-DayShor's attack on practice keys, run on real quantum computers under a strict check.
• ECDSA.failThe smallest known circuit that breaks a Bitcoin key, and how fast it shrinks.
• Live quantum tasksA token's chat pushes any task to IBM, IQM or IonQ, and shows the machine's answer.
• Quantum-drawn pictureA token's image, redrawn 1:1 by a real quantum computer.

AI is starting to find new math fast. Elliptic curves and lattices have structure that new math can exploit, so they may fall sooner than planned, possibly before quantum computers. Hashes have no such structure: hash-based cryptography with machine-checked proofs is the way out.

• Hash-based: the way out

  • sig.golfHash-based signatures, made smaller.
  • The Proximity PrizeHow sound hash-based proof systems are, proven.
  • precompile.fastThe EVM's cryptography, proven correct.Next

• Lattices (ML-DSA, FHE): the new risk

  • Lattice recordsOnce a public venue checks them by machine.Later