FA-40124 / Heap invariants / Member archive

Fibonacci cascade clears each promoted ancestor mark including the last cut · case 04

The bounded fibonacci cascade certificate reports an incorrect cleared.

Member previewVariant 4 · 3 implementations · 7 checks per implementation

Case contract

A cascading-cut path runs from the parent of an initially cut node upward as [id,is_root,marked]. Stop at a root or first unmarked nonroot; mark that first unmarked node. Previously marked nonroots are cut and unmarked. Report cut ids, marked stop, cleared ids, visited count, promoted count, and potential change roots+2*marks.

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 4	`{"cleared": [], "cuts": [1], "new_mark": 2, "potential_delta": 1, "promoted_count": 1, "visits": 2}`	`{"cleared": [1], "cuts": [1], "new_mark": 2, "potential_delta": 1, "promoted_count": 1, "visits": 2}`	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.