BrendanBenshoof

def getApproxDelaunayPeers(candidates,center):
    """
    This is the Distrubuted Greedy Voronoi Heuristic.
    center is some point in a space (we don't really care which) and the 
    heuristic decides which of the candidates are members of Delaunay 
    Triangulations with the center point.
    This allows a node located at center to quickly figure out its 
    Voronoi region.
    Error rate: Our heuristic underestimates approximately edge per node
    """

BrendanBenshoof

<html/>
<head/>

</head>
<body/>


<h1>UrDHT based simple chatroom</h1>

channel:  <input type="text" id="channel" value="testnet"/>

BrendanBenshoof

Keybase proof

I hereby claim:

• I am BrendanBenshoof on github.
• I am brendanbenshoof (https://keybase.io/brendanbenshoof) on keybase.
• I have a public key whose fingerprint is 6B03 364E 01E7 E247 85F1 2093 B62F E823 13E7 01CB

To claim this, I am signing this object: