An improved PBFT consensus algorithm based on grouping and credit grading

Abstract

To address the problems of high communication complexity, the random selection of master nodes, and limited supported network size of the Practical Byzantine Fault Tolerance (PBFT) consensus algorithm for consortium chains, an improved Byzantine Fault Tolerance (CBFT) algorithm based on grouping and credit hierarchy is proposed to optimize the nodes of large-scale consortium chains structure. First, the network nodes are divided into different consensus sets according to their response speed to the management nodes, and the consensus is carried out inside and outside the group respectively; based on this, a credit grading mechanism is proposed and a credit calculation formula is introduced to select the management nodes; finally, a simulation and performance testing system based on this improved scheme is built. The experimental results show that CBFT has less communication overhead, shorter latency, and higher throughput than PBFT, and it is more obvious with the increase in the number of nodes, which meets the needs of large consortium chains.

A Study on Practical Byzantine Algorithms Based on Short Group Signatures

“…The experimental results showed thatthe im proved PBFT algorithm significantly reduces the number of communications compared to the traditional PBFT algorith m. This effectively mitigates the problem of increased nodes and excessive traffic in the traditional PBFT algorithm, red ucing the probability of malicious behavior by the leader no de and improving consensus efficiency. Yanhe Na et al [14] proposed the dual master node-derived Practical Byzantine Fault Tolerance Algorithm (DPNPBFT) based on the concep t of power separation. This algorithm avoids the over-central ization of a single master node system by implementing che cks and balances and mutual supervision between two maste r nodes.…”

“…This greatly reduces communica tion overhead during the consensus process of large-scale no de systems. Shannan Liuet al The literature [14] proposed a n Improved Byzantine Fault Tolerance (CBFT) algorithm ba sed on grouping and credit hierarchies to optimize nodes in a large-scale federated chain structure. The algorithm divide s network nodes into different consensus sets based on their response speed to management nodes, creating in-group and out-group divisions.…”