🎯 Goals

  • Understand the Sumcheck protocol and underlying ideas
  • Understand applications
  • Relation to Bulletproofs

πŸ“š Material

Advanced:

πŸ“ Notes

June 19

June 26

July 3

July 10

The lecture last week left did not explain how to check (using sumchecks) that a multivariate polynomial vanishes on the boolean hypercube, i.e. (this statement is interesting because is set up such that this statement is equivalent to all circuit constraints being fulfilled). This session’s goal is to find out how that actually works.

Material:

  • Thaler lecture notes probably around Lemma 4.7 / Remark 4.4. We should probably just look at GKR at this point.

For comedic effect, one might also ask ChatGPT about it, which has a very simple solution: To be fair, it’s quite impressive that it understood the question (β€œI was watching a lecture about sumchecks (as in SNARKs). The lecturer reduced circuit satisfiability to a certain polynomial vanishing on the boolean hypercube, and said that this can be checked with a sumcheck. How?”), and it supplied me with lots of explanations of how sumchecks work (which seemed decent), but it really messed up actual answer.