FA-40410 / Heap invariants / Member archive

Min-max complete-tree level alternation includes both zero-based child positions · case 05

The bounded minmax levels certificate reports an incorrect edges.

Member previewVariant 5 · 3 implementations · 7 checks per implementation

Case contract

A min-max heap certificate is a complete zero-based binary array. Even depth is a minimum level, odd depth a maximum level. Report level parities, grandparent indices, minimum-level grandchild violations, maximum-level grandchild violations, maximum endpoint, and immediate-child level alternation pairs. Empty maximum is None.

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 2	`{"edges": [[0, 0]], "grandparents": [null], "max_violations": [], "maximum": 4, "min_violations": [], "parity": [0]}`	`{"edges": [], "grandparents": [null], "max_violations": [], "maximum": 4, "min_violations": [], "parity": [0]}`	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.