Hash-based Folding Schemes

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).