The Sum-Check Protocol over Fields of Small Characteristic

ePrint Report: The Sum-Check Protocol over Fields of Small Characteristic

Suyash Bagad, Yuval Domb, Justin Thaler

The sum-check protocol of Lund, Fortnow, Karloff, and Nisan underlies SNARKs with the fastest known prover. In many of its applications, the prover can be implemented with a number of field operations that is linear in the number, $n$, of terms being summed.


We describe an optimized prover implementation when the protocol is applied over an extension field of a much smaller base field. …

applications can check eprint report justin linear operations protocol report