FA-41054 / Heap invariants / Member archive

Twin heap shared record deletion preserves equal-priority neighbors · case 04

The bounded twin heap delete certificate reports an incorrect records.

Member previewVariant 4 · 3 implementations · 7 checks per implementation

Case contract

A double-ended heap certificate has min-order ids, max-order ids, and unique live records id->priority. Erase id x from both heaps by identity, preserving surviving order for this logical model. Report min ids, max ids, live map, cross-index mapping from surviving min slots to max slots, next minimum, and next maximum. Equal priorities retain separate identities.

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	`{"cross_index": [], "max_ids": [], "maximum": null, "min_ids": [], "minimum": null, "records": {"a": 2}}`	`{"cross_index": [], "max_ids": [], "maximum": null, "min_ids": [], "minimum": null, "records": {}}`	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.