Algorand: A Secure, Scalable and Decentralized Blockchain
summary
A permissionless chain implements a pure proof-of-stake system that never requires token locking or punishments, runs a live mainnet, and gives immediate finality (no forks) while tolerating a dynamic adversary so long as >2/3 of stake is honest. Committee members self-select each step via cryptographic self-selection (VRFs and unique signatures), using a lookback of ~80–100 rounds and ~4.5s rounds; parameters target failure ≈10^−18 and nodes can run on low‑end hardware like a Raspberry Pi.
AI-written summary · about
chapters (16)
- 0:00Intro
- 2:38Pure Proof Stake System
- 4:55Permissionless
- 5:55Protocol
- 6:36Guarantees
- 9:20Structure
- 10:50Challenges
- 14:05Public Selection
- 16:25Self Selection
- 16:40Physical Lottery
- 17:40SelfSelection
- 23:25Unique Signature
- 26:30Replace Parity
- 27:30Token Selection
- 29:54Other Ideas
- 30:15Summary
related talks
01h 10mAlgorand: The Truly Distributed Ledger
01h 00mDecentralized Randomness Protocols
47mCant we just agree
42mBeyond Blockchain: Convergent Consensus
23mProduct Driven R&D Strategy and Report
27mBlockchains, Blockweaves and the De centralised Revolution
42mStochastic reasoning in decentralised systems
30mCan Private Proof-of-Stake Blockchains Obtain All of Safety, Liveness, and Privacy?