π² Verifiable Randomness: Provably Fair RNG
Learn how Chainlink VRF and VDFs ensure tamper-proof randomness
Your Progress
0 / 5 completedWhat is Verifiable Randomness?
**Verifiable randomness** is cryptographically provable random number generation for blockchain applications. Unlike traditional RNG, verifiable randomness provides a proof that numbers were generated fairly without manipulationβcritical for gaming, lotteries, NFT minting, and validator selection.
The challenge: blockchains are deterministic by design. Every node must compute the same result. True randomness breaks consensus. Solutions like VRF (Verifiable Random Functions) and VDF (Verifiable Delay Functions) enable provably fair randomness on-chain.
π² Why Verifiable Randomness Matters
Interactive: Randomness Method Comparison
Compare different approaches to generating random numbers on blockchain and understand their security tradeoffs.
Block Hash
Use block.prevrandao (formerly blockhash)
Test Random Generation
The Determinism Problem
β Why blockhash() fails
Miners can see the block hash before committing and withhold blocks with unfavorable outcomes.
β οΈ Why oracles are risky
Centralized oracles can be compromised, censored, or go offline. Single point of failure.
β Why VRF/VDF work
Cryptographic proofs ensure randomness cannot be predicted or manipulated before commitment.