The discovery and study of probabilistic proof systems, such as PCPs and IPs, have had a tremendous impact on theoretical computer science. These proof systems have numerous applications (e.g., to hardness of approximation) but one of their most compelling uses is a direct one: to construct cryptographic protocols that enable super fast verification of long computations. This course will introduce students to the foundations of probabilistic proof systems, covering both classical results as well as modern efficient constructions.
The course was held online and all recorded lectures are available [here].
Links to each individual lecture and slides are also provided in the syllabus below.
This course requires knowledge of basic algorithms (CS 170) and complexity (CS 172).
Completing the course for credit requires regular attendance/participation (on Piazza or during online lecture), completing occasional homework, scribing (once or twice), and a research project.
This course has no required textbook. Each lecture will have specific references. This course is a new revision of a prior course on probabilistic proofs from [Spring 2019].
#  Date  Topic  Reading 

1  2020.08.27  Interactive Proofs 1 [intro video] [intro slides] [video] [slides]

Formulation of interactive proofs:
Video:

2  2020.09.01  Interactive Proofs 2 [video] [slides]

The sumcheck protocol: 
3  2020.09.03  Interactive Proofs 3 [video] [slides]

Shamir's protocol: Additional: 
4  2020.09.08  Interactive Proofs 4 [video] [slides]

GoldwasserSipser transformation:
Additional:

5  2020.09.10  Interactive Proofs 5 [video] [slides]

The results presented in class: Additional results: 
6  2020.09.15  Interactive Proofs 6 [video] [slides]

The result presented in class: A survey: Additional on implementations of GKR's protocol:
Additional on doublyefficient interactive proofs: 
7  2020.09.17  Interactive Proofs 7 [video] [slides]

On zero knowledge:
Video:

8  2020.09.22  Probabilistically Checkable Proofs 1 [video] [slides]

Video: New York Times article about the PCP Theorem: 
9  2020.09.24  Probabilistically Checkable Proofs 2 [video] [slides]

The exponentialsize constantquery PCP is the inner PCP in this paper: 
10  2020.09.29  Probabilistically Checkable Proofs 3 [video] [slides]

Main: Additional:
Video: 
11  2020.10.01  Probabilistically Checkable Proofs 4 [video] [slides]

Main: 
12  2020.10.06  Probabilistically Checkable Proofs 5 [video] [slides]

Main: Additional: 
13  2020.10.08  PCPs with Sublinear Verification 1 [video] [slides]

Main: 
14  2020.10.13  PCPs with Sublinear Verification 2 [video] [slides]

Main: 
15  2020.10.15  Interactive Oracle Proofs 1 [video] [slides]

IOP model and its compilation into noninteractive arguments: 
16  2020.10.20  Interactive Oracle Proofs 2 [video] [slides]

IOPs for R1CS(𝔽): Aditional on IOPs for CSAT(𝔽_{2}): 
17  2020.10.22  Interactive Oracle Proofs 3 [video] [slides]

FRI protocol: 
18  2020.10.27  Interactive Oracle Proofs 4 [video] [slides]

FRI protocol: Additional reading: 
19  2020.10.29  Interactive Oracle Proofs 5 [video] [slides]

Main: 
20  2020.11.03  Proof Composition 1 [video] [slides]

Main:

21  2020.11.05  Proof Composition 2 [video] [slides]

Robustification: Additional on O(1)query tests: 
22  2020.11.10  Proof Composition 3 [video] [slides]

Main: 
23  2020.11.12  Parallel Repetition [video] [slides]

Main on parallel repetition: Counterexamples:
Additional on explicit bounds for Furstenberg–Katznelson: 
24  2020.11.17  Limitation of PCPs and IOPs [video] [slides]

Main:
Towards the sliding scale conjecture: 
25  2020.11.19  Holographic Proofs [video] [slides]

Main: 
X  2020.11.24  No class (Thanksgiving week). 

X  2020.11.26  No class (Thanksgiving week). 

26  2020.12.01  Class Project Presentations 1 

27  2020.12.03  Class Project Presentations 2 

X  2020.12.08  No class (RRR week). 

X  2020.12.10  No class (RRR week). 