The Last Survivor of PoS Pools: Staker's Dilemma
In PoW blockchains, the pooling approach has been criticized to be vulnerable to the block withholding (BWH) attack. BWH attackers can unfairly claim rewards from victim pools by submitting proofs of work while secretly withholding any valid blocks they discover. It is well known that BWH attackers against PoW face the miner's dilemma. Interestingly, our findings reveal that this vulnerability manifests more severely in Proof-of-Stake (PoS) systems. For a network only consisting of one attacker pool and one victim pool, the attacker will eventually manipulate the network while the victim will vanish by losing the stake ratio gradually. Moreover, in a more realistic scenario with multiple BWH attacker pools and one solo staker who does not join any pools, we show that only one lucky attacker and the solo staker will survive, whereas all the other pools will vanish gradually, revealing the staker's dilemma. Our analysis is supported by experiments on massive real blockchain systems and numerical simulations.
Authors
- Yuming Huang (ORCID: https://orcid.org/0000-0002-3101-7687)
- T. B. Richard (ORCID: https://orcid.org/0000-0002-9883-5844)
- Qianhao Cong
- Jing Tang (ORCID: https://orcid.org/0000-0002-0785-707X)
- Yeow Meng Chee (ORCID: https://orcid.org/0000-0001-7823-8068)
- Lei Chen (ORCID: https://orcid.org/0000-0002-8257-5806)
Institutions
- National University of Singapore (SG)
Publication Details
- Journal
- ACM SIGMETRICS Performance Evaluation Review
- Published
- 2025-06-16
- DOI
- https://doi.org/10.1145/3744970.3727318
- Primary Topic
- Blockchain Technology Applications and Security
- Type
- article
- Field-Weighted Citation Impact
- 0.00