this is the new khashmir, now based on Twisted and XML-RPC

[quix0rs-apt-p2p.git] / ktable.py

diff --git a/ktable.py b/ktable.py
index 9cd373246ab1ea23cf556e9e939d1128bef272cf..3bff4074ff75a1fcf5be33fe3f6d6bad6ef67e3b 100644 (file)
--- a/ktable.py
+++ b/ktable.py
@@ -8,7 +8,7 @@ from types import *
 from node import Node
 
 # The all-powerful, magical Kademlia "k" constant, bucket depth
-K = 20
+K = 8
 
 # how many bits wide is our hash?
 HASH_LENGTH = 160
@@ -111,6 +111,7 @@ class KTable:
        this insert the node, returning None if successful, returns the oldest node in the bucket if it's full
        the caller responsible for pinging the returned node and calling replaceStaleNode if it is found to be stale!!
        """
+       assert(node.id != " "*20)
        # get the bucket for this node
        i = self. _bucketIndexForInt(node.int)
        ## check to see if node is in the bucket already