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.
Log-Space Commitments Enable Hyper-Efficient Recursive Proofs for Scalable State
A novel Log-Space Verifiable Commitment scheme achieves logarithmic verification complexity for continuous state updates, unlocking truly scalable verifiable systems.
