An Analysis of Blockchain Consistency in Asynchronous Networks: Deriving a Neat Bound
An Analysis of Blockchain Consistency in Asynchronous Networks: Deriving a Neat Bound
复制标题
异步网络中区块链一致性的分析：推导一个整齐的界限
DOI：
--
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
Jing Tang
中科院分区：
文献类型：
--
作者：
Jun Zhao;Jing Tang
区块链协议的形式化分析最近受到了广泛的关注。中本聪的区块链协议的一致性结果通常用数量c表示，这表示在某个区块被挖掘之前的预期网络延迟数。用μ (p)表示。， ν)表示由良性矿工控制的计算能力的比例。，其中μ+ν =1，我们首次证明，为了确保中本聪的区块链协议在异步网络中的一致性，c仅略大于$\frac{{2\mu }}{{\ln \left( {\mu /\nu } \right)}}$就足够了。这样的结果比现有的结果更简洁、更有力。在证明中，我们制定了新的马尔可夫链，该链表征了不同回合中开采区块的数量。
Formal analyses of blockchain protocols have received much attention recently. Consistency results of Nakamoto’s blockchain protocol are often expressed in a quantity c, which denotes the expected number of network delays before some block is mined. With μ (resp., ν) denoting the fraction of computational power controlled by benign miners (resp., the adversary), where μ+ν =1, we prove for the first time that to ensure the consistency property of Nakamoto’s blockchain protocol in an asynchronous network, it suffices to have c to be just slightly greater than $\frac{{2\mu }}{{\ln \left( {\mu /\nu } \right)}}$ . Such a result is both neater and stronger than existing ones. In the proof, we formulate novel Markov chains which characterize the numbers of mined blocks in different rounds.
影响因子：
3.5
作者：
ARRATIA, R;GORDON, L
通讯作者：
GORDON, L