Vector Commitments Enable Sublinear State Verification for Stateless Clients
A new polynomial vector commitment scheme transforms light clients into secure, stateless verifiers, dramatically improving blockchain decentralization and user security.
Logarithmic-Cost Data Availability Sampling Vector Commitments
Introducing a novel vector commitment scheme that reduces data availability proof size from linear to logarithmic, fundamentally unlocking scalable decentralized rollups.
Universal Vector Commitments Enable Efficient Proofs of Non-Membership and Data Integrity
Introducing Universal Vector Commitments, a new primitive that securely proves element non-membership, fundamentally enhancing stateless client and ZK-rollup data verification.
Sublinear Vector Commitments Enable Constant-Time Verification for Scalable Systems
A new vector commitment scheme achieves constant verification time with logarithmic proof size, fundamentally enabling efficient stateless clients and scalable data availability.
Universal Vector Commitments Achieve Constant-Time Data Availability Sampling
A novel Universal Vector Commitment scheme achieves constant-time data availability sampling, fundamentally solving the verifier's dilemma and enabling infinite L2 scalability.
Layered Vector Commitment Trie Achieves Constant-Time Blockchain State Updates
A new Layered Versioned Multipoint Trie, utilizing algebraic vector commitments, achieves amortized $O(1)$ state updates, dramatically boosting blockchain throughput and lowering latency.
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.
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.
Sublinear Vector Commitments Enable Trustless Stateless Data Availability
A new vector commitment scheme allows light clients to verify massive datasets with logarithmic communication, fundamentally solving the stateless data availability problem.
