中本聪共识与可验证延迟难题

摘要：

提出了一种新的基于可验证延迟函数的一致性协议。首先，我们引入了可验证延迟难题（VDP）的概念，它类似于PoW机制中使用的哈希难题，但只能顺序解决。然后，我们提出了一个VDP实现的基础上的连续可验证的延迟函数。此外，我们表明，VDP可以结合中本聪共识的权益证明/延迟证明的混合协议。我们分析了协议的持久性和活性，并表明，相比PoW，我们的建议消耗更少的能量;相比基于BFT领导选举的共识算法，我们的建议实现了更好的抵抗远程攻击和针对块提案者的拒绝服务攻击。

英文摘要：

This paper presents a new consensus protocol based on verifiable delay function. First, we introduce the concept of verifiable delay puzzle (VDP), which resembles the hashing puzzle used in the PoW mechanism but can only be solved sequentially. We then present a VDP implementation based on the continuous verifiable delay function. Further, we show that VDP can be combined with the Nakamoto consensus in a proof-of-stake/proof-of-delay hybrid protocol. We analyze the persistence and liveness of the protocol, and show that compared to PoW, our proposal consumes much less energy; compared to BFT leader-election based consensus algorithms, our proposal achieves better resistance to long-range attacks and DoS attacks targeting the block proposers.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。