Temporary Power Adjusting Withholding Attack
Abstract
We consider the block withholding attacks on pools, more specifically the state-of-the-art Power Adjusting Withholding (PAW) attack. We propose a generalization called Temporary PAW (T-PAW) where the adversary withholds a fPoW from pool mining at most $T$-time even when no other block is mined. We show that PAW attack corresponds to $T\to\infty$ and is not optimal. In fact, the extra reward of T-PAW compared to PAW improves by an unbounded factor as adversarial hash fraction $α$, pool size $β$ a...
Description / Details
We consider the block withholding attacks on pools, more specifically the state-of-the-art Power Adjusting Withholding (PAW) attack. We propose a generalization called Temporary PAW (T-PAW) where the adversary withholds a fPoW from pool mining at most -time even when no other block is mined. We show that PAW attack corresponds to and is not optimal. In fact, the extra reward of T-PAW compared to PAW improves by an unbounded factor as adversarial hash fraction , pool size and adversarial network influence decreases. For example, the extra reward of T-PAW is 22 times that of PAW when an adversary targets a pool with . We show that honest mining is sub-optimal to T-PAW even when there is no difficulty adjustment and the adversarial revenue increase is non-trivial, e.g., for most at least within weeks in Bitcoin even when (for PAW it was at most ). Hence, T-PAW exposes a significant structural weakness in pooled mining-its primary participants, small miners, are not only contributors but can easily turn into potential adversaries with immediate non-trivial benefits.
Source: arXiv:2604.14135v1 - http://arxiv.org/abs/2604.14135v1 PDF: https://arxiv.org/pdf/2604.14135v1 Original Link: http://arxiv.org/abs/2604.14135v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Apr 16, 2026
Computer Science
Cybersecurity
0