Kademlia (Distributed Hash Table) is a routing algorithm which mimics a key-value store used in decentralized p2p networks to look up sources of content efficiently using the key of that content.

This project is aimed at demonstrating visually the concept of kademlia routing as pertaining to the swarm(DISC) and ipfs(DHT) networks. How routing tables are formed for each node when it joins the network and how nodes route traffic to remote nodes to find or store content.

• Demonstrate new node onboarding and the formation of a routing table via the HIVE operation
• Demonstrate how nodes route effectively in the p2p network via kademlia, in effect, covering all the different operations.

• Here, Swarm's HIVE operation is shown, where nodes get to know about closer nodes it does not know about yet, to populate its routing table

• Here, is Swarm's FIND NODE operation, visualizing the recursive nature of network request in swarm's DISC network.

• Here, a selected path in the FIND NODE oepration is visualized, allowing tracking of a single packet's request path, in this case, path 0 from the FIND NODE operation shown here 👆🏿

• Not tested for web nor mobile(no future plans) yet, just desktop(mac)