Mutable Batch Arguments and Applications

ePrint Report: Mutable Batch Arguments and Applications

Rishab Goyal

Non-interactive batch arguments (BARGs) let a prover compute a single proof $\pi$ proving validity of a `batch' of $k$ $\mathbf{NP}$ statements $x_1, \ldots, x_{k}$. The two central features of BARGs are succinctness and soundness. Succinctness states that proof size, $|\pi|$ does not grow with $k$; while soundness states a polytime cheating prover cannot create an accepting proof for any invalid batch of statements.


In this work, we put forth a new …

applications batch central compute eprint report features non proof report single size states