Verifiable Random Function
Web3 / privacy technology
A Verifiable Random Function (VRF) is a cryptographic primitive that generates random-looking outputs from a secret input while allowing anyone to verify the output's authenticity without learning the secret. The function owner produces both a random output and a proof that the output was computed correctly using their private key. This creates a powerful privacy-preserving tool where randomness is provably fair but not manipulable. VRFs are commonly used in blockchain systems for leader election, randomness beacons, and lottery mechanisms where participants must trust the outcome without trusting the outcome generator. Example: Chainlink VRF provides verifiable randomness for smart contracts on multiple blockchains, enabling provably fair NFT mints, gaming mechanics, and randomized selection processes across DeFi protocols. Why it matters for privacy technology: VRFs enable systems to verify randomness authenticity without exposing underlying private keys, allowing participants to independently confirm fairness while maintaining cryptographic privacy and preventing manipulation by centralized actors.
Explore the full Web3 Glossary — 2,062+ expert-curated definitions. Need guidance? Talk to our consultants.