On the Phase Space of Block-Hiding Strategies in Bitcoin-like networks
暂无分享,去创建一个
We calculate the probability of success of block-hiding mining strategies in Bitcoin-like networks. These strategies involve building a secret branch of the block-tree and publishing it opportunistically, aiming to replace the top of the main branch and rip the reward associated with the secretly mined blocks. We identify two types of block-hiding strategies and chart the parameter space where those are more beneficial than the standard mining strategy described in Nakamoto's paper. Our analysis suggests a generalization of the notion of the relative hashing power as a measure for a miner's influence on the network. Block-hiding strategies are beneficial only when this measure of influence exceeds a certain threshold.
[1] Emin Gün Sirer,et al. Majority Is Not Enough: Bitcoin Mining Is Vulnerable , 2013, Financial Cryptography.
[2] Meni Rosenfeld,et al. Analysis of Hashrate-Based Double Spending , 2014, ArXiv.