Improvement of practical Byzantine fault tolerance algorithm based on node reputation value matching

Abstract

Aiming at the problems of low consensus efficiency and low scalability in traditional Byzantine consensus algorithm, propose a Practical Byzantine Algorithm Based on Node Reputation Value Matching TMBFT (Trust-based on Node Reputation Value Matching). Select some consensus nodes for consensus voting according to the neighbor matching model. At the same time, a reputation value evaluation mechanism is introduced to supervise the consensus behavior of neighbor nodes. To sum up, compared with the traditional practical Byzantine fault-tolerant algorithm, the consensus algorithm based on node reputation value matching improves the consensus efficiency of the system, reduces the node overhead in the network, and enhances the stability and security of the system.

A Study of Community-Based Ecological Governance Model of DAO Organizations

“…Consensus mechanism is actually a management mechanism based on cryptographic trust, which is a higher level of trust mechanism. From practical Byzantine fault-tolerant algorithm [7] , PoW proof-of-work consensus mechanism [8] , PoS proof-of-stake consensus mechanism [9] to DPoS delegated proof-of-stake consensus mechanism [10] , the consensus mechanism has been continuously improved to solve the problem of distributed database consistency, and continuously explored to avoid wasting resources such as arithmetic power and electricity while reducing latency, and to establish a lower cost and higher-level trust mechanism.…”

An Improved Byzantine Fault-Tolerant Algorithm Based on Reputation Model

“…The consensus mechanism is one of the blockchain's core technologies, and the consensus algorithm's performance directly affects the efficiency of the blockchain system [4]. In the consensus of consortium chain, there are many classical consensus algorithms, such as Practical Byzantine Fault Tolerance Algorithm (PBFT), Reliable and Fault Tolerant Algorithm (RAFT), Proof of Activity (PoA), Proof of Stake (PoS), Delegated Proof of Stake (DPoS), Tendermint [5][6][7][8], etc. In the RAFT algorithm, it is up to the leader node to pack the transaction information into blocks and synchronize the logs of the whole system.…”