Verifiable Random Function (VRF)
cryptography
consensus
A cryptographic function that produces random-looking output with a proof anyone can verify using a public key.
- Acronym
- VRF
1
definition
A verifiable random function (VRF) lets a holder of a private key generate a pseudorandom output and a proof. Anyone with the public key can verify that the output was computed correctly and was not chosen after the fact.
2
uses
VRFs are used for leader election, committee selection, lotteries, and randomness beacons where public verifiability matters. They do not by themselves guarantee unbiased randomness if inputs or participants can be manipulated.
Conceptual links
Related terms
2 linkedExplore connected entries beyond the alphabetical index.
All terms and definitions may update as the Cryptionary improves.
