Improved PBFT consensus algorithm based on node evaluation and dynamic management

To address the limitations of the Practical Byzantine Fault Tolerant (PBFT) consensus algorithm, this paper proposes several improvement measures. Firstly, design a mechanism for evaluating nodes to calculate the reputation score of nodes, and then classify them according to their reputation scores. Nodes with lower reputation scores can receive consensus outcomes and are not involved in the consensus process. Secondly, a dynamic node joining and exiting mechanism was designed to improve the consensus efficiency of network nodes that cannot join or exit dynamically. Finally, the original PBFT algorithm's three-stage consensus process is improved to decrease the communication times. Experimental results indicate that the refined consensus algorithm has better performance than the original PBFT algorithm in security, the number of communication times, and consensus delay.