An improved PBFT consensus algorithm based on reputation and gaming

Blockchain technology provides a reliable and efficient environment for digital asset transactions. Consensus algorithms are the cornerstone of its security and accuracy. However, there are still security problems and performance bottlenecks associated with blockchain consensus algorithms in the context of current digital asset transactions, an improved PBFT algorithm (GamePBFT) based on reputation and game was proposed on the basis of Practical Byzantine Fault Tolerance (PBFT).Better applied to digital asset trading, we establish a reputation model that enables the dynamic reward and punishment of nodes according to their consensus behavior in this paper. Furthermore, a game model is constructed, which allows for the minimum number of nodes to participate in the consensus and the highest efficiency of eliminating malicious nodes. This can resist some common attacks, reduce the complexity of the algorithm, and improve the security and consensus efficiency of the algorithm. Finally, the results of the simulated node digital transaction scenario demonstrate that the improved consensus algorithm exhibits a notable enhancement over the PBFT consensus algorithm in terms of consensus latency, communication overhead, throughput, and security.