Toy Koorde DHT

This is a toy Koorde implementation in Go.

Implemented:

• N back up successor for better path correction
• Degree-N network with O(log(N)/log(log(N)) scaling
• benchmark.sh to parse and output lookup metrics
• Join algorithm
• Stabilize algorithm
• Leave algorith
• Reorganisation algorith

Licese

MIT