diff options
-rw-r--r-- | kad/kad.cabal | 28 |
1 files changed, 21 insertions, 7 deletions
diff --git a/kad/kad.cabal b/kad/kad.cabal index 5babda13..d709059c 100644 --- a/kad/kad.cabal +++ b/kad/kad.cabal | |||
@@ -1,14 +1,28 @@ | |||
1 | -- Initial kad.cabal generated by cabal init. For further documentation, | ||
2 | -- see http://haskell.org/cabal/users-guide/ | ||
3 | |||
4 | name: kad | 1 | name: kad |
5 | version: 0.1.0.0 | 2 | version: 0.1.0.0 |
6 | -- synopsis: | 3 | synopsis: Kademlia implementation used by the dhtd process. |
7 | -- description: | 4 | description: |
5 | |||
6 | Kademlia is a Distributed Hash Table Algorithm, useful for routing in a peer | ||
7 | to peer network. In particular, it is the algorithm used by the Bittorrent and | ||
8 | ToxChat networks. | ||
9 | |||
10 | The original intention of this library, was to provide a commons for all | ||
11 | implementers and implementations of kademlia. Mostly however, it's present | ||
12 | purpose is as the backbone to the routing done by the dhtd unix daemon, which | ||
13 | supports both of the afore named networks. One way to bootstrap a peer to peer | ||
14 | network is simply to use an existing one. This can be done by interfacing with | ||
15 | dhtd, which is available via the dht-client package. If however, you wish to | ||
16 | form an independent routing network based on the kademlia algorithm, or an | ||
17 | alternative to dhtd, then this library may be of interest to you. | ||
18 | |||
19 | That said, this library is not officially released, and all the usual caveats | ||
20 | apply until the 1.0 version is announced. | ||
21 | |||
8 | license: BSD3 | 22 | license: BSD3 |
9 | license-file: LICENSE | 23 | license-file: LICENSE |
10 | author: James Crayne | 24 | author: Joe Crayne, James Crayne |
11 | maintainer: jim.crayne@gmail.com | 25 | maintainer: James Crayne <jim.crayne@gmail.com> |
12 | -- copyright: | 26 | -- copyright: |
13 | -- category: | 27 | -- category: |
14 | build-type: Simple | 28 | build-type: Simple |