+[Note: I have no idea how up to date the code examples are -- icepick ]
+
+Khashmir is a distributed hash table that uses an XOR distance metric and a
+routing table similar to Kademlia [1]. Use Khashmir to build distributed
+applications. Note that Khashmir currently isn't very attack resistant.
+
+ 1 - http://kademlia.scs.cs.nyu.edu/
+
+Khashmir is implemented in Python using the Twisted [2] asynchronous networking
+framework. Network deliver is done using UDP. PySQLite is used for each
+peer's backing store of keys and values. The backing store is currently
+held in memory but it could easily be placed on disk. Values expire after
+24 hours, by default. Each peer stores multiple values for a key and
+currently returns all available values when requested.
+
+ 2 - http://twistedmatrix.com
+
+If you just want to watch it build a test network of peers, run "python
+khashmir.py <num peers>" This script will create the specified number of
+peers, give each one three random contacts, tell each one to find the
+closest nodes, then pick a random peer and have it find another random peer
+(ten times), then pick a random peer to insert a key/value and have three
+random peers try to find it (ten times.)
+