Compounding of Wealth in Proof-of-Stake Cryptocurrencies
From Giulia Fanti, Leonid Kogan, Sewoong Oh, Kathleen Ruan, Pramod Viswanath and Gerui Wang
Proof-of-stake (PoS) is a promising approach for designing efficient blockchains, where block proposers are randomly chosen with probability proportional to their stake. A primary concern with PoS systems is the “rich getting richer” phenomenon, whereby wealthier nodes are more likely to get elected, and hence reap the block reward, making them even wealthier. In this paper, we introduce the notion of equitability, which quantifies how much a proposer can amplify her stake compared to her initial investment. Even with everyone following protocol (i.e., honest behavior), we show that existing methods of allocating block rewards lead to poor equitability, as does initializing systems with small stake pools and/or large rewards relative to the stake pool. We identify a geometric reward function, which we prove is maximally equitable over all choices of reward functions under honest behavior and bound the deviation for strategic actions; the proofs involve the study of optimization problems and stochastic dominances of P´olya urn processes, and are of independent mathematical interest. These results allow us to provide a systematic framework to choose the parameters of a practical incentive system for PoS cryptocurrencies.
Featured Publication
Fanti, Giulia, Leonid Kogan, Sewoong Oh, Kathleen Ruan, Pramod Viswanath, and Gerui Wang. In Financial Cryptography and Data Security. FC 2019. Lecture Notes in Computer Science, edited by Ian Goldberg and Tyler Moore. Cham, Switzerland: September 2019. arXiv Preprint.
Learn More about Cryptocurrency
Current Cryptocurrency projects from the Consumer Finance Initiative cover topics including the Terra Luna crash, crypto arbitrage and bitcoin and blockchain technology. Find more Cryptocurrency research here.