Proof Carrying Data

on YouTube ↗30m

" summary

New constructions show proof‑carrying data (PCD) from simpler building blocks by replacing recursive SNARK verifiers with atomic accumulation and then split accumulation, so the recursive circuit only checks tiny accumulators rather than full SNARK verification. The work converts KZG and IPA polynomial commitments into accumulation schemes, lets IVC/PCD use SNARKs with linear verifier or linear proof size, and reports order‑of‑magnitude concrete speedups versus prior recursive SNARK approaches. Papers: ia.cr/2020/499 and ia.cr/2020/1618.

AI-written summary · about

" chapters (6)

1. 0:00Motivation for IVC
2. 2:31Defining IVC concepts
3. 7:13New construction techniques
4. 13:16Formal IVC definitions
5. 18:02Atomic accumulation schemes
6. 24:22Split accumulation and results

" related talks

• 01h 02mIncremental proof systemsBenedikt Bunz · Proofs (Simons Institute)
• 01h 08mTutorial on Proof SystemsAbhishek Jain · Minimal Complexity Assumptions for Cryptography 2023
• 01h 09mProofs - Practice 1Justin Thaler · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 39mPrivacy and Evolution of SNARKsAriel G. Gabizon, Lucas Nuzzi, Eugene Leventhal, Aleksandr Vlasov · Smart Contract Summit #1 2021
• 18mA Selection of Pairing Based zk-SNARKsMary Maller · Zcon1: Zero to Privacy Hero 2019
• 01h 13mA Zero-Knowledge PCP TheoremNicholas Spooner · Proofs (Simons Institute)
• 23mSonic: Nearly Trustless SNARK SetupsSean Bowe · Zcon1: Zero to Privacy Hero 2019
• 26mPCPs and Instance Compression from a Cryptographic LensLiron Bronfman, Ron D. Rothblum · ITCS 2022