
























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}$.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。