FA-40147 / Heap invariants / Member archive

Pairing pass selects each pair by priority rather than child id · case 02

The bounded pairing pass certificate reports an incorrect winners.

Member previewVariant 2 · 3 implementations · 7 checks per implementation

Case contract

For delete-min pairing pass, children are [id,key]. Pair adjacent children left-to-right, keeping the left on equal keys. An odd last child survives. Return pair indices, winning ids, losing ids, odd carry id, second-pass traversal order, and comparison count. The second pass folds from right to left.

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	`{"carry": 1, "comparisons": 2, "fold_order": [1, 7], "losers": [4], "pairs": [[0, 1]], "winners": [4]}`	`{"carry": 1, "comparisons": 2, "fold_order": [1, 7], "losers": [4], "pairs": [[0, 1]], "winners": [7]}`	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.