基于节点识别的改进拜占庭容错共识算法OA北大核心CSTPCD

The practical Byzantine fault tolerance(PBFT)algorithm applied to the alliance chain has some problems,such as arbitrary selection of master nodes and high communication overhead.To solve these problems,an improved Byzantine fault-tolerant consensus algorithm(NR-PBFT)based on node recognition is proposed.Firstly,the consistency process is optimized by introducing BLS aggregate signature.Secondly,CatBoost algorithm is used to identify nodes,select high-reputation nodes as the primary nodes,and dynamically process low-reputation nodes.Experimental results show that NR-PBFT is superior to PBFT and ABFT in security,throughput and delay.