The Kademlia paper shows a simple binary tree as a data structure for the routing table. This can grow very deep for long keys so an optimisation is to only use a prefix of the KAD-ID when constructing the table.
This results in faster lookups for better performance.
Change checklist
[x] I have performed a self-review of my own code
[ ] I have made corresponding changes to the documentation if necessary (this includes comments as well)
[x] I have added tests that prove my fix is effective or that my feature works
The Kademlia paper shows a simple binary tree as a data structure for the routing table. This can grow very deep for long keys so an optimisation is to only use a prefix of the KAD-ID when constructing the table.
This results in faster lookups for better performance.
Change checklist