Improved PBFT Consensus Algorithm Based on Node Role Division

The PBFT (Practical Byzantine Fault Tolerance, PBFT) consensus algorithm, which addressed the issue of malicious nodes sending error messages to disrupt system operation in distributed systems, was challenging support massive network nodes, common participation over all mechanism would lead increased communication complexity, and arbitrary selection master also inefficient consensus. This paper offered a method (Role Division-based Practical RD-PBFT) address above problems based on node role division. First, voted with each other divide high reputation group low group, determined starting value nodes. Then, mobile divided into roles according value, total three were node, backup supervisory reduce number involved process reduced complexity communication. In addition, an adaptive used select process, integer introduced ensure unpredictability equality selection. Experimentally, it verified that algorithm has lower better decentralization characteristics compared improved efficiency