Interactive evidence · §3.7
Deterministic re-attachment
A stranded frame declares the content addresses it read. Each candidate base is compared by set intersection, in fixed order; no model chooses the winner.
What you are looking atOne stranded frame, its declared read addresses, and a fixed ladder of candidate bases with computed conflict sets.
Do thisSearch the ladder, tamper with the selected base, then run the dry-hole scenario.
Watch forThe first empty contradiction set wins; tampering moves the choice to the next clean base.
What this demonstratesRe-attachment is a deterministic read-set comparison, and no candidate means no mutation.
Scope: the result is only as complete as the declared read set and candidate ladder. The model does not authenticate either input or prove that an omitted dependency is safe.
Stranded frame · declared reads
Ordered candidate ladder
| Order | Candidate base | Declared upstream reads | Computed contradiction set |
|---|
Deterministic result
No search run yet.
Preserved histories
Input hash assertion: not run
Choice assertion: not run
Provenance assertion: not run
Dry-hole assertion: not run
Choose an action to begin.
The search log is empty.
Prove this with any LLM
Copy this prompt into any model. It requests a self-contained implementation that can be independently verified.
Create one self-contained HTML file with no dependencies that independently proves deterministic re-attachment without an LLM decision. Requirements: - Give one stranded frame a declared read set of name → SHA-256 content-address pairs. - Provide at least four candidate bases in a fixed ladder spanning a local head, another local dimension, and public federated histories. - Independently recompute the stranded-frame and candidate-base hashes before selecting a base; fail closed if any hash is invalid. - For each candidate, compute the exact contradiction set: intersect read names, then include every shared name whose content addresses differ. - Select the first candidate whose computed contradiction set is empty; do not hard-code a candidate index. - On success, append a content-addressed graft frame containing grafted_from and selected_base provenance while preserving the stranded original. - Include a tamper control that changes one candidate declaration, recomputes its hash and conflict set, and visibly changes the deterministic selection. - Include a dry-hole scenario in which every candidate conflicts; prove it is a no-op by comparing canonical history bytes before and after. - Display full read addresses, candidate hashes, conflict sets, exact provenance, assertions, and an operation log. - Provide reset, keyboard-accessible controls, aria-live feedback, reduced-motion handling, and light/dark theme support. Return the complete runnable HTML. Every verdict must be computed from current data so another reader can independently inspect and break the invariant.