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.
Distributed Verifiable Random Functions Secure Decentralized Randomness Generation Trustlessly
Integrating threshold cryptography and zk-SNARKs into a Distributed Verifiable Random Function creates a foundational, unbiasable randomness primitive essential for secure PoS and sharding.
Constant-Cost Randomness Beacons Decouple Security from Network Scale
A new cryptographic protocol achieves constant *O(1)* on-chain gas cost for decentralized randomness, making leader election and sharding truly scalable.
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.
Lightweight Asynchronous Verifiable Secret Sharing Achieves Optimal Resilience
New AVSS protocols use only hash functions to achieve optimal $t
Distributed Verifiable Random Function Secures Decentralized Randomness Beacons
Implementing a Distributed VRF with zk-SNARKs and NI-DKG creates a publicly verifiable, unbiased, and unmanipulable source of network randomness.
Weighted Verifiable Random Functions Scale Proof-of-Stake Randomness
Cryptographers introduce Weighted VRFs to provide cost-independent, autonomous, and fresh on-chain randomness for weighted Proof-of-Stake systems, solving a critical scalability bottleneck.
Game-Theoretic Incentives Guarantee Provably Uniform Decentralized Randomness
A new Randomness Incentive Game (RIG) establishes a Nash Equilibrium where participants are compelled to submit provably uniform inputs, securing all decentralized randomness protocols.
Rondo Protocol Achieves Scalable, Dynamic Distributed Randomness Beacon
The Rondo protocol introduces Batched Asynchronous Verifiable Secret Sharing with Partial Output, enabling dynamic node membership and optimal O(n) message complexity for scalable, unpredictable randomness.
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.