Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 7 min ago
PreprintarXiv licencearXiv

All-out Attack: Optimal Block Withholding Under Pay-Per-Share Scheme

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) for Nakamoto-style blockchains and prove that these mechanisms are not incentive compatible, contrary to conclusions drawn under fixed difficulty in prior literature. Under PPS, 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 when the pPoW difficulty is reduced accordingly or, if the pPoW difficulty is held fixed, earns a higher reward per share. In both cases, it achieves a post-adjustment reward rate of α/(1−α) per target epoch, compared with the honest baseline rate of α. Remarkably, this gain matches the theoretical upper bound achieved by optimal selfish mining in Nakamoto consensus under perfect network influence. The results further indicate that BWH is substantially more profitable under PPS than under mainstream block-dependent payout schemes, even when compared with advanced BWH variants. 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.

Related

  1. A Combinatorial Formula and a Hilbert Scheme Realization of a Rank-One Virasoro Irregular Conformal Block
    Hajime Nagoya
    arXivPreprintarXiv licenceFull textMathematical physicsarXiv
  2. Unconditional optimal convergence of a relaxation Crank-Nicolson difference scheme for 2D space-fractional NLS
    Lisen Ding, Dongling Wang
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingarXiv
  3. An Optimal IPDG Scheme for the Biharmonic Equation
    Bohua Zhang, Xia Ji, Shuo Zhang
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  4. Feedback Capacity of Stationary Gaussian Channels: An Optimal Schalkwijk-Kailath Scheme
    David Fay, Oron Sabag
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  5. Jordan-Block Degeneracy and Cubic-Order Bifurcating Periodic Orbits in Minimum-Energy Optimal Control of Hamiltonian Equilibria
    Mai Bando, Ayano Tsuruta, Shanshan Pan +1
    arXivPreprintCC BY-NC-ND 4.0Full textDynamical systemsOptimisation & controlarXiv
BibTeX
@misc{doger2026allout,
  title = {{All-out Attack: Optimal Block Withholding Under Pay-Per-Share Scheme}},
  author = {Mustafa Doger and Sennur Ulukus},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2607.01209},
  eprint = {2607.01209},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2607.01209},
}
RIS
TY  - UNPB
TI  - All-out Attack: Optimal Block Withholding Under Pay-Per-Share Scheme
AU  - Mustafa Doger
AU  - Sennur Ulukus
PY  - 2026
DA  - 2026/10/16
PB  - arXiv
DO  - 10.48550/arxiv.2607.01209
UR  - https://arxiv.org/abs/2607.01209
AB  - 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) for Nakamoto-style blockchains and prove that these mechanisms are not incentive compatible, contrary to conclusions drawn under fixed difficulty in prior literature. Under PPS, 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 when the pPoW difficulty is reduced accordingly or, if the pPoW difficulty is held fixed, earns a higher reward per share. In both cases, it achieves a post-adjustment reward rate of α/(1−α) per target epoch, compared with the honest baseline rate of α. Remarkably, this gain matches the theoretical upper bound achieved by optimal selfish mining in Nakamoto consensus under perfect network influence. The results further indicate that BWH is substantially more profitable under PPS than under mainstream block-dependent payout schemes, even when compared with advanced BWH variants. 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.
ER  -