FA-41235 / Heap invariants / Member archive

Pointer heap traversal records every repeated reference rather than expanding or hiding aliases · case 05

The bounded complete tree certificate certificate reports an incorrect repeated.

Member previewVariant 5 · 3 implementations · 7 checks per implementation

Case contract

A bounded binary pointer-tree certificate gives node records [id,left_id,right_id], root id or None; references name existing nodes or None. Breadth-first traversal stops expanding previously seen ids. Assign conceptual heap indices root=0,left=2i+1,right=2i+2. Report visit ids, unreachable ids, shared/cyclic references encountered, completeness (unique indices 0..n-1 and all nodes reached without repeats), right-only parents, and parent multiplicities.

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 5	`{"complete": false, "incoming": {"a": 2, "b": 2}, "repeated": [], "right_only": [], "unreachable": [], "visits": ["a", "b"]}`	`{"complete": false, "incoming": {"a": 2, "b": 2}, "repeated": ["b", "a", "a"], "right_only": [], "unreachable": [], "visits": ["a", "b"]}`	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.