Skip to Content.
Sympa Menu

bluesky - Re: Kademlia Kademlia Kademlia (was: how to do censorship resistance (was: Grapevine Technical Overview))

bluesky AT lists.ibiblio.org

Subject: Global-Scale Distributed Storage Systems

List archive

Chronological Thread  
  • From: Zooko <zooko AT zooko.com>
  • To: "Global-Scale Distributed Storage Systems" <bluesky AT franklin.oit.unc.edu>
  • Subject: Re: Kademlia Kademlia Kademlia (was: how to do censorship resistance (was: Grapevine Technical Overview))
  • Date: Thu, 30 May 2002 03:51:03 -0700



Last night my wife and I drew sketches of Kademlia space.

One neat thing that came up is that Kademlia space is almost a hypercube --
it's a hypercuboid!

Imagine a hypercube, but without all of its edges being the same length.
Instead, each edge which extends into the Nth dimension has length 2^N.

That's Kademlia's routing space!

It shares with hypercubes the property that you have to traverse at most
log2(N) edges to move from any vertex to any other. It is different from a
hypercube in that for any vertex A, each other vertex is at a unique distance
from A. (In a hypercube, most other vertexes are the same distance from A:
log2(N)/2 edges away.)

Regards,

Zooko

-------
Secure Distributed Systems Consulting -- http://zooko.com/
-------




Archive powered by MHonArc 2.6.24.

Top of Page