FA-40705 / Heap invariants / Member archive

Fibonacci degree table capacity covers the largest degree index rather than occupied count · case 05

The bounded fibonacci degree table certificate reports an incorrect capacity.

Member previewVariant 5 · 3 implementations · 7 checks per implementation

Case contract

A Fibonacci consolidation trace gives occupied degree slots table degree->root id, incoming degree, and incoming root. Pop consecutive occupied degrees starting at incoming degree, collecting collision roots, then place incoming representative in first vacant slot. Report collisions, final degree, emptied slots, resulting occupied degree keys, required array capacity, and carry-step count. This is the degree-routing portion; key comparisons are outside this bounded model.

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	`{"capacity": 1, "carry_steps": 1, "cleared": [0], "collisions": ["a"], "final_degree": 1, "occupied": [1]}`	`{"capacity": 2, "carry_steps": 1, "cleared": [0], "collisions": ["a"], "final_degree": 1, "occupied": [1]}`	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.