论文标题
可验证的延迟功能有多难？
How hard are verifiable delay functions?
论文作者
论文摘要
可验证的延迟函数（VDF）是采用指定数量的顺序步骤的函数，但可以有效地验证。在本文中，我们介绍了一个包含所有VDF的新复杂性类。我们表明，这个新类$ \ mathbf {vdf} $是$ \ mathbf {cls} $（连续本地搜索）的子类，而宽松的访问 - 访问 - 可验证的线是$ \ mathbf {vdf} $的类的完整问题。
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}$.
