PoW共识算法中的博弈困境分析与优化
发布时间：2018-07-29 07:04
【摘要】：区块链是随着比特币等数字加密货币逐渐兴起而盛行的一种新型去中心化分布式系统,具有去中心化、时序数据、集体维护、可编程和安全可信等特点.目前,区块链已引起政府部门、金融机构、科技企业和资本市场的高度重视与广泛关注.如何在一个去中心化的分布式系统中高效地达成共识是区块链技术研究的重要问题.本文从工作量证明(Proof of work,PoW)共识算法的挖矿困境入手,分析PoW共识过程中矿工策略选择的纳什均衡存在条件.利用零行列式(Zero determinant,ZD)策略对矿工策略选择进行优化,并通过数值仿真来验证优化算法的有效性.概括来说,本文从博弈论角度来理解和剖析PoW共识算法,为进一步设计基于博弈论的共识算法提供新的思路和方法.
[Abstract]:Block chain is a new type of decentralized distributed system which is popular with the rise of digital cryptographic currency such as bitcoin. It has the characteristics of decentralization, sequential data, collective maintenance, programmable and secure. At present, block chain has attracted great attention from government departments, financial institutions, technology enterprises and capital markets. How to reach consensus efficiently in a decentralized distributed system is an important issue in the research of block chain technology. Based on the workload proof of mining dilemma of (Proof of workstation PoW consensus algorithm, this paper analyzes the existing conditions of Nash equilibrium of miner strategy selection in the process of PoW consensus. The Zero determinant (ZD) strategy is used to optimize the miner strategy selection, and the effectiveness of the optimization algorithm is verified by numerical simulation. In summary, this paper analyzes the PoW consensus algorithm from the perspective of game theory, and provides a new idea and method for the further design of the consensus algorithm based on game theory.
【作者单位】： 浙江师范大学数理与信息工程学院;复旦大学电子工程系自适应网络与控制实验室;复旦大学智慧网络与系统研究中心;
【基金】：国家自然科学基金(61272007,61503342,61672467);国家自然科学基金重点项目(71731004) 国家杰出青年基金(61425019) 浙江省自然科学基金(LY16F030002)资助~~
【分类号】：TP311.13
，
本文编号：2151897
[Abstract]:Block chain is a new type of decentralized distributed system which is popular with the rise of digital cryptographic currency such as bitcoin. It has the characteristics of decentralization, sequential data, collective maintenance, programmable and secure. At present, block chain has attracted great attention from government departments, financial institutions, technology enterprises and capital markets. How to reach consensus efficiently in a decentralized distributed system is an important issue in the research of block chain technology. Based on the workload proof of mining dilemma of (Proof of workstation PoW consensus algorithm, this paper analyzes the existing conditions of Nash equilibrium of miner strategy selection in the process of PoW consensus. The Zero determinant (ZD) strategy is used to optimize the miner strategy selection, and the effectiveness of the optimization algorithm is verified by numerical simulation. In summary, this paper analyzes the PoW consensus algorithm from the perspective of game theory, and provides a new idea and method for the further design of the consensus algorithm based on game theory.
【作者单位】： 浙江师范大学数理与信息工程学院;复旦大学电子工程系自适应网络与控制实验室;复旦大学智慧网络与系统研究中心;
【基金】：国家自然科学基金(61272007,61503342,61672467);国家自然科学基金重点项目(71731004) 国家杰出青年基金(61425019) 浙江省自然科学基金(LY16F030002)资助~~
【分类号】：TP311.13
，
本文编号：2151897
本文链接：https://www.wllwen.com/kejilunwen/ruanjiangongchenglunwen/2151897.html
