Assertion: chord | /r/CapableOf | keep track of r = o
Facets:
Source sentences:
text: If Chord keeps track of r = O ( log ⁡ N ) {\displaystyle r=O(\log N)} predecessors/successors, then with high probability, if each node has probability of 1/4 of failing, find_successor (see below) and find_predecessor (see below) will return the correct nodes