Implementation Study of Two Verifiable DelayFunctions
Implementation Study of Two Verifiable DelayFunctions
复制标题
DOI：
10.4230/oasics.tokenomics.2020.9
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Vidal Attias;Luigi Vigneri;V. Dimitrov
中科院分区：
文献类型：
--
作者：
Vidal Attias;Luigi Vigneri;V. Dimitrov
工作量证明是证明区块链项目时间投资的流行机制。然而，大规模并行性和专用硬件的使用给一小部分节点带来了不公平的优势，并引发了环境和经济问题。在本文中，我们提供了两个可验证延迟函数的实现研究，这是一种新的加密原语，以无与伦比的方式实现工作证明目标。我们提供模拟结果和基于多重指数算法的优化。
Proof of Work is a prevalent mechanism to prove investment of time in blockchain projects. However, the use of massive parallelism and specialized hardware gives an unfair advantage to a small portion of nodes and raises environmental and economical concerns. In this paper, we provide an implementation study of two Verifiable Delay Functions, a new cryptographic primitive achieving Proof of Work goals in an unparallelizable way. We provide simulation results and an optimization based on a multiexponentiation algorithm.