Efficient verification of computation is one of the most fundamental and intriguing concepts in computer science, and lies at the heart of the \(\mathrm {P}\)  vs. \(\mathrm {NP}\)  question. It has been studied in the classical setting for over three decades, giving rise to beautiful notions such as interactive proofs [1]}, multi-prover interactive proofs [2]}, probabilistically checkable proofs [3]}, [4]}, [5]}, and culminating with the notion of a succinct (interactive and non-interactive) argument [6]}, [7]}. Roughly speaking, a succinct argument for a \(T\) -time computation enables a prover running in \(\mathsf {poly}(T)\)  time to convince a \(\mathsf {polylog}(T)\) -time verifier of the correctness of the computation using only \(\mathsf {polylog}(T)\)  bits of communication, with soundness against all polynomial-time cheating provers.
