HD-PBFT Consensus Algorithm Based on Hierarchical Evaluation of Nodes

Aiming at the problems of high communication overhead and high consensus delay and low throughput of the practical Byzantine fault tolerant consensus algorithm PBFT, an HD - PBFT algorithm (Hierarchical Dynamics-Practical Byzantine Fault Tolerance) is proposed, which introduces a dynamic grouping mechanism to improve the PBFT algorithm according to the node evaluation results. Experimental results show that HD-PBFT algorithm effectively reduces the communication complexity, has lower communication overhead, average consensus delay and higher consensus throughput. At the same time, HD-PBFT algorithm performs best in scalability and efficiency balance, especially suitable for large-scale distributed networks.