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

Last change on this file since 9323 was 9323, checked in by livings124, 13 years ago

#2514 update to dht-0.10

File size: 2.4 KB
Line 
118 October 2009: dht-0.10
2
3  * Send nodes even when sending values.  This is a violation of the
4    protocol, but I have been assured that it doesn't break any deployed
5    implementation.  This is also what both libtorrent and uTorrent do.
6  * Give up immediately on a search peer when no token was provided.  This
7    is a very reasonable extension to the protocol, and certainly doesn't
8    break anything.
9  * Parse heterogeneous values lists correctly.  This is mandated by BEP 32.
10
1120 September 2009: dht-0.9
12
13  * Fixed incorrect computation of number of nodes.
14  * Made the initial bucket split eagerly (speeds up bootstrapping).
15  * Fixed initial filling of search buckets (speeds up searches).
16
1728 July 2009: dht-0.8
18
19  * Fixed a crash when expiring the first search on the list.
20  * Fixed freeing of the search list when uniniting with dofree = 1.
21
2224 June 2009: dht-0.7
23
24  * Removed the fixed limit on the number of concurrent searches, we now
25    use a linked list.
26  * Fixed build on FreeBSD (thanks to Humihara and Charles Kerr).
27
2822 May 2009: dht-0.6
29
30  * Fixed a buffer overflow (when reading) in parse_message.
31  * Fixed slightly inacurrate metric computation when searching.
32  * Removed a slightly inaccurate shortcut when responding to find_nodes.
33  * Relaxed the rate-limiting parameters to 4 requests per second.
34
3519 May 2009: dht-0.5
36
37  * Made reading of /dev/urandom a function provided by the user.
38  * Implemented the ``v'' extension that identifies node implementations.
39
4018 May 2009: dht-0.4
41
42  * Fixed the handling of tokens in announce_peer messages.
43  * Implemented backtracking during search when nodes turn out to be dead.
44
4517 May 2009: dht-0.3
46
47  * Fixed a number of incorrectly formatted messages.
48  * Changed reply to find_peers to spread the load more uniformly.
49  * Fixed a bug that could cause premature splitting.
50  * Implemented rate limiting.
51  * Changed some time constants to be less chatty.
52  * When determining if a bucket is fresh enough, we now only take replies
53    into account.
54  * dht_get_nodes now returns nodes starting with our own bucket.
55  * Tweaked the memory allocation strategy for stored peers.
56
5717 May 2009: dht-0.2
58
59  * Fixed a crash in dht_uninit.
60  * Added support for saving the list of known-good nodes.
61  * Changed the interface of dht_nodes to provide the number of nodes that
62    recently sent incoming requests.
63
6413 May 2009: dht-0.1
65
66  * Initial public release.
Note: See TracBrowser for help on using the repository browser.