Cost-Effective Verifiable Delay Functions Unlock Secure EVM Randomness
Optimizing Pietrzak's VDF verification from 4M to 2M gas makes unbiasable on-chain randomness feasible, securing leader election and decentralized applications.
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.
On-Chain Randomness Enables Fair Transaction Inclusion without Miner Manipulation
Introducing rTFM, a mechanism using on-chain randomness to decouple miner incentives from fair transaction inclusion, unlocking equitable blockspace access.
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.
