Home▸Networks & Graph Theory▸Chord DHT Lookup Simulator

🔗 Chord DHT Lookup Simulator

Interactive 3D ring of peer nodes where routing a key lookup through finger-table hops shows how Chord finds any key in a peer-to-peer network in O(log n) steps.

Networks & Graph Theory3DModerate60 FPS

A 3D ring of peer nodes hashed into a shared identifier space, showing how a Chord distributed hash table routes a key lookup through finger-table shortcuts in only a handful of hops.

🔬 What It Demonstrates

Each node's finger table holds shortcut pointers roughly doubling in reach; forwarding a lookup to the closest preceding finger at each step lets Chord resolve any key in O(log n) hops instead of walking the ring node by node.

🎮 How to Use

Set the ring size and the key to look up, then run a lookup and watch the glowing packet hop across finger-table shortcuts to the node responsible for that key. Toggle finger arcs to see the shortcuts being used at each hop.

💡 Did You Know?

Chord's O(log n) hop guarantee with only O(log n) routing state per node — introduced by Stoica et al. at MIT in 2001 — became a foundational building block for later peer-to-peer and distributed storage systems.

⚙ Under the hood

Interactive 3D ring of peer nodes where routing a key lookup through finger-table hops shows how Chord finds any key in a peer-to-peer network in O(log n) steps.

chorddistributed-hash-tablepeer-to-peeroverlay-networkskey-lookupnetworks

3D · Three.js / WebGL renderer · 60 FPS target · runs fully client-side, no install