1/ New survey: Sum-check is all you need. Just posted a survey on the design principles behind Jolt and fast-prover SNARKs more broadly. It's arguably the first time the core ideas have all been written down in one place.

2/ What’s the sum-check protocol? It’s the backbone of today’s fastest SNARKs. An interactive proof that checks a huge sum with minimal overhead. In SNARKs, it lets provers commit to far less data. Most of the work becomes simple additions and multiplications.

3/ But not all uses of sum-check are equal. The fastest SNARKs use it intelligently, exploiting repeated structure to minimize prover work. Key techniques: – Batch evaluation arguments – Memory checking – Virtual polynomials – Sparse sum-checks – Small-value preservation