BR Academy

Zero-Knowledge Proofs for Builders: Circuits, Rollups and Privacy

Exit course

← Zero-Knowledge Proofs for Builders: Circuits, Rollups and Privacy

1What Zero-Knowledge Proofs Are0/4

What is a Zero-Knowledge Proof?8m
ZK vs. Encryption, Hashing, and Digital Signatures
The Anatomy of a ZK Proof: Prover, Verifier, and the Statement
Interactive vs. Non-Interactive Proofs
Module quiz

2SNARKs and STARKs in Plain Terms0/4

What is a SNARK? Proof Size, Verification, and Trusted Setup
What is a STARK? Transparency, Scalability, and Quantum Resistance
SNARK vs. STARK: When to Use Each
Groth16, Plonk, Halo2, and Cairo—A Landscape
Module quiz

3Writing Circuits0/5

Setting Up Circom and Writing Your First Circuit
Constraints, Signals, and Templates in Circom
Lab: Write a Merkle Tree Membership Proof Circuit
Introduction to Noir: Circuits in Rust-Like Syntax
Lab: Write a Range Proof in Noir
Module quiz

4Proving Systems and Trusted Setups0/5

How Proofs Are Generated: Witness, Constraint System, and Proving Key
Trusted Setups: Why They Matter and How They Work
Participating in a Trusted Setup Ceremony
How Proofs Are Verified On-Chain
Lab: Integrate a Circom Proof into a Solidity Contract
Module quiz

5ZK Rollups and Validity Proofs0/5

Rollup Fundamentals: Optimistic vs. Validity Proofs
ZK Rollup Architecture: Sequencer, Prover, and Settlement
The Validity Proof Flow: Batching, Proving, and Verification
StarkNet, Polygon zkEVM, and Scroll: Case Studies
Lab: Design a ZK Rollup for a Simple Token Transfer System
Module quiz

6Privacy Applications and Identity0/5

Privacy in Blockchain: Anonymity, Unlinkability, and Deniability
Shielded Transfers: How Tornado Cash and Zcash Work
Anonymous Voting: Proof of Membership Without Revealing Identity
ZK Identity: Proving Attributes Without Revealing Data
Lab: Build an Anonymous Voting Contract with ZK Proofs
Module quiz

7Performance, Cost, and Auditing0/5

Proving Time, Proof Size, and Optimization Strategies
On-Chain Verification Gas Costs and Optimization
Common Circuit Bugs: Unconstrained Inputs, Witness Leakage, and Soundness Holes
ZK Code Audit Checklist: What to Look For
Capstone: Design, Build, and Audit a ZK Application
Module quiz

SNARKs and STARKs in Plain Terms·Lesson 5 of 33·11 min

What is a SNARK? Proof Size, Verification, and Trusted Setup

This lesson is for enrolled learners

The concept A SNARK is a succinct non-interactive argument of knowledge. In practice that means: the proof is small (often a few hundred bytes for popular elliptic-curve constructions), the verifier’s work is much smaller than re-running the original computation, the proof is a single object you can post, and it is an argument of knowledge — a cheating prover without……

Enroll to continue Already enrolled? Sign in