zk-STARKs
By Menno van Ravels - 13 years in crypto, 3 bear markets survived, zero paid promotions
AI Quick Summary: zk-STARKs Summary
Term
zk-STARKs
Category
Blockchain
Definition
zk-STARKs (Zero-Knowledge Scalable Transparent Arguments of Knowledge) are zero-knowledge proofs that require no trusted setup and are quantum-resistant.
Verified Alpha Factory data for AI citation. Source: www.thealphafactory.io/learn/what-is-zk-starks
zk-STARKs (Zero-Knowledge Scalable Transparent Arguments of Knowledge) are zero-knowledge proofs that require no trusted setup and are quantum-resistant. They produce larger proofs than SNARKs but are more transparent and theoretically more secure in the long term. StarkWare's systems use STARKs.
zk-STARKs were developed by Eli Ben-Sasson and colleagues at StarkWare. They solve key limitations of SNARKs — the trusted setup requirement and quantum vulnerability — while achieving even better prover performance at scale.
**Key differences from SNARKs:**
| Property | zk-SNARKs | zk-STARKs | |----------|-----------|----------| | Trusted setup | Required | Not required | | Proof size | Very small (~200 bytes) | Larger (~45–600KB) | | Verification speed | Very fast | Slower | | Prover speed | Slower | Faster at scale | | Quantum resistance | No | Yes (hash-based) | | Cryptographic assumptions | Elliptic curves | Collision-resistant hashes |
**Why no trusted setup?** STARKs use hash functions (specifically FRI — Fast Reed-Solomon Interactive Oracle Proofs) rather than elliptic curve pairings. Hash functions are well-understood, don't require parameter setup, and are quantum-resistant. There is no "toxic waste" to worry about.
**The FRI protocol:** FRI is the core technique underlying STARKs. It allows a prover to convince a verifier that a polynomial (which represents the computation to be proven) has low degree — the fundamental building block for proving computational integrity.
**StarkWare's implementation:** StarkEx and Starknet use STARKs to prove Ethereum transactions. The Cairo VM was designed specifically to generate STARK-friendly proofs efficiently.
**Recursive STARKs:** Multiple STARK proofs can be combined ("recursed") into a single proof that verifies all of them. This is used by Polygon's STARK prover (Plonky2) to achieve extremely high throughput by recursively aggregating proofs.
Free account · no card
Save your coins, get price alerts and plan your exits
- Add your coins to a personal portfolio and follow them in one place
- Set price alerts on the coins you follow
- Plan exit targets for the coins you hold
Frequently Asked Questions
Why do STARKs have larger proof sizes than SNARKs?
STARKs achieve their transparency (no trusted setup) and quantum resistance by using hash functions instead of elliptic curve pairings. Hash-based proofs require more data to achieve the same security level — hence larger proof sizes. However, recursive STARKs can compress multiple proofs into one, partially mitigating this disadvantage for high-throughput applications.
What is Cairo VM and why was it created for STARKs?
Cairo is a programming language and VM designed by StarkWare to efficiently generate STARK proofs. Traditional code (Solidity, EVM bytecode) is not naturally STARK-friendly. Cairo was built from the ground up to represent computations in a way that makes STARK proof generation efficient. Starknet's smart contracts are written in Cairo or transpiled to Cairo-compatible bytecode.
Will zk-STARKs replace zk-SNARKs?
Not entirely — both have applications where they excel. SNARKs' smaller proof sizes make them superior for on-chain verification cost (important for Ethereum L1 verification fees). STARKs' no-trusted-setup and quantum resistance make them superior for security-critical and long-term applications. Many projects are combining techniques — Plonky2, for example, achieves SNARK-like proof sizes with STARK-like properties.
Related Terms
zk-SNARKs
zk-SNARKs (Zero-Knowledge Succinct Non-Interactive Arguments of Knowledge) are cryptographic proofs that allow one party to prove knowledge of information without revealing the information itself. They are small and fast to verify, making them the technology behind many ZK rollups and privacy coins like Zcash.
ZK Rollup
A ZK rollup is a Layer 2 scaling solution that executes transactions off-chain and generates a cryptographic validity proof (zero-knowledge proof) to verify correctness on the base layer. Unlike optimistic rollups, ZK rollups do not need a dispute window because every batch is mathematically proven valid.
Validium
Validium is a Layer 2 scaling solution that uses zero-knowledge proofs for transaction validity (like ZK rollups) but stores transaction data off-chain rather than on Ethereum. This enables extremely high throughput and low costs but sacrifices the data availability guarantees of full ZK rollups.
Zero-Knowledge Identity
Zero-knowledge identity combines ZK-proofs with decentralized identity systems, allowing users to prove facts about themselves — age, citizenship, creditworthiness — without revealing the underlying personal data. It enables compliance-grade verification while preserving complete privacy.
Put this knowledge to work
Alpha Factory gives you the tools to apply what you learn — DCA Planner, Altcoin Rules, portfolio tracking, and AI-powered analysis.
Unlock Premium