IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-031-07535-3_3.html
   My bibliography  Save this book chapter

Consensus Algorithms for Blockchain

In: Handbook on Blockchain

Author

Listed:
  • Hyunsoo Kim

    (Seoul National University)

  • Taekyoung Ted Kwon

    (Seoul National University)

Abstract

A consensus algorithm is an essential component of a blockchain, responsible for reaching an agreement among decentralized nodes. It also determines the performance and characteristics of an application. With more than 2,000 different cryptocurrencies currently in use, we face an ever-growing list of consensus algorithms. Furthermore, the inherent complexity of consensus algorithms and their rapid evolutions make it hard to assess their suitability for blockchain applications. Understanding the pros and cons of a consensus algorithm is crucial in designing new blockchain services and developing more advanced algorithms. We propose a framework with comprehensive criteria to evaluate consensus algorithms in terms of performance, security, and decentralization. In addition, we present the operational mechanisms and analyze the characteristics of mainstream consensus algorithms, namely, proof-based algorithms such as Proof of Work (PoW) and Proof of Stake (PoS), and vote-based algorithms with Byzantine Fault Tolerance (BFT). The algorithms are evaluated based on our proposed framework to provide a better understanding. We hope this article leads us to identify research challenges and opportunities of consensus algorithms.

Suggested Citation

  • Hyunsoo Kim & Taekyoung Ted Kwon, 2022. "Consensus Algorithms for Blockchain," Springer Optimization and Its Applications, in: Duc A. Tran & My T. Thai & Bhaskar Krishnamachari (ed.), Handbook on Blockchain, pages 85-118, Springer.
    • Handle: RePEc:spr:spochp:978-3-031-07535-3_3
    DOI: 10.1007/978-3-031-07535-3_3
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    More about this item

    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:spr:spochp:978-3-031-07535-3_3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.