How hard are verifiable delay functions?

Abstract

Verifiable delay functions (VDF) are functions that take a specified number of sequential steps to be evaluated but can be verified efficiently. In this paper, we introduce a new complexity class that contains all the VDFs. We show that this new class $\mathbf{VDF}$ is a subclass of $\mathbf{CLS}$ (continuous local search) and Relaxed-Sink-of-Verifiable-Line is a complete problem for the class $\mathbf{VDF}$.

arXiv admin note: substantial text overlap with arXiv:2202.10970