FAILURE MAP
← Case archive

FA-76068 / Chat ordering and read receipts / Member archive

Page older history with a composite (ts, id) cursor: id tiebreak · case 03

Messages with equal timestamps are paged in arrival order, so the cursor comparison and the page disagree.

Member previewVariant 3 · 3 implementations · 6 checks per implementation

Case contract

messages are [ts, id] pairs in any order; ordering is by (ts, id). cursor is None or the exclusive [ts, id] of the oldest message already shown. A page holds the newest `limit` messages strictly older than the cursor, in ascending order; next is the [ts, id] of the page's oldest item when older messages remain, else None.

Why this case matters

Infinite-scroll history must neither skip nor duplicate messages that share a timestamp.

One recorded failure

Sample boundary fixture

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

Boundary fixtureActualExpectedOutcome
equal timestamps across a page edge{"next": [50, "Q"], "page": ["Q", "a"]}{"next": [50, "a"], "page": ["a", "b"]}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.

Sign in to the archive ↗