基于信誉机制的多主节点PBFT共识算法OA

In view of the problems of high communication overhead,high consensus delay and possi-ble failure risk of the master node as a single point in the practical Byzantine fault tolerance(PBFT)con-sensus algorithm,a multi-master node practical Byzantine fault tolerance(M-PBFT)consensus algo-rithm based on a reputation mechanism is proposed.Firstly,a reputation mechanism is established to dynamically compute each node's reputation value based on its behavior during the consensus process,and nodes are classified into different reputation tiers accordingly.Secondly,a verifiable random func-tion is employed to select multiple master nodes that are reliable and whose identities are difficult to pre-dict maliciously from the excellent reputation tier.Finally,the consistency protocol of the PBFT algo-rithm is improved to reduce the algorithm communication complexity,so that all nodes use the improved algorithm for consensus.Experimental results and analysis show that,compared with the PBFT consen-sus algorithm and its improved algorithms,the M-PBFT consensus algorithm not only significantly re-duces the communication overhead and consensus delay,but also achieves higher throughput.