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.
Sublinear Vector Commitments Enable Stateless Client Scalability
Developing a new vector commitment scheme that achieves sublinear complexity for both update information and proof maintenance, fundamentally optimizing stateless client operation.
Robust Distributed Arrays Secure Data Availability Sampling Networking
Robust Distributed Arrays formally secure the peer-to-peer networking layer of Data Availability Sampling, enabling provably robust blockchain scaling.
