Home > Theoretical Models

Theoretical Models

Foundational computational models and taxonomies that underpin the theory of Zero-Knowledge Proofs.

Contents

Note	Description
ZK Families Overview	High-level taxonomy of ZKP families: SNARKs, STARKs, IOP-based, MPC-in-the-head, etc.
ZK Proof Taxonomy	Taxonomy by abstraction level: native sigma → composed (CP-SNARKs) → circuit-based → ZK VMs
Interactive Proof Model	The IP / Arthur-Merlin model from Goldwasser-Micali-Rackoff (1985) — defines completeness, soundness, and zero-knowledge
Schwartz-Zippel Lemma	The core polynomial identity test lemma underpinning soundness in sumcheck, PLONK, FRI, and most polynomial IOPs