JERAJournal of Electronic Research and Application2208-35022208-3510Bio-Byword Scientific Publishing Pty. Ltd.10.26689/jera.v9i6.12584ArticleAn Improved PBFT Algorithm Based on Dual Scoring Mechanismhttps://artdesignp.com/journal/JERA/9/6/10.26689/jera.v9i6.12584ZhaoPeng,XuWeixuan2025962025-12-16The traditional Practical Byzantine Fault Tolerance (PBFT) approach suffers from three critical deficiencies: arbitrary primary node election, excessive network transmission overhead, coupled with the absence of node incentive mechanisms. To address these issues, this study proposes a refined PBFT strategy utilizing dual scoring (Double Scoring Practical Byzantine Fault Tolerance, DS-PBFT). The algorithm innovatively combines hardware performance evaluation with a dual-dimensional node scoring system. The algorithm first employs bucket sorting technology to quantitatively evaluate node hardware resources, followed by constructing a comprehensive scoring model through credit values and recommendation values. According to the scoring outcomes, the framework hierarchically divides nodes into primary node, follower node and backup nodes groups in a 1:4:5 ratio, substantially decreasing the quantity of nodes involved in consensus. Additionally, this approach streamlines the Commit-Reply stages within the consistency protocol, substantially reducing communication overhead. Experimental validation demonstrates that DS-PBFT maintains security while achieving notable improvements in consensus efficiency, significant reductions in communication costs, and enhanced defense capabilities against malicious nodes.

Yuan F, Zuo Z, Jiang Y, et al., 2025, AI-Driven Optimization of Blockchain Scalability, Security and Privacy Protection. Algorithms, 18(5): 263.

Wang J, Wang T, Yuan W, et al., 2023, A Review of the Development History of Distributed Ledger Technology. Application Research of Computers, 40(3): 641-648.

Liang B, Yuan F, Deng J, et al., 2025, Cs-pbft: A Comprehensive Scoring-Based Practical Byzantine Fault Tolerance Consensus Algorithm. The Journal of Supercomputing, 81(7): 859.

Deng X, Wang Z, Li J, et al., 2022, Comparative Research on Mainstream Blockchain Consensus Algorithms. Application Research of Computers, 39(1): 1–8.

Wang W, Hoang D, Hu P, et al., 2019, A Survey on Consensus Mechanisms and Mining Management in Blockchain Networks. IEEE Access, 2019(7): 22328–22370.

Veronese G, Correia M, Bessani A, et al., 2013, Efficient Byzantine Fault-Tolerance. IEEE Transactions on Computers, 62(1): 16–30.

Zou J, Zhang H, Tang Y, et al., 2018, Blockchain Technology Guide, China Machine Press, Beijing, 158–161.

Castro M, Liskov B, 1999, Practical Byzantine Fault Tolerance. Proceedings of the 3rd Symposium on Operating Systems Design and Implementation, 173–186.

Wang J, Fan Y, Zhang H, 2020, Topic Discovery and Evolution of Blockchain Literature. Computer Engineering and Applications, 56(20): 1–8.

Ongaro D, Ousterhout J, 2014, In Search of an Understandable Consensus Algorithm. Proceedings of the USENIX Annual Technical Conference, 305–319.

Pease M, Shostak R, Lamport L, 1980, Reaching Agreement in the Presence of Faults. Journal of the ACM, 27(2): 228–234.

Lamport L, Shostak R, Pease M, 1982, The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3): 382–401.

Schneider F, 1990, Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial. ACM Computing Surveys, 22(4): 299–319.