DHT, BFT, OMG: Know Your Building Blocks for Decentralized Applications

on YouTube ↗30m

" summary

Practical survey of concrete primitives and tradeoffs: recommends ChaCha20-Poly1305 as the fast cipher choice; explains Kademlia DHT logarithmic lookups for content and peer discovery; shows BRAM's gossip as a uniform-sampling peer exchange to resist malicious peers; demonstrates CRDTs with a G-counter CRDT and PN-counter composition to guarantee mergeable, offline edits. Distinguishes consensus families: Lamport-style permissioned protocols give absolute finality, Nakamoto-style proof-of-work gives probabilistic finality, and Avalanche sits between.

AI-written summary · about

" chapters (5)

1. 0:00Start
2. 4:47Byzantine Fault Tolerance
3. 5:21The Asymmetric Encryption
4. 16:06Conflict Free Replication Data Types
5. 16:35What Is the Merge Conflict

" related talks

• 47mCant we just agreeVojtěch Juránek, Ondra Chaloupka · DevConf.CZ 2019
• 29mBuilding Probabilistic BFT Protocols Through Subsampled VotingKevin Sekniqi · Large-Scale Consensus and Blockchains 2019
• 48mCRDTs: From sequential to concurrent executionsCarlos Baquero · Code Mesh LDN 2018
• 56mA sledgehammer to crack a nut: why blockchain is not (always) a good ideaPetr Kuznetsov · Hydra 2022
• 42mBeyond Blockchain: Convergent ConsensusMike Anderson · Strange Loop 2022
• 22mOptimizing network topologies...Wyatt Meldman Floch, Ryle Goehausen · Scale By The Bay 2018
• 43mAll Together Now: An Introduction to Distributed ConsensusTess Rinearson · Craft Conference 2019
• 58mBlockchains and Publicly-Verifiable LotteriesJoseph Bonneau · Blockchain in Society: Applications, Economics, Law, and Ethics 2019