Welcome
Introduction to ZK Jargon
What does it mean to prove?
Probabilistic and Interactive proofs
Definitions
Algebraic Holographic Proof (AHP)
Arithmetization
Base Field
Circuit
Coefficient Form
Common Reference String
Completeness
Constraints
Elliptic Curve
Evaluation Form
Fast Fourier Transform
Fiat-Shamir Transform
Instance
Lagrange Interpolation
Language
Nullifier
Oracle
PLONKish Arithmetization
Polynomial Commitment Scheme
Polynomial Interactive Oracle Proof
Preprocessing SNARK
Public-coin
Quadratic Arithmetic Program
R1CS
Random Oracle
Relation
Roots of Unity
Scalar Field
Schwartz-Zippel Lemma
SNARK
Soundness
Structured Reference String
Threshold Encryption
Trusted Setup
Vanishing Polynomial
Witness
Zero-Knowledge Proof
Light
Rust
Coal
Navy
Ayu
ZK Jargon Decoder
Constraints
In arithmetized circuits
. A constraint is an equation that relates gate inputs to gate outputs.