自动化学报2017,Vol.43Issue(9):1520-1531,12.DOI:10.16383/j.aas.2017.c160672
PoW共识算法中的博弈困境分析与优化
Game Dilemma Analysis and Optimization of PoW Consensus Algorithm
摘要
Abstract
Blockchain is a new decentralized distributed system with the prevalence of Bitcoin and other cryptocurrencies,whose characteristics include decentralization,time-series data,collective maintenance,programmability,security,and so on.Currently,blockchain has attracted intensive attention from governments,financial institutions,high-tech enterprises,and capital markets.Under the framework of this decentralized distributed system,one of the key research issues is how to reach a consensus effectively.In this paper,we analyze the Nash equilibria existence of the miner's strategy choice in the process of proof of work (PoW) consensus algorithm.Besides,we apply the zero determinant (ZD) strategy to optimize the strategy choosing of the miner,and verify the effectiveness of the optimization algorithm through numerical simulation.In brief,this work contributes understanding and analyzeing the PoW consensus algorithm,and provides a new idea and method for the design of consensus algorithm based on the game theory.关键词
区块链/工作量证明/共识算法/区块截留攻击/纳什均衡/零行列式策略Key words
Blockchain/proof of work (PoW)/consensus algorithm/block withholding attack/Nash equilibrium/zero determinant (ZD) strategy引用本文复制引用
唐长兵,杨珍,郑忠龙,陈中育,李翔..PoW共识算法中的博弈困境分析与优化[J].自动化学报,2017,43(9):1520-1531,12.基金项目
国家自然科学基金(61272007,61503342,61672467),国家自然科学基金重点项目(71731004),国家杰出青年基金(61425019),浙江省自然科学基金(LY16F030002)资助 Supported by National Natural Science Foundation of China (61272007,61503342,61672467),Key Projects of National Natural Science Foundation of China (71731004),National Science Foundation for Distinguished Young Scholar of China (61425019),and Natural Science Foundation of Zhejiang Province (LY16F030002) (61272007,61503342,61672467)