Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | Verifiable Delay Functions |
|---|---|
| What the text proposes | A function that forces a wait. Evaluating it takes a set number of sequential steps. Checking the result is quick, and the output is unique. Parallel machines do not make the wait much shorter. |
| Who may write | Dan Boneh, Joseph Bonneau, Benedikt Bünz and Ben Fisch |
| What is settled | Sequential work, so extra CPUs do not divide the wait by the same factor. |
| Load-bearing assumption | A VDF is not a consensus protocol, a proof of space, or a random beacon by itself. |
| What this library says afterwards | Hardware that evaluates faster than the designers assumed shortens the delay for whoever owns it. |
| Rights | Official external source only |