Hierarchical Vector Commitment Enables Constant-Time Stateless Blockchain Verification
A new Hierarchical Polynomial Vector Commitment achieves constant-size state proofs, drastically lowering node hardware requirements and securing decentralization.
Logarithmic Accumulators Enable Constant-Size Stateless Blockchain Verification
A new cryptographic accumulator compresses massive state into a constant-size proof, unlocking efficient stateless clients and scalable data availability.
Constant-Space Distributed Randomness via Insertion-Secure Accumulators and Delay Functions
This framework achieves scalable, unpredictable randomness by combining Verifiable Delay Functions with a new accumulator property, reducing public storage complexity to a constant.
Merkle Mountain Ranges Achieve Optimal Witness Update Frequency Lower Bound
This work establishes the theoretical lower bound for cryptographic accumulator witness updates, proving Merkle Mountain Ranges are structurally optimal for stateless blockchain verification.
Vector Accumulators Enable Logarithmic Stateless Client Verification without Trusted Setup
This new Vector Accumulator primitive decouples state size from client verification cost, achieving logarithmic-time proofs for truly scalable stateless nodes.
CRSet Achieves Private Non-Interactive Credential Revocation Concealing All Metadata
CRSet introduces Bloom filter cascades with padding to cryptographically conceal credential revocation metadata, enabling truly private self-sovereign identity.
