Cost-Effective Verifiable Delay Functions Unlock On-Chain Randomness and Fairness
New EVM-aware VDF verification slashes gas cost by half, making unbiasable on-chain randomness economically viable for decentralized systems.
Constant-Size Proofs Secure Distributed Verifiable Random Functions Efficiently
Cryptographers developed a Distributed Verifiable Random Function with proofs of constant size, eliminating bilinear pairings for faster, pairing-free verification.
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.
Sequential Proof-of-Work Enables Competitive Decentralized Randomness Beacons
RandChain introduces Sequential Proof-of-Work to mandate non-parallelizable mining, securing public randomness and democratizing validator election.
Cryptographic Sequential Delay Secures Decentralized Randomness Beacons
Verifiable Delay Functions introduce cryptographically enforced sequential time, preventing parallel computation and eliminating randomness bias in Proof-of-Stake leader election.
