Skip to main content

Verifiable Random Function

Definition

A Verifiable Random Function (VRF) is a cryptographic primitive that generates a pseudorandom output along with a proof that the output was correctly computed. This proof can be publicly verified without revealing the secret input used to generate the randomness. VRFs provide a reliable source of verifiable randomness, which is essential for fair and unpredictable outcomes in decentralized systems. They ensure transparency and resistance to manipulation.