Security and Attacks on Decentralized Mining Pools
summary
Describes concrete weaknesses and experiments with decentralized pools: P2Pool relies on a FIFO share chain that reduces average block size to about 61%, creates heavy network overhead, and requires tricky dynamic difficulty so small miners can be starved; an attacker with ~21% can temporally control a 30% P2Pool via selfish-mining on both chains; smart pool uses smart contracts and Merkle trees for probabilistic share verification but cannot validate transactions, enabling undetectable block-withholding and cross-chain bribery. Covers what was built, why it struggles in practice, and a proposal to combine both approaches.
AI-written summary · about
chapters (15)
- 0:00Start
- 0:44Motivation
- 2:24Goals of Decentralized Mining (Pools)
- 3:57P2Pool (Voight et al., 2011)
- 6:20Share Difficulty Handling
- 8:48Block Size and Latency issues - Observations
- 9:18Selfish Mining & 51% Attacks
- 10:33Temporary Dishonest Majority
- 14:49P2Pool - Did it work?
- 15:35SmartPool (Luu et al. 2017)
- 16:15Augmented Merkle Tree
- 16:40Probabilistic Verification
- 18:36Practical Challenges
- 19:58Security issues
- 23:04Questions?
related talks
01h 05mPanel Discussion - Dangers of Pool hash wars and how to keep pools decentralized
42mDecentralized Mining in Centralized Pools
14mEarly Lessons From Braidpool: Decentralized Mining Needs Open Source Solutions
27mSmartPool: Practical Decentralized Pooled Mining
37mMining Panel
31mP2Poolv2
30mMining Centralization Pressures
26mOpen Source Mining