Tree Representation, Growth Rate of Blockchain and Reward Allocation in Ethereum with Multiple Mining Pools
Quan-Lin Li, Yan-Xia Chang, Chi Zhang

TL;DR
This paper models Ethereum's blockchain with multiple mining pools, analyzing block growth, classification, and reward distribution using stochastic processes and simulations, providing insights into mining dynamics and attack impacts.
Contribution
It introduces a mathematical framework for representing multi-pool Ethereum block trees and analyzes growth and rewards, addressing complexities of multi-branch structures and mining competition.
Findings
Key probabilities of block types derived
Long-term blockchain growth rate estimated
Reward allocation among pools characterized
Abstract
It is interesting but difficult and challenging to study Ethereum with multiple mining pools. One of the main difficulties comes from not only how to represent such a general tree with multiple block branches (or sub-chains) related to the multiple mining pools, but also how to analyze a multi-dimensional stochastic system due to the mining competition among the multiple mining pools. In this paper, we first set up a mathematical representation for the tree with multiple block branches. Then we provide a block classification of Ethereum: Regular blocks (in the main chain), orphan blocks, uncle blocks, stale blocks, and nephew blocks, and give some key probabilities of generating the different types of blocks by applying the law of large numbers. Based on this, we further discuss the growth rate of blockchain, and the reward allocation among the multiple mining pools through applying the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBlockchain Technology Applications and Security · Cloud Computing and Resource Management
