Incentives Against Power Grabs or How to Engineer the Revolution in a Pooled Proof of Stake System

Proof-of-Stake (PoS) blockchain systems, especially those that allow stakeholders to organize themselves in “stake-pools”, have emerged as a compelling paradigm for the deployment of large scale distributed ledgers. A stake-pool operates a node that engages in the PoS protocol and potentially represents a large number of smaller stakeholders. While such pooled PoS operation is attractive from various angles, it also exhibits a significant shortcoming that, so far and to the best of our knowledge, has not been sufficiently understood or investigated. Pooled PoS operation, to be effective and not lead to sub-optimal dictatorial or cartel-like configurations, should enable the stakeholders to revoke and re-delegate their stake in a way that is aligned with their incentives. However, given that stake-pool operators are exactly those entities who determine what transactions are to be recorded in the ledger, they are quite likely to form a cartel and censor any transaction they want, such as those that attempt to adjust the current stake-pool lineup. In this way, a power grab takes place, where the stake-pool cartel perpetuates its control over the PoS system. We first model and observe formally the emergence of the above problem in pooled PoS systems. Then, we describe an anti-censorship mechanism that takes advantage of the underlying cryptographic functions of the ledger and the nature of peer-to-peer networks to diffuse information without suppression. Specifically, the mechanism exploits digital signatures which can endorse messages that are censored and bind them to delegation transactions, as well as the ability of the underlying ledger to produce unpredictable randomness which can be used to randomly “audit” the suitability of a stake-pool by forcibly expiring it. Upon such expiration, members can evaluate their membership taking into account what information is available, including information potentially not recorded in the ledger but diffused in the peer-to-peer network. We provide a thorough game-theoretic analysis of this mechanism discovering various types of Nash equilibria which demonstrate that the “revolution”, i.e., the strategic decision of pool members to withdraw support from a censoring cartel as well as the pool operators to step down, can be incentivized, under suitable and plausible conditions in the utility functions of the involved participants.

[1]  J. Morgan,et al.  Cheap Talk , 2005 .

[2]  S. Matthew Weinberg,et al.  Bitcoin: A Natural Oligopoly , 2018, ITCS.

[3]  J. Huyck,et al.  Tacit Coordination Games, Strategic Uncertainty, and Coordination Failure , 1990 .

[4]  Aggelos Kiayias,et al.  Ouroboros Praos: An adaptively-secure, semi-synchronous proof-of-stake protocol , 2017, IACR Cryptol. ePrint Arch..

[5]  Navin Kartik,et al.  On Cheap Talk and Burned Money , 2005 .

[6]  T. W. Ross,et al.  Communication in Coordination Games , 1992 .

[7]  Michael Dahlin,et al.  BAR fault tolerance for cooperative services , 2005, SOSP '05.

[8]  Aggelos Kiayias,et al.  Reward Sharing Schemes for Stake Pools , 2018, 2020 IEEE European Symposium on Security and Privacy (EuroS&P).

[9]  Silvio Micali,et al.  ALGORAND: The Efficient and Democratic Ledger , 2016, ArXiv.

[10]  Aggelos Kiayias,et al.  Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol , 2017, CRYPTO.

[11]  Joseph Farrell Cheap Talk, Coordination, and Entry , 1987 .

[12]  Nikos Leonardos,et al.  Oceanic Games: Centralization Risks and Incentives in Blockchain Mining , 2019, MARBLE.

[13]  J. Sobel,et al.  STRATEGIC INFORMATION TRANSMISSION , 1982 .

[14]  Moni Naor,et al.  Pricing via Processing or Combatting Junk Mail , 1992, CRYPTO.

[15]  Vitalik Buterin,et al.  Casper the Friendly Finality Gadget , 2017, ArXiv.

[16]  S. Nakamoto Bitcoin: A Peer-to-Peer Electronic Cash System , 2008 .

[17]  Yongdae Kim,et al.  Impossibility of Full Decentralization in Permissionless Blockchains , 2019, AFT.