FA-39869 / Heap invariants / Member archive

Binomial child rank chain accepts ascending children · case 04

The bounded binomial forest certificate reports an incorrect children.

Member previewVariant 4 · 3 implementations · 7 checks per implementation

Case contract

For a binomial-forest certificate, roots is a list of [rank,key,node_count,child_ranks]. Report canonical rank order, duplicate ranks, root minimum, size, tree-cardinality failures, and descending child-rank failures. No implicit tree nodes are present.

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 5	`{"canonical": [1, 2], "cardinality": [0, 1], "children": [], "collisions": [], "minimum": 4, "population": 6}`	`{"canonical": [1, 2], "cardinality": [0, 1], "children": [0], "collisions": [], "minimum": 4, "population": 6}`	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.