An improved PBFT consensus algorithm based on grouping and credit grading

Abstract

To improve the blockchain consensus algorithm practical Byzantine fault tolerance (PBFT) with random master node selection, which has high communication overhead and a small supported network size, this paper proposes a Byzantine fault tolerant consensus algorithm based on credit (CBFT) enhanced with a grouping and credit model. The CBFT algorithm divides the network nodes according to the speed of their response to the management nodes, resulting in different consensus sets, and achieves consensus within and outside the group separately to reduce communication overhead and increase system security. Second, the nodes are divided into different types according to the credit model, each with different responsibilities to reduce the probability that the master node is a malicious node. Experimental results show that the throughput of the CBFT algorithm is 3.1 times that of PBFT and 1.5 times that of GPBFT when the number of nodes is 52. Our scheme has latency that is 7.4% that of PBFT and 38.8% that of GPBFT; CBFT has communication overhead that is 6.4% that of PBFT and 87.3% that of GPBFT. The number of nodes is 300, and the Byzantine fault tolerance is improved by 59.3%. These improvements are clearer with the increase in the number of nodes.

Facile and Rapid Synthesis of Gold Nanoparticles on Unconventional Imine‐ Decorated Silica

“…The wet monoliths dipped in the Au 3+ containing acetonitrile solution (for different durations) was dried under ambient conditions for 24 h and the corresponding dried monoliths were analyzed by UV‐DRS to confirm the reduction of Au 3+ ions to Au 0 . Figure 1a shows the UV‐DRS of pristine silica monolith (SM), ADSM and IDSM dipped in the Au 3+ acetonitrile solution for 24 h. The reduction of Au 3+ ions to Au 0 was confirmed by the presence of a peak at 527 and 530 nm [59–61] for the ADSM and IDSM respectively. A slight shift in the λ max was observed in the case of IDSM may be due to the difference in the particle size [62–64] .…”

A Blockchain-Based Framework for Rural Property Rights Transactions

“…The algorithm also improves the consistency protocol for PBFT when there are no Byzantine nodes and introduces an upgrade mechanism to dynamically update the set of nodes participating in the consensus to ensure that the optimized consistency protocol is executed most of the time. Xianan Liu et al [35] presented an optimized Credit Byzantine Fault Tolerance (CBFT) algorithm based on grouping and credit grading to optimize the node structure in large-scale consortium blockchains. Meng Wutong et al [36] proposed a non-interactive and verifiable random endorsement node optimization scheme.…”