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

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.