FA-40880 / Heap invariants / Member archive

Cyclic priority extraction selects an absolute active key rather than a stale or modulo minimum · case 05

The bounded dial window certificate reports an incorrect next.

Member previewVariant 5 · 3 implementations · 7 checks per implementation

Case contract

A cyclic integer bucket queue with ring size C stores entries [id,absolute_key]. Cursor is last extracted absolute key. Only keys in [cursor,cursor+C) are in the active window. Report physical bucket indices, expired ids, future-window ids, next active key, rotation distance, and active ids in absolute-key order. Same-slot values from later revolutions must not be delivered.

Why this case matters

This isolates an internal heap representation or priority-structure invariant using deterministic finite records.

One recorded failure

Sample boundary fixture

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

Boundary fixture	Actual	Expected	Outcome
regression certificate 3	`{"active_order": ["b", "a"], "advance": 1, "buckets": [["a", 2], ["b", 4], ["c", 2], ["d", 3]], "expired": ["c"], "future": ["d"], "next": 7}`	`{"active_order": ["b", "a"], "advance": 1, "buckets": [["a", 2], ["b", 4], ["c", 2], ["d", 3]], "expired": ["c"], "future": ["d"], "next": 9}`	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.