FA-75263 / CRDT convergence / Member archive

Causal length set: removing an absent element toggles it on · case 03

A remove of something not in the set makes it appear.

Member previewVariant 3 · 3 implementations · 8 checks per implementation

Case contract

Each replica maps elements to a causal length. An element is present when its length is odd. ["add", r, e] increments the length only when it is even; ["rem", r, e] increments it only when it is odd. ["merge", s, d] takes the per-element maximum. Return per replica the sorted members and the sorted [element, length] pairs.

Why this case matters

Causal-length sets encode an element's add/remove history as a single counter whose parity is its membership.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
removing an absent element is a no-op	`[[["z"], [["z", 1]]], [["w", "z"], [["w", 3], ["z", 1]]]]`	`[[[], []], [[], [["w", 2]]]]`	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.