Term

Verifiable Random Function (VRF)

A function that produces a random-looking output with a proof that can be publicly verified.

Type:
cryptography
consensus
1
definition

A VRF lets a party generate pseudorandom values with proofs verifiable by anyone using the party’s public key. Used in leader election and committees without revealing biasable seeds.

Example 1.1

"In a PoS protocol, validators compute a VRF per slot; if the output is below a threshold, they’re eligible to propose a block and include the VRF proof."

All terms and definitions may update as the Cryptionary improves.