How Merkle Trees Enable the Decentralized Web!

on YouTube ↗10m

" summary

Merkle trees let a dataset be addressed by a root hash (typically 32 bytes) and verified by hashing leaves and concatenating left/right children up the tree, so a single changed chunk changes the root. Peers can fetch chunks from strangers and confirm integrity with partial proofs (only sibling hashes plus the chunk), enabling content addressing and sharded hosting; Git, BitTorrent, ZFS, and Ethereum are concrete users of this pattern.

AI-written summary · about

" chapters (4)

1. 0:00Start
2. 0:51Host-based addressing
3. 1:32Content addressing - hash functions
4. 4:30Checking for equality

" related talks

• 01h 00mThe Decentralized WebViktor Grishchenko · HolyJS 2018 Moscow
• 01h 04mKeynote: Towards a more effective, decentralized webHolger Krekel · EuroPython 2015
• 39mPrivacy-preserving Approaches to Transparency LogsHayden Blauzvern · SupplyChainSecurityCon at Open Source Summit Europe 2022
• 22mActually Functional Blockchain DesignLuke Champine · LambdaConf 2024
• 37mProgressive Centralization: The Right Way(TM) to do Web3Bruno Skvorc · Web Summer Camp 2023
• 22mTransparent proofs of data records in blockchainRoman Shirochenko · RustRush 2018
• 29mThe Evolution of Data Control in Decentralized NetworksWil Wade · Web3 Summit 2025
• 25mExpanding the Web 3.0 to Low-level Devices: Scaling AccessChristoph Jentzsch · Web3 Summit 2018