FA-40982 / Heap invariants / Member archive

Persistent heap update copies the full search path while sharing off-path subtrees · case 02

The bounded persistent path copy certificate reports an incorrect allocations.

Member previewVariant 2 · 3 implementations · 7 checks per implementation

Case contract

A persistent array-backed heap update supplies a root-to-target node-id path, off-path sibling ids, old node generations, and a new generation. Allocate one copy per path node, reconnect copied edges, share every sibling, and preserve old node references. Report allocated pairs, copied edges, shared ids, old generation list, new root reference, and target reference.

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	`{"allocations": [[3, 9]], "edges": [[[1, 9], [3, 9]]], "old_refs": [[1, 2], [3, 2]], "root": [1, 9], "shared": [[2, 2]], "target": [3, 9]}`	`{"allocations": [[1, 9], [3, 9]], "edges": [[[1, 9], [3, 9]]], "old_refs": [[1, 2], [3, 2]], "root": [1, 9], "shared": [[2, 2]], "target": [3, 9]}`	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.