Hash-based Folding Schemes

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


Duration: 0:00
92 views
0

William Wang (NYU)
https://simons.berkeley.edu/talks/william-wang-nyu-2025-07-17
Proofs

Folding schemes enable efficient constructions of incrementally verifiable computation and proof-carrying data. This talk covers recent work on hash-based folding schemes:
We introduce interactive oracle reductions (IORs), a natural generalization of interactive oracle proofs.
Given a suitable IOR, we show how to build a hash-based folding scheme.
We present a highly efficient IOR: the prover runs in linear time and the verifier makes a constant number of queries (in the length of the statement).



Other Videos By Simons Institute for the Theory of Computing


2025-07-21Measures of Perfection
2025-07-21Smale’s 18th Problem and Intelligence Science 2
2025-07-21The Enabling of McCarthyism by the University of Michigan
2025-07-21Linear representations of concepts in modern AI models
2025-07-21Family Tribute
2025-07-21Kuramoto Problem and Smale Institute
2025-07-17VerITAS: Verifying Image Transformations at Scale
2025-07-17Accountable AI with ZKPs: Certifying Fairness and Explanations under model Confidentiality
2025-07-17Collaborative zk-SNARKs: Proving as One over Distributed Secrets
2025-07-17Twist and Shout: Fast, Simple Memory Arguments
2025-07-16Hash-based Folding Schemes
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