What are hash trees? and why you should care
summary
Explains binary Merkle (hash) trees where each parent hash is computed from child hashes using a one-way hash, allowing a server to return both a query result and a compact logarithmic-size proof of inclusion that a client can verify with a few hash computations. Covers practical uses: chunked file distribution (BitTorrent-style verification), tamper-evident histories and ledgers (blockchain), and signed document stores, and describes update strategies that keep proofs efficient so clients can detect server tampering without downloading full objects.
AI-written summary · about
chapters (10)
- 0:00Introduction
- 1:48Why hash trees matter
- 10:06Hash functions basics
- 20:01Real-world applications
- 30:53Security and verification
- 40:43Peer-to-peer networks
- 50:38Tree structures explained
- 1:00:21Practical use cases
- 1:10:40Implementation challenges
- 1:19:56Q&A
related talks
43mFinding the merkle tree in the block chain forest
01h 01mKey transparency: Blockchain meets NoiseSocket
41mStateful Hash-Based Signature Schemes
29mHash Functions Taste Great with Anything
28mRings and trees: how to prove coin ownership
54mQuantum BIPs Showdown
31mSecure Distributed Storage
23mBlockchain