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. Experi

SUBMITTER: Liu S 

PROVIDER: S-EPMC10415261 | biostudies-literature | 2023 Aug

REPOSITORIES: biostudies-literature