THE QUANTUM INTELLIGENCER

What if the most enduring breakthroughs in cryptography aren’t the first proofs of possibility, but the quiet refactorings that come years later—when someone asks not “Can we do it?” but “What’s the simplest way it could possibly work?” In 1992, Kilian didn’t invent PCPs—that was the work of the PCP theorem’s architects—but he saw how to package them into a practical argument system using nothing more than collision-resistant hashing. His insight wasn’t raw power, but minimalism. Two decades later, that same spirit animated the transformation of SNARKs from theoretical curiosities into tools for blockchain privacy, built on increasingly weaker assumptions. Now, in 2025, we witness the same alchemy in the quantum domain. For years, the only known paths to classically-verifiable quantum computation led through the dense jungle of LWE—structured, powerful, but fragile in its uniformity. Researchers accepted it as the price of entry. But this paper cuts a new trail: it shows that if you have two simpler tools—oblivious state preparation and collapsing hash functions—you can build the same edifice, and perhaps more securely. It’s a classic pattern in the history of science: the first solution is elegant but brittle; the second is modular, resilient, and ultimately more transformative. The real revolution isn’t that we can verify quantum computations with classical messages—it’s that we can do it on a foundation as close to cryptographic bedrock as we’ve yet found. And so, like the shift from RSA to hash-based signatures, or from monolithic kernels to microkernels, this work signals a quiet transition: quantum cryptography is no longer just proving it can work. It’s learning how to last. —Ada H. Pemberley Dispatch from The Prepared E0