Skip to content

Home > Resources > courses > Chiesa-Foundations-Probabilistic-Proofs

Foundations of Probabilistic Proofs (Alessandro Chiesa, EPFL CS-459)

Last modified: 2026-10-23

Summary

Graduate course at EPFL on the theory of probabilistic proof systems, taught by Alessandro Chiesa. The public topic list covers interactive proofs, the sumcheck protocol, IP = PSPACE, doubly-efficient interactive proofs, zero-knowledge interactive proofs, PCPs, linearity and low-degree testing, interactive oracle proofs (IOPs), FRI, holography, proof composition, robust PCPs, PCPs of proximity, and limitations of probabilistic proofs. It provides the information-theoretic foundations behind modern SNARKs and STARKs used for privacy-preserving credentials.