FA-40475 / Heap invariants / Member archive

Winner tournament replay must recompute the immediate parent before its ancestors · case 05

The bounded tournament path certificate reports an incorrect replay.

Member previewVariant 5 · 3 implementations · 7 checks per implementation

Case contract

A complete winner tournament has power-of-two leaf capacity c and updated leaf slot s. Tree leaves occupy c+s. Report ancestors in bottom-up replay order, sibling indices along that path, root index, comparison count, leaf index, and unaffected leaf slots. Capacity at least one; slot is in range.

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	`{"comparisons": 2, "leaf": 4, "replay": [1, 2], "root": 1, "siblings": [5, 3], "untouched": [1, 2, 3]}`	`{"comparisons": 2, "leaf": 4, "replay": [2, 1], "root": 1, "siblings": [5, 3], "untouched": [1, 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.