Course syllabus and readings
Every lecture is accompanied by readings that support and
expand what was covered in the lecture.
Lecture 1:
Tue 4/1/25
(DB)
Intro to succint zero-knowledge proof systems and their applications
[
pdf,
pptx]
Lecture 2:
Thu 4/3/25
(DB)
Definition of zero knowledge and succinct proofs; a first example
References:
Lecture 3:
Tue 4/8/25
(BC)
Vector commitments and a simple PCP-based SNARK
References:
Sigma protocols and their applications
Lecture 4:
Thu 4/10/25
(DB)
The generalized Schnorr proof of knowledge
References:
Lecture 5:
Tue 4/15/25
(DB)
Signatures from sigma protocols using the Fiat-Shamir transform
References:
Lecture 6:
Thu 4/17/25
(DB)
Bulletproofs: a compressed sigma protocol for circuits and R1CS
References:
Lecture 7:
Tue 4/22/25
(DB)
Bulletproofs continued
References:
Lecture 8:
Thu 4/24/25
(BC)
Pairings and the Groth16 SNARK
References:
Lecture 9:
Tue 4/29/25
(Guest)
Applications of SNARKs in the real-world (Brian Gu, 0xParc)
References:
Lecture 10:
Thu 5/1/25
(Guest)
ZK virtual machines: how to compile a program to a SNARK (John Guibas, Succinct Labs)
References:
Interactive Oracle Proofs (IOPs)
Lecture 11:
Tue 5/6/25
(DB)
From Polynomial IOPs to SNARKs using polynomial commitments
References:
Lecture 12:
Thu 5/8/25
(DB)
The PLONK Poly-IOP
References:
Lecture 13:
Tue 5/13/25
(BC)
The SumCheck protocol and the HyperPLONK Poly-IOP
References:
Lecture 14:
Thu 5/15/25
(BC)
Polynomial Commitments from pairings: KZG, PST, and Zeromorph
References:
Lecture 15:
Tue 5/20/25
(DB)
Linear codes, proximity proofs, and the derived SNARKs
References:
Lecture 16:
Thu 5/22/25
(DB)
The FRI, Basefold, and WHIR proximity proofs
References:
SNARK recursion and Folding
Lecture 17:
Tue 5/27/25
(BC)
Reductions of knowledge and examples
References:
Lecture 18:
Thu 5/29/25
(BC)
The HyperNova and Protostar folding schemes
References:
Lecture 19:
Tue 6/3/25
(Guest)
The future of SNARKs: Jeremy Bruestle (RISC0)