FA-40412 / Heap invariants / Member archive

Interval heap admits equal endpoints and a final singleton · case 02

The bounded interval endpoints certificate reports an incorrect reversed.

Member previewVariant 2 · 3 implementations · 7 checks per implementation

Case contract

An interval heap stores ordered pairs [lo,hi] except the last node may be singleton [x]. Report reversed intervals, low-end heap violations, high-end heap violations treating singleton as both endpoints, global minimum, global maximum, and member count.

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	`{"high_order": [], "low_order": [], "maximum": 4, "members": 1, "minimum": 4, "reversed": [0]}`	`{"high_order": [], "low_order": [], "maximum": 4, "members": 1, "minimum": 4, "reversed": []}`	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.