FA-40972 / Heap invariants / Member archive

Read-only heap frontier enumeration must preserve the source heap representation · case 02

The bounded heap frontier certificate reports an incorrect heap after.

Member previewVariant 2 · 3 implementations · 7 checks per implementation

Case contract

A read-only best-first traversal of a valid binary min heap has already emitted parent slot p and a frontier of distinct slots. Insert p children that exist into the frontier, order by (key,index), and choose next. Return new frontier, chosen slot, child additions, traversal output key, preserved heap, and next frontier after selection. Initial frontier excludes p and its children.

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 1	`{"children": [], "chosen": null, "frontier_after": [], "heap_after": [], "next_key": null, "ready": []}`	`{"children": [], "chosen": null, "frontier_after": [], "heap_after": [1], "next_key": null, "ready": []}`	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.