【摘要】：區(qū)塊鏈是隨著比特幣等數字加密貨幣逐漸興起而盛行的一種新型去中心化分布式系統(tǒng),具有去中心化、時序數據、集體維護、可編程和安全可信等特點.目前,區(qū)塊鏈已引起政府部門、金融機構、科技企業(yè)和資本市場的高度重視與廣泛關注.如何在一個去中心化的分布式系統(tǒng)中高效地達成共識是區(qū)塊鏈技術研究的重要問題.本文從工作量證明(Proof of work,PoW)共識算法的挖礦困境入手,分析PoW共識過程中礦工策略選擇的納什均衡存在條件.利用零行列式(Zero determinant,ZD)策略對礦工策略選擇進行優(yōu)化,并通過數值仿真來驗證優(yōu)化算法的有效性.概括來說,本文從博弈論角度來理解和剖析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.
【作者單位】： 浙江師范大學數理與信息工程學院;復旦大學電子工程系自適應網絡與控制實驗室;復旦大學智慧網絡與系統(tǒng)研究中心;
【基金】：國家自然科學基金(61272007,61503342,61672467);國家自然科學基金重點項目(71731004) 國家杰出青年基金(61425019) 浙江省自然科學基金(LY16F030002)資助~~
【分類號】：TP311.13
，

本文編號：2151897