FA-063 / Distributed coordination / Member archive

Concurrent revisions are mistaken for causal successors · case 03

A scalar or lexicographic comparison imposes an order on independent replica updates.

Member previewVariant 3 · 3 implementations · 7 checks per implementation

Case contract

Given two maps from replica ID to nonnegative counter, return equal, before, after, or concurrent. Before requires every component <= and at least one <; after is its inverse.

Why this case matters

Models conflict detection for replicated revisions; a total order can silently hide conflicts that require application-specific reconciliation.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
same-sum independent writes	`"equal"`	`"concurrent"`	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.