RF-PBFT is an Improved PBFT Consensus Algorithm Based on the Random Forest Algorithm

Yingchen Xu , Ye Tian , Ying Jing , Fujiang Yuan

Journal of Computer Science and Digital Technology ›› 2026, Vol. 2 ›› Issue (1) : 21 -36.

PDF (778KB)
Journal of Computer Science and Digital Technology ›› 2026, Vol. 2 ›› Issue (1) :21 -36. DOI: 10.71204/pyppdf95
research-article
RF-PBFT is an Improved PBFT Consensus Algorithm Based on the Random Forest Algorithm
Author information +
History +
PDF (778KB)

Abstract

The Practical Byzantine Fault-Tolerant (PBFT) consensus algorithm faces challenges such as random master node selection, high communication overhead, and a lack of incentive and penalty mechanisms, which undermine its efficiency and security in large-scale network environments. To address these issues, this paper proposes an improved PBFT consensus algorithm, RF-PBFT, which integrates a random forest-based node grouping mechanism with a dynamic reputation system. The algorithm leverages key behavioral data of nodes during the consensus process to train a random forest model, partitioning nodes into a consensus set and a candidate set. Nodes with superior predictive performance are selected to participate in the consensus process, thereby reducing redundant communication overhead. Furthermore, a differentiated reputation mechanism is established for the consensus group and the candidate group to encourage positive behavior and deter malicious actions. The master node is elected through a combination of prediction results and voting, enhancing system reliability and security. Simulation results demonstrate that, compared with traditional PBFT and other state-of-the-art variants, RF-PBFT significantly reduces communication overhead, decreases consensus latency, and improves throughput, validating its effectiveness in multi-node blockchain systems.

Keywords

Blockchain / PBFT / Random Forest Algorithm / Reputation Mechanism

Cite this article

Download citation ▾
Yingchen Xu, Ye Tian, Ying Jing, Fujiang Yuan. RF-PBFT is an Improved PBFT Consensus Algorithm Based on the Random Forest Algorithm. Journal of Computer Science and Digital Technology, 2026, 2 (1) : 21-36 DOI:10.71204/pyppdf95

登录浏览全文

4963

注册一个新账户 忘记密码

References

[1]

Bessani, A. N., Sousa, J., & Alchieri, E. A. P. (2014). State machine replication for the masses with BFT-SMART. In Proceedings of the 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) (pp. 355-362). IEEE.

[2]

Castro, M., & Liskov, B. (1999). Practical Byzantine fault tolerance. In Proceedings of the 3rd USENIX Symposium on Operating Systems Design and Implementation (OSDI) (pp. 173-186).

[3]

Gueta, G. G., Abraham, I., Grossman, S., Malkhi, D., Pinkas, B., Reiter, M. K., Seredinschi, D.-A., Tamir, O., & Tomescu, A. (2018). SBFT: A scalable and decentralized trust infrastructure. arXiv preprint arXiv:1804.01626.

[4]

Li, W., Feng, C., Zhang, L., Xu, H., Cao, B., & Imran, M. (2020). A scalable multi-layer PBFT consensus for blockchain. IEEE Transactions on Parallel and Distributed Systems, 32(5), 1146-1160. https://doi.org/10.1109/TPDS.2020.3038142

[5]

Li, Z., Wang, J., & Li, Y. (2025). An improved PBFT consensus algorithm based on reputation and gaming. The Journal of Supercomputing, 81(1), 323.

[6]

Madigan, D. J., Litvin, S. Y., Popp, B. N., Carlisle, A. B., Farwell, C. J., & Block, B. A. (2012). Tissue turnover rates and isotopic trophic discrimination factors in the endothermic teleost, Pacific bluefin tuna (Thunnus orientalis). PLOS ONE, 7(11), e49220. https://doi.org/10.1371/journal.pone.0049220

[7]

Na, Y., Wen, Z., Fang, J., Zhang, X., & Wang, J. (2022). A derivative PBFT blockchain consensus algorithm with dual primary nodes based on separation of powers (DPNPBFT). IEEE Access, 10, 76114-76124.

[8]

Sukhwani, H., Martínez, J. M., Chang, X., Trivedi, K. S., & Rindos, A. (2017). Performance modeling of PBFT consensus process for permissioned blockchain network (Hyperledger Fabric). In Proceedings of the 36th IEEE Symposium on Reliable Distributed Systems (SRDS) (pp. 253-255). IEEE.

[9]

Vedant, A., Yadav, A., Sharma, S., Thite, O., & Sheikh, A. (2022). A practical Byzantine fault tolerance blockchain for securing vehicle-to-grid energy trading. In Proceedings of the Global Energy Conference (GEC) (pp. 1-6). IEEE.

[10]

Veronese, G. S., Correia, M., Bessani, A. N., & Lung, L. C. (2009). Spin one’s wheels? Byzantine fault tolerance with a spinning primary. In Proceedings of the 28th IEEE International Symposium on Reliable Distributed Systems (SRDS) (pp. 135-144). IEEE.

[11]

Wu, X., Wang, Z., Li, X., Ding, J., Tian, J., & Liu, Y. (2025). DBPBFT: A hierarchical PBFT consensus algorithm with dual blockchain for IoT. Future Generation Computer Systems, 162, 107429.

[12]

Yin, M., Malkhi, D., Reiter, M. K., Gueta, G. G., & Abraham, I. (2019). HotStuff: BFT consensus in the lens of blockchain. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC) (pp. 347-356).

[13]

Zhong, W., Feng, W., Huang, M., Du, D., & Li, Z. (2023). ST-PBFT: An optimized PBFT consensus algorithm for intellectual property transaction scenarios. Electronics, 12(2), 325.

PDF (778KB)

0

Accesses

0

Citation

Detail

Sections
Recommended

/

〈 〉