Improved PBFT consensus method based on reputation and voting mechanism

Abstract

The invention belongs to the technical field of block chains, and provides an improved PBFT consensus method based on a reputation and voting mechanism, which comprises the following steps: carrying out state division on nodes, carrying out node state conversion according to the performance of the nodes in a consensus process, carrying out authority distribution according to the states of the nodes, wherein the nodes with the participation authority can participate in main node election, electing the main node according to voting calculation, by the main node, receiving a request sent by the client, broadcasting the request to a backup node, and starting a consensus process, wherein in the consensus process, if the main node breaks down or is disadvantaged, view switching is carried out according to the abnormal condition of the main node. Compared with the traditional PBFT, the average throughput is increased, the time delay is reduced, and the operation efficiency and safety of the system are improved.

Description

technical field [0001] The invention belongs to the technical field of block chain, and proposes an improved practical Byzantine fault tolerance (Practical Byzantine Fault Tolerance, PBFT) consensus method based on reputation and voting mechanism. Background technique [0002] At present, blockchain technology has provided decentralized solutions for all walks of life, forming a new application model composed of computer technologies such as distributed data storage, cryptography, network protocols, and consensus mechanisms. The consensus mechanism is the core of blockchain technology. Through the node consensus process, the consistency of the blocks generated by the latest transaction set in the nodes is guaranteed, thus ensuring the normal operation of the distributed network. [0003] At present, the consensus algorithms in the blockchain mainly include: Proof of Work (PoW), Proof of Stack (PoS), Delegated Proof of Stack (DPoS) and PBFT. In the PoW algorithm, each node s...

AI Technical Summary

Problems solved by technology

In the PBFT algorithm, the selection of the master node adopts a sequential system, which cannot guarantee the reliability of the master node, and it is easy to cause abnormal nodes to act as the master node

Although the view switching protocol ensures the security and activity of the system, frequent view switching greatly reduces the operating efficiency of the system

[0011] (2) The communication overhead of the consensus process is large

The consensus process includes three broadcasts, the pre-preparation stage, a single-node broadcast, the preparation stage and the confirmation stage, and two full-node broadcasts, which consume a lot of network bandwidth and waste communication resources

[0012] (3) View switching efficiency is low

When the backup node thinks that the master node is abnormal, it will broadcast the view-change message to other nodes, and there are various situations where the master node is abnormal. Broadcasting every time an exception will waste communication resources

Images