Analysis And Design Of Blockchain Consensus Algorithm Based On Game Theor

With the rapid development of the Internet of Things and blockchain technology,online decision-making has become a current trend,and the security of decision-making has attracted extensive attention of scholars.As one of the representative consensus algorithms,blockchain consensus algorithm has important significance and contribution to secure and reliable consensus.However,the disadvantages of traditional blockchain consensus algorithms are also obvious: high resource consumption,low throughput,low security,low efficiency and over-concentration of interests.As game theory is widely used in various fields,the combination of game theory and consensus algorithm provides a new way to solve the problems existing in consensus process.This paper uses blockchain and game theory as basic theoretical tools to conduct research on blockchain consensus algorithm,and the specific work is as follows:(1)Global randomization consensus algorithm against collusion attack based on game theory.Aiming at the problem of node randomness and node collusion attack in fault-tolerant consensus algorithm,the security and throughput of blockchain network are improved by realizing node randomization and solving related security problems.Firstly,the global randomization of consensus nodes is realized by combining mapping function and random function.Secondly,the security problem of fault-tolerant consensus algorithm is analyzed by game theory,and the collusion behavior between nodes is analyzed.And construct collusion contract to solve the collusion problem;Finally,security analysis and experiments show that the algorithm has significant advantages and high security in many aspects.(2)PT-PoS: A multi-block parallel consensus algorithm with decentralized interests.Aiming at the problems of centralization of rights and interests,unfair mining and high interaction in consensus algorithm.Based on Po S and PBFT,a multi-block parallel consensus algorithm is proposed to solve the problems of centralization of interests,unfair mining,unreliable nodes and high interaction times in PBFT.Firstly,the virtual chain with the property of bidirectional linked list is constructed,and the transactions are packaged into blocks and stored in the virtual chain until it is fully filled.The virtual chain is divided into master chain and slave chain.Secondly,in a round of bidding,the miner nodes bid on the slave chain as a unit to obtain the accounting right of the block contained in the slave chain,and satisfy that the accounting right between adjacent slave chains does not belong to the same miner node.Finally,legitimate bidders are selected as candidates,and the desired consensus miner nodes are selected from the candidates to perform multiple synchronized consensus on the blocks contained in the chain.Security analysis and experiments show that PT-Po S not only has high security,but also achieves the decentralization of interests while reducing the number of information interaction by75% compared with fault-tolerant consensus algorithm.