Scuttlebutt Reconciliation in the paper "Efficient Reconciliation and Flow Control for Anti-Entropy Protocols"
I am reading the paper ["Efficient Reconciliation and Flow Control for Anti-Entropy Protocols"](http://www.cs.cornell.edu/home/rvr/papers/flowgossip.pdf)! , I couldn't clearly understand Section 3.2 "Scuttlebutt Reconciliation". Here I extract out some sentences from the paper, which especially confuse me.

1. If gossip messages were unlimited in size, then the sets contains the exact differences,just like with precise reconciliation.

2. Scuttlebutt requires that if a certain delta (r; k; v; n) is omitted, then all the deltas with higher version numbers for the same r should be omitted as well.

3. Scuttlebutt satises the global invariant C(p;q) for any two
processes p and q:

Scuttlebutt Reconciliation in the paper "Efficient Reconciliation and Flow Control for Anti-Entropy Protocols"
===

I am reading the paper ["Efficient Reconciliation and Flow Control for Anti-Entropy Protocols"](http://www.cs.cornell.edu/home/rvr/papers/flowgossip.pdf)! , I couldn't clearly understand Section 3.2 "Scuttlebutt Reconciliation". Here I extract out some sentences from the paper, which especially confuse me.

1. If gossip messages were unlimited in size, then the sets contains the exact differences,just like with precise reconciliation.

2. Scuttlebutt requires that if a certain delta (r; k; v; n) is omitted, then all the deltas with higher version numbers for the same r should be omitted as well.

3. Scuttlebutt satises the global invariant C(p;q) for any two
processes p and q:
