Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Learn about hash-based folding schemes in this 52-minute conference talk that explores recent advances in efficient constructions for incrementally verifiable computation and proof-carrying data. Discover interactive oracle reductions (IORs) as a natural generalization of interactive oracle proofs, and understand how suitable IORs can be used to construct hash-based folding schemes. Examine a highly efficient IOR implementation where the prover operates in linear time while the verifier requires only a constant number of queries relative to statement length, making this approach particularly valuable for scalable cryptographic applications and zero-knowledge proof systems.
