Abstract: Aiming at the problems of high communication complexity, poor scalability and unbalanced primary node load in the traditional practical Byzantine fault tolerance consensus algorithm in large-scale distributed networks. This paper proposes an improved practical Byzantine fault tolerance consensus algorithm based on balanced iterative reducing and clustering using hierarchies and hash ring data structure. The algorithm achieves dynamic clustering sub-organization division of network nodes through distributed optimization of the balanced iterative reducing and clustering using hierarchies algorithm. Meanwhile, combined with the virtual node hash ring mechanism, the problems of load balancing and uneven task assignment within sub-organizations are resolved, and a global committee mechanism is also introduced to significantly reduce the communication complexity of the entire network. Experimental results demonstrate that when the network node scale reaches 256, the system delay of the proposed algorithm is only 713.4 ms, which is 62.4% lower than the 1 895.4 ms of the traditional practical Byzantine fault tolerance algorithm, and its delay growth curve slope is significantly smaller than those of two other mainstream improved consensus algorithms. The proposed algorithm also exhibits significant advantages in terms of throughput, communication overhead, and resource consumption, demonstrating good scalability and stability in large-scale distributed networks. This research significantly improves the consensus efficiency in distributed networks, effectively meets the requirements of complex business scenarios in the Internet industry for high-performance consensus algorithms, and provides important theoretical basis and technical support for the architecture optimization of large-scale blockchain systems.

Key words:  , internet business, blockchain, PBFT algorithm, BIRCH algorithm, Hash ring mechanism