关键词: 自私挖掘, 区块链, 区块挖掘, 概率分布, 矿池收益

Abstract: Selfish mining is a mining strategy in the blockchain, which can increase profits by selectively publishing the “blocks” dug up. This paper proposes SAPV model based on probability distribution, aiming at the problems that selfish mining destroys the normal mining process and wastes the mining power. The typical attacks of blockchain are summarized firstly, then the process of selfishness minings is analyzed, and the different states of selfish mining are gottern, the probability distribution of selfish mining is calculated in different situation lastly. A new method of comparing the size of the probability of selfish and honesty mining to determine whether the hidden blocks are published is given, which optimizes the relative revenue. The experiment simulates the relative revenue share of the selfish mining pool under different mining power, and this paper analyzes the impact of different computing power on the reward of the pool. Lastly the threshold of selfish mining is proposed for ensuring the safe processing of mining. The paper provides the ideas to solve the problem of blockchain security for prospective research.

Key words: selfish mining, blockchain, mining blocks, probability distribution, pool revenue