# Algorand: Scaling Byzantine Agreements for Cryptocurrencies Content type: Research Paper Summary: This paper introduces Algorand, a novel permissionless blockchain protocol designed to overcome the scalability, security, and decentralization challenges faced by early cryptocurrencies. Algorand employs a pure Proof-of-Stake (PoS) approach to establish Byzantine Agreement, where users are secretly and randomly selected via a verifiable random function (VRF) – termed 'cryptographic sortition' – to form committees responsible for proposing and validating blocks. This committee-based consensus me Key concepts: Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, Nickolai Zeldovich, algorand, proof of stake, consensus, byzantine fault tolerance, scalability, finality, cryptocurrency
Paperadvanced

Algorand: Scaling Byzantine Agreements for Cryptocurrencies

Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, Nickolai Zeldovich

Academic PaperJanuary 2017

Abstract

This paper introduces Algorand, a novel permissionless blockchain protocol designed to overcome the scalability, security, and decentralization challenges faced by early cryptocurrencies. Algorand employs a pure Proof-of-Stake (PoS) approach to establish Byzantine Agreement, where users are secretly and randomly selected via a verifiable random function (VRF) – termed 'cryptographic sortition' – to form committees responsible for proposing and validating blocks. This committee-based consensus mechanism is designed to be highly efficient, offering instant transaction finality without requiring forks. The protocol achieves security under the assumption that a supermajority of the total stake is controlled by honest participants, even with a minority of honest online users. The paper details the mechanism for rapid committee re-selection per block, preventing malicious actors from corrupting a committee before it completes its task. Algorand's design contributes significantly to the field of PoS consensus by introducing a robust and scalable solution that aims to balance security with performance.

Key Findings

  • 1Algorand achieves a permissionless Byzantine Agreement through a pure Proof-of-Stake mechanism.
  • 2Committee members for block proposal and validation are secretly and randomly selected using cryptographic sortition.
  • 3The protocol offers instant transaction finality, eliminating the possibility of forks.
  • 4Security is maintained even if a supermajority of the total stake is malicious, provided a certain threshold of online users are honest.
  • 5The committee re-selection process is rapid, mitigating the risk of malicious takeover.

Topics

algorandproof of stakeconsensusbyzantine fault tolerancescalabilityfinalitycryptocurrency

Citation

Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, Nickolai Zeldovich (2017). Algorand: Scaling Byzantine Agreements for Cryptocurrencies. Academic Paper. https://dl.acm.org/doi/pdf/10.1145/3132747.3132783

BibTeX

@misc{algorandscaling2017,
  title = {Algorand: Scaling Byzantine Agreements for Cryptocurrencies},
  author = {Yossi Gilad and Rotem Hemo and Silvio Micali and Georgios Vlachos and Nickolai Zeldovich},
  year = {2017},
  howpublished = {\url{https://dl.acm.org/doi/pdf/10.1145/3132747.3132783}},
}

Knowledge Explorer

Explore Related Concepts

See how Algorand: Scaling Byzantine Agreements for Cryptocurrencies connects to glossary terms, books, and other research in the Knowledge Graph.

Explore Connections