Verkle Trees Enable Stateless Ethereum Clients via Compact Polynomial Commitments
Verkle Trees replace Merkle proofs with polynomial commitments, reducing state witness size by 30x, unlocking truly scalable and decentralized stateless clients.
Polynomial Commitments Secure Erasure Codes for Scalable Data Availability Sampling
Cryptographically-secured erasure codes enable light clients to verify data availability by sampling, resolving the scalability bottleneck for modular architectures.
Vector Commitments Enable Constant-Time Data Availability Proofs for Stateless Clients
This new Vector Commitment primitive achieves $O(1)$ data availability proof verification, fundamentally decoupling light client security from network throughput limits.
Cryptographic Oracle Decouples Data Availability from Execution for Scalable Rollups
The Data Availability Oracle (DAO) uses polynomial commitments and game theory to cryptographically enforce off-chain data publication, unlocking trustless, massive L2 scalability.
Formalizing Data Availability Sampling as a New Cryptographic Commitment Primitive
Researchers formalize Data Availability Sampling as a cryptographic primitive, introducing a new commitment scheme that rigorously secures light client verification.
Erasure Code Commitments Cryptographically Enforce Data Availability Consistency
This new cryptographic primitive, defined by position- and code-binding, solves the data availability problem by guaranteeing that committed data is a valid erasure codeword, securing modular blockchain scaling.
FRIDA Enables Transparent Data Availability Sampling with Poly-Logarithmic Proofs
FRIDA uses a novel FRI-based commitment to achieve non-trusted setup data availability sampling, fundamentally improving scalability.
Zero-Overhead Data Availability Protocol Enables Trustless Scalability
ZODA introduces a tensor code-based proof of encoding that eliminates sampler communication overhead, fundamentally democratizing data availability verification for light nodes.
FRIDA Formalizes Data Availability Sampling with Transparent Cryptographic Proofs
FRIDA introduces the first formal cryptographic primitive for Data Availability Sampling, enabling trustless, scalable block data verification for modular blockchains.
