Incrementally Verifiable Computation via Rate-1 Batch Arguments

ePrint Report: Incrementally Verifiable Computation via Rate-1 Batch Arguments

Omer Paneth, Rafael Pass

Non-interactive delegation schemes enable producing succinct proofs (that can be efficiently verified) that a machine $M$ transitions from $c_1$ to $c_2$ in a certain number of deterministic steps. We here consider the problem of efficiently \emph{merging} such proofs: given a proof $\Pi_1$ that $M$ transitions from $c_1$ to $c_2$, and a proof $\Pi_2$ that $M$ transitions from $c_2$ to $c_3$, can these proofs be efficiently merged into …

batch computation enable eprint report machine non omer pass problem producing rate report transitions verified