Introduction to zk-STARKs

Cryptography · Axiom Academy

LESSON Introduction to zk-STARKs Understanding Scalable Transparent Arguments of Knowledge and their role in modern cryptography 1. What is STARK? Understanding the Acronym STARK stands for Scalable Transparent ARgument of Knowledge . Each word carries significant meaning: Scalable: Proof generation scales quasi-linearly with computation size Transparent: No trusted setup required - no "toxic waste" to worry about ARgument: Computationally sound (vs. unconditionally sound proofs) Knowledge: The prover knows a witness to the statement being proven 2. Technical Foundation: Hash Functions & Error-Correcting Codes STARKs are built on fundamentally different cryptographic primitives than SNARKs: Collision-Resistant Hash Functions: Used for Merkle trees and commitment schemes Reed-Solomon Codes: Error-correcting codes that enable the FRI protocol Polynomial Commitments: Merkle trees over polynomial evaluations Quantum Resistance: Unlike SNARKs which rely on elliptic curve pairings (vulnerable to quantum attacks), STARKs only assume collision-resistant hash functions, making them quantum-resistant. 3. Trade-offs: STARKs vs SNARKs While STARKs offer transparency and quantum resistance, they come with trade-offs: 4. High-Level Construction: AIR to FRI The STARK proving system follows a two-phase construction: Computational trace represented as a table of values Constraints expressed as low-degree polynomials Each row represents a step in the computation

This is the written version of the interactive lesson above. See the full Cryptography course.