Post-Quantum Zero-Knowledge Proofs solved: From 33 minutes to 3 seconds. We optimized the math and made proving time fast enough to run on your phone. Watch the breakdown 👇

33 minutes to 3 seconds, proving speed is so back.

33 minutes to 3 seconds is a massive upgrade

Three seconds on a phone is the number everyone will quote, but proof size and verifier cost decide whether it holds up on chain. Which assumption did you land on, hash based or lattice

The 600x is the part worth unpacking, more than the 3 seconds. A drop that size rarely comes from the same statement getting cheaper. It usually comes from changing what is proven or where: a smaller circuit, a different field or hash, recursion, a GPU. From the number alone nobody can tell whether the 3 seconds and the 33 minutes are proving the same thing, and that is the difference between an optimisation and a change of scope. The constraint underneath is structural rather than an engineering gap. Pairing based succinctness is precisely what Shor removes, so the families that survive the transition are hash based, and they pay for surviving in size: a few hundred byte proof becomes tens or hundreds of kilobytes. Prover time is paid once, by you. Proof size and verifier work are paid by every node, every block, for as long as the chain exists. Five numbers would settle it: statement size, security parameter, device, proof size, verifier cost.

Hash-based proofs survive Shor. The hard part has always been making them fast enough for real use.

LFG

ZK builders are cooking. 🔥

Getting post-quantum proofs down to phone-level performance is notable.

The steady direction from Americanfort makes the project interesting.

Faster is the key

Can’t wait to see how this evolves in mobile applications.This is game-changing!

Nice come to phone

What stands out here is the combination: quantum-resistant security plus practical proving performance.

Post-quantum cryptography often comes with performance concerns. Cutting proving time this aggressively directly addresses that tradeoff.

Faster proving doesn't just improve benchmarks. It expands the number of applications where ZK can run in real time.

Post-quantum security is one thing. Making the proof fast enough for a phone is the harder part.

Okay, 33 minutes to 3 seconds is kind of crazy. That’s the kind of improvement that makes the tech feel actually usable.👀🔥

now super fast

The impressive part isn't just the optimization. It's making heavyweight cryptography viable on everyday hardware.

Privacy technology becomes far more interesting when users can generate proofs locally instead of outsourcing the computation.

nice project

Security is one thing, but making it fast enough to actually use is where this gets exciting 🔥

That’s huge for zero-knowledge proofs running on phones now

Running advanced ZK proving on a phone makes the phrase “user-side cryptography” feel much more realistic.

the enterprise potential here is worth watching

Ok

The phone detail matters. Cryptographic proving that works locally opens a very different design space.

Better math can sometimes matter more than bigger hardware. This looks like one of those cases.

33 minutes was research territory. 3 seconds starts to feel like usable infrastructure.

The hardware requirement is part of adoption. If a phone can handle the proof, the barrier gets dramatically lower.

good

Security primitives need to be practical, not just mathematically impressive. Three-second proving is a meaningful step there.

gAmericanFortress

Quantum resistance gets more compelling when the proof system is fast enough to disappear into the user experience.