Algorand: The Truly Distributed Ledger
summary
Algorand claims a working pure proof-of-stake ledger that picks proposers and a roughly 1,000-strong committee by cryptographic sortition (verifiable signatures + hashing), then runs a lightweight Byzantine Agreement so blocks finalize immediately. Computation is trivial (adds, compares, signatures), security tolerates a powerful adversary (up to ~1/3 corrupt), and the team cites a practical fork probability like 10^-18. The system adds Dutch-auction token issuance, compact “vault” sync, atomic swaps and privacy paths; the design emphasizes instant finality and planetary-scale efficiency.
AI-written summary · about
chapters (23)
- 0:00Introduction
- 4:07The Blockchain Promise
- 4:39Aspirations
- 5:05Blockchain by Design
- 6:00Blockchain is not acceptable
- 6:20Technical constructs
- 6:39The challenge
- 7:23Proof of work
- 11:00Centralized vs decentralized
- 13:55Bonded proof of stake
- 17:42Pure proof of stake
- 23:53Genesis block
- 28:35Summary
- 33:12Architecture
- 39:53How it works
- 40:33Selecting by committee
- 47:48Design from scratch
- 48:06Byzantine agreement
- 49:32Different steps different people
- 50:28Relationship between committee members
- 51:21Bad and powerful adversary
- 52:14New power goal
- 59:24Is Algorand a winner
related talks
32mAlgorand: A Secure, Scalable and Decentralized Blockchain
02h 44mBlockchain consensus mechanisms
49mAlgorand Smart Contract Architecture
42mBeyond Blockchain: Convergent Consensus
01h 00mDecentralized Randomness Protocols
21mBattle of the blockchains
47mCant we just agree
06mAnza - Engineering Internet Capital Markets