Majority Is Not Required: A Rational Analysis of the Private Double-Spend Attack from a Sub-Majority Adversary

We study the incentives behind double-spend attacks on Nakamoto-style Proof-of-Work cryptocurrencies. In these systems, miners are allowed to choose which transactions to reference within their block, and a common strategy for selecting transactions is to greedily choose those with the highest fees. This can be problematic if these transactions originate from an adversary with substantial computational power (even if it is less than 50% of the total), as high-value transactions are targets for double-spend attacks. The most common mechanism for deterring double-spend attacks is for the recipients of large transactions to wait for additional block confirmations beyond the number suggested by the protocol (effectively increasing the attack cost). We argue that this defense mechanism is not satisfactory, as the security of the system is contingent on the actions of its users . Instead, defending against double-spend attacks should be the responsibility of the miners ; to this end, we propose a protocol rule under which miners limit the amount of transaction value in a block (i.e., reduce the attack reward). To demonstrate the efficacy of our proposed rule, we model cryptocurrency mining as a mean-field game in which the standard mining reward function is augmented to simulate the presence of a rational, double-spending adversary. We design and implement an algorithm which characterizes the behavior of miners at equilibrium, and we show that miners who respond to the adversary-aware reward function accumulate more wealth than those who do not. Under this reward function, the optimal strategy for honest miners is to limit the value transferred in each block such that the adversary’s expected profit is 0. Additionally, we examine Bitcoin’s resilience to double-spend attacks under our model. Assuming a six-block confirmation time, we find that a Bitcoin miner with 26% of the network mining power expects to profit from a double-spend attack.

Authors

Institutions

Publication Details

Journal
Distributed Ledger Technologies Research and Practice
Published
2025-03-27
DOI
https://doi.org/10.1145/3722126
Primary Topic
Spam and Phishing Detection
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Majority Is Not Required: A Rational Analysis of the Private Double-Spend Attack from a Sub-Majority Adversary

Karl J. Kreder, Yanni Georghiades, Sriram Vishwanath, Rajesh Mishra
Distributed Ledger Technologies Research and Practice
Spam and Phishing Detection
article

Majority Is Not Required: A Rational Analysis of the Private Double-Spend Attack from a Sub-Majority Adversary

Karl J. Kreder, Yanni Georghiades, Sriram Vishwanath, Rajesh Mishra
article en

Abstract

We study the incentives behind double-spend attacks on Nakamoto-style Proof-of-Work cryptocurrencies. In these systems, miners are allowed to choose which transactions to reference within their block, and a common strategy for selecting transactions is to greedily choose those with the highest fees. This can be problematic if these transactions originate from an adversary with substantial computational power (even if it is less than 50% of the total), as high-value transactions are targets for double-spend attacks. The most common mechanism for deterring double-spend attacks is for the recipients of large transactions to wait for additional block confirmations beyond the number suggested by the protocol (effectively increasing the attack cost). We argue that this defense mechanism is not satisfactory, as the security of the system is contingent on the actions of its users . Instead, defending against double-spend attacks should be the responsibility of the miners ; to this end, we propose a protocol rule under which miners limit the amount of transaction value in a block (i.e., reduce the attack reward). To demonstrate the efficacy of our proposed rule, we model cryptocurrency mining as a mean-field game in which the standard mining reward function is augmented to simulate the presence of a rational, double-spending adversary. We design and implement an algorithm which characterizes the behavior of miners at equilibrium, and we show that miners who respond to the adversary-aware reward function accumulate more wealth than those who do not. Under this reward function, the optimal strategy for honest miners is to limit the value transferred in each block such that the adversary’s expected profit is 0. Additionally, we examine Bitcoin’s resilience to double-spend attacks under our model. Assuming a six-block confirmation time, we find that a Bitcoin miner with 26% of the network mining power expects to profit from a double-spend attack.

Distributed Ledger Technologies Research and PracticeVol. 5(1)
SciTech Strategies (United States) (US), The University of Texas at Austin (US)
Openalex Percentile: Top 93%
Spam and Phishing Detection
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.