kahuin / kahdemlia

Clojure(script) implementation of the Kademlia DHT

kahdemlia

An asynchronous Clojure & Clojurescript implementation of the Kademlia distributed hash table.

Usage

(ns kad-dht
  (:require [clojure.core.async :refer [<! go-loop]]
             ; ^^ or cljs.core.async and cljs.core.async.macros if you are using CLJS
            [kahdemlia.core :refer [make-node!]]))

(let [{:keys [network-fn network-out-ch store-fn find-fn found-ch]}
      (make-node!)]
  (go-loop []
    (let [[dest msg] (<! network-out-ch)]
      ; SEND MESSAGE TO DESTINATION
      (recur)))
  (go-loop []
    (let [[key val] (<! found-ch)]
      ; HANDLE KEY LOOKUP
      (recur)))
  (def on-network-message network-fn)
  (def find find-fn)
  (def store! store-fn))

Development

• Original Kademlia paper
• Unofficial specification

Tests

Tests uses clojure.test for clojure and rhino via doo for clojurescript:

lein test

License

Copyright © 2017 Camilo Polymeris

Distributed under the Eclipse Public License either version 1.0 or (at your option) any later version.

kahdemlia's Issues

kabel integration

Hey,

first of all great work. I am looking for a DHT implementation in pure Clojure(Script) to host on https://github.com/replikativ/kabel . I have recently ported the hitchhiker-tree to ClojureScript+core.async including a Merkle version datacrypt-project/hitchhiker-tree#30. I am currently thinking whether a combination of the hitchhiker tree for mutable metadata + the DHT might provide some very nice basis for replikativ. What are your plans for kahdemelia? I would love to see it work for simple immutable key lookups and provide a kabel network layer implementation then as a basis for replikativ then.

Best,
Christian