EXHIBIT 06⬡ PEDAGOGICAL SNARK MODEL
zk-SNARK Pipeline (Setup → Prove → Verify)
Bridge the Fiat-Shamir mental model to modern proving systems without pretending this is production cryptography.
✓ Succinct verification shape
✓ Public vs private inputs
✓ Conceptual zero-knowledge flow
Fiat-Shamir removed interaction by deriving a challenge from a hash. zk-SNARKs go further: they compile a computation into a proof system where the verifier checks a tiny proof against public inputs using a verification key.
This exhibit visualizes that pipeline with a toy arithmetic relation so you can map intuition to modern systems without confusing educational animation with deployable proving software.
Toy vs Production Parameters
| Dimension | This Exhibit | Production Expectation |
|---|---|---|
| Circuit complexity | Tiny arithmetic relation | Large circuits (thousands to millions of constraints) |
| Setup model | Visual trusted setup simulation | Ceremony with strict toxic-waste handling |
| Proof object | Readable JSON envelope | Curve-based proof bytes with formal verification equations |
| Verifier environment | Browser pedagogy | Audited verifiers (on-chain/off-chain) with formal assumptions |
PROVER PIPELINE
Private witness w
—
Public input y
—
Toy relation
y = w² + 3w + 7
Proof commitment digest
—
VERIFIER PIPELINE
Verification equation check
—
Digest consistency
—
Ready.
— protocol log —
What this teaches: SNARK systems separate private witness data from public claims, and let verifiers run small checks over proof objects and public inputs. Real systems add finite-field circuits, polynomial commitments, setup assumptions, and formal security proofs.