FA-40563 / Heap invariants / Member archive

Weak join preserves both exchanged keys instead of overwriting the ancestor · case 03

The bounded weak join certificate reports an incorrect keys.

Member previewVariant 3 · 3 implementations · 7 checks per implementation

Case contract

A weak-heap join receives keys, reverse bits, ancestor i and distinct descendant j. When keys[j]<keys[i], swap these keys and flip only reverse[j]; on equality do nothing. Return resulting keys, reversal bits, swapped status, winning key, changed reversal index, and comparison count.

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	`{"bits": [0, 1], "comparisons": 1, "flipped": 1, "keys": [4, 2], "swapped": true, "winner_key": 2}`	`{"bits": [0, 1], "comparisons": 1, "flipped": 1, "keys": [2, 4], "swapped": true, "winner_key": 2}`	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.