Batch Arguments and Their Applications

Over the past five years, there has been significant progress in constructing succinct non-interactive arguments from standard cryptographic assumptions. A key component underpinning many of these advances is the concept of batch arguments (BARGs).

In this tutorial talk, we will introduce the notion of BARGs, demonstrate how they can be used to construct succinct non-interactive arguments (SNARGs) for deterministic computations, and explore applications in which BARGs can replace general-purpose SNARKs for NP.