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

Last change on this file since 10914 was 10914, checked in by charles, 12 years ago

(trunk third-party/dht) #3311 "mingw build of Transmission" -- use jch's upstream win32 portability fixes

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