ETHBerlin2024 (First Cut, Note: Edit technically finished +1h after deadline)
This repo contains a collection of scripts and files related to the How SNARKs Compress Infinite Computation Video.
In this video we wanted to visually demonstrate the math in a more intuitive and step-by-step way so that you may understand how SNARKs are succinct while not being shy about the math.
In the visualizations / resulting video we attempt to explain:
- The Schwartz-Zippel Lemma: Why comparing two bounded polynomials at a given point is enough to determine whether they're equal or not
- How any computation can be turned into a set of polynomials
- How to construct a quotient check to efficiently verify that our computation has the desired result at the specified points.