Decentralized Randomness Protocols
summary
Explains concrete tradeoffs and fixes: which randomness schemes reveal the seed early, which let adversaries bias outcomes, and what actually scales to thousands of validators. Covers VRF used by Algorand and Ouroboros (no seed revealed until a block), deterministic stake scheduling (predictable), Randao with slashing (commit‑reveal plus economic penalties), and VDF time‑lock XOR (delay functions to prevent aborts). Includes practical notes on synchrony vs asynchrony, adversary power, and using Bitcoin blocks as entropy extractors.
AI-written summary · about
chapters (9)
- 0:00Start
- 2:59Applications of Randomness and Computing
- 4:37The Flp Theorem
- 7:11Committee Election and Proof of Stake
- 7:37What Are Problems with Centralized Sources of Randomness
- 22:35Network Synchrony
- 23:12Synchrony Model
- 38:56Verifiable Random Functions
- 58:08Creating a Random the Source with an Extractor
related talks
02h 44mBlockchain consensus mechanisms
58mBlockchains and Publicly-Verifiable Lotteries
32mAlgorand: A Secure, Scalable and Decentralized Blockchain
35mVerifiable Luck
16mRandomness in your Smart Contracts
01h 10mAlgorand: The Truly Distributed Ledger
18mEqual Opportunity: A Correctness Condition for Ordered Consensus
42mStochastic reasoning in decentralised systems
