Verifiable Delay Function (VDF)
A function designed to require a minimum sequential computation time while producing a proof that is quick to verify.
- Acronym
- VDF
A verifiable delay function (VDF) produces an output only after a computation that cannot be meaningfully sped up with parallel hardware. The result includes proof that others can verify quickly.
VDFs are studied for randomness, leader election, and time-delay mechanisms. They differ from proof of work because the goal is a predictable delay, not an open-ended race to find a hash below a target.
Related terms
3 linkedExplore connected entries beyond the alphabetical index.
Verifiable Random Function (VRF)
→A cryptographic function that produces random-looking output with a proof anyone can verify using a public key.
Timelock
→A spending rule that prevents a transaction or output from being used until a specified time or block height.
Proof of Work (PoW)
→A consensus algorithm where computing power is used to solve complex problems, verify transactions, and create new blocks.
All terms and definitions may update as the Cryptionary improves.
