A Primer on Economics for Cryptocurrencies School on Security & - - PowerPoint PPT Presentation

a primer on economics for cryptocurrencies
SMART_READER_LITE
LIVE PREVIEW

A Primer on Economics for Cryptocurrencies School on Security & - - PowerPoint PPT Presentation

A Primer on Economics for Cryptocurrencies School on Security & Privacy for Blockchains and Distributed Ledger Technologies Rainer Bhme Motivation We have tried quite some time ago to explain Bitcoin to economists: Bhme, R.,


slide-1
SLIDE 1

A Primer on Economics for Cryptocurrencies

School on Security & Privacy for Blockchains and Distributed Ledger Technologies

Rainer Böhme

slide-2
SLIDE 2

Motivation

We have tried – quite some time ago – to explain Bitcoin to economists:

  • Böhme, R., Christin, N., Edelman, B., and Moore, T. Bitcoin: Economics, Technology,

and Governance. Journal of Economic Perspectives, 29, 2 (2015), 213–238

  • Today I am trying to do the opposite.

Rainer Böhme, Vienna, 2 September 2019 4

slide-3
SLIDE 3

Outline

  • 1. Rational Agents and Adversaries
  • 2. Efficient Markets
  • 3. Market Concentration

Rainer Böhme, Vienna, 2 September 2019 6

slide-4
SLIDE 4

Economics

predict behavior model

Illustration: xkcd.com

Rainer Böhme, Vienna, 2 September 2019 7

slide-5
SLIDE 5

Game Theory

A mathematical approach to model strategic behavior

Interpretation as generalizations of . . .

  • a. Probability theory – replace uncertainty with rationality assumption
  • b. Optimization – objective function anticipates optimal response

Mechanism design (MD) “Reverse game theory”: define payouts to incentivize intended behavior The protocol is the mechanism. Users are agents – “players”.

Rainer Böhme, Vienna, 2 September 2019 9

slide-6
SLIDE 6

Classification of Security Games

Attacker vs Defender

  • for security investment and tactics
  • often zero sum

Defender vs Defender

  • for security policy
  • often non-zero sum
  • attackers are “nature”, i. e., stochastic but not strategic

Attacker vs Protocol Designer (less common)

  • “rational” protocol design inspired from “rational cryptography”
  • defenders are “nature”

Garay, J. et al. Rational Protocol Design: Cryptography Against Incentive-driven Adversaries, 2013.

Rainer Böhme, Vienna, 2 September 2019 11

slide-7
SLIDE 7

Weak Identities

Games without central identity provider:

Douceur, J. R. The Sybil Attack. In P . Druschel, F . Kaashoek und A. Rowstron (eds.), Peer-to-peer Systems. LNCS 2429, Springer, Berlin Heidelberg, 2002, 251–260.

Rainer Böhme, Vienna, 2 September 2019 12

slide-8
SLIDE 8

Weak Identities

Games without central identity provider:

Douceur, J. R. The Sybil Attack. In P . Druschel, F . Kaashoek und A. Rowstron (eds.), Peer-to-peer Systems. LNCS 2429, Springer, Berlin Heidelberg, 2002, 251–260.

Rainer Böhme, Vienna, 2 September 2019 12

slide-9
SLIDE 9

Weak Identities

Games without central identity provider:

Douceur, J. R. The Sybil Attack. In P . Druschel, F . Kaashoek und A. Rowstron (eds.), Peer-to-peer Systems. LNCS 2429, Springer, Berlin Heidelberg, 2002, 251–260.

Rainer Böhme, Vienna, 2 September 2019 12

slide-10
SLIDE 10

Behavior-regulating Assumptions

Building a bridge between distributed systems and economics: textbook economics rational “Byzantine” strong identities weak identities distributed systems blockchain systems

Rainer Böhme, Vienna, 2 September 2019 13

slide-11
SLIDE 11

Principles of Economics

Rational choice

  • Autonomous decision makers – agents – take actions to maximize their objective

function – utility. ui(ai) Externality

  • Actions taken by one agent affect the utility of other agents.

uj(. . . , ai, . . . ) Social welfare – protocol objective

  • Global outcome from all local decisions.
  • i

ui(. . . , ai, . . . )

Rainer Böhme, Vienna, 2 September 2019 14

slide-12
SLIDE 12

Types of Goods

Club good Common good Private good Public good Excludable Non-excludable Rivalrous Non-rivalrous

(externality) (access control)

blockchain read access

Rainer Böhme, Vienna, 2 September 2019 15

slide-13
SLIDE 13

Technology Stack

Execution environment Infrastructure

Application State machine Consensus protocol Network Ledger

· · · Nodes · · ·

Pseudonyms

weak identities (public keys) weak identities (IP hosts)

Rainer Böhme, Vienna, 2 September 2019 16

slide-14
SLIDE 14

Public Blockchains Need Cryptocurrencies

A public distributed ledger has characteristics of a public good.

  • Cost: maintenance, in particular proof-of-work, born by nodes
  • Benefit: depends on application, enjoyed by pseudonyms
  • Mismatch in value, time, and parties !

Cross-layer incentive mechanism Blockchain systems need a payment method, so that pseudonyms can pay nodes. T wo common schemes (also in combination):

  • 1. Money creation (“minting”) → all accounts pay by devaluation
  • 2. Transaction tax (“fee”) → individuals pay for write access

Note: Minting is often prescribed in the protocol, while fees are set (in principle) by market mechanisms at runtime.

Rainer Böhme, Vienna, 2 September 2019 17

slide-15
SLIDE 15

Bitcoin Minting Rewards

Nodes pay pseudonyms for the provision of a public good

Blocks Time 2009 210 K 2013 420 K 2017 630 K 2021 840 K 2025 1050 K 2029 1260 K 2033

50 BTC/block

|

25 BTC/block

|

12.5

|

6.25

|

|

upper bound of money supply: 21 million BTC

Bitcoin in circulation

Rainer Böhme, Vienna, 2 September 2019 18

slide-16
SLIDE 16

Different Roles of Network Participants

Satoshi’s likely working assumption network relay receiving party saver miner paying party

Rainer Böhme, Vienna, 2 September 2019 19

slide-17
SLIDE 17

Different Roles of Network Participants

Specialization in the real world network relay receiving party saver miner paying party pool

  • perators

wallets & exchanges payment services

Rainer Böhme, Vienna, 2 September 2019 19

slide-18
SLIDE 18

The Enemy of Decentralization

Economies of scale

  • utput

total cost Proof-of-work fraction of mining cost share of block rewards “fair” progressive force to concentration The area under the diagonal (progressive) is not achievable with weak identities.

Rainer Böhme, Vienna, 2 September 2019 20

slide-19
SLIDE 19

Incentive Compatibility

w(P) > w(P) + s(P) (1)

  • t=t0

E [wt(P)] δt−t0 >

  • t=t0

E

  • wt(P)
  • δt−t0

(2) uP(w(P)) − c(P) > uP(w(P)) − c(P) + s(P) (3)

P follow protocol w wealth in protocol coins P worst of all other actions (attacks) u utility, reflecting real-world preferences c cost in units of utility

δ

discount factor < 1, e.g., δ = .97 s side-payment (“bribe”, in varying units)

Rainer Böhme, Vienna, 2 September 2019 21

slide-20
SLIDE 20

The Fallacy’s Origin

“The incentive may help encourage nodes to stay honest. If a greedy attacker is able to assemble more CPU power than all the honest nodes, he would have to choose between using it to defraud people [ . . . ], or using it to generate new coins. He ought to find it more profitable to play by the rules, [. . . ] than to undermine the system and the validity of his own wealth.”

Satoshi Nakamoto 2008, p. 4

Rainer Böhme, Vienna, 2 September 2019 22

slide-21
SLIDE 21

Fallacy Continued

  • A. Kiayias et al. CRYPTO 2017 (Ouroboros), p. 47

“[I]n in our PoS based protocol, malicious slot leaders [ . . . ] not only risk to forego any potential profit they would earn from behaving honestly but may also risk to lose equity. Notice that slot leaders must have money invested in the system in order to be able to generate blocks and if an attack against the system is observed it might bring currency value down. [ . . . ] Currently our rationality model does not formally encompass this attack strategy [ . . . ].”

Rainer Böhme, Vienna, 2 September 2019 23

slide-22
SLIDE 22

Behavior-regulating Assumptions

Building a bridge between distributed systems and economics: rational “Byzantine” attackers with payments and contracts

Rainer Böhme, Vienna, 2 September 2019 25

slide-23
SLIDE 23

Secure Capacity Under the Longest Chain Rule

(against one type of economic attack ⇒ lower bound) λ

bribe loading > 1 r block reward to miner v double-spendable value v0 r0 v1 r1

. . .

vk rk 1’

. . .

k’ k+1’

Security condition:

k−6

  • i=1

vk

< λ (1 + k−1)

k

  • i=1

ri

Bonneau, J. Why Buy When You Can Rent? FC Workshops, 2016; Gervais, A. et al. On the Security and Performance of Proof

  • f Work Blockchains. ACM CCS, 2016; Budish, E. The Economic Limits of Bitcoin and the Blockchain. 2018; Auer, R. Beyond

the Doomsday Economics of “Proof-of- Work” in Cryptocurrencies. BIS, 2019. (and others)

Rainer Böhme, Vienna, 2 September 2019 27

slide-24
SLIDE 24

Types of Goods

Club good Common good Private good Public good Excludable Non-excludable Rivalrous Non-rivalrous

(externality) (access control)

blockchain secure capacity

Rainer Böhme, Vienna, 2 September 2019 28

slide-25
SLIDE 25

Outline

  • 1. Rational Agents and Adversaries
  • 2. Efficient Markets
  • 3. Market Concentration

Rainer Böhme, Vienna, 2 September 2019 29

slide-26
SLIDE 26

Motivation

28 October 2016: Zcash launched Source: coinwarz.com, accessed on 23 January 2017

Rainer Böhme, Vienna, 2 September 2019 30

slide-27
SLIDE 27

Mining Resource Allocation as a Game

T wo chains with compatible proof-of-work puzzles and fixed solving capacity: Chain A expected utility 1 per period Player i allocates mining power ai ∈ [0, 1]. Chain B expected utility δ < 1 per period Player i allocates mining power 1 − ai. Payoff function for two homogeneous and risk neutral miners i and ¬i yi = ai ai + a¬i

+ δ · (1 − ai) (1 − ai) + (1 − a¬i)

utility = return in fiat currency; expectations over realizations of r. v. and in anticipation of difficulty adjustments

Rainer Böhme, Vienna, 2 September 2019 31

slide-28
SLIDE 28

Step 1: Pure Allocations

Payoffs (yi, y¬i) in normal form representation: Player ¬i Chain A Chain B Player i a¬i = 1 a¬i = 0 Chain A: ai = 1

1

2, 1 2

  • (1, δ)

Chain B: ai = 0

(δ, 1) δ

2, δ 2

  • 1. “Greedy” is not a Nash equilibrium if δ > 1

2.

  • 2. “Anti-greedy” is never an equilibrium.
  • 3. Coordination on different chains are welfare-maximizing equilibria, but . . .

Rainer Böhme, Vienna, 2 September 2019 32

slide-29
SLIDE 29

Step 2: Best Response for Mixed Allocations

a¬i: other player’s allocation 1 ai: best response allocation 1

δ =

9 10

δ =

2 10

a∗

i = 1

δ+1

is NE

Rainer Böhme, Vienna, 2 September 2019 33

slide-30
SLIDE 30

Confirmation for N ≥ 2 Symmetric Players

0 a¬i: all other players’ allocations 1 ai: best response allocation 1 N = 2 N = 3 N = 5 N = 9

δ =

7 10 Rainer Böhme, Vienna, 2 September 2019 34

slide-31
SLIDE 31

Mining Resource Allocation as a Game

T wo chains with compatible proof-of-work puzzles and fixed solving capacity: Chain A expected utility 1 per period Player i allocates mining power ai ∈ [0, 1]. Chain B expected utility δ < 1 per period Player i allocates mining power 1 − ai. Parameter δ contains information on the exchange rate ratio

δ = rB

rA

· pB

pA

· ∆tA ∆tB

target block times block rewards in units of cryptocurrency utility = return in fiat currency; expectations over realizations of r. v. and in anticipation of difficulty adjustments

Rainer Böhme, Vienna, 2 September 2019 35

slide-32
SLIDE 32

Empirical Validation

Chain B: Bitcoin Cash

Hash share allocated to chain A

Chain A: Bitcoin

.85 .90 .95 1.0 Dec 2018 Jan 2019 Feb Mar Apr May Jun

equilibrium (from market prices) actual

Bissias, G., Levine, B. N., and Thibodeau, D. Greedy but Cautious: Conditions for Miner Convergence to Resource Allocation

  • Equilibrium. 2019. Data reused for own visualization with friendly permission.

Rainer Böhme, Vienna, 2 September 2019 36

slide-33
SLIDE 33

Empirical Validation

Chain B: Bitcoin SV

Hash share allocated to chain A

Chain A: Bitcoin

.85 .90 .95 1.0 Dec 2018 Jan 2019 Feb Mar Apr May Jun

equilibrium (from market prices) actual

Bissias, G., Levine, B. N., and Thibodeau, D. Greedy but Cautious: Conditions for Miner Convergence to Resource Allocation

  • Equilibrium. 2019. Data reused for own visualization with friendly permission.

Rainer Böhme, Vienna, 2 September 2019 36

slide-34
SLIDE 34

Empirical Validation

Chain B: Ethereum Classic

Hash share allocated to chain A

Chain A: Ethereum

.85 .90 .95 1.0 Dec 2018 Jan 2019 Feb Mar Apr May Jun

equilibrium (from market prices) actual

Bissias, G., Levine, B. N., and Thibodeau, D. Greedy but Cautious: Conditions for Miner Convergence to Resource Allocation

  • Equilibrium. 2019. Data reused for own visualization with friendly permission.

Rainer Böhme, Vienna, 2 September 2019 36

slide-35
SLIDE 35

Empirical Validation

Chain B: Bitcoin Cash

Hash share allocated to chain A

Chain A: Bitcoin SV

0.2 0.4 0.6 0.8 1.0 Dec 2018 Jan 2019 Feb Mar Apr May Jun

equilibrium (from market prices) actual

Bissias, G., Levine, B. N., and Thibodeau, D. Greedy but Cautious: Conditions for Miner Convergence to Resource Allocation

  • Equilibrium. 2019. Data reused for own visualization with friendly permission.

Rainer Böhme, Vienna, 2 September 2019 36

slide-36
SLIDE 36

Arbitrage

Definition Simultaneous purchase and sale of the same or a similar asset in two different markets for an almost risk-free profit Between locations

(two-point arbitrage)

1 e

1 p1 BTC p2 p1 > 1 e

Between assets

(three-point arbitrage) BTC EUR ETH BTC

ETH

EUR

−1

1 e

> 1 e

NEW: between chains

BTC

BCH

−1 δ < 1 BCH

  • pportunity cost

k hashes reward r1 1 BCH More important than arbitrage: absence of arbitrage ⇐ economic equilibrium

Harrison, J. M. and Kreps, D. M. Martingales and Arbitrage in Multiperiod Security Markets. Journal of Economic Theory, 1979.

Rainer Böhme, Vienna, 2 September 2019 37

slide-37
SLIDE 37

Efficient Markets

The no-arbitrage condition gives us the same equilibrium with fewer assumptions. Our model

Chain A Chain B

δ = 1

4

The real world

Chain A Chain B Chain C

δ = 1

4

Rational pricing: every “irrational” behavior of some miner creates an arbitrage

  • pportunity which is exploited for profit by at least one other miner.

Law of one price (blockchain version): the marginal miner can expect the same fiat return per hash on every chain.

Rainer Böhme, Vienna, 2 September 2019 38

slide-38
SLIDE 38

Outline

  • 1. Rational Agents and Adversaries
  • 2. Efficient Markets
  • 3. Market Concentration

Rainer Böhme, Vienna, 2 September 2019 39

slide-39
SLIDE 39

How to Make Money

How Silicon Valley transformed investor mindsets: 1985 Profit 2000 Revenue 2015 “Eyeballs” “bargain-then-ripoff”

The eyeballs metaphor is borrowed from Zuboff’s 2015 essay on “surveillance capitalism”.

Rainer Böhme, Vienna, 2 September 2019 40

slide-40
SLIDE 40

Profit and Market Structure

quantity q price p a linear demand: p = a − bq = a − b(qi + q¬i) c

marginal cost

competition monopoly or cartel

Cournot duopoly

Stackelberg duopoly

⋆ ⋆Bertrand duopoly

quantity is less elastic than price

Rainer Böhme, Vienna, 2 September 2019 41

slide-41
SLIDE 41

Types of Goods

Club good Common good Private good Public good Excludable Non-excludable Rivalrous Non-rivalrous

(externality) (access control)

blockchain write access

Rainer Böhme, Vienna, 2 September 2019 43

slide-42
SLIDE 42

Quantity Decisions in Blockchain Space

  • Mining power

— unconventional economics: “contest”

  • Permissionless blockchain space

— competitive-then-price discriminating

  • Permissioned blockchain space

— cartel? Cournot?

  • Differentiated virtual assets (tokens)

— Bertrand?

  • Off-chain payment channel capacity

— Stackelberg? Cournot?

  • Investment in gas options (storage space, gas tokens)

— Stackelberg?

  • . . .

It requires some creativity to apply models of oligopoly from economics textbooks to markets governed by distributed ledgers. Investors, beware.

Dimitri, N. Bitcoin Mining as a Contest. Ledger, 2017.

Rainer Böhme, Vienna, 2 September 2019 45

slide-43
SLIDE 43

T wo Opposing Views

Competition and the blockchain

  • ptimistic

critical

L I N K T O P R I V A C Y ! “Monopoly without monopolist”

  • Benefits of a single platform

(mainly network effects)

  • Decentralized operation avoids

the dead-weight loss of monopolies.

“Tension between decentralized consensus and information distribution”

  • Risk pooling gives power to specialized

parties (→ oligopoly of mining pools).

  • Transparency encourages monitoring and

punishment of deviant behavior (→ cartel).

  • Is coordination on the same protocol

anti-competitive in the first place?

Huberman, G., Leshno, J. D. and Moallemi, C. Monopoly without a Monopolist: An Economic Analysis of the Bitcoin Payment System, 2017; Cong, L. W. and He, Z. Blockchain Disruption and Smart Contracts. Review of Financial Studies 32 (5), 2019. Malik, N. Aseri, M., Singh P . V. and Srinivasan, K. Why Bitcoin will Fail to Scale, WEIS 2019.

Rainer Böhme, Vienna, 2 September 2019 46

slide-44
SLIDE 44

Summary

  • 1. Rational Agents and Adversaries

Bad news: rational attackers are (almost) as strong as Byzantine ones

  • 2. Efficient Markets

Good news: efficient markets is where economic theory works (best)

  • 3. Market Concentration

Good news: blockchain (security) economics are sufficiently distinct to merit many exciting and interdisciplinary PhD theses . . .

Rainer Böhme, Vienna, 2 September 2019 48

slide-45
SLIDE 45

Lesson Learned

Club good Common good Private good Public good Excludable Non-excludable Rivalrous Non-rivalrous

(externality) (access control)

blockchain read access blockchain write access blockchain secure capacity

Rainer Böhme, Vienna, 2 September 2019 49

slide-46
SLIDE 46

What’s Missing ?

Concepts omitted in this primer

  • Time and repeated games
  • Risk and uncertainty
  • Information asymmetries
  • Bounded rationality
  • Econometrics

Other relevant topics

  • Monetary economics
  • Network economics & adoption
  • Market mechanisms
  • Economics of crime
  • Economics of privacy

Rainer Böhme, Vienna, 2 September 2019 50

slide-47
SLIDE 47

Thank you for your attention.

A Primer on Economics for Cryptocurrencies

rainer.boehme @ uibk.ac.at