A verifiable delay function (VDF) is a cryptographic tool that requires a set amount of time to compute, because its steps must be done one after another and gain little from parallel processors, yet produces an output whose correctness anyone can check almost instantly. The concept was formalised in 2018 by Dan Boneh, Joseph Bonneau, Benedikt Bünz and Ben Fisch.
VDFs are useful wherever a system needs proof that real time has passed, or randomness that nobody can manipulate at the last moment. In consensus mechanisms, a VDF can make a random value impossible to predict or bias before it is revealed, which helps choose block producers fairly. The Chia network combines VDFs with proof of space, and researchers have studied their use alongside Ethereum's randomness for selecting validators. VDFs are related to, but distinct from, verifiable random functions and other forms of cryptographic proof.
Ref 1300000364