Decoupling Coding and Commitment Strengthens Data Availability Sampling Assurance
A new Data Availability Sampling paradigm uses Random Linear Network Coding to generate coded samples on-the-fly, achieving significantly stronger security assurance for light clients.
Non-Interactive Proofs Cryptographically Secure Proof-of-Stake Long-Range Attacks
Non-interactive epiality proofs establish a bounded trust model, cryptographically securing Proof-of-Stake light clients against historical chain rewrites.
Verifiable Data Commitment Decouples Scalability from Base Layer Bandwidth
The Verifiable Data Commitment primitive allows light clients to cryptographically verify massive data availability with constant overhead, solving the fundamental scalability bottleneck for decentralized systems.
