---
title: "world-story — Mova code model"
description: "Mova code model of world/src/story.rs: components with their labels, obernants and the model text."
url: "https://groupants.elamur.ai/free/en/mova/world/src/story.rs.groupant/"
---
Elamur: [Mova](https://md.mova.elamur.ai/free/en/) · [Dictionary](https://md.dictionary.elamur.ai/free/en/) · [Research](https://md.research.elamur.ai/free/en/) · **Groupants**

This page as HTML: <https://groupants.elamur.ai/free/en/mova/world/src/story.rs.groupant/>

# world-story

The groupant beside world/src/story.rs in the Mova repository: what the code computes, what it never does, how to go back from its outputs, its invariants, cost and checks.

## Facts

- **kind:** groupant
- **status:** partial source bound model
- **source:** [`world/src/story.rs`](https://github.com/ElamurAI/mova-free/blob/main/world/src/story.rs)
- **source SHA-256:** `40f1d7e9b3e7f56b…`
- **repository folder:** [`world/src/story.rs.groupant`](https://github.com/ElamurAI/mova-free/tree/main/world/src/story.rs.groupant)
- **repository commit:** `48f2e6f74146`

> **Implementation material.** A Mova code model describes this code at one source revision: partial models, finite checks and their stated scope. It is not a reviewed general exposition, and its labels are shown as written, never raised.

## Components

| component | label | where |
|---|---|---|
| **approximant** | partial source model | [forward](#forward) |
| **ast** | partial | `syntax.json` |
| **composition** | partial source model | [composition](#composition) |
| **cost** | partial source model | [cost](#cost) |
| **descriptant** | partial source model | [epoch-memory](#epoch-memory) |
| **invariant** | partial source model | [invariant](#invariant) |
| **tests** | partial source model | [checks](#checks) |

## Obernants

The typed relations around the forward model: the behaviour complement (what the code never does), the reverse reconstruction (every input compatible with an output) and specialised views.

| id | type | label | where |
|---|---|---|---|
| `world-story-behavior-complement` | behavior_complement | partial source model | [behavior-complement](#behavior-complement) |
| `world-story-reverse-reconstruction` | reverse_reconstruction | partial source model | [reverse-reconstruction](#reverse-reconstruction) |
| `world-story-strictness-witness` | constraint_relation | partial source model | [strictness-witness](#strictness-witness) |
| `world-story-interval-priority` | priority_relation | partial source model | [interval-priority](#interval-priority) |
| `world-story-world-partition` | identity_relation | partial source model | [world-partition](#world-partition) |
| `world-story-dead-edge-memory` | information_loss | partial source model | [dead-edge-memory](#dead-edge-memory) |
| `world-story-observer-minimum` | priority_relation | partial source model | [observer-minimum](#observer-minimum) |
| `world-story-narrator-depth` | projection_relation | partial source model | [narrator-depth](#narrator-depth) |
| `world-story-dependency-fallback` | resource_boundary | partial source model | [dependency-fallback](#dependency-fallback) |
| `world-story-absence-default` | constraint_relation | partial source model | [absence-default](#absence-default) |

## Parts

- [world-story-time](https://md.groupants.elamur.ai/free/en/mova/world/src/story.rs.groupant/time.groupant/)
- [world-story-frames](https://md.groupants.elamur.ai/free/en/mova/world/src/story.rs.groupant/frames.groupant/)
- [world-story-knowledge](https://md.groupants.elamur.ai/free/en/mova/world/src/story.rs.groupant/knowledge.groupant/)
- [world-story-reproduction](https://md.groupants.elamur.ai/free/en/mova/world/src/story.rs.groupant/reproduction.groupant/)

## Model text


### model

## world-story

Partial source-bound model, 2026-10-30. The reference is the exact sibling Rust source. The domain is valid finite typed values reachable through checked World::apply, except explicitly constructed graph/helper fixtures. Public mutable graph/frame fields are not defended against arbitrary corruption. No live parser, teacher, corpus, GPU or persistence is exercised.

### forward

State is (point identity map, world ids, live tagged edges, frames, canonical metadata, knowledge and reveals). add accepts u<=v or u<v exactly when a return path does not form a strict cycle; equal-node weak insertion is a no-op. path prefers any strict witness. order is an ordered classifier of endpoint reachability, not a complete Allen algebra. known_since takes the first minimum sentence among explicit knowledge, reveals, telling, listeners and narrator opening. creation_order orders six supported registries with bounded dependency passes.

### invariant

On graphs constructed through add, no live cycle contains a strict edge. Pt identity reuses its first world id; callers must maintain same-world edge premises. A public Order is a projection of constraints, not their converse. Stack and parent acyclicity are established by narrative commands, not validated by recursive narr_level.

### cost

With V endpoints and E stored edges, path is O(V+E), add one path plus append; kill O(E). closure iterates at most V+2 rounds, scanning live edges and cloning V/64-word rows: O(V E ceil(V/64)) time and O(V ceil(V/64)) result memory. Dead edges still occupy adjacency storage. known_since scans K knowledge and R reveals. creation_order costs up to 64 scans of N candidates with ordered-set lookup and entity snapshot work.

### composition

Time, frame, observer and reproduction fragments share Id/Pt identity. narr::register creates endpoints and metadata; narr::relate inserts endpoint constraints; World::apply supplies outer rollback. Frame worlds and canonical metadata must agree on wid. Knowledge sentence time is independent of story endpoint order.

### checks

Native story::wave9_models tests exercise the bounded domains described in evidence.md at the file root. Ordinary test bodies have partial syntax projections; macro token contents are opaque. The graph oracle uses a dense three-state Floyd closure, not the implementation BFS/bitset algorithm. Typed commands call the real public World::apply boundary.

### epoch-memory

Initial modeling epoch: distinguish admitted graph states from arbitrary public-field edits, and internal mutation from public commit. No production bug was established. In particular narr::relate restores its multi-edge batch, and World::apply discards a cloned failed command even when apply_root has already added a cause edge. Creation ordering has a deliberate 64-round fallback, not an unrestricted topological-sort guarantee. No percentage-error approximant or performance claim.

### behavior-complement

Subject: world-story, source-bound revision. Domain and observation: the finite typed state/transition family in forward, with dependencies fixed. Operator: Within the add-generated graph universe, transitions accepting a strict return cycle are absent. With missing event endpoints order cannot certify any relation. Different start-node world ids preclude all order labels except OtherWorld. These exclusions do not promise that raw add rejects cross-world edges.

Assurance: source-derived partial relation, with finite native evidence where named in checks. Unknown paths remain unknown; no universal coverage or unique inverse is inferred. Complement claims are inner absent-behavior bounds under their stated premises; reverse relations retain all compatible antecedents in their declared family.

### reverse-reconstruction

Subject: world-story, source-bound revision. Domain and observation: the finite typed state/transition family in forward, with dependencies fixed. Operator: Given only order(a,b), retain every valid graph whose prioritized classifier returns that label. The fiber discards edge provenance, redundant paths, other nodes and absolute chronology. For the acyclic strict three-edge family (0,1),(1,2),(0,2), reach(0,2)=strict has exactly masks 3,4,5,6,7; enumeration is complete only on those eight candidates.

Assurance: source-derived partial relation, with finite native evidence where named in checks. Unknown paths remain unknown; no universal coverage or unique inverse is inferred. Complement claims are inner absent-behavior bounds under their stated premises; reverse relations retain all compatible antecedents in their declared family.

### strictness-witness

Subject: world-story, source-bound revision. Domain and observation: the finite typed state/transition family in forward, with dependencies fixed. Operator: Observe a path as node-contiguous alive edge indices; its strictness is OR of edge flags. A strict witness dominates a weak witness; witness uniqueness is not promised.

Assurance: source-derived partial relation, with finite native evidence where named in checks. Unknown paths remain unknown; no universal coverage or unique inverse is inferred. Complement claims are inner absent-behavior bounds under their stated premises; reverse relations retain all compatible antecedents in their declared family.

### interval-priority

Subject: world-story, source-bound revision. Domain and observation: the finite typed state/transition family in forward, with dependencies fixed. Operator: order checks Before/NotAfter then After/NotBefore, During, Contains, Overlap, Unknown; equal intervals can classify During, while zero-duration self intervals can classify NotBefore.

Assurance: source-derived partial relation, with finite native evidence where named in checks. Unknown paths remain unknown; no universal coverage or unique inverse is inferred. Complement claims are inner absent-behavior bounds under their stated premises; reverse relations retain all compatible antecedents in their declared family.

### world-partition

Subject: world-story, source-bound revision. Domain and observation: the finite typed state/transition family in forward, with dependencies fixed. Operator: Endpoint identity is Pt, not (Pt,wid): a repeated node call reuses its original world. order checks start-world equality, while add itself has no world gate.

Assurance: source-derived partial relation, with finite native evidence where named in checks. Unknown paths remain unknown; no universal coverage or unique inverse is inferred. Complement claims are inner absent-behavior bounds under their stated premises; reverse relations retain all compatible antecedents in their declared family.

### dead-edge-memory

Subject: world-story, source-bound revision. Domain and observation: the finite typed state/transition family in forward, with dependencies fixed. Operator: kill changes alive bits but retains adjacency/index identity. Current reachability cannot reconstruct killed-edge provenance; full storage can.

Assurance: source-derived partial relation, with finite native evidence where named in checks. Unknown paths remain unknown; no universal coverage or unique inverse is inferred. Complement claims are inner absent-behavior bounds under their stated premises; reverse relations retain all compatible antecedents in their declared family.

### observer-minimum

Subject: world-story, source-bound revision. Domain and observation: the finite typed state/transition family in forward, with dependencies fixed. Operator: known_since uses strict less-than replacement: first explicit know wins equal-sentence ties over later knows/reveals/telling. The returned explanation is part of the observation.

Assurance: source-derived partial relation, with finite native evidence where named in checks. Unknown paths remain unknown; no universal coverage or unique inverse is inferred. Complement claims are inner absent-behavior bounds under their stated premises; reverse relations retain all compatible antecedents in their declared family.

### narrator-depth

Subject: world-story, source-bound revision. Domain and observation: the finite typed state/transition family in forward, with dependencies fixed. Operator: narr_level counts observer changes on the parent chain rather than stored frame.level. Parent acyclicity and u8 capacity are premises; arbitrary corrupt cycles are not termination-safe.

Assurance: source-derived partial relation, with finite native evidence where named in checks. Unknown paths remain unknown; no universal coverage or unique inverse is inferred. Complement claims are inner absent-behavior bounds under their stated premises; reverse relations retain all compatible antecedents in their declared family.

### dependency-fallback

Subject: world-story, source-bound revision. Domain and observation: the finite typed state/transition family in forward, with dependencies fixed. Operator: creation_order stops deferrals after 64 passes, then emits residuals; this bounds iteration but not dependency correctness for long chains/cycles.

Assurance: source-derived partial relation, with finite native evidence where named in checks. Unknown paths remain unknown; no universal coverage or unique inverse is inferred. Complement claims are inner absent-behavior bounds under their stated premises; reverse relations retain all compatible antecedents in their declared family.

### absence-default

Subject: world-story, source-bound revision. Domain and observation: the finite typed state/transition family in forward, with dependencies fixed. Operator: is_real(absent)=true is a permissive helper default. Callers needing existence must check the event registry separately; it is not evidence an event happened.

Assurance: source-derived partial relation, with finite native evidence where named in checks. Unknown paths remain unknown; no universal coverage or unique inverse is inferred. Complement claims are inner absent-behavior bounds under their stated premises; reverse relations retain all compatible antecedents in their declared family.

### evidence

#### story bounded evidence

2026-10-30. Source SHA-256: `40f1d7e9b3e7f56b2d2744b64b9e13da4d56044acc74baf6e752067093092889`.

No production code changed: the baseline source is an exact prefix of the final file. The only source additions are native wave9_models test bodies. No bug was inferred from internal partial mutation: World::apply supplies the actual rollback boundary. No runtime repair was warranted.

The file root declares ten typed views and four scoped fragments with three views each: 22 typed views per file, 44 across this pair. Fragments do not claim all branch coverage. Their byte scopes and partial syntax bind the final source.

##### Executed checks

Command family: `cargo test -p world --lib [--release] wave9_models -- --test-threads=1`. Eleven tests pass twice in debug and twice in release, with identical normalized test identities/results. Five story tests and six narr tests run in every profile. The final restored debug run also passes all eleven after both compiled mutation controls. Existing unrelated compiler warnings remain.

The independent three-node Floyd semiring oracle exhausts 729 absent/weak/strict directed-edge codes in fixed insertion order. It checks acceptance/refusal, reach, closure, alive witness continuity, removal of all edges sourced at node 1, and strict/weak self-edge boundaries. It is finite evidence, not a proof for unrestricted graph size. The eight acyclic three-edge inputs produce five compatible strict-reach preimages (masks 3,4,5,6,7).

Narrative relation checks enumerate 36 valid endpoint assignments over 0..2 for each of Before, After, During and Same: 144 comparisons of actual inserted inequalities against independent interval predicates. A separate second-edge During contradiction checks exact graph restoration.

Controlled typed-world checks exercise public frame nesting/refusal/resumption, isolated new-world identity, claim/knowledge canonical references, future-knowledge refusal, past projection erasure, and line splicing with pending-cause dedup/consumption. The reveal rollback fixture first permits a cause edge and then rejects contradictory temporal placement: public World::apply preserves the original graph/reveal/event observations, while direct internal apply_root retains its earlier cause edge. This is a tested boundary distinction, not a proposed public semantic change.

##### Compiled mutation controls

- story: change strict-cycle guard `s || strict` to `s && strict`. `story::wave9_models::finite_time_oracle_and_kill` fails assertion at code 11 (accepted=true versus oracle=false).
- narr: replace `st.time = saved` in relate with discarding saved. `narr::wave9_models::relation_endpoint_oracle_and_atomic_pair` fails with an extra first inequality after second-edge refusal.

Each mutant compiled successfully, failed a named assertion, and was restored byte for byte before the final positive run. Compile failures are not counted as controls.

##### Actual joins and limits

Source inspection: World::apply -> position -> clone -> apply_root -> step -> exec_v3 or frame apply_local -> register -> TimeGraph. Time commands call relate; reveal does cause insertion before relation, requiring the outer clone for whole-command rollback. Past closing calls merge_from -> creation_order/recreate -> local exec/check_links with per-command rollback and warning accumulation. qa3::knows reads known_since (caller name/line may change independently); vmm uses world_frame for current frame world. These call paths are not all exhaustively executed.

Valid parent trees and sufficient u8 levels are premises. Public mutable frame/graph fields can construct invalid cycles or indexes; those malformed-state APIs have no universal safety guarantee. creation_order's 64-pass fallback is bounded but not an unrestricted topological-order guarantee. No full merge branch coverage, live parser, corpus, filesystem persistence, teacher, GPU, throughput or approximation-error claim.

##### Structural evidence

Two fresh syntax exports per source are byte-identical. groupants-final.json reports valid=true and no diagnostics using an external registry that wraps the unchanged baseline tree plus these two leaves. The external validation parent intentionally has no repository sidecar (missing_group_sidecars=1); the integration agent owns permanent ancestor/registry updates. changed.json reports only story.rs and narr.rs changed, missing=[]. Structural validity does not verify semantics.

Raw evidence resides under `$MOVA_DATA/runs/octopus-wave9-story-2026-10-30/`. SHA-256 bindings:

| Artifact | SHA-256 |
|---|---|
| debug1.log | `4a5ae0ad9a645189574c8869249014b60dc10d548b09c748c171e63c285646ed` |
| debug2.log | `597dd5322b098415c0efced4592ca4edcab74d20e87536f4b064337b07dab685` |
| release1.log | `8632f33f1a6ce3bba5ce5300d91340f1f15a27e21de3484239445ec2d8b68127` |
| release2.log | `18b654d2ce3e5e7ddbe7fcfee9cbd18d8927b4e0c427b92e25eaee76c1034b08` |
| mutant-story.log | `bfddeae7d2c6b5c264c0342c8a8f2f82f31138dbe48ba432b83c01594e1acd94` |
| mutant-narr.log | `5c604a72f84ca9dcff5c067452eb65e3e64bbf862e453e7256f896e9d0e81829` |
| restored.log | `312856721b3639774d3714626c18e70fe19b64dbc6e7018377f4069f631622b6` |
| normalized.txt | `a126d1c58ee365428170a357360ef3abb9a7b07643cc8193d07fd8c2d758cf30` |
| validation.log | `d220d39db7a8b4decc9876fb43eeec73cc1b1f36e4dddb5f852345a2a26e14ec` |
| story-final-a.json | `4b82b3f4c0f05eb308cc29fb0e825df8d432d04ec8612f942017354248e01227` |
| story-final-b.json | `4b82b3f4c0f05eb308cc29fb0e825df8d432d04ec8612f942017354248e01227` |
| narr-final-a.json | `81c6f6c662760b8e5dd029575cd09852464ca0ac96b5e1623b80d9eedd88e26c` |
| narr-final-b.json | `81c6f6c662760b8e5dd029575cd09852464ca0ac96b5e1623b80d9eedd88e26c` |
| groupants-final.json | `af066b29359f1aef6a5aac6880ebba017f8e63392dab4d67beaef9c7de6016a8` |
| changed.json | `533bae8ae43062891c32162ebb2dcb9756d7d138199b70a4373087f7070a5ac0` |