I am trying to understand how Riak deals with corner cases for the delete operation. For example, assume there are three nodes, A, B, C:

1. Node A receives DEL ‘x’
2. Node A goes down
3. Node B and C keep receiving updates on ‘x’.
4. Node A comes back up and sends update to B and C that ‘x’ was deleted.

Similarly:

1. Node A receives DEL ‘x’
2. Node B goes down before receiving the update from A.
3. ‘x’ is removed from A and C. Eventually the tombstone is also removed.
4. B comes back up, and receives an updates to ‘x’. This should have been a new ‘x’ but B can’t figure that out.

Is there a paper / doc that describes many such scenarios.

Thank you.

Tried reading and finding Riak documentation. Found some documentation but not a lot of details.