This is an original educational summary of the research paper named below, not a reproduction of it. The paper’s authors retain its copyright.
Browse: All whitepapers · Algorand Ecosystem Directory
Paper and scope
Algorand: Scaling Byzantine Agreements for Cryptocurrencies was written by Yossi Gilad, Rotem Hemo, Silvio Micali, Georgios Vlachos, and Nickolai Zeldovich, and published at ACM’s Symposium on Operating Systems Principles (SOSP) in 2017. This page focuses on that conference paper and its proposed design.
It is related to, but distinct from, the 2017 ALGORAND* whitepaper by Jing Chen and Silvio Micali (arXiv:1607.01341v9), which the Algorand Foundation published on May 26, 2017. The SOSP paper describes Chen and Micali’s technical report as an earlier version of Algorand. A later Chen–Micali paper, Algorand: A Secure and Efficient Distributed Ledger, appeared in 2019; it is another publication, not the SOSP paper.
How the 2017 design works
The paper combines a Byzantine agreement protocol called BA* with cryptographic sortition. A participant uses a verifiable random function (VRF) and public blockchain information to privately check whether it was selected for a protocol step. If selected, it sends a proof that others can verify. Selection is weighted by the money assigned to participants in the paper’s model, so creating extra pseudonymous accounts does not by itself add voting weight.
BA* uses randomly selected committees to agree on a block. The paper’s design changes participants between protocol steps and uses short-lived protocol state; these choices are intended to limit targeted attacks against people whose selection has become visible. They reduce a particular exposure described by the authors. They do not mean that every denial-of-service attack is impossible.
Security assumptions and limits
The paper’s permissionless model assumes that more than two-thirds of the money used to weight participation is controlled by honest users. That is a stake-weighted security assumption, not a claim about the number of accounts or machines. The paper also specifies assumptions about message delivery and the network. Its guarantees should be read within that formal model; they are not unconditional promises about every real-world failure or attack.
What the experiments showed
The authors evaluated their prototype on 1,000 Amazon EC2 virtual machines while simulating up to 500,000 users. They reported transaction confirmation in under a minute and throughput 125 times Bitcoin’s in their experiment. These are results from the paper’s prototype and test setup, not current mainnet measurements or a like-for-like benchmark of today’s networks.
How this relates to today’s Algorand
Current Algorand developer documentation describes a Pure Proof of Stake protocol with block proposal, soft vote, and certify vote stages. It says a certified block’s transactions are final and that a certifying vote that misses quorum can lead to recovery mode. The documentation currently reports an average block time of 2.82 seconds. These are descriptions of the current network and its documentation, separate from the 2017 prototype and measurements.
Related Terms
See Also
- Ouroboros: A Proof-of-Stake Blockchain Protocol
- The Stellar Consensus Protocol
- Ethereum Beacon Chain and Proof of Stake
Social Media Sentiment
A thread in r/AlgorandOfficial discussing blockchain finality rankings shows a narrow debate about what “instant finality” means. One commenter asks whether a ranking is describing block-production time or the point at which a confirmed block can be reversed; another questions the ranking methodology and how it treats decentralization measures. This small, self-selected discussion sample illustrates why those metrics need clear definitions. It does not represent all Algorand users or establish network performance.
Last updated: 2026-10
Sources
- Gilad, Hemo, Micali, Vlachos, and Zeldovich, Algorand: Scaling Byzantine Agreements for Cryptocurrencies (ACM SOSP 2017), MIT CSAIL copy (DOI: 10.1145/3132747.3132757).
- Algorand Foundation, 2017 announcement of the separate Algorand Whitepaper, with the linked ALGORAND* paper by Jing Chen and Silvio Micali.
- Algorand Foundation, 2019 article on Chen and Micali’s Algorand: A Secure and Efficient Distributed Ledger.
- Algorand Developer Portal, current consensus overview and current block, timing, and finality documentation.
- Reddit discussion about finality rankings in r/AlgorandOfficial (a limited discussion sample).