All-out Attack: Optimal Block Withholding Under Pay-Per-Share Scheme
- URL: http://arxiv.org/abs/2607.01209v2
- Date: Fri, 03 Jul 2026 17:27:14 GMT
- Title: All-out Attack: Optimal Block Withholding Under Pay-Per-Share Scheme
- Abstract summary: We analyze Block Withholding attacks under Pay-Per-Share and Full-PPS schemes for Nakamoto-style blockchains.<n>Under PPS/FPPS, the optimal strategy for a BWH attacker is the All-out Attack (AoA)<n> advanced BWH variants such as Fork After Withholding (FAW) yield no additional profit under PPS/FPPS.
- Score: 45.776687601070705
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Classical Block Withholding (BWH) attacks have been extensively studied in block-dependent reward schemes, where pool members are compensated upon a block discovery within the pool. However, most contemporary mining pools operate under share-based schemes, wherein participants are paid immediately upon submission of valid shares. In this paper, we analyze BWH under Pay-Per-Share (PPS) and Full-PPS (FPPS) schemes for Nakamoto-style blockchains and prove that these mechanisms are not incentive compatible -- contrary to claims in prior literature. Under PPS/FPPS, the optimal strategy for a BWH attacker is the All-out Attack (AoA): the adversary allocates its entire hashpower toward the victim pool, submitting only partial Proof-of-Work shares (pPoW) while withholding all valid blocks, i.e., full Proof-of-Work (fPoW). Prior to the first difficulty adjustment, the adversary incurs negligible loss from withheld fPoWs. After the adjustment reduces block difficulty, the adversary either generates more pPoWs per unit time or, if pPoW difficulty is held fixed, earns a higher reward per share, in both cases achieving a relative gain of $\fracα{1-α}$ over pre-adjustment rates, where $α$ is the adversarial hashpower fraction. Honest miners benefit at the same rate as the adversary per unit hashpower, while the victim pool operator bears all losses, paying out-of-pocket for pPoW submissions without receiving fPoW compensation in return. Finally, advanced BWH variants such as Fork After Withholding (FAW) yield no additional profit under PPS/FPPS.
Related papers
- PDoS: A Profitable Denial-of-Service Attack against Proof-of-Work Blockchain Liveness [9.160986728068094]
We present PDoS, a hybrid attack that combines block header signal deterrence with parasitic revenue extraction.<n>In high-fee or high-MEV environments, higher block value can make PoW systems less secure by increasing the attacker's parasitic revenue.<n>To the best of our knowledge, PDoS is the first attack to demonstrate that disrupting PoW blockchain liveness can be economically self-sustaining and even profitable.
arXiv Detail & Related papers (2026-09-11T05:16:01Z) - GD$^2$PO: Mitigating Multi-Reward Conflicts via Group-Dynamic reward-Decoupled Policy Optimization [54.596224644751565]
Post-training reinforcement learning (RL) increasingly relies on multi-dimensional rewards to cultivate comprehensive capabilities.<n>To address this, existing methods such as Group reward-Decoupled Policy Optimization (GDPO) decompose the overall score into independent reward groups, then compute the RL loss separately within each group.<n>We propose Group-Dynamic reward-Decoupled Policy Optimization (GD$2$PO), which employs a conflict-aware filtering mechanism to mask out rollouts suffering from severe reward-wise disagreement.
arXiv Detail & Related papers (2026-06-15T14:19:28Z) - Breaking $\textit{Winner-Takes-All}$: Cooperative Policy Optimization Improves Diverse LLM Reasoning [53.42577591449649]
Group Cooperative Policy Optimization shifts the training paradigm from rollout competition to team cooperation.<n>GCPO replaces independent rollout scoring with team-level credit assignment.<n>It redistributes the collective team reward to each single rollout according to its average marginal contribution to the team.
arXiv Detail & Related papers (2026-05-12T03:20:24Z) - Temporary Power Adjusting Withholding Attack [45.776687601070705]
Temporary PAW attack corresponds to $Ttoinfty$ and is not optimal.<n>We show that honest mining is sub-optimal to T-PAW even when there is no difficulty adjustment.
arXiv Detail & Related papers (2026-04-15T17:55:56Z) - Outcome-Grounded Advantage Reshaping for Fine-Grained Credit Assignment in Mathematical Reasoning [60.00161035836637]
Group Relative Policy Optimization has emerged as a promising critic-free reinforcement learning paradigm for reasoning tasks.<n>We introduce Outcome-grounded Advantage Reshaping (OAR), a fine-grained credit assignment mechanism that redistributes advantages based on how much each token influences the model's final answer.<n>OAR-G achieves comparable gains with negligible computational overhead, both significantly outperforming a strong GRPO baseline.
arXiv Detail & Related papers (2026-01-12T10:48:02Z) - Hashpower allocation in Pay-per-Share blockchain mining pools [0.0]
This article examines a Pay-per-Share (PPS) reward system, where the pool manager can adjust both the share difficulty and the management fee.<n>Using a simplified wealth model for miners, we explore how miners should allocate their computing resources among different mining pools.
arXiv Detail & Related papers (2025-11-15T13:42:59Z) - Incentive Attacks in BTC: Short-Term Revenue Changes and Long-Term Efficiencies [45.776687601070705]
Bitcoin's Difficulty Adjustment Algorithm (DAA) has been a source of vulnerability for incentive attacks such as selfish mining, block withholding and coin hopping strategies.<n>We study the short-term revenue change per hashpower of the adversarial and honest miners for these incentive attacks.<n>For block withholding strategies, it turns out, the honest miners outside the pool profit from the attack, usually even more than the attacker both in the short-term and the long-term.
arXiv Detail & Related papers (2025-11-14T18:18:17Z) - BM-PAW: A Profitable Mining Attack in the PoW-based Blockchain System [8.156709861487697]
We introduce a novel mining strategy, named BM-PAW, which yields superior rewards for both the attacker and the targeted pool.<n>We propose practical countermeasures to mitigate these novel pool attacks.
arXiv Detail & Related papers (2024-11-09T13:59:55Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.