FA-40248 / Heap invariants / Member archive

Radix redistribution preserves multiplicity of equal priorities · case 03

The bounded radix redistribute certificate reports an incorrect moved.

Member previewVariant 3 · 3 implementations · 7 checks per implementation

Case contract

Redistribute one nonempty radix bucket with entries [id,key], all keys at least old_last. Set new_last to bucket minimum and move every entry to bit_length(key XOR new_last); preserve entry order within each destination bucket. Report threshold, assignments, bucket-zero ids, moved count, old-bucket clearing, and maximum destination.

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	`{"destinations": [[1, 3], [2, 0], [3, 0], [4, 3]], "largest_destination": 3, "moved": 3, "source_after": [], "threshold": 8, "zero_ids": [2, 3]}`	`{"destinations": [[1, 3], [2, 0], [3, 0], [4, 3]], "largest_destination": 3, "moved": 4, "source_after": [], "threshold": 8, "zero_ids": [2, 3]}`	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.