PBFT improved algorithm with linear message complexity

Abstract

The invention discloses a PBFT improved algorithm with linear message complexity. The method comprises the following steps: S1, establishing an improved PBFT network; S2, carrying out an improved pre-prepare stage; S3, carrying out an improved prepare stage; S4, carrying out an improved commit stage; S5, feeding back all commit messages to the Client, and after the Client receives 2f + 1 consistent reply response messages, determining that the round of consensus is reached. The invention provides a new consensus algorithm based on a series of problems existing in a consensus algorithm used in an alliance chain at present. According to the new algorithm, an efficient RAFT network is introduced to optimize a three-stage process of PBFT consensus, finally, conversion of communication complexity of consensus messages from o(n2) to linearity is achieved, and meanwhile, the problem of a single-point bandwidth bottleneck of a consensus node is solved.

Description

technical field [0001] The invention relates to the technical field of consensus algorithms, and more specifically relates to an improved PBFT algorithm with linear message complexity. Background technique [0002] With the development and wide application of blockchain, the consensus algorithm, one of the core technologies, has received extensive attention from academia and the industry. [0003] At present, there are various consensus algorithms in the industry. There are two types of mainstream consensus algorithms in the alliance chain: BFT algorithms and non-BFT algorithms. Non-BFT algorithms, that is, non-Byzantine fault-tolerant algorithms, are deterministic Consensus algorithm, that is, after the consensus is reached, each node gets a deterministic and the same result, and the only error it can tolerate is node failure, and malicious attacks cannot be tolerated. Typical such algorithms include Paxos, RAFT consensus algorithm, etc. BFT algorithms, that is, Byzantine...

AI Technical Summary

Problems solved by technology

[0004] However, in the existing technology, although the non-BFT algorithm is simple, efficient, and has linear message complexity, it cannot tolerate the scene of Byzantine nodes; the PBFT algorithm and many BFT consensus algorithms based on the improvement of the PBFT algorithm, although Can tolerate Byzantine node faults, but has an average o(n 2 ) message complexity, and as the number of nodes increases, the message complexity will increase rapidly, and the overall throughput of the consensus protocol will decrease rapidly; and in the classic three-stage process of the PBFT algorithm, each consensus node needs to broadcast consensus messages, It is easy to cause a single-point bandwidth bottleneck of consensus nodes

Images