Sumcheck 201, Chapter 2: Checkfold - Folding Sumcheck Instances

Published on: 
Mar 11, 2024


In this chapter, we construct a knowledge-reduction argument for the sumcheck protocol that reduces the proving of a large-sized sum-check to the proving of a folded small-sized sum-check.

The folding argument is proven using a batched sum-check protocol that verifies the linear independence and satisfiability of each of the folded instances. The method is more suitable for large fields, where the problem is memory bound.

Full paper:

Code (coming soon):


Written by

Table of Contents

Want to discuss further?

Ingonyama is commited to developing hardware for a private future using Zero Knowledge Proofs.

Get in touch
Get our RSS feed