Glossary
Verifiable Random Function (VRF)
A function that produces a random output and a proof anyone can use to verify that the output was generated honestly from a given input and secret key.
A VRF combines a private key and an input into a pseudorandom output plus a proof. Anyone with the public key can verify that the output was generated correctly — the prover cannot bias the result without producing an invalid proof.
VRFs are the on-chain randomness primitive. Chainlink VRF is the most-used implementation; Algorand and several other chains use VRFs in their consensus protocol for committee selection. NFT mints, lotteries, and games rely on VRFs to produce unforgeable randomness.