基于节点动态评分机制的分组共识算法

针对实用拜占庭容错（practical Byzantine fault tolerance，PBFT）共识算法三阶段流程通信开销大，主节点随机选取且缺乏奖惩机制等问题，提出基于节点动态评分机制的分组共识算法（dynamic scoring practical Byzantine fault tolerance，DS-PBFT）。首先，优化一致性协议，简化三阶段通信流程从而提高共识效率；其次，提出节点评分分组机制，通过节点在共识过程中的历史行为进行评分，并分为共识组和候选组，降低恶意节点参与共识过程的可能性；最后，提出动态过程选择参与共识的节点，优化视图切换协议和垃圾回收机制，减少参与共识的节点数量，从根本上提高共识效率。用Docker容器模拟多个节点的仿真实验表明，在网络稳定、可信节点较多的联盟链中，提出的DS-PBFT共识算法在共识时延、吞吐量、容错性和通信复杂度等方面比PBFT共识算法及其他改进算法相比具有更好的性能，能够快速达成共识，提高共识效率。

Group consensus algorithm based on node dynamic scoring mechanism

In response to the issues of high communication overhead random primary node selection and the absence of incentive mechanisms in the three-stage procoss of PBFT consensus algorithm, as well as problems with, this paper introduced a new grouped consensus algorithm named DS-PBFT. Firstly, this paper optimized the consensus protocol simplified of the three-phase communication process, thereby enhancing consensus efficiency. Secondly, this paper proposed a node scoring and grouping mechanism, where nodes received scores based on their historical behavior during the consensus process and fell into consensus and candidate groups, reducing the likelihood of malicious node participation. Lastly, this paper introduced a dynamic process for selecting nodes to participate in consensus, optimized view-change protocols and garbage collection mechanisms to fundamentally reduce the number of participating nodes, resulting in enhanced consensus efficiency. Using Docker containers to simulate multiple nodes, the experimental results show that in a consortium blockchain with network stability and a significant number of trusted nodes, the proposed DS-PBFT consensus algorithm outperforms the PBFT consensus algorithm and other improved algorithms in terms of consensus latency, throughput, fault tolerance, and communication complexity. It can quickly achieve consensus and improve consensus efficiency.