Verifiable Delay Function (VDF)
A function that takes a guaranteed minimum time to compute, with fast publicly verifiable proofs.
VDFs enforce time delays that can’t be parallelized, useful for unbiased randomness beacons and leader election. The output comes with a proof that’s quick to verify.
"A randomness beacon uses a VDF to prevent adversaries from quickly grinding through many seeds to bias the outcome."
Related Terms
Verifiable Random Function (VRF)
→A function that produces a random-looking output with a proof that can be publicly verified.
Timelock
→A constraint that prevents a transaction or output from being spent 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.
