Answers are grounded in this paper and cite their sources.
A verifiable delay function (VDF) is an important tool used for adding delay in decentralized applications. This paper surveys and compares two beautiful verifiable delay functions, one due to Pietrzak, and the other due to Wesolowski, In addition, we provide a new computational proof of security for one of them, present an attack on an incorrect implementation of the other, and compare the complexity assumptions needed for both schemes.
No takes yet. Share an insight, caveat, or question.
Boneh et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: