Efficient MDP Analysis for Selfish-Mining in Blockchains
Roi Bar-Zur, Ittay Eyal, Aviv Tamar

TL;DR
This paper introduces a novel Probabilistic Termination Optimization method to efficiently solve Average Reward Ratio Markov Decision Processes, improving analysis of selfish mining strategies in blockchain protocols.
Contribution
It presents a new technique to solve ARR MDPs with a single standard MDP, reducing complexity and enabling tighter bounds on selfish mining thresholds.
Findings
PTO reduces computational complexity significantly.
Tighter bounds on selfish mining thresholds in Ethereum.
Applicable to various blockchain protocols.
Abstract
A proof of work (PoW) blockchain protocol distributes rewards to its participants, called miners, according to their share of the total computational power. Sufficiently large miners can perform selfish mining - deviate from the protocol to gain more than their fair share. Such systems are thus secure if all miners are smaller than a threshold size so their best response is following the protocol. To find the threshold, one has to identify the optimal strategy for miners of different sizes, i.e., solve a Markov Decision Process (MDP). However, because of the PoW difficulty adjustment mechanism, the miners' utility is a non-linear ratio function. We therefore call this an Average Reward Ratio (ARR) MDP. Sapirshtein et al.\ were the first to solve ARR MDPs by solving a series of standard MDPs that converge to the ARR MDP solution. In this work, we present a novel technique for solving…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlockchain Technology Applications and Security · Privacy-Preserving Technologies in Data · Distributed systems and fault tolerance
