IDEAS home Printed from https://ideas.repec.org/p/chf/rpseri/rp1775.html

The Blockchain Folk Theorem

Author

Listed:
  • Bruno Biais

    (University of Toulouse 1)

  • Christophe Bisiere

    (University of Toulouse)

  • Matthieu Bouvard

    (McGill University)

  • Catherine Casamatta

    (University of Toulouse 1)

Abstract

Blockchains are distributed ledgers, operated within peer-to-peer networks. If reliable and stable, they could offer a new, cost effective way to record transactions, but are they? We model the proof-of-work blockchain protocol as a stochastic game and analyse the equilibrium strategies of rational, strategic miners. Mining the longest chain is a Markov perfect equilibrium, without forking, in line with Nakamoto (2008). The blockchain protocol, however, is a coordination game, with multiple equilibria. There exist equilibria with forks, leading to orphaned blocks and persistent divergence between chains. We also show how forks can be generated by information delays and software upgrades. Last we identify negative externalities implying that equilibrium investment in computing capacity is excessive.

Suggested Citation

  • Bruno Biais & Christophe Bisiere & Matthieu Bouvard & Catherine Casamatta, 2017. "The Blockchain Folk Theorem," Swiss Finance Institute Research Paper Series 17-75, Swiss Finance Institute.
  • Handle: RePEc:chf:rpseri:rp1775
    as

    Download full text from publisher

    File URL: https://papers.ssrn.com/sol3/papers.cfm?abstract_id=3108601
    Download Restriction: no
    ---><---

    Other versions of this item:

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
    • G2 - Financial Economics - - Financial Institutions and Services
    • L86 - Industrial Organization - - Industry Studies: Services - - - Information and Internet Services; Computer Software

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:chf:rpseri:rp1775. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Ridima Mittal (email available below). General contact details of provider: https://edirc.repec.org/data/fameech.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.