FA-39927 / Heap invariants / Member archive

Leftist meld work bound counts all nodes instead of right spine · case 02

The bounded leftist ranks certificate reports an incorrect spine length.

Member previewVariant 2 · 3 implementations · 7 checks per implementation

Case contract

A leftist-tree certificate has nodes [key,left,right,stored_npl] with missing child=-1 and valid references. Null-path length of null is -1. Report local heap-edge violations, rank recurrence violations, leftist orientation violations, leaves, unary-right nodes, and root-to-right-spine length; spine traversal stops on repeated node.

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 3	`{"heap_edges": [], "leaves": [1, 2], "orientation": [], "rank_recurrence": [], "right_orphans": [], "spine_length": 3}`	`{"heap_edges": [], "leaves": [1, 2], "orientation": [], "rank_recurrence": [], "right_orphans": [], "spine_length": 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.