- 12 Jul, 2017 1 commit
-
-
Steven Allen authored
-
- 11 Jul, 2017 1 commit
-
-
Jeromy authored
-
- 04 Jul, 2017 1 commit
-
-
Łukasz Magiera authored
-
- 29 Jun, 2017 1 commit
-
-
Łukasz Magiera authored
-
- 20 Jun, 2017 2 commits
-
-
Steven Allen authored
-
Steven Allen authored
-
- 30 May, 2017 1 commit
-
-
Lars Gierth authored
-
- 17 May, 2017 2 commits
- 25 Mar, 2017 1 commit
-
-
Jeromy authored
-
- 06 Mar, 2017 2 commits
-
-
Jeromy authored
-
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.
-
- 16 Feb, 2017 2 commits
-
-
Jakub Sztandera authored
-
Jakub Sztandera authored
-
- 06 Feb, 2017 1 commit
-
-
Jeromy authored
-
- 03 Feb, 2017 4 commits
- 18 Jan, 2017 1 commit
-
-
Jeromy authored
-
- 10 Jan, 2017 3 commits
- 06 Jan, 2017 2 commits
- 27 Dec, 2016 1 commit
-
-
Jeromy authored
-
- 17 Dec, 2016 1 commit
-
-
Jakub Sztandera authored
-
- 29 Nov, 2016 1 commit
-
-
Jeromy authored
-
- 28 Nov, 2016 3 commits
- 22 Nov, 2016 1 commit
-
-
Jeromy authored
-
- 17 Nov, 2016 1 commit
-
-
Jakub Sztandera authored
-
- 16 Nov, 2016 3 commits
- 11 Nov, 2016 2 commits
- 06 Nov, 2016 2 commits