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."
All terms and definitions may update as the Cryptionary improves.