Q-Learning model for selfish miners with optional stopping theorem for honest miners

【Author】 Rakkini, M. J. Jeyasheela; Geetha, K.

【Source】INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH

【影响因子】3.610

【Abstract】Bitcoin, the most popular cryptocurrency used in the blockchain, has miners join mining pools and get rewarded for the proportion of hash rate they have contributed to the mining pool. This work proposes the prediction of the relativegain of the miners by machine learning and deep learning models, the miners' selection of higher relativegain by the Q-learning model, and an optional stopping theorem for honest miners in the presence of selfish mining attacks. Relativegain is the ratio of the number of blocks mined by selfish miners in the main canonical chain to the blocks of other miners. A Q-learning agent with & epsilon;-greedy value iteration, which seeks to increase the relativegain for the selfish miners, that takes into account all the other quintessential parameters, including the hash rate of miners, time warp, the height of the blockchain, the number of times the blockchain was reorganized, and the adjustment of the timestamp of the block, is implemented. Next, the ruin of the honest miners and the optional stopping theorem are analyzed so that the honest miners can quit the mining process before their complete ruin. We obtain a low mean square error of 0.0032 and a mean absolute error of 0.0464 in our deep learning model. Our Q-learning model exhibits a linearly increasing curve, which denotes the increase in the relativegain caused by the selection of the action of performing the reorganization attack.

【Keywords】difficulty adjustment algorithms; gambler ruin; honest mining; prediction; reinforcement learning; selfish mining

【发表时间】2023 2023 JUL 30

【收录时间】2023-08-18

【文献类型】

【主题类别】

--