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
Cryptographic honesty: this exhibit teaches the architecture of zk-SNARK systems (setup/proving/verification and public/private split). It is intentionally not a real SNARK implementation or security parameterization.

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
DimensionThis ExhibitProduction Expectation
Circuit complexityTiny arithmetic relationLarge circuits (thousands to millions of constraints)
Setup modelVisual trusted setup simulationCeremony with strict toxic-waste handling
Proof objectReadable JSON envelopeCurve-based proof bytes with formal verification equations
Verifier environmentBrowser pedagogyAudited 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.