Fully Automated Selfish Mining Analysis in Efficient Proof Systems Blockchains
Open Access
- 17 June 2024
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 268-278
Abstract
We study selfish mining attacks in longest-chain blockchains like Bitcoin, but where the proof of work is replaced with efficient proof systems - like proofs of stake or proofs of space - and consider the problem of computing an optimal selfish mining attack which maximizes expected relative revenue of the adversary, thus minimizing the chain quality. To this end, we propose a novel selfish mining attack that aims to maximize this objective and formally model the attack as a Markov decision process (MDP). We then present a formal analysis procedure which computes an ϵ-tight lower bound on the optimal expected relative revenue in the MDP and a strategy that achieves this ϵ-tight lower bound, where ϵ > 0 may be any specified precision. Our analysis is fully automated and provides formal guarantees on the correctness. We evaluate our selfish mining attack and observe that it achieves superior expected relative revenue compared to two considered baselines. In concurrent work [Sarenche FC'24] does an automated analysis on selfish mining in predictable longest-chain blockchains based on efficient proof systems. Predictable means the randomness for the challenges is fixed for many blocks (as used e.g., in Ouroboros), while we consider unpredictable (Bitcoin-like) chains where the challenge is derived from the previous block.Keywords
All Related Versions
Funding Information
- European Research Council (ERC-2020-CoG 863818)
- Ministry of Education - Singapore (MOE-T2EP20122-0014)
This publication has 18 references indexed in Scilit:
- Proof-of-Stake Longest Chain Protocols2022
- Proof-of-Stake Mining Games with Perfect Randomness2021
- The probabilistic model checker StormInternational Journal on Software Tools for Technology Transfer, 2021
- Tight Consistency Bounds for Bitcoin2020
- Efficient MDP Analysis for Selfish-Mining in Blockchains2020
- Algorand: A secure and efficient distributed ledgerTheoretical Computer Science, 2019
- SpaceMint: A Cryptocurrency Based on Proofs of Space2018
- Majority is not enoughCommunications of the ACM, 2018
- Proofs of Space2015
- PRISM 4.0: Verification of Probabilistic Real-Time Systems2011