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.
Non-Delegatable Commitments Enforce Cryptographic Proof of Work and Identity
Non-Delegatable Commitments cryptographically bind action to private key possession, preventing outsourcing and enforcing honest participation in attestations.
Verifiable Information Dispersal Decouples Finality from Asynchronous Data Availability
Asynchronous Verifiable Dispersal is a new primitive enabling optimal BFT latency by proving data dispersal before full reconstruction, accelerating consensus.
Sublinear Zero-Knowledge Proofs Democratize Verifiable Computation and Privacy
Sublinear memory scaling for ZKPs breaks the computation size bottleneck, enabling universal verifiable privacy on resource-constrained devices.
Lattice-Based Recursion Enables Transparent Post-Quantum Zero-Knowledge Proofs
LaBRADOR introduces a post-quantum, lattice-based ZK primitive that achieves sublinear proof size via recursive folding, securing future computation.
