Master the mathematical foundations of zero-knowledge proofs. No advanced math background required—just curiosity and a desire to learn.
This course is your gateway to mastering the essential mathematics that power zero knowledge proofs (ZKPs)—from modular arithmetic to elliptic curves. Whether you're a builder, auditor, or protocol engineer, you'll gain the real-world intuition and confidence needed to work with cutting-edge zk technology. No advanced math background required—just curiosity and a desire to learn.
| # | Module | Description |
|---|---|---|
| 0 | Introduction | Course intro |
| 1 | Numbers and Terminology | Core terminology behind groups, fields, and modular arithmetic in ZK proofs |
| 2 | Complexity Theory | An intro to complexity theory and why it matters for ZK proofs |
| 3 | Elliptic Curves | Understanding elliptic curves and why they matter in cryptography |
| 4 | Polynomials | A powerful tool for encoding and verifying claims in ZK proofs |
| 5 | Polynomail Commitment Schemes | How we commit to polynomials without revealing or transmitting them |
| 6 | Further Techniques | Supporting techniques that add redundancy and structure to ZK proofs |
| 7 | Outro | Final thoughts and curated resources to continue your ZK learning journey |
This course is built for developers, cryptography learners, auditors, protocol engineers, and anyone curious about the math behind zero knowledge proofs (ZKPs).
Whether you're a student, researcher, Web3 founder, product manager, or security professional, you'll find clear, accessible explanations and practical insights.
Perfect for those who want to: