Jude Nelson f67c2258b1 rework peer discovery and peer retention logic: ...

* use metropolis-hastings random walk with random backtracking (variant of MRWB)
to sample the peer graph in as unbiased a way as we can.  The only major
difference between this and MRWB is that we don't maintain a peer stack;
we just select a random peer instead of backtracking.
* keep the peer table and the peer database in sync--the table is the
cache-coherent copy.
* keep only 65536 peers.  Hash the peer address and a nonce to select a
slot, and ping an old peer before evicting it on collision (and keep the
old peer on collision if it responds)
* a peer can ask for all other peers.
* remove up to 10 peers that are unhealthy per walk; add up to 10 new
peers that we discover on remote peer queries.
* use socket-determined peer address, not RPC-given peer address
* various code cleanups.

2016-08-22 17:55:58 -04:00

..

lib

use correct zonefile cache path; disable update tx check when testing

2016-08-18 18:33:08 -04:00

__init__.py

update symbols

2016-08-15 18:20:35 -04:00

atlas.py

rework peer discovery and peer retention logic:

2016-08-22 17:55:58 -04:00

blockstackd.py

atlas inventory requests are in terms of byte offset and length

2016-08-18 18:33:25 -04:00

build_nameset.py

Rename BlockstoreDB to BlockstackDB

2016-02-23 15:56:09 -05:00

version.py

version 0.14.0

2016-08-10 16:07:49 -04:00