Bitcoin Selfish Mining and Dyck Words

02/05/2019
by   Cyril Grunspan, et al.
0

We give a straightforward proof for the formula giving the long-term apparent hashrate of the Selfish Mining strategy in Bitcoin using only elementary probabilities and combinatorics, and more precisely, Dyck words. There is no need to compute stationary probabilities on Markov chain nor stopping times for Poisson processes as it was previously done. We consider also several other block withholding strategies.

READ FULL TEXT
research
04/11/2019

Selfish Mining and Dyck Words in Bitcoin and Ethereum Networks

The main goal of this article is to present a direct approach for the fo...
research
11/22/2018

On Profitability of Trailing Mining

We compute the revenue ratio of the Trail Stubborn mining strategy in th...
research
01/15/2019

Selfish Mining in Ethereum

As the second largest cryptocurrency by market capitalization and today'...
research
01/16/2022

Dynamics of Bitcoin mining

What happens to mining when the Bitcoin price changes, when there are mi...
research
08/02/2018

On profitability of stubborn mining

We compute and compare profitabilities of stubborn mining strategies tha...
research
04/22/2018

On the insecurity of quantum Bitcoin mining

Grover's algorithm provides quantum computers a quadratic advantage over...
research
07/16/2021

The Convergence Rates of Blockchain Mining Games: A Markovian Approach

Understanding the strategic behavior of miners in a blockchain is of gre...

Please sign up or login with your details

Forgot password? Click here to reset