Archivecryptography
Verifiable Delay Functions Force Sequential Time
A VDF takes a known number of sequential steps to compute and is fast to verify — a clock made of math.
- Published
- Reading time
- 1 min read
A VDF produces a unique output after a prescribed number of sequential operations. Anyone can verify the output quickly, but nobody can parallelize the computation. That makes it a public randomness beacon with a built-in delay.
Properties
- Sequentiality: no known shortcut to parallelize.
- Uniqueness: exactly one valid output per input.
- Efficient verification: proof checking is much cheaper than evaluation.
Common constructions use repeated squaring in a group of unknown order, with a proof (Wesolowski/Pietrzak) to avoid recomputation.
Uses
- Randomness beacons resistant to last-revealer manipulation.
- Leader election with enforced timing.
- Preventing front-running by imposing a delay.
Limits
- Evaluation is intentionally slow; misuse as a general delay is wasteful.
- Trusted setup may be required to generate the group of unknown order.
- An attacker with massive parallelism still cannot shortcut, but can choose not to participate.
Takeaway: VDFs turn elapsed time into a verifiable resource. They are for sequencing and randomness, not for encryption or consensus by themselves.