FA-45562 / Data systems / Member archive

Membership maintenance uses whole-right emptiness for every left key · case 02

Membership maintenance uses whole-right emptiness for every left key.

Member previewVariant 2 · 3 implementations · 8 checks per implementation

Case contract

For a fixed left bag [id,key,multiplicity], apply a right-key count delta batch and emit signed left rows only when right membership crosses zero. Null keys never match. Emit [id,signed-left-multiplicity] in left order; duplicate right updates consolidate before crossing detection.

Why this case matters

A bounded deterministic data engine model makes representation and changelog faults reproducible.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
other right key	`[]`	`[[10, 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.