FA-41127 / Heap invariants / Member archive

Buffered heap flush write count reflects the actual promoted batch · case 02

The bounded buffered flush certificate reports an incorrect writes.

Member previewVariant 2 · 3 implementations · 7 checks per implementation

Case contract

A buffered priority heap has sorted resident entries [id,key] and unsorted insertion buffer of unique ids disjoint from residents. Flush only when buffer length reaches capacity; then merge all records ordered by key then id. Report triggering flag, resident after flush, buffer after flush, visible minimum across both tiers, logical size, and write count of promoted buffer entries.

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	`{"buffer": [], "minimum": 2, "resident": [["c", 2], ["a", 5], ["d", 6], ["b", 7]], "size": 4, "trigger": true, "writes": 4}`	`{"buffer": [], "minimum": 2, "resident": [["c", 2], ["a", 5], ["d", 6], ["b", 7]], "size": 4, "trigger": true, "writes": 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.