FA-75334 / CRDT convergence / Member archive

Delete set normalization: ranges are merged in arrival order · case 04

Unsorted delete sets normalize to overlapping or out-of-order ranges.

Member previewVariant 4 · 3 implementations · 8 checks per implementation

Case contract

A delete set is a list of [client, clock, length] ranges, possibly unsorted, overlapping or adjacent. Normalize per client in client order: sort by clock and merge ranges that overlap or touch. Queries [client, clock] report whether the clock lies in a merged range (end exclusive). Return merged ranges and query answers.

Why this case matters

Sequence CRDTs ship deletions as compact range sets that every replica must normalize identically.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
unsorted input	`{"hits": [true, false], "ranges": [[4, 9, 2]]}`	`{"hits": [true, false], "ranges": [[4, 0, 11]]}`	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.