Rationality is Self-Defeating in Permissionless Systems

10/19/2019 ∙ by Bryan Ford, et al. ∙ 0

We outline a metacircular argument explaining why it is rational to be irrational when attacking open-world decentralized systems, and why systems whose security depend on rationality assumptions are insecure.



There are no comments yet.


page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

Many blockchain and cryptocurrency fans seem to prefer building and analyzing decentralized systems in a rational or “greedy behavior” failure model, rather than a Byzantine or “arbitrary behavior” failure model. Many of the same blockchain and cryptocurrency fans also like open, permissionless systems like Bitcoin and Ethereum, which anyone can join and participate in using weak identities such as anonymous cryptography key pairs.

What most of these heavily-overlapping sets of fans do not seem to realize, however, is that rationality assumptions are self-defeating in open permissionless systems with weak identities. A fairly simple metacircular argument—a kind of “Gödel’s incompleteness theorem [13] for rationality”—shows that for any system that makes any behavioral assumption, including but not limited to a rationality assumption, a rational attacker both exists and has an incentive to defeat that behavioral assumption, thereby violating that assumption and exhibiting Byzantine behavior from the perspective of the system.

As a quick summary of the argument we will expand below, suppose a permissionless system like Bitcoin is secure against rational attacks, but has some weakness against irrational Byzantine attacks in which the attacker would lose money. Because the system is open, permissionless, and exists within a larger ecosystem, a rational attacker can find ways to “bet against” Bitcoin’s security in other financially-connected systems (e. g., Ethereum), making a profit outside of Bitcoin on this attack against Bitcoin. An attack that appears irrational in the context of Bitcoin may be perfectly rational in the context of the larger ecosystem.

For this reason, an open permissionless system designed to be secure only against rational adversaries is actually just insecure, unless it remains secure even when the “rational” participants become fully Byzantine. Given this, one might as well have designed the permissionless system in a Byzantine model in the first place. The rationality assumption offers no actual benefit, but merely can make an insecure system appear secure under flawed analysis.

This manuscript is based partly on ideas in the second author’s lecture [6] at the BDLT Summer School in Vienna [24]. While formalizing the argument would require some effort, we thought it would be worth at least sketching the argument intuitively for the public record.

2 Threat Modeling: Honest, Byzantine, and Rational Participants

In designing or analyzing the security of any decentralized system, we must define the system’s threat model, and in particular our assumptions about the behaviors of the participants in the system. An honest, correct, or altruistic participant is one that we assume to follow the system’s protocol rules as specified, hence representing a “well-behaved” participant exhibiting no adversarial behavior.

A Byzantine participant, named after the Byzantine Generals Problem [20], is one we make no assumptions about. A Byzantine participant can behave in arbitrary fashion, without restriction, and hence by definition represents the strongest possible adversary.

We would like to build systems that could withstand all participants being Byzantine, but this appears fundamentally impossible. We therefore in practice have to make threshold security assumptions, such as that over two-thirds of the participants in classic Byzantine consensus protocols are honest, or that the participants controlling over half the hash power in Bitcoin are well-behaved.

Even with threshold assumptions, however, building systems that resist Byzantine behavior is extremely difficult, and the resulting systems are often much more complex and inefficient than systems tolerating weaker adversaries. We may therefore be tempted to improve a design’s simplicity or efficiency by making stronger assumptions about the behavior of adversarial participants, effectively weakening the assumed adversary.

Byzantine participants (arbitrary behavior)

Rational participants (“greedy”)

Honest participants
Figure 1: Euler diagram of possible behaviors in the three threat models considered

One such popular assumption, especially in economic circles, is rationality. In essence, we assume that rational participants may deviate from the rules in arbitrary ways but only when doing so is in their economic self-interest, improving their expected rewards—usually but not always financial—in comparison with following the rules honestly (cf. Fig. 1).

By assuming that adversarial participants are rational rather than Byzantine, we need not secure the system against all possible participant behaviors, such as against participants who pay money with no reward merely to sow chaos and destruction. Instead, we merely need to prove that the system is incentive compatible, for example by showing that its rules represent a Nash equilibrium, in which deviations from the equilibrium will not give participants a greater financial reward.

Besides simplicity and efficiency, another appeal of rationality assumptions is the promise of strengthening the system’s security by lowering the threshold of participants we assume to be fully honest. To circumvent the classical Byzantine consensus requirement that fewer than one third of participants may be faulty, for example, we might hope to tolerate closer to 50 %, or even 100 %, of participants being “adversarial” if we assume they are rational and not Byzantine. Work on the Byzantine-Altruistic-Rational (BAR) model [2] and -robustness [1] exemplifies this goal, which sometimes appears achievable in closed systems with strong identities. But a direct implication of our metacircular argument is that an open system cannot generally be secure if all participants are either Byzantine or rational.

3 Assumptions Underlying the Argument

The metacircular argument makes three main assumptions.

Assumption 1

First, the system under consideration is open and permissionless, allowing anyone to join and participate in the system using only weak, anonymous identities such as bare cryptographic key pairs. Identities in need not even be costless [12] provided their price is modest: the argument still works even if imposes membership fees or requires new wallet keys to be “mined,” for example. Proof-of-Work cryptocurrencies such as Bitcoin and Ethereum, Proof-of-Stake systems such as Algorand [8] and Ouroboros [17], and most other permissionless systems seem to satisfy this openness property. Because participation is open to anyone globally and can be anonymous, we cannot reasonably expect police or governments to protect from attack: even if they wanted to and considered it their job, they would not be able to find or discipline a smart rational attacker who might be attacking from anywhere around the globe, especially from a country with weak international agreements and extradition rules. Thus, must “stand on its own,” by successfully either withstanding or disincentivizing attacks coming from anywhere. (And it will turn out that merely disincentivizing such attacks is impossible.)

Assumption 2

Second, the system

does not control a majority of total economic power or value in the world: i. e., it is not totally economically dominant from a global perspective. Instead, there may be (and probably are) actors outside of

who, if rationally incentivized to do so, can at least temporarily muster an amount of economic power outside of comparable to or greater than the economic value within or controlled by . In other words, we assume that is not the “biggest fish in the ocean.” Given that there can be at most one globally dominant economic system at a time, it seems neither useful nor advisable to design systems that are secure only when they are the biggest fish in the ocean, because almost always they are not.

Assumption 3

Third, the system actually leverages in some fashion the behavioral assumption(s) it makes on participants, such as a rationality assumption. That is, we assume there exist one or more (arbitrary) behavioral strategies that assumes some participants will not follow, such as economically-losing behaviors in the case of rationality. Further, we assume there exists such an assumption-violating strategy that will cause to malfunction or otherwise deviate observably from its correct operation. In fact, we need not assume that this deviant behavior will always succeed in breaking , but only that it will non-negligibly raise the probability of failing. If this were not the case, and in fact operates correctly, securely, and indistinguishably from its ideal even if participants do violate their behavioral assumptions, then is actually Byzantine secure after all. In that case, is not actually benefiting from its assumptions about participant behavior, which are redundant and thus may be simply discarded.

4 The Metacircular Argument: Rational Attacks on Rationality

Suppose permissionless system is launched, and operates smoothly for some time, with all participants conforming to ’s assumptions about them. Because is permissionless (assumption 1) and exists in a larger open world (assumption 2), new rational participants may arrive at any time, attracted by ’s success and presumably growing economic value provided there is an opportunity to profit from doing so.

Consider a particular newly-arriving participant . could of course play by the rules assumes of , in which case the greatest immediate economic benefit could derive from participating in is some fraction of the total economic value currently embodied in (e. g., its market cap). For most realistic permissionless systems embodying strong founders’ or early-adopters’ rewards, if is not one of the original founders of but arrives substantially after launch, then ’s near-term payoff prospectives from joining is likely bounded to a fairly small fraction of ’s total value. But what if there were another strategy could take, for perfectly rational and economically-motivated reasons, by which could in relatively short order acquire a large fraction of ’s total value?

The “open world”


(target of attack)


(used to attack )

Rational attacker

Figure 2: The attacker behaves rational outside of system ’s boundaries

Because is permissionless and operating in a larger open world, is not confined to operating exclusively within the boundaries of . can also make use of facilities external to . By assumption 2, may in particular have access to, or be able to borrow temporarily, financial resources comparable to or larger than the total value of .

Suppose the facilities external to include another Ethereum-like cryptocurrency , which includes a smart contract facility with which decentralized exchanges, futures markets, and the like may be implemented. (This is not really a separate assumption because even if did not already exist, could create and launch it, given sufficient economic resources under assumption 2.) Further, suppose that someone (perhaps ) has created on external system a decentralized exchange, futures market, or any other mechanism by which tokens representing shares of the value of may be traded or speculated upon in the context of : e. g., a series of tradeable Ethereum tokens pegged to ’s cryptocurrency or stake units (see Fig. 2).

Now suppose participant finds some behavioral strategy that system depends on participants not exhibiting, and that will observably break —or even that just might break with significant non-negligible probability. Assumption 3 above guarantees the existence of such a behavioral strategy, unless ’s rationality assumptions were in fact redundant and worthless. must merely be clever enough to find and implement such a strategy. It is possible this strategy might first require to pretend to be one or more well-behaved participants of for a while, to build up the necessary reputation or otherwise get correctly positioned in ’s state space; a bit of patience and persistence on ’s part will satisfy this requirement. may also have to “buy into” enough to surmount any entry costs or stake thresholds might impose; the external funds can invoke or borrow by assumption 2 can satisfy this requirement, and are bounded by the total value of . In general, ’s openness by assumption 1 and the existence of a correctness-violating strategy by assumption 3 ensures that there exists some course of action and supply of external resources by which can position itself to violate ’s behavioral assumption.

In addition to infiltrating and positioning itself within , also invokes or borrows enough external funds and uses them to short-sell (bet against) shares of ’s value massively in the context of the external system , which (unlike ) trusts will remain operational and hold its value independently of . Provided reaches this short-selling position gradually and carefully enough to avoid revealing its strategy early, the funds must invoke or borrow for this purpose must be bounded by some fraction of the total economic value of . And provided there are at least some participants and/or observers of who believe that is secure and will remain operating correctly, and are willing to bet to that effect on , will eventually be able to build its short position.

Finally, once is positioned correctly within both and , then launches its assumption-violating behavior in that will observably cause to fail as per assumption 2. This might manifest as a denial-of-service attack, a correctness attack, or in any other fashion. The only requirement is that ’s behavior creates an observable failure, which a nontrivial number of the existing participants in believed would not happen because they believed in and its threat model. The fact that is now observed to be broken, and its basic design assumptions manifestly violated, causes the shares of ’s value to drop precipitously on external market , on which takes a handsome profit. Perhaps recovers and continues, or perhaps it fails entirely—but either way, has essentially transferred a significant fraction of system ’s economic value from system itself to ’s own short-sold position on external market . And to do so, needed only to find a way—any way—to surprise all those who believed was secure and that its threat model accurately modeled ’s real-world participants.

Even if ’s assumption-violating behavioral strategy does not break with perfect reliability, but only with some probability, can still create an expectation of positive profit from its attack by hedging its bets appropriately on . does not need a perfect attack, but merely needs to possess the correct knowledge that ’s failure probability is much higher than the other participants in believe it to be—because only knows that (and precisely when) it will violate ’s design assumptions to create that higher failure probability. Furthermore, even if ’s attack fails, and the vulnerability it exploits is quickly detected and patched, may still profit marginally from the market’s adjustment to a realization that ’s failure probability was (even temporarily) higher than most of ’s participants thought it was.

Within the context of system , ’s behavior manifests as Byzantine behavior, specifically violating the assumptions ’s designers thought participants would not exhibit and thus excluded from ’s threat model. Considered in the larger context of the external world in which is embedded, however, including the external trading system , ’s behavior is perfectly rational and economically-motivated. Thus, the very rationality of in the larger open world is precisely what motivates to break, and profit from, ’s ill-considered assumption that its participants would behave rationally.

5 Implications for Practical Systems

This type of financial attack is by no means entirely theoretical or limited to fully-digital systems such as cryptocurrencies. In our scenario, is essentially playing a game closely-analogous to the investors in credit default swaps who both contributed to, and profited handsomely from, the 2007–2008 financial crisis. as covered more recently in the film “The Big Short.”

In the cryptocurrency space, some real-world attacks we are seeing—such as increasingly-common 51 % attacks [3]—might be viewed as special cases of this metacircular attack on rationality. It is often claimed that large proof-of-work miners (or proof-of-stake holders) will not attempt 51 % attacks because doing so would undermine the value of the cryptocurrency in which they by definition hold a large stake, and hence would be “irrational.” But this argument falls apart if the attack allows the large stakeholder to reap rewards outside the attacked system, e. g., by defrauding exchanges or selling short in other systems.

Externally-motivated attacks on cryptocurrencies have been predicted before in the form of virtual protest or “Occupy Bitcoin” attacks [5], Goldfinger attacks [18] puzzle transaction attacks [23], merged mining attacks [16], hostile blockchain takeovers [7], and out-of-band variants of pay-to-win attacks [15]. All these attacks are specific instances of our argument. They have been presented in the literature as open yet solvable challenges. We are not aware, however, of any prior attempt to summarize the lessons learned and formulate a general impossibility statement.

For most practical systems, we do not even know if they are incentive compatible in the absence of an external system —i. e., where assumption 2 is violated—and probably they are not. Almost all game-theoretic treatments of (parts of) the Bitcoin protocol deliver negative results. Many attacks against specific cryptocurrency system designs are known to be profitable in expectation, such as transaction withholding [4], empty block mining [14], selfish mining [11], block withholding [11], stubborn mining [10], fork after withholding [19], and whale attacks [21] It is likely thanks only to frictions such as risk aversion and other costs that we rarely observe such attacks in large deployed systems. Many specific attacks do not even depend on assumption 1, underlining the fact that rationality is not a silver bullet even where this metacircular argument does not apply. Where it does apply, it is more general and effectively guarantees the existence of attacks against all open systems that assume participants are rational.

Another related observation is that financial markets on derivatives of a system mature in the external world (e. g., ) as grows and becomes more relevant. So in some sense, systems built on the rationality assumption are temporarily more secure only until they become fat enough targets to be eaten by their own success. We can see this effect, for example, in the growing and increasingly liquid market for hash power, which effectively thwarts Nakamoto’s [22] (or Dwork’s [9]) rule of thumb that the ratio of processors to individuals varies in a small band. Such dynamics happen in the real world, too. But there they have traditionally taken centuries or decades while in cryptocurrency space everything happens in time-lapse.

6 Limitations of the Argument

This argument is of course currently only a rough and informal sketch. An enterprising student might wish to try formalizing it, or maybe someone has already done so but we are unaware of it.

The metacircular argument certainly does not apply to all cryptocurrencies or decentralized systems. In a permissioned system, for example, in which a closed group of participants are strongly-identified and subject to legal and contractual agreements with each other, one can hope that the threat of lawsuits for arbitrarily-large damages will keep rational participants incentivized to behave correctly. Similarly, in a national cryptocurrency, which might be relatively open but only to citizens of a given country, and which require verified identities with which the police can expect to track down and jail misbehaving participants, this metacircular argument does not necessarily apply.

Apart from police enforcement, rationality assumptions may be weakened in other ways to circumvent the metacircular argument. For example, an open system might be designed according to a “weak rationality” assumption that users need incentives to join the system in the first place (e. g., mining rewards in Bitcoin), but that after having become stakeholders, most will then behave honestly. In this case, rational incentives serve only as a tool for system growth, but become irrelevant and equivalent to a strong honesty assumption in terms of the internal security of the system itself.

7 Conclusion: Irrationality Can Be Rational

Byzantine participants

Rational participants


Honest participants
Figure 3: Rational and Byzantine participants are equivalent in permissionless systems

What many in the cryptocurrency community seem to want is a system that is both permissionless and tolerant of strongly-rational behavior—either beyond the thresholds a similar a Byzantine system would tolerate (such as a rational majority), or by deriving some simplicity or efficiency benefit from assuming rationality. But in an open world in which the permissionless system is not the only game in town, a potential perfectly rational attacker can always exist, or appear at any time, whose entirely rational behavior is precisely to profit from bringing the system down by violating its assumptions on participant behavior.

So if you think you have designed a permissionless decentralized system that is cleverly secured based on rationality assumptions, you haven’t. You have merely obfuscated the rational attacker’s motive and opportunity to profit outside your system from breaking your rationality assumptions. The only practical way to eliminate this threat appears to be either to close the system and require strong identities and police protection, or else secure the system against arbitrary Byzantine behavior, thereby rendering rationality assumptions redundant and useless for security (cf. Fig. 3).


We wish to thank Jeff Allen, Ittay Eyal, Damir Filipovic, Patrik Keller, Alexander Lipton, Andrew Miller, and Haoqian Zhang for helpful feedback on earlier drafts of this work.


  • [1] Ittai Abraham, Lorenzo Alvisi, and Joseph Y. Halpern.

    Distributed computing meets game theory: Combining insights from two fields.

    ACM SIGACT News, 42(2):69–76, 2011.
  • [2] Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement, Michael Dahlin, Jean-Philippe Martin, and Carl Porth. BAR fault tolerance for cooperative services. In Proceedings of the 20th ACM Symposium on Operating Systems Principles (SOPS), pages 45–58. ACM, 2005.
  • [3] Elikem Attah. Five most prolific 51 % attacks in crypto: Verge, Ethereum Classic, Bitcoin Gold, Feathercoin, Vertcoin. Cryptoslate.com, https://tinyurl.com/yyrvxyoh, April 2019.
  • [4] Moshe Babaioff, Shahar Dobzinski, Sigal Oren, and Aviv Zohar. On Bitcoin and red balloons. In ACM Conference on Electronic Commerce, pages 56–73. ACM, 2012.
  • [5] Jörg Becker, Dominic Breuker, Tobias Heide, Justus Holler, Hans Peter Rauer, and Rainer Böhme. Can we afford integrity by proof-of-work? Scenarios inspired by the Bitcoin currency. In Rainer Böhme, editor, The Economics of Information Security and Privacy, pages 135–156. Springer, 2013.
  • [6] Rainer Böhme. A primer on economics for cryptocurrencies. Lecture slides. https://tinyurl.com/y3nezbq6, September 2019.
  • [7] Joseph Bonneau. Hostile blockchain takeovers (short paper). In Aviv Zohar, Ittay Eyal, Vanessa Teague, Jeremy Clark, Andrea Bracciali, Federico Pintore, and Massimiliano Sala, editors, Financial Cryptography and Data Security Workshops, volume 10958 of Lecture Notes in Computer Science, pages 92–100. Springer, 2018.
  • [8] Jing Chen and Silvio Micali. Algorand: A secure and efficient distributed ledger. Theoretical Computer Science, 777:155–183, 2019.
  • [9] Cynthia Dwork and Moni Naor. Pricing via processing or combatting junk mail. In Ernest F. Brickell, editor, Advances in Cryptology (CRYPTO), volume 740 of Lecture Notes in Computer Science, pages 139–147. Springer, 1992.
  • [10] Ittay Eyal. The miner’s dilemma. In IEEE Symposium on Security and Privacy (Oakland), pages 89–103. IEEE, 2015.
  • [11] Ittay Eyal and Emin Gün Sirer. Majority is not enough: Bitcoin mining is vulnerable. In Nicolas Christin and Reihaneh Safavi-Naini, editors, Financial Cryptography and Data Security, volume 8437 of Lecture Notes in Computer Science, pages 436–454. Springer, 2014.
  • [12] Eric Friedman and Paul Resnick. The social cost of cheap pseudonyms. Journal of Economics and Management Strategy, 10(2):173–199, 2001.
  • [13] Kurt Gödel. Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. Monatshefte für Mathematik und Physik, 38(1):173–198, 1931.
  • [14] Nicolas Houy. The Bitcoin mining game. Available at SSRN: https://ssrn.com/abstract=2407834, March 2014.
  • [15] Aljosha Judmayer, Nicholas Stifter, Alexei Zamyatin, Itay Tsabary, Ittay Eyal, Peter Gazi, Sarah Meiklejohn, and Edgar Weippl. Pay-to-win: Incentive attacks on proof-of-work cryptocurrencies. Cryptology ePrint Archive, Report 2019/775, 2019.
  • [16] Aljosha Judmayer, Alexei Zamyatin, Nicholas Stifter, Artemios G. Voyiatzis, and Edgar R. Weippl. Merged mining: Curse or cure? In Joaquín García-Alfaro, Guillermo Navarro-Arribas, Hannes Hartenstein, and Jordi Herrera-Joancomartí, editors, Data Privacy Management, Cryptocurrencies and Blockchain Technology, volume 10436 of Lecture Notes in Computer Science, pages 316–333. Springer, 2017.
  • [17] Aggelos Kiayias, Alexander Russell, Bernardo David, and Roman Oliynykov. Ouroboros: A provably secure proof-of-stake blockchain protocol. In Jonathan Katz and Hovav Shacham, editors, Advances in Cryptology (CRYPTO), volume 10401 of Lecture Notes in Computer Science, pages 357–388. Springer, 2017.
  • [18] Joshua Kroll, Ian Davey, and Edward Felten. The economics of Bitcoin mining, or Bitcoin in the presence of adversaries. In Workshop on Economics and Information Security (WEIS), Washington, DC, 2013.
  • [19] Yujin Kwon, Dohyun Kim, Yunmok Son, Eugene Vasserman, and Yongdae Kim. Be selfish and avoid dilemmas: Fork after withholding (FAW) attacks on Bitcoin. In ACM Conference on Computer and Communications Security (CCS), pages 195–209. ACM, 2017.
  • [20] Leslie Lamport, Robert Shostak, and Marshall Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382–401, 1982.
  • [21] Kevin Liao and Jonathan Katz. Incentivizing blockchain forks via whale transactions. In Michael Brenner, Kurt Rohloff, Joseph Bonneau, Andrew Miller, Peter Y. A. Ryan, Vanessa Teague, Andrea Bracciali, Massimiliano Sala, Federico Pintore, and Markus Jakobsson, editors, Financial Cryptography and Data Security Workshops, volume 10323 of Lecture Notes in Computer Science, pages 264–279. Springer, 2017.
  • [22] Satoshi Nakamoto. Bitcoin: A peer-to-peer electronic cash system. https://bitcoin.org/bitcoin.pdf, 2008.
  • [23] Jason Teutsch, Sanjay Jain, and Prateek Saxena. When cryptocurrencies mine their own business. In Jens Grossklags and Bart Preneel, editors, Financial Cryptography and Data Security, volume 9603 of Lecture Notes in Computer Science, pages 499–514. Springer, 2016.
  • [24] TU Vienna. 1st International Summer School on Security & Privacy for Blockchains and Distributed Ledger Technologies. https://bdlt.school, September 2019.