Nikitas Paslis, phd student at UPF (Universitat Pompeu Fabra Barcelona) - Digital Security
Date: - Location: Eurecom
Abstract: Recursive proof composition allows long or distributed computations to be proven step by step, but current approaches force a choice. Folding schemes make each step extremely cheap but require provers to carry and pass on a large private state. Stateless approaches on the other hand, such as full recursion and atomic accumulation, avoid this but pay for a full SNARK proof and verification at every step. This talk presents holography accumulation, a stateless recursion technique for lincheck-based SNARKs such as Marlin and Spartan. The key observation is that their verification splits into witness-dependent checks and public evaluations of polynomials encoding the computation. The latter need not be proven and verified at every step, but rather accumulated. We capture this structure with a linear-algebraic relation we call generalized bilinear forms and build recursive proof systems for both univariate and multivariate encodings.
