Optimal Prover Time Unlocks Scalable Zero-Knowledge Verifiable Computation
A new zero-knowledge argument system achieves optimal linear prover time, fundamentally eliminating the computational bottleneck for verifiable execution of large programs.
