- 07 Mar, 2017 1 commit
-
-
Jakub Sztandera authored
-
- 06 Mar, 2017 1 commit
-
-
Jeromy authored
First, we use Alpha instead of K as the number of peers we grab from the routing table (as per the kademlia paper). Second, we don't use a size limited set for the 'GetClosestPeers' query. We're going to process more than K peers before we find the K closest peers. Third, Change GetClosestPeers to actually return the K Closest peers, not a hodge podge of peers that it found on the way to finding the closest peers.
-
- 13 Sep, 2016 1 commit
-
-
Jeromy authored
-
- 02 Sep, 2016 1 commit
-
-
George Antoniadis authored
-
- 21 Aug, 2016 1 commit
-
-
George Antoniadis authored
-