Cs-pbft: a comprehensive scoring-based Practical Byzantine Fault Tolerance consensus algorithmCS-PBFT: a comprehensive scoring-based Practical Byzantine Fault...B. Liang et al.

被引：0

作者：

Bo Liang ^{[1
]}

Fujiang Yuan ^{[2
]}

Jiaru Deng ^{[1
]}

Qi Wu ^{[2
]}

Jie Gao ^{[1
]}

机构：

[1] Taiyuan Normal University,School of Computer Science and Technology

[2] Shanxi Key Laboratory of Intelligent Optimization Computing and Blockchain Technology,School of Intelligent Manufacturing

[3] Shanxi Vocational University of Engineering Science and Technology,undefined

来源：

The Journal of Supercomputing | / 81卷 / 7期

关键词：

Blockchain; PBFT; Consensus algorithm; CS-PBFT;

D O I：

10.1007/s11227-025-07342-3

中图分类号：

学科分类号：

摘要：

Practical Byzantine Fault Tolerance (PBFT) is one of the most important consensus algorithms in distributed systems, which can effectively respond to the threat of malicious nodes. However, PBFT still has shortcomings in terms of arbitrary selection of primary nodes, high communication overhead, and lack of reward and punishment mechanisms. To address this problem, in this paper, we propose a comprehensive scoring-based Practical Byzantine Fault Tolerance consensus algorithm, called CS-PBFT. The algorithm introduces a comprehensive scoring mechanism to evaluate the node’s reliability and overall capability, which is composed of two key metrics: node honor and recommendation scores. Based on this mechanism, the algorithm selects the primary node, slave node, and alternate node to ensure an efficient and secure consensus process. Additionally, the algorithm optimizes the communication process in the Commit and Reply phases of the PBFT consensus protocol, reducing communication latency and improving consensus efficiency. Experimental results show that the improved PBFT algorithm not only improves consensus efficiency but also reduces communication overhead, strengthens fault tolerance against malicious nodes, and demonstrates better scalability.

引用