IOP based Zero-Knowledge Proofs

on YouTube ↗44m

" summary

A modular compiler turns interactive oracle proofs (IOPs) into transparent, plausibly post‑quantum succinct arguments by committing long PCP/IOP transcripts with Merkle-tree commitments and deriving challenges from random‑oracle hash functions, so cryptography only adds linear hashing overhead while the prover cost is dominated by the information‑theoretic PCP/IOP work. Practical IOPs use Reed‑Solomon reductions and the FRI proximity test, achieve prover time about n log n, and shrink proof sizes from tens of megabytes (2017) to tens or hundreds of kilobytes today, with a conjectured path toward ~1 KB.

AI-written summary · about

" chapters (6)

1. 0:00Start
2. 6:05What do we do?
3. 18:37From PCP to SNARG
4. 24:22Interactive Oracle Proofs
5. 37:20Limits of Argument Size
6. 40:32A Framework for

" related talks

• 51mDistributed Zero-Knowledge Proofs and Applications to Secure ComputationElette Boyle · 4th ZKProof Workshop (Home Edition)
• 30mKEYNOTE Building Succinct Arguments from Ideal Hash FunctionsAlessandro Chiesa · ZKProof 6 in Berlin
• 01h 03mProofs, Knowledge, and ComputationSilvio Micali · Berkeley ACM A.M. Turing Laureate Colloquium 2018
• 57mThe Cryptographic Lens: Visions of our Past and FutureShafi Goldwasser · Symposium on Visions of the Theory of Computing 2013
• 23mRecent progress in MPC-in-the-Head protocolsEmmanuela Orsini · 4th ZKProof Workshop (Home Edition)
• 30mPractical Zero Knowledge ProofsRemi Gai, Kautuk Kundan, Danilo Kim · Pragma India 2023
• 44mStandardizing Zero Knowledge Proofs - KeynoteRan Canetti · 1st ZKProof Standards Workshop 2018
• 44mZero-Knowledge Proofs: Simultaneously ensuring integrity and privacyTjerand Silde · NDC Security 2026