# Wikipedia Authors - Kademlia (Highlights) ![rw-book-cover|256](https://readwise-assets.s3.amazonaws.com/static/images/article4.6bc1851654a0.png) ## Metadata **Cover**:: https://readwise-assets.s3.amazonaws.com/static/images/article4.6bc1851654a0.png **Source**:: #from/readwise **Zettel**:: #zettel/fleeting **Status**:: #x **Authors**:: [[Wikipedia Authors]] **Full Title**:: Kademlia **Category**:: #articles #readwise/articles **Category Icon**:: 📰 **URL**:: [en.wikipedia.org](https://en.wikipedia.org/wiki/Kademlia) **Host**:: [[en.wikipedia.org]] **Highlighted**:: [[2022-03-03]] **Created**:: [[2022-09-26]] ## Highlights - Kademlia uses a "distance" calculation between two nodes. This distance is computed as the exclusive or (XOR) of the two node IDs, taking the result as an unsigned integer number. - Every list corresponds to a specific distance from the node. Nodes that can go in the nth list must have a differing nth bit from the node's ID; the first n-1 bits of the candidate ID must match those of the node's ID.