A Wishlist for Verifiable Computation: An Applied CS Perspective
summary
Surveys implemented verifiable computation systems (Pinocchio, Libsnark, Zatar, Buffet), identifies QAPs as the common costly core, and measures real limits: prover memory and verifier preprocessing block practical runs past about 10 million gates. Claims up to ~20 orders of magnitude theoretical improvements exist but concrete systems only handle small inputs and incur huge prover overheads; several frontends and backends are built and benchmarked but remain impractical for general use.
AI-written summary · about
chapters (11)
- 0:00Introduction to the topic
- 0:34Verifiable computation setup
- 2:27State of the art overview
- 4:42Technical framework
- 7:43Probabilistic proof designs
- 11:59Exploiting QAPs
- 15:34Front-end approaches
- 18:43Performance reality check
- 22:43Bottlenecks and limitations
- 24:50Motivation for future work
- 28:55Wrap-up and Q&A
related talks
01h 25mIntroduction to Verifiable Computing
27mProofs of proofs: incremental verifiability from recursion and accumulation
57mThe Cryptographic Lens: Visions of our Past and Future
51mDistributed Zero-Knowledge Proofs and Applications to Secure Computation
30mPractical Zero Knowledge Proofs
01h 00mCooperative Verification: Towards Reliable Safety-Critical Systems
54mVerification Dilemmas, Law, and the Promise of Zero-Knowledge Proofs
48mThe Proof Must Go On: Formal Methods in the Theater of Secure Software Development(…)