FA-40654 / Heap invariants / Member archive

Binomial decrease bubbling exchanges handle identity together with priority · case 04

The bounded binomial payload bubble certificate reports an incorrect payloads.

Member previewVariant 4 · 3 implementations · 7 checks per implementation

Case contract

A binomial decrease-key bubble supplies the node-id path from leaf toward root, payloads [handle,key] at those nodes, and a decreased key for the first payload. While smaller than parent, exchange complete payloads. Structural nodes remain fixed; return final payload sequence, handle locations, swaps, decreased handle location, untouched structural path, and final minimum on this path.

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	`{"changed_location": 11, "locations": {"a": 11, "b": 10}, "minimum": 1, "payloads": [["a", 3], ["b", 1]], "structural_nodes": [10, 11], "swaps": [[10, 11]]}`	`{"changed_location": 11, "locations": {"a": 11, "b": 10}, "minimum": 1, "payloads": [["b", 3], ["a", 1]], "structural_nodes": [10, 11], "swaps": [[10, 11]]}`	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.