Earlier quoted context omitted.
Do you have any document that explain what resolution algorithm uses in what cases? For example, one peer change a property value and the other peer deletes it.
Same algorithm for everything. This cartoon explains it: https://gun.eco/distributed/matters.html It is a vector + timestamp + lexical sort. A delete is changing a value to `null`, it would lose (I assume you are asking if/when these 2 changes happen at the exact same microsecond time, conflicting?) as is it has a lower lexical rank.
The cartoon explanation do not tackle those terms.