机制(生物学)
计算机科学
图层(电子)
树(集合论)
计算机网络
分布式计算
计算机安全
材料科学
纳米技术
数学
认识论
数学分析
哲学
作者
Peiyun Zhang,Fei Xu,Tianlin Huang,Haibin Zhu,Qinglin Zhao
标识
DOI:10.1109/tii.2025.3534426
摘要
Practical Byzantine Fault Tolerance-based consensus mechanisms in consortium blockchains face challenges in scalability and communication efficiency. While recent approaches like HotStuff and Kauri have attempted to address these issues through star and tree communication structures, they still encounter limitations in security, communication costs, and node workload distribution. This article presents CTT, a novel consensus mechanism with a three-layer tree communication structure for consortium blockchains. CTT incorporates three key innovations: 1) A fixed three-layer architecture that reduces communication complexity between any two nodes to O(1), compared to O(logn) in existing tree-based approaches; 2) specialized role distribution among nodes at different layers to optimize workload and enhance system security; 3) an improved Borda counting method for efficient consensus node selection based on multiple attributes including verification rate, propagation rate, and storage space. The mechanism features dual middle-node communication paths with bottom nodes, providing enhanced fault tolerance and security compared to existing approaches. Experimental results demonstrate CTT's effectiveness in improving scalability and security while reducing communication overhead in consortium blockchain systems. The findings have the potential to significantly advance the performance and applicability of consortium blockchains in critical areas such as finance, supply chain, and healthcare.
科研通智能强力驱动
Strongly Powered by AbleSci AI