基于HotStuff和多叉树的改进共识算法

doi:10.3969/j.issn.1671-1122.2025.09.012

信息网络安全 ›› 2025, Vol. 25 ›› Issue (9): 1447-1455.doi: 10.3969/j.issn.1671-1122.2025.09.012

基于HotStuff和多叉树的改进共识算法

杨建新¹^,², 汪晓丁¹^,², 林晖¹^,²()

1.福建师范大学计算机与网络空间安全学院，福州 350117
2.网络安全与教育信息化福建省高校工程研究中心，福州 350117

收稿日期:2024-06-28 出版日期:2025-09-10 发布日期:2025-09-18
通讯作者: 林晖 linhui@fjnu.edu.cn
作者简介:杨建新（2000—），男，福建，硕士研究生，主要研究方向为区块链共识协议|汪晓丁（1982—），男，福建，副教授，博士，CCF会员，主要研究方向为网络优化、无线网络通信|林晖（1977—），男，福建，教授，博士，CCF会员，主要研究方向为机器学习、移动边缘计算、无线网络安全、区块链
基金资助:
国家自然科学基金(U1905211);福建省高校产学研重点项目(2024H6008)

Improved Consensus Algorithm Based on HotStuff and Multi-Ary Trees

YANG Jianxin¹^,², WANG Xiaoding¹^,², LIN Hui¹^,²()

1. College of Computer and Cyber Security, Fujian Normal University, Fuzhou 350117, China
2. Fujian Provincial University Engineering Research Center of Cyber Security and Education Information, Fuzhou 350117, China

Received:2024-06-28 Online:2025-09-10 Published:2025-09-18

摘要/Abstract

摘要：

为解决区块链拜占庭容错共识协议中通信复杂度高、可扩展性差和领导者审查等问题，文章提出一种基于HotStuff和多叉树的改进共识算法。该算法在签名机制中引入BLS签名以实现聚合验证，显著减少了消息开销；利用多叉树结构实现负载均衡，提升了区块处理的并行度；通过流水线技术优化投票和提交阶段，降低了共识时延；采用积极的领导者轮换策略，解决恶意或低效领导者造成的系统性能下降问题。实验结果表明，在100个节点的场景下，该算法的吞吐量较传统HotStuff算法提升了约5倍。当网络往返时延由50 ms增至400 ms时，吞吐量仅下降9%，仍保持较高稳定性。同时，在多种网络环境下，该算法展现出更低的交易确认时延。因此，该算法在降低通信复杂度、增强容错能力和提升性能方面具有显著优势，为高性能区块链系统的设计与应用提供了参考。

关键词: 区块链, 共识算法, HotStuff, 多叉树

Abstract:

This paper presented an improved consensus algorithm based on HotStuff and multi-ary trees to address the issues of high communication complexity, poor scalability, and leader censorship in Byzantine fault-tolerant consensus protocols for blockchain. This algorithm introduced BLS signature into the signature mechanism to achieve aggregation verification, significantly reducing message overhead. Using multi-ary trees structure to achieve load balancing and improved the parallelism of block processing. By optimizing the voting and submission stages through pipeline technology, consensus latency had been reduced, and adopted an active leadership rotation strategy to address the system performance degradation caused by malicious or inefficient leaders. The results show that with a total of 100 system nodes, this algorithm consensus algorithm achieves a throughput five times higher than the traditional HotStuff consensus algorithm. Moreover, when round-trip time increases from 50ms to 400ms, throughput only decreases by 9% and still maintained high stability. Meanwhile, in various network environments, this algorithm exhibits lower transaction confirmation latency. Therefore, this algorithm has significant advantages in reducing communication complexity, enhancing fault tolerance, and improving performance, providing reference for the design and application of high-performance blockchain systems.

Key words: blockchain, consensus algorithm, HotStuff, multi-ary trees

中图分类号:

TP309

杨建新, 汪晓丁, 林晖. 基于HotStuff和多叉树的改进共识算法[J]. 信息网络安全, 2025, 25(9): 1447-1455.

YANG Jianxin, WANG Xiaoding, LIN Hui. Improved Consensus Algorithm Based on HotStuff and Multi-Ary Trees[J]. Netinfo Security, 2025, 25(9): 1447-1455.

图/表 7

图1

图2

图3

图4

图5

图6

图7

参考文献 18

[1]	CACHIN C. Architecture of the Hyperledger Blockchain Fabric[EB/OL]. (2016-06-23)[2024-06-10]. https://docslib.org/doc/9496711/architecture-of-the-hyperledger-blockchain-fabric.
[2]	BROWN R G. The Corda Platform: An Introduction[EB/OL]. (2018-05-10)[2024-06-10]. https://www.semanticscholar.org/paper/The-Corda-Platform-%3A-An-Introduction/8f0bb6825f4af8a708187959d62cadd6b6e424f2.
[3]	CASTRO M, LISKOV B. Practical Byzantine Fault Tolerance[C]// ACM. The Third Symposium on Operating Systems Design and Implementation (OSDI’99). New York: ACM, 1999: 173-186.
[4]	BESSANI A, SOUSA J, ALCHIERI E E P. State Machine Replication for the Masses with BFT-SMART[C]// IEEE. 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks. New York: IEEE, 2014: 355-362.
[5]	YIN Maofan, MALKHI D, REITER M K, et al. HotStuff: BFT Consensus with Linearity and Responsiveness[C]// ACM. The 2019 ACM Symposium on Principles of Distributed Computing. New York: ACM, 2019: 347-356.
[6]	KOGIAS E K, JOVANOVIC P, GAILLY N, et al. Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing[C]// USENIX. 25th USENIX Security Symposium (USENIX Security 16). Berkley: USENIX, 2016: 279-296.
[7]	LUU L, NARAYANAN V, ZHENG Chaodong, et al. A Secure Sharding Protocol for Open Blockchains[C]// ACM. The 2016 ACM SIGSAC Conference on Computer and Communications Security. New York: ACM, 2016: 17-30.
[8]	KOKORIS-KOGIAS E, JOVANOVIC P, GASSER L, et al. OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding[C]// IEEE. 2018 IEEE Symposium on Security and Privacy. New York: IEEE, 2018: 583-598.
[9]	BONEH D, LYNN B, SHACHAM H. Short Signatures from the Weil Pairing[C]// Springer. 2001 Theory and Application of Cryptology and Information Security. Heidelberg: Springer, 2001: 514-532.
[10]	JALALZAI M M, NIU Jianyu, FENG Chen, et al. Fast-HotStuff: A Fast and Resilient HotStuff Protocol[EB/OL]. (2023-08-25)[2024-06-10]. https://doi.org/10.1109/TDSC.2023.3308848.
[11]	CHANDRA T D, TOUEG S. Unreliable Failure Detectors for Asynchronous Systems (Preliminary Version)[C]// ACM. The Tenth Annual ACM Symposium on Principles of Distributed Computing (PODC’91). New York: ACM, 1991: 325-340.
[12]	GELASHVILI R, KOKORIS-KOGIAS L, SONNINO A, et al. Jolteon and Ditto: Network-Adaptive Efficient Consensus with Asynchronous Fallback[C]// Springer. The 26th Financial Cryptography and Data Security. Heidelberg: Springer, 2022: 296-315.
[13]	LI Qinan, XUE Zhihao, ZHANG Xuejun. Improved Fast-HotStuff Blockchian Consensus Algorithm[J]. Computer Engineering, 2021, 47(8): 14-21. doi: 10.19678/j.issn.1000-3428.0060847
	李启南, 薛志浩, 张学军. 改进Fast-HotStuff区块链共识算法[J]. 计算机工程, 2021, 47(8): 14-21. doi: 10.19678/j.issn.1000-3428.0060847
[14]	SUI Xiao, DUAN Sisi, ZHANG Haibin. Marlin: Two-Phase BFT with Linearity[C]// IEEE. 2022 52nd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN). New York: IEEE, 2022: 54-66.
[15]	BROWN D R L. Sec2:Recommended Elliptic Curve Domain Parameters[EB/OL]. (2010-01-27)[2024-06-10]. https://www.secg.org/sec2-v2.pdf.
[16]	LIU Jintao, SHEN Limin. TRBFT Consensus Algorithm Based on Threshold Signature and Reputation Grouping[J]. Journal of Nanjing Normal University (Engineering and Technology Edition), 2023, 23(4): 10-18.
	刘金涛, 沈丽敏. 基于门限签名及信誉分组的TRBFT共识算法[J]. 南京师范大学学报(工程技术版), 2023, 23(4): 10-18.
[17]	SYTA E, TAMAS I, VISHER D, et al. Keeping Authorities “Honest or Bust” with Decentralized Witness Cosigning[C]// IEEE. 2016 IEEE Symposium on Security and Privacy. New York: IEEE, 2016: 526-545.
[18]	AJTAI M. The Complexity of the Pigeonhole Principle[J]. Combinatorica, 1994, 14(4): 417-433.

基于HotStuff和多叉树的改进共识算法

Improved Consensus Algorithm Based on HotStuff and Multi-Ary Trees

RichHTML

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

图/表 7

参考文献 18

相关文章 15

编辑推荐

Metrics

本文评价

[1]	佘维, 马天祥, 冯海格, 刘炜. 基于RBF机制的无痕区块链隐蔽通信方案[J]. 信息网络安全, 2025, 25(8): 1302-1312.
[2]	刘峰, 黄灏. 一种基于智能合约预言机技术的主动式去中心化监管传感网络架构[J]. 信息网络安全, 2025, 25(6): 898-909.
[3]	叶佳骏, 高翠凤, 薛吟兴. 基于静态分析的价格预言机操纵源代码检测方法研究[J]. 信息网络安全, 2025, 25(5): 732-746.
[4]	秦金磊, 康毅敏, 李整. 智能电网中轻量级细粒度的多维多子集隐私保护数据聚合[J]. 信息网络安全, 2025, 25(5): 747-757.
[5]	朱晓强, 张皓文, 林彦孜, 刘吉强. 基于可信数字身份的轻量级分布式认证方案[J]. 信息网络安全, 2025, 25(5): 817-827.
[6]	杨亚涛, 丁渝诚, 刘培鹤, 桑鹏. 基于区块链的隐私保护和数字认证研究[J]. 信息网络安全, 2025, 25(4): 640-653.
[7]	张雨轩, 黄诚, 柳蓉, 冷涛. 结合提示词微调的智能合约漏洞检测方法[J]. 信息网络安全, 2025, 25(4): 664-673.
[8]	王勇, 武一帆, 万前程. 基于中国剩余定理的可编辑区块链方案研究[J]. 信息网络安全, 2025, 25(1): 36-47.
[9]	余礼苏, 李彪, 姚元志, 温家进, 黎子鹏, 王振. 区块链辅助无人机移动边缘计算系统的性能优化[J]. 信息网络安全, 2024, 24(9): 1432-1443.
[10]	吕秋云, 周凌飞, 任一支, 周士飞, 盛春杰. 一种全生命周期可控的公共数据共享方案[J]. 信息网络安全, 2024, 24(8): 1291-1305.
[11]	张继威, 王文俊, 牛少彰, 郭向阔. 区块链扩展解决方案：ZK-Rollup综述[J]. 信息网络安全, 2024, 24(7): 1027-1037.
[12]	郭瑞, 杨鑫, 王俊茗. 基于区块链的可验证可撤销属性加密方案[J]. 信息网络安全, 2024, 24(6): 863-878.
[13]	凌治, 杨明, 余江银. 基于IPFS和区块链技术的电力安全交易平台研究[J]. 信息网络安全, 2024, 24(6): 968-976.
[14]	田钊, 牛亚杰, 佘维, 刘炜. 面向车联网的车辆节点信誉评估方法[J]. 信息网络安全, 2024, 24(5): 719-731.
[15]	石润华, 杨婧怡, 王鹏博, 刘华伟. V2G中基于区块链的在线/离线跨域身份认证方案[J]. 信息网络安全, 2024, 24(4): 587-601.