FA-40003 / Heap invariants / Member archive

Binomial link increments rank once rather than summing ranks · case 03

The bounded binomial link certificate reports an incorrect new rank.

Member previewVariant 3 · 3 implementations · 7 checks per implementation

Case contract

Link two equal-rank binomial roots a and b, each [id,key,rank,child_ids]. Ties keep a. Return winner, loser, winner rank, child-chain prepend, comparison cost, and removed-root identities. Certificate input is two distinct roots of equal rank.

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	`{"children": [3], "loser": 3, "new_rank": 0, "parent_updates": [[3, 8]], "root_set": [8], "winner": 8}`	`{"children": [3], "loser": 3, "new_rank": 1, "parent_updates": [[3, 8]], "root_set": [8], "winner": 8}`	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.