IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v70y2024i6p3827-3840.html
   My bibliography  Save this article

Lightning Network Economics: Channels

Author

Listed:
  • Paolo Guasoni

    (School of Mathematical Sciences, Dublin City University, D09 W6Y4 Dublin, Ireland; Dipartimento di Statistica, Università di Bologna, 40126 Bologna, Italy)

  • Gur Huberman

    (Columbia Business School, New York, New York 10027)

  • Clara Shikhelman

    (Chaincode Labs, New York, New York 10017)

Abstract

Compared with existing payment systems, Bitcoin’s throughput is low. Designed to address Bitcoin’s scalability challenge, the Lightning Network (LN) is a protocol allowing two parties to secure bitcoin payments and escrow holdings between them. In a lightning channel, each party commits collateral toward future payments to the counterparty and payments are cryptographically secured updates of collaterals. The network of channels increases transaction speed and reduces blockchain congestion. This paper (i) identifies conditions for two parties to optimally establish a channel, (ii) finds explicit formulas for channel costs, (iii) obtains the optimal collaterals and savings entailed, and (iv) derives the implied reduction in congestion of the blockchain. Unidirectional channels costs grow with the square-root of payment rates, while symmetric bidirectional channels with their cubic root. Asymmetric bidirectional channels are akin to unidirectional when payment rates are significantly different, otherwise to symmetric bidirectional.

Suggested Citation

  • Paolo Guasoni & Gur Huberman & Clara Shikhelman, 2024. "Lightning Network Economics: Channels," Management Science, INFORMS, vol. 70(6), pages 3827-3840, June.
    • Handle: RePEc:inm:ormnsc:v:70:y:2024:i:6:p:3827-3840
    DOI: 10.1287/mnsc.2022.01664
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.2022.01664
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.2022.01664?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:ormnsc:v:70:y:2024:i:6:p:3827-3840. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.