FA-40758 / Heap invariants / Member archive

Min-max grandchild descent uses the opposite inequality for its parent correction · case 03

The bounded minmax grandchild step certificate reports an incorrect correction.

Member previewVariant 3 · 3 implementations · 7 checks per implementation

Case contract

A minimum-level trickle step receives current key x, chosen grandchild key g, its parent key p, and ids. After swapping x with smaller g, x at the grandchild must also be no greater than its maximum-level parent; if x>p exchange those two. Return root key, grandchild key, parent key, cross-level correction flag, two-step trace, and preserved multiset.

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	`{"correction": true, "grandchild_key": 5, "multiset": [1, 5, 8], "parent_key": 8, "root_key": 1, "trace": ["grandchild"]}`	`{"correction": false, "grandchild_key": 5, "multiset": [1, 5, 8], "parent_key": 8, "root_key": 1, "trace": ["grandchild"]}`	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.