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 VDF is a subclass of CLS (continuous local search) and Relaxed-Sink-of-Verifiable-Line is a complete problem for the class VDF.
Cite
@article{arxiv.2211.08181,
title = {How hard are verifiable delay functions?},
author = {Souvik Sur},
journal= {arXiv preprint arXiv:2211.08181},
year = {2022}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2202.10970