Block withholding resilience

Cyril Grunspan (1) , Ricardo Pérez-Marco (2, 3, 4)

1 ESILV - École Supérieure d'Ingénierie Léonard de Vinci
2 CNRS - Centre National de la Recherche Scientifique
3 IMJ-PRG (UMR_7586) - Institut de Mathématiques de Jussieu - Paris Rive Gauche
4 UPCité - Université Paris Cité

It has been known for some time that the Nakamoto consensus as implemented in the Bitcoin protocol is not totally aligned with the individual interests of the participants. More precisely, it has been shown that block withholding mining strategies can exploit the difficulty adjustment algorithm of the protocol and obtain an unfair advantage. However, we show that a modification of the difficulty adjustment formula taking into account orphan blocks makes honest mining the only optimal strategy. Surprinsingly, this is still true when orphan blocks are rewarded with an amount smaller to the official block reward. This gives an incentive to signal orphan blocks. The results are independent of the connectivity of the attacker.

Domaines: Probabilités [math.PR]

Cyril Grunspan, Ricardo Pérez-Marco. Block withholding resilience. 2022. ⟨hal-03851057⟩