FA-40594 / Heap invariants / Member archive

Bottom-up heap construction repairs descendants before their parents and excludes leaves · case 04

The bounded bottomup schedule certificate reports an incorrect schedule.

Member previewVariant 4 · 3 implementations · 7 checks per implementation

Case contract

For building a complete zero-based binary heap of n nodes, report descending internal-node repair schedule, leaf indices, level spans as inclusive [start,end], right-child-less internal node, parent dependency edges [child,parent], and number of internal nodes. This describes the build work graph, not sorted output.

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 4	`{"dependencies": [[1, 0]], "internal_count": 2, "leaves": [2, 3, 4], "levels": [[0, 0], [1, 2], [3, 4]], "schedule": [0, 1], "unpaired_parent": null}`	`{"dependencies": [[1, 0]], "internal_count": 2, "leaves": [2, 3, 4], "levels": [[0, 0], [1, 2], [3, 4]], "schedule": [1, 0], "unpaired_parent": null}`	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.