Abstract: In this talk, I will present sumcheck arguments; a new class
of interactive protocols which show that "split-and-fold protocols"
(such as Bulletproofs and many more) are consequences of the Lund et
al. sumcheck protocol from 1992.
I will explain how many existing commitment schemes can be framed as
"sumcheck-friendly commitments" over rings and modules, and how to
obtain succinct arguments for NP-complete statements over rings. This
gives a lattice-based succinct argument from the SIS assumption, which
was previously open.
Joint work with Jonathan Bootle and Alessandro Chiesa