FA-40352 / Heap invariants / Member archive

Lazy compaction filters by current version and restores priority order · case 02

The bounded lazy compaction certificate reports an incorrect kept.

Member previewVariant 2 · 3 implementations · 7 checks per implementation

Case contract

A lazy heap compaction receives arbitrary physical records [priority,serial,id,version] and live map id->version. Preserve only records whose id and version match, retain duplicate physical records for diagnostic detection, heapify by (priority,serial), and report stale count, duplicate-current ids, live-id coverage, storage ratio numerator, and triggering condition physical>2*live+slack.

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	`{"duplicate_current": [], "kept": [[2, 2, "b", 0], [3, 1, "a", 1], [5, 0, "a", 0]], "missing": [], "post_size": 2, "stale": 1, "trigger": false}`	`{"duplicate_current": [], "kept": [[2, 2, "b", 0], [3, 1, "a", 1]], "missing": [], "post_size": 2, "stale": 1, "trigger": false}`	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.