Brakedown Achieves Post-Quantum Sublinear Polynomial Commitment without Trusted Setup
This new polynomial commitment scheme combines Reed-Solomon codes with Merkle trees, enabling post-quantum security and sublinear proof size.
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.
Sublinear Vector Commitments Optimize Stateless Blockchain State Updates
A novel vector commitment scheme achieves sublinear update complexity, fundamentally reducing the overhead for light clients to maintain and verify global blockchain state.
Lattice-Based Functional Commitments Secure All Functions with Transparent Post-Quantum Setup
New lattice-based functional commitments secure all functions, enabling post-quantum verifiable computation without a trusted setup.
Constant-Size Accumulators Unlock Truly Stateless Blockchain Architecture
This research introduces constant-size batching techniques for cryptographic accumulators, fundamentally enabling blockchain nodes to achieve constant-time state verification with minimal storage.
