The other Kademlia
A look at "Sloppy hashing and self-organizing clusters" by Michael J. Freedman and David Mazières (2002). These are the same authors of the Kademlia DHT paper 00:00 Sloppy hashing and self-organizing clusters 01:22 DHTs are the wrong Abstraction 02:31 DHTs have poor locality 04:30 Le Network 06:01 Kademlia Example 08:47 Clustering 13:50 Sloppiness 16:17 Self-organizing clusters 17:04 Cluster Discovery 19:52 Cluster Merging & Splitting 21:41 Small Privacy Concerns 22:12 Implementation Challenges 23:40 Closing Thoughts
▶︎
mapping peer to peer locality with latency & fancy geometry
▶︎
Unfortunately, You Need to Know What the Jevons Paradox is
▶︎
Fibonacci Heaps or "How to invent an extremely clever data structure"
▶︎
Kademlia, Explained
▶︎
Zig 2026: No-AI Policy, $670K Foundation, Left GitHub & Why Zig Isn’t 1.0 - Andrew Kelley Explains
▶︎
Bloom Filters - Part 1 of 3
▶︎
Chord: Scalable P2P Lookup via Consistent Hashing — Animated Paper Explainer
▶︎
Aaron David Goldman on Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
▶︎
Android 17 sucks. So I put Linux on a phone.
▶︎
Invertible Bloom Filters - Part 2 of 3
▶︎
Kademlia: P2P Distributed Hash Table with Petar Maymounkov
▶︎
Trump Declares Iran Ceasefire "Over" & Goes No-Contact with Spain | The Daily Show
▶︎
Solving Problems the Clojure Way - Rafal Dittwald
▶︎
let's replace bitswap with a two week old paper?
▶︎
A tour of iroh
▶︎
Distributed Hash Tables, Video, and Fun! - Thomas Gebert & Nick Misturak
▶︎
Creator of C++: Bell Labs, Negative Overhead Abstraction, Mistakes | Bjarne Stroustrup
▶︎
How 1999 Quake 3 Teaches Elite Software Engineering
▶︎