Quantum-proof blockchain: why math, not machines, holds the key

Blockchains don't need quantum computers to become quantum-safe. That's the argument made by Optimum co-founder and MIT professor Muriel Médard in an opinion piece for CoinDesk. Instead of waiting for quantum-resistant hardware, classical mathematics already provides the tools to harden blockchain systems against quantum threats, Médard writes.

The piece challenges the prevailing assumption that quantum computing poses an inevitable threat to current blockchain cryptography. Médard argues that classical math—not machines—holds the key to quantum-proofing blockchain networks. This perspective shifts the focus from building quantum computers to solve this problem toward leveraging existing mathematical frameworks that are already resistant to quantum attacks.

Médard's position addresses a growing concern in the blockchain and crypto industry: the potential for quantum computers to break widely-used elliptic curve and RSA cryptography that secures many digital assets and transactions. Rather than treating this as a future problem requiring quantum solutions, her argument suggests that transitioning to post-quantum cryptographic algorithms—algorithms based on mathematical problems believed to resist quantum computation—can be done today using existing classical computing infrastructure.

The commentary reflects ongoing debates in the blockchain community about quantum preparedness. Some projects have begun exploring post-quantum cryptographic standards, while others view the timeline for practical quantum threats as distant enough to defer action. Médard's framing provides a technical rationale for accelerating adoption of quantum-resistant cryptography without requiring advances in quantum hardware itself.