Sublinear Dynamic Vector Commitments Optimize Stateless Blockchain Scaling
New sublinear vector commitments fundamentally resolve the state update bottleneck, enabling efficient, decentralized stateless blockchain validation.
Proof-Carrying Messages Decouple ZK Verifiability and Cross-Chain Interoperability
Introducing Proof-Carrying Interchain Messages and a Verifier Router to achieve composable, stateless, and proof-agnostic cross-domain verifiability.
Holographic Vector Commitments Enable Logarithmic State Verification for Stateless Clients
This new holographic commitment primitive radically reduces state proof size to logarithmic complexity, enabling trustless, efficient validation on any device.
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.
Recursive Proof Composition Achieves Logarithmic-Time Zero-Knowledge Verification
A novel folding scheme reduces the verification of long computations to a logarithmic function, fundamentally decoupling security from computational scale.
Sublinear Vector Commitments Achieve Optimal Stateless Client Update Efficiency
A new vector commitment scheme achieves sublinear complexity for both global update size and local proof updates, solving the stateless client efficiency trade-off.
