Skip to content
This repository has been archived by the owner on Feb 13, 2023. It is now read-only.

Math wrong in Kademlia example #9

Open
RichardLitt opened this issue Oct 28, 2015 · 1 comment
Open

Math wrong in Kademlia example #9

RichardLitt opened this issue Oct 28, 2015 · 1 comment

Comments

@RichardLitt
Copy link
Member

https://github.com/ipfs/papers/blob/master/ipfs-cap2pfs/ipfs-cap2pfs.tex#L57-L59

Efficient lookup through massive networks: queries on average contact ⌈log2(n)⌉ nodes. (e.g. 20 hops for a network of 10, 000, 000 nodes).

That's 20 hops for 1,000,000 nodes.

@jbenet
Copy link
Member

jbenet commented Nov 2, 2015

yep should be 23 hops

ivilata added a commit to ivilata/papers that referenced this issue Nov 30, 2015
Since 2**23 doesn't completely cover 10 million nodes, I went for 2**20 which
covers 1 million nodes (as suggested by @RichardLitt).

License: MIT
Signed-off-by: Ivan Vilata-i-Balaguer <ivan@selidor.net>
ivilata added a commit to ivilata/papers that referenced this issue Dec 2, 2015
Since 2**23 doesn't completely cover 10 million nodes, I went for 2**20 which
covers 1 million nodes (as suggested by @RichardLitt).

License: MIT
Signed-off-by: Ivan Vilata-i-Balaguer <ivan@selidor.net>
ivilata added a commit to ivilata/papers that referenced this issue Dec 2, 2015
Since 2**23 doesn't completely cover 10 million nodes, I went for 2**20 which
covers 1 million nodes (as suggested by @RichardLitt).

License: MIT
Signed-off-by: Ivan Vilata-i-Balaguer <ivan@selidor.net>
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants