FA-75203 / CRDT convergence / Member archive

LWW map with delete-wins ties: timestamp ties are decided by writer, not by kind · case 03

A put and a delete with equal timestamps resolve by replica name, sometimes keeping the key.

Member previewVariant 3 · 3 implementations · 9 checks per implementation

Case contract

Each key holds [value, ts, kind, writer] with kind 1 for a delete tombstone and 0 for a put. An incoming entry (local op or merge) replaces the stored one only if (ts, kind, writer) is lexicographically larger, so deletes win timestamp ties and writers break the rest. Tombstones are kept. ["merge", s, d] offers each of s's entries to d. Return sorted visible [key, value] pairs per replica.

Why this case matters

Document CRDTs built from per-field LWW registers must not let stale writes resurrect deleted fields.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
delete from a smaller writer still wins the tie	`[[["y", "yb"]], [["y", "yb"]]]`	`[[], []]`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.