发表机构
National Mobile Communications Research Laboratory, Southeast University; Purple Mountain Laboratories; School of Cyber Science and Engineering, Southeast University; State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications; Department of Electrical and Computer Engineering, University of California, Davis（东南大学国家移动通信实验室; 紫金山实验室; 东南大学网络空间安全学院; 北京邮电大学网络与交换技术国家重点实验室; 加州大学戴维斯分校电气与计算机工程系）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
提出基于可验证延迟函数的轻量级共识协议PoVD，在较弱网络假设下实现低分叉率、低计算通信开销，提升区块链一致性，适用于资源受限环境。
AI 中文摘要
共识协议确保了区块链及其上构建的去中心化应用的鲁棒性和可扩展性。然而，现有的共识机制往往需要高昂的计算成本或繁重的通信开销。为了解决这些挑战，我们提出了可验证延迟证明（PoVD），一种基于可验证延迟函数（VDF）的轻量级共识协议。我们详细介绍了PoVD的协议，包括区块挖掘和验证规则，并阐述了PoVD如何根据网络状况灵活调整区块时间分布。通过数学证明，我们指出，在相对较弱的网络假设下，PoVD能够在保持相同吞吐量的同时，实现比PoW更低的分叉率。我们的实验验证了PoVD具有较低的计算和通信复杂度，并且还能提高区块链的一致性，使其特别适用于资源受限的节点和带宽受限的网络。
英文摘要
Consensus protocols ensure the robustness and scalability of blockchains and decentralized applications built on them. However, existing consensus mechanisms often impose high computational cost or require heavy communication overhead. To address these challenges, we propose proof of verifiable delay (PoVD), a lightweight consensus protocol based on the verifiable delay function (VDF). We present the detailed protocol of PoVD, including the block mining and verification rules, and illustrate how PoVD can flexibly adjust the block time distribution according to the network condition. Through mathematical proof, we point out that, under a relatively weak network assumption, PoVD can achieve a lower fork rate than PoW while maintaining the same throughput. Our experiments verify that PoVD exhibits low computation and communication complexity and can also improve the blockchain consistency, making it particularly suitable for resource-constrained nodes and bandwidth-limited networks.
