Scalable Distributed Randomness via Insertion-Secure Accumulators
Research demonstrates a scalable distributed randomness beacon by enforcing verifiable inclusion of all entropy contributions using insertion-secure accumulators.
Recursive Structure-Preserving Commitments Enable Constant-Size Universal SNARK Setup
Fractal Commitment Schemes introduce a recursive commitment primitive that compresses the universal trusted setup into a constant size, dramatically accelerating verifiable computation deployment.
Two-Phase ZK-VM Architecture Secures Memory Integrity with Custom Accumulators
A novel two-phase ZK-VM architecture leverages a custom elliptic curve accumulator for memory integrity, drastically cutting proving cost and boosting verifiable computation efficiency.
Sublinear Vector Commitments Enable Constant-Time Verification for Scalable Systems
A new vector commitment scheme achieves constant verification time with logarithmic proof size, fundamentally enabling efficient stateless clients and scalable data availability.
Vector Commitments Enable Constant-Time Data Availability Proofs for Stateless Clients
This new Vector Commitment primitive achieves $O(1)$ data availability proof verification, fundamentally decoupling light client security from network throughput limits.
Cornucopia: Insertion-Secure Accumulators Forge Scalable Distributed Randomness
Cornucopia introduces insertion-secure accumulators to efficiently aggregate contributions for VDF-based randomness, securing the foundation of decentralized systems.
Bilinear Accumulators Enable Constant-Size Zero-Knowledge Batch Proofs
Zero-knowledge batch proofs using Bilinear Pairings achieve constant size and verification time, dramatically accelerating stateless blockchain and credential systems.
Succinct State Proofs Decouple Verification from State Bloat
A novel polynomial commitment scheme enables constant-size cryptographic proofs of the entire blockchain state, resolving the critical state synchronization bottleneck and preserving decentralization.
Cornucopia Achieves Scalable Unbiasable Randomness Using Accumulators and Delay Functions
A new framework combines accumulators and VDFs with insertion security to create a scalable, unbiasable distributed randomness beacon for consensus.
