continuum - P2P replicated document storage service

	Commit message (Collapse)	Author	Age	Files	Lines
*	pull after grace	tv	9 days	1	-1/+3
\| \| \| \| \| \| \| \|	Before pulling, a node waits one measured round trip to the announcer (1 s at most) and pulls only what is still missing. If the round trip isn't known yet, it pulls at once, as now. On the clean benchmark links the round trip is a few milliseconds, so those scenarios shouldn't change.
*	announcements answered when lacking	tv	9 days	1	-2/+3
\| \| \| \| \| \| \|	A neighbour now answers an announcement only if it lacks some of the announced heads. Heads that merely differ are no longer enough, since they do while writes go on. The check reads the document, so it runs off the message consumer, as the pull check already does.
*	unanswered members not reached	tv	10 days	1	-5/+10
\|
*	writers from authors	tv	10 days	1	-5/+7
\|
*	reach set for the session	tv	10 days	1	-2/+4
\|
*	tree changes had already	tv	10 days	1	-1/+3
\|
*	announce what trees miss	tv	10 days	1	-1/+6
\|
*	order members by distance	tv	10 days	1	-4/+6
\|
*	replace eager links by trees	tv	10 days	1	-9/+2
\|
*	add writer trees	tv	10 days	1	-0/+16
\|
*	measure 2-hop neighbourhood	tv	10 days	1	-0/+9
\|
*	introduce eager links	tv	10 days	1	-1/+9
\|
*	skip neighbours with our heads	tv	10 days	1	-1/+4
\|
*	announcements answered only if heads differ	tv	10 days	1	-2/+3
\|
*	retry new peers before probing	tv	10 days	1	-1/+3
\|
*	probe list members	tv	11 days	1	-1/+3
\|
*	always announce new heads	tv	11 days	1	-5/+4
\|
*	swarm: announce to whom writers can't reach	tv	11 days	1	-1/+4
\|
*	add documentation	tv	11 days	1	-0/+358