source: trunk/third-party/dht/CHANGES @ 9777

Last change on this file since 9777 was 9777, checked in by charles, 11 years ago

(trunk) update our DHT snapshot

File size: 3.2 KB
Line 
115 December 2009: dht-0.13
2
3  * Implemented protection against incorrect addresses in the DHT.
4  * Tweaked neighborhood maintenance to wake up less often.
5
611 December 2009: dht-0.12
7  * Fixed slightly incorrect formatting of DHT messages.
8  * Fixed incorrect debugging message.
9
1022 November 2009: dht-0.11
11
12  * Implemented IPv6 support (BEP-32).
13  * Fixed a bug which could cause us to never mark a search as finished.
14  * Fixed a bug that could cause us to send incomplete lists in response to
15    find_nodes.
16  * Limit the number of hashes that we're willing to track.
17  * Made bucket maintenance slightly more aggressive.
18  * Produce on-the-wire error messages to give a hint to the other side.
19  * Added a bunch of options to dht-example to make it useful as
20    a bootstrap node.
21  * Send version "JC\0\0" when using dht-example.
22
2318 October 2009: dht-0.10
24
25  * Send nodes even when sending values.  This is a violation of the
26    protocol, but I have been assured that it doesn't break any deployed
27    implementation.  This is also what both libtorrent and uTorrent do.
28  * Give up immediately on a search peer when no token was provided.  This
29    is a very reasonable extension to the protocol, and certainly doesn't
30    break anything.
31  * Parse heterogeneous values lists correctly.  This is mandated by BEP 32.
32
3320 September 2009: dht-0.9
34
35  * Fixed incorrect computation of number of nodes.
36  * Made the initial bucket split eagerly (speeds up bootstrapping).
37  * Fixed initial filling of search buckets (speeds up searches).
38
3928 July 2009: dht-0.8
40
41  * Fixed a crash when expiring the first search on the list.
42  * Fixed freeing of the search list when uniniting with dofree = 1.
43
4424 June 2009: dht-0.7
45
46  * Removed the fixed limit on the number of concurrent searches, we now
47    use a linked list.
48  * Fixed build on FreeBSD (thanks to Humihara and Charles Kerr).
49
5022 May 2009: dht-0.6
51
52  * Fixed a buffer overflow (when reading) in parse_message.
53  * Fixed slightly inacurrate metric computation when searching.
54  * Removed a slightly inaccurate shortcut when responding to find_nodes.
55  * Relaxed the rate-limiting parameters to 4 requests per second.
56
5719 May 2009: dht-0.5
58
59  * Made reading of /dev/urandom a function provided by the user.
60  * Implemented the ``v'' extension that identifies node implementations.
61
6218 May 2009: dht-0.4
63
64  * Fixed the handling of tokens in announce_peer messages.
65  * Implemented backtracking during search when nodes turn out to be dead.
66
6717 May 2009: dht-0.3
68
69  * Fixed a number of incorrectly formatted messages.
70  * Changed reply to find_peers to spread the load more uniformly.
71  * Fixed a bug that could cause premature splitting.
72  * Implemented rate limiting.
73  * Changed some time constants to be less chatty.
74  * When determining if a bucket is fresh enough, we now only take replies
75    into account.
76  * dht_get_nodes now returns nodes starting with our own bucket.
77  * Tweaked the memory allocation strategy for stored peers.
78
7917 May 2009: dht-0.2
80
81  * Fixed a crash in dht_uninit.
82  * Added support for saving the list of known-good nodes.
83  * Changed the interface of dht_nodes to provide the number of nodes that
84    recently sent incoming requests.
85
8613 May 2009: dht-0.1
87
88  * Initial public release.
Note: See TracBrowser for help on using the repository browser.