Incremental proof systems

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
69,400
Published on ● Video Link: https://www.youtube.com/watch?v=pedKaHMiqek


Duration: 0:00
123 views
0

Benedikt Bünz (New York University)
https://simons.berkeley.edu/talks/benedikt-bunz-new-york-university-2025-07-14
Proofs

In this talk we will explore incremental verifiable computation (IVC), as well as its generalization PCD. We will show how IVC and PCD is defined, how it can lead to low memory and distributed provers and study more applications. We will also look at constructions from SNARKs and modern constructions from accumulation schemes.
Finally we will discuss open problems in the space.



Other Videos By Simons Institute for the Theory of Computing


2025-07-15Towards SNARGs for NP from Standard Assumptions
2025-07-15Towards a White-Box Secure Fiat-Shamir Transformation
2025-07-15Verifiable quantum advantage: old and new ideas
2025-07-15Batch Arguments and Their Applications
2025-07-15Succinct Non-interactive Arguments of Proximity
2025-07-14A Zero-Knowledge PCP Theorem
2025-07-14SP1 Hypercube and the Jagged PCS
2025-07-14A New Approach for Non-Interactive Zero-Knowledge from Learning with Errors
2025-07-14SNARGs for P/poly from SIS
2025-07-14Error-Correcting Codes That Enable Efficient SNARKs
2025-07-13Incremental proof systems
2025-07-10Few Single-Qubit Measurements Suffice to Certify Any Quantum State
2025-07-10Lightning Talks
2025-07-10Thermal metastability and area laws
2025-07-10Rapid quantum ground state preparation via dissipative dynamics
2025-07-09Computational quantum chemistry: Classical gaps, quantum opportunities, open questions Part 2
2025-07-09Computational quantum chemistry: Classical gaps, quantum opportunities, open questions
2025-07-09Panel Discussion
2025-07-09How Hamiltonian complexity differs from quantum chemistry
2025-07-09Sum of squares spectral amplification (SOSSA)
2025-07-08When do you need an inverse or controlled unitary oracle?