CS-Raft:适用于联盟链的拜占庭容错共识算法OA北大核心CSTPCD

This paper proposed a credit-score-based Byzantine fault-tolerant consensus algorithm,called CS-Raft,to address the inadequate performance of the current consensus algorithms in consortium chains.Initially,it assigned credit score attributes to all nodes and updated the credit score of each node according to their consensus behavior,activity level,time of joining the cluster and other metrics.The higher the credit score,the higher the node's trustworthiness.Secondly,it selected monitoring nodes based on their credit scores,which had the authority to inspect and participate in leader elections.The setting of monito-ring nodes could effectively resist attacks from Byzantine malicious nodes.Finally,it made improvements to address the issue of vote splitting in leader elections,thereby enhancing the speed of leader election.Experimental analysis shows that compared to the PBFT algorithm,the CS-Raft algorithm effectively reduces consensus latency,increases system throughput,and accelerates leader election speed while achieving Byzantine fault tolerance.