ALGORAND: The Efficient and Democratic Ledger

The problem the paper names

Classical Byzantine agreement is expensive if every holder talks to every other holder. Bitcoin-style longest chain is permissionless but slow to become confident. Algorand wants a committee that is large enough to represent stake and small enough to finish quickly, without publishing the committee in advance.

What the design proposes

• Cryptographic sortition lets a holder learn privately, from their own key and a public seed, whether they were selected.
• A verifier can check the selection proof after the message appears. Before that, the holder is not a target.
• Player replaceability means the next step draws a new committee. Bribing the last one does not carry forward.

How the mechanism is specified

• The ledger is a sequence of certified blocks, not a race of forks that the heaviest chain wins later.
• Safety is argued from the stake-weighted honesty of the selected sets.
• The 2017 systems paper by Gilad, Hemo, Micali, Vlachos and Zeldovich is the implementation companion, not a different project.

What this page does not treat as proven

• Sortition only helps if the underlying stake and keys are what the paper assumes.
• The paper is not a description of later Algorand product features or relay networks.
• Committee designs still need an account of who can censor inclusion. Certification is not the same as open membership of every transaction.

Why a venture studio still reads it

The idea worth stealing, carefully, is replaceability: do not leave a standing set of signers who can be found and pressured. A venture that publishes its validator set on a webpage has not adopted this property.