ZK Whiteboard Sessions: What Is a SNARK? | Dan Boneh | Module 1

Added:

STARKs and the Critique of SNARK Trusted Setups and Quantum Vulnerability

While zk-SNARKs offer highly succinct proofs and fast verification, critics highlight several significant drawbacks. Many popular SNARKs require a 'trusted setup' (generating cryptographic parameters that must be securely destroyed), introducing a potential security vulnerability if the setup ceremony is compromised. Furthermore, most SNARKs rely on elliptic curve cryptography, making them vulnerable to future quantum computer attacks. In response, proponents champion zk-STARKs (Zero-Knowledge Scalable Transparent Arguments of Knowledge). STARKs eliminate the trusted setup entirely by relying on collision-resistant hash functions, which also grants them post-quantum security. While STARKs generate larger proof sizes than SNARKs—leading to higher transmission and on-chain storage costs—advocates argue that their elimination of trust assumptions and readiness for a post-quantum world make them a more robust, future-proof alternative for decentralized privacy and scaling.

Basic concepts of cryptography, including cryptographic hash functions, public-key encryption, and algebraic structures like finite fields.
The foundational concept of interactive proof systems, involving a Prover and a Verifier, and the definition of Zero-Knowledge.
Fundamental computational complexity theory, specifically the concept of NP-completeness and arithmetic circuits.
Elementary algebra, particularly polynomial arithmetic and polynomial interpolation, which are crucial for understanding SNARK representations.
Polynomial Commitment Schemes (PCS), such as KZG, IPA, and FRI, which serve as the mathematical backbone of modern SNARKs.
The process of Arithmetization, transforming programs into mathematical representations like R1CS (Rank-1 Constraint Systems) or QAPs (Quadratic Arithmetic Programs).
Advanced SNARK and STARK constructions, comparing protocols like Groth16, PLONK, and Halo2 in terms of setup types and performance.
Real-world scaling and privacy architectures, such as ZK-Rollups (e.g., zkSync, Starknet) and privacy-preserving smart contract platforms.
39.8K views771likes42:08@zeroknowledgefmOriginal Release: 2022-08-02

A SNARK (Succinct Non-Interactive Argument of Knowledge) is a cryptographic proof system that enables a prover to convince a verifier that a statement is true without revealing any information about the underlying data, with proofs being extremely short (logarithmic in circuit size) and verification taking only milliseconds regardless of circuit complexity. SNARKs achieve this through preprocessing of arithmetic circuits, which are directed acyclic graphs representing computational statements as polynomials. The system relies on three key algorithms: a setup procedure that generates public parameters, a prover algorithm that creates the succinct proof, and a verifier algorithm that checks proof validity. Zero-knowledge variants additionally ensure the proof reveals nothing about the witness beyond what the verifier already knows. SNARKs have transformative applications in blockchain technology including private transactions, compliance verification, and scalability solutions like zk-Rollups.