FA-75224 / CRDT convergence / Member archive

Replicated tree move: late moves are applied without undoing newer ones · case 04

Replicas that receive the same moves in different orders end with different trees.

Member previewVariant 4 · 3 implementations · 17 checks per implementation

Case contract

Moves [[counter, replica], node, parent] arrive in any order. The replica keeps a log sorted by timestamp. On arrival it undoes every logged move with a larger timestamp (restoring the old parent, or detaching a node that had none), applies the new move, then redoes the undone moves in timestamp order. A move is skipped (logged, tree unchanged) when the parent is neither "root" nor attached, or when the node is the parent or one of its ancestors. Return sorted [node, parent] pairs.

Why this case matters

Tree CRDTs must reject moves that create cycles, and must reach the same tree regardless of delivery order.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
late earlier move is replayed underneath	`[["x", "root"], ["y", "root"]]`	`[["x", "y"], ["y", "root"]]`	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.