Frame 06 · autonomous assembly proof
Swarm-Built Space Station
Six synthetic agents build one orbital system without sharing write authority. Each owns one frame-chain dimension—plainly, one station part only that agent may update. Every move becomes a canonical, SHA-256-addressed frame; compatible work merges, contradictions remain visible.
The tour includes one deliberate ownership violation and proves it cannot alter verified work.
Scope: This is a synthetic explanatory model, not flight software. SHA-256 proves byte identity and linkage here; it does not establish real-world truth, safety, authorship, or Byzantine consensus.
Merged station state
AWAITING GENESISLedger · canonical frames, hashes, and reattach provenance
Mutations · prove both failure paths
Each mutation runs against a snapshot and is checked by a separate verifier. Rejection must leave every accepted hash untouched.
Copyable any-LLM proof prompt
Ask any capable coding model for an independent implementation, then compare its assertions and exact score.
Create one museum-quality, self-contained offline HTML file that demonstrates a swarm-built synthetic space station using frame chains. Do not use libraries, external assets, network calls, timestamps, random APIs, or precomputed fake hashes. Model six autonomous agents with exclusive owned dimensions: habitat, power, life_support, navigation, science, and docking. Use a published fixed seed and a deterministic PRNG to order concurrent work. Every accepted append must contain its dimension, owner, logical tick, parent hash, declared reads, payload, and provenance. Serialize with a recursively key-sorted canonical JSON function and compute the frame address with the browser's canonical Web Crypto SHA-256 implementation. Render the station from merged state, not from an unrelated animation counter. Include a guided run, single-step manual control, replay, reset, a readable ledger, assertions, keyboard controls, aria-live status, 44px controls, responsive layout, reduced-motion support, and light/dark theme variables. Create six shared interface claims. Five must agree. Life support and docking must independently choose contradictory airlock pressure rules (68 kPa and 72 kPa). Preserve both alternatives in parallel. Derive and display exact merge fidelity as mergeable shared interface slots / all shared interface slots = 5 / 6 = 0.833333. Never let the score authorize conflict erasure. Encode every interface claim as a content-addressed frame. Also encode each candidate station base as a checkpoint frame whose state and source heads are independently reproduced by replay. Derive conflicts, alternatives, fidelity, and all visible labels only by verifying and replaying those frames. Take navigation offline. Let it append a stranded frame to its own dimension while merged station work continues. Reattach it through a newest-to-oldest ladder derived from checkpoint frames: reject two candidate bases for explicit read-set mismatches, accept the first contradiction-free base, and append a bridge carrying origin agent, local parent, accepted base hash, rejected candidate hashes, and reasons. Submit normal appends, a cross-dimension write candidate, and a one-winner overwrite proposal through the same independent semantic verifier. Render verdict words only from its returned result. Prove sensitivity: generating both airlock claims as 68 kPa must yield no conflict and 6/6; generating the power genesis frame with Aster as authority must make Aster's power candidate accepted and turn the expected-rejection assertion red. Explain the scope: content addressing proves identity and linkage, not truth or operational safety. Return only the complete runnable HTML.