FA-41270 / Heap invariants / Member archive

Tournament depth counts tree levels rather than total matches · case 05

The bounded tournament padding certificate reports an incorrect rounds.

Member previewVariant 5 · 3 implementations · 7 checks per implementation

Case contract

A tournament is built from m real leaves [id,key]. Round leaf capacity to the next power of two (empty capacity one) and append inactive None pads. Inactive pads always lose without numeric sentinel assumptions. Report capacity, padded leaves, champion id with arrival-order ties, match rounds, active-leaf indices, and key-comparison count m-1 for m>0.

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 1	`{"active_indices": [], "capacity": 1, "champion": null, "key_comparisons": 0, "leaves": [null], "rounds": 1}`	`{"active_indices": [], "capacity": 1, "champion": null, "key_comparisons": 0, "leaves": [null], "rounds": 0}`	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.