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