$\mathbf{VDF} = \mathbf{PSPACE}$

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 show that every VDF is provable in PSPACE and every language in PSPACE admits to a VDF.