February 2019
Intermediate to advanced
450 pages
9h 59m
English
Content preview from Hands-On Blockchain for Python Developers
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
Start your free trial
Buckets
Now that we have gone through XOR distances, we will take a look at how a node saves other nodes' addresses. A node does not save all other nodes in a distributed hash table. The number of nodes a node can save depends on the number of bits in a node and the k configuration number. Let's discuss these one by one.
Remember the tree picture we saw previously? It has 16 leaves. Now imagine the smallest tree:
It has two leaves. Let's double the tree:
The tree now has four leaves. Let's double it again:
The tree now has eight leaves. If ...