HackerPapers

arXiv:2103.14713cs.CR

Do the Rich Get Richer? Fairness Analysis for Blockchain Incentives

Yuming Huang, Jing Tang, Qianhao Cong, Andrew Lim, Jianliang Xu

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

Proof-of-Work (PoW) is the most widely adopted incentive model in current blockchain systems, which unfortunately is energy inefficient. Proof-of-Stake (PoS) is then proposed to tackle the energy issue. The rich-get-richer concern of PoS has been heavily debated in the blockchain community. The debate is centered around the argument that whether rich miners possessing more stakes will obtain higher staking rewards and further increase their potential income in the future. In this paper, we define two types of fairness, i.e., expectational fairness and robust fairness, that are useful for answering this question. In particular, expectational fairness illustrates that the expected income of a miner is proportional to her initial investment, indicating that the expected return on investment is a constant. To better capture the uncertainty of mining outcomes, robust fairness is proposed to characterize whether the return on investment concentrates to a constant with high probability as time evolves. Our analysis shows that the classical PoW mechanism can always preserve both types of fairness as long as the mining game runs for a sufficiently long time. Furthermore, we observe that current PoS blockchains implement various incentive models and discuss three representatives, namely ML-PoS, SL-PoS and C-PoS. We find that (i) ML-PoS (e.g., Qtum and Blackcoin) preserves expectational fairness but may not achieve robust fairness, (ii) SL-PoS (e.g., NXT) does not protect any type of fairness, and (iii) C-PoS (e.g., Ethereum 2.0) outperforms ML-PoS in terms of robust fairness while still maintaining expectational fairness. Finally, massive experiments on real blockchain systems and extensive numerical simulations are performed to validate our analysis.

arXiv comments
A short version of the paper will appear in 2021 International Conference on Management of Data (SIGMOD '21)
Journal reference
DOI
doi:10.1145/3448016.3457285
Subjects
cs.CRCryptography and Security cs.DBDatabases

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Sep 2021 to Sep 2021.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Proof of stake leads to "rich gets richer" situation [1]. Proof of work is much more fair, it appears. [1] https://arxiv.org/pdf/2103.14713.pdf This particular paper shows that every proof-of-stake variant is fallible into the "rich get richer". That means these PoS schemes do…

      theszView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.