---
title: "world-triggers-events-io — Mova code model"
description: "Mova code model of world/src/triggers.rs: components with their labels, obernants and the model text."
url: "https://groupants.elamur.ai/free/en/mova/world/src/triggers.rs.groupant/events-io.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/triggers.rs.groupant/events-io.groupant/>

# world-triggers-events-io

The groupant beside world/src/triggers.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_fragment
- **status:** partial source derived instance
- **source:** [`world/src/triggers.rs`](https://github.com/ElamurAI/mova-free/blob/main/world/src/triggers.rs)
- **source SHA-256:** `4eea913faafa8f76…`
- **covers:** Logical source region "// ---- The self" through before "const NUMBER_WORDS". expect_after considers adjacent original pairs whose first event matches and second is neither message nor task; it does not reconnect across excluded events. Each group has floor(1000*n/N) and upper median of saturating time gaps. Sort descending probability then lexical event. Frequencies may sum below 1000. activate recognizes EVENTS, gets now, sanitizes tab/newline, truncates detail to 200 Unicode characters and best-effort appends; Task drop invokes task activation with Instant elapsed. episodes reads/reverses/truncates physical rows, not timestamp sorting. fire performs per-event reads then clock/timezone reads, so its input is not an atomic snapshot. This typed effect relation is unexecuted by bounded tests. outcome_rate counts all physical rows whose second tab column matches event, even malformed rows, then substring-matches word anywhere in those rows. surprising requires at least 20 matching rows and hits*20 <= rows. expectation_line composes separate reads, not an atomic log snapshot; no native live-log execution. Parent composition retains shared text/clock/intermediate values. Full-file wrapper and test gaps remain in the root. (bytes 2910–10395)
- **part of:** [world-triggers](https://md.groupants.elamur.ai/free/en/mova/world/src/triggers.rs.groupant/)
- **repository folder:** [`world/src/triggers.rs.groupant/events-io.groupant`](https://github.com/ElamurAI/mova-free/tree/main/world/src/triggers.rs.groupant/events-io.groupant)
- **repository commit:** `855da7bd4a7b`

> **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 | [Forward](#forward) |
| **ast** | partial | `../syntax.json` |
| **composition** | partial | [Composition](#composition) |
| **cost** | symbolic unmeasured | [Cost](#cost) |
| **descriptant** | present | `model.md` |
| **invariant** | partial | [Invariant](#invariant) |
| **tests** | bounded evidence | [tests](#tests) |

## 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 |
|---|---|---|---|
| `nonbehavior` | behavior_complement | partial source derived model | [nonbehavior](#nonbehavior) |
| `antecedents` | reverse_reconstruction | partial source derived model | [antecedents](#antecedents) |
| `event_statistics` | ordered_trace_projection | partial source derived model | [event_statistics](#event-statistics) |
| `io_clock` | effect_boundary | partial source derived model | [io_clock](#io-clock) |
| `outcome` | threshold_projection | partial source derived model | [outcome](#outcome) |

## Model text


### descriptant

## world-triggers-events-io

### Forward

Logical source region "// ---- The self" through before "const NUMBER_WORDS". expect_after considers adjacent original pairs whose first event matches and second is neither message nor task; it does not reconnect across excluded events. Each group has floor(1000*n/N) and upper median of saturating time gaps. Sort descending probability then lexical event. Frequencies may sum below 1000. activate recognizes EVENTS, gets now, sanitizes tab/newline, truncates detail to 200 Unicode characters and best-effort appends; Task drop invokes task activation with Instant elapsed. episodes reads/reverses/truncates physical rows, not timestamp sorting. fire performs per-event reads then clock/timezone reads, so its input is not an atomic snapshot. This typed effect relation is unexecuted by bounded tests. outcome_rate counts all physical rows whose second tab column matches event, even malformed rows, then substring-matches word anywhere in those rows. surprising requires at least 20 matching rows and hits*20 <= rows. expectation_line composes separate reads, not an atomic log snapshot; no native live-log execution. Parent composition retains shared text/clock/intermediate values. Full-file wrapper and test gaps remain in the root.

### Invariant

Respect source order, retain ambiguity of lossy text projections, and keep observed finite correspondence distinct from universal semantics. Pure functions have no modeled filesystem effects. Error paths before annotator acquisition do not write the output.

### Composition

Compose only through equal intermediate token sequences, paragraphs, quantities, event lists and explicit clock inputs. Parent roots cover every logical source region, including imports/constants and native tests; local fragments isolate useful operations and may overlap. The hierarchy is not a complete call graph. Same numeric answer does not imply same text or event history.

### Cost

Tokenization O(text bytes); quantity lookup O(words * units); recall O(EVENTS * words * hooks + lived scan); expectations O(events + sum group gap-sort costs); log reads O(file bytes), overlap O(manual bytes + candidates log candidates). Costs are symbolic operation/allocation counts, not measured speedups.

### Limits

Partial syn-2 syntax is source-bound; no macro expansion, semantic AST, name resolution or verified dependency behavior. No automatic reverse solver or production surrogate exists. Poly annotator acquisition/tokenization, detokenization, output encoding and filesystem failures beyond early rejection remain conditional. Trigger talk::civil/now/tz_offset, state::root, global nerves graph, manual data and stdout are dependency boundaries. No activate/Task/drop/fire/episodes/expectation/explain calls are made by the new bounded tests. Extremely large counts, nonfinite floating values, signed timestamp overflow and concurrent log append/read remain outside tested domains. Declared event effects are not executed.

### Epoch memory

2026-10-30 prospective: punctuation continuation should preserve a total token partition; malformed Gutenberg ordering should return Err before the parser. The old slice admitted a reversed-bound panic; the repair adds the ordering guard and isolates pure extraction without changing public signatures. Calendar century exceptions and expectation upper medians are predicted separately from natural-language semantics. Native tests and mutation controls calibrate these claims; see tests.md. Formal proofs and general corpus quality remain absent.

### catalog

## world-triggers-events-io

Domain: Finite English texts, finite positive unit quantities, year domain 1583..9999, in-range explicit u64 clock/i64 timezone, bounded event histories; named external log/graph/manual effects are conditional only.

All relations below are source-derived partial models, conditional on successful allocation and the stated input domain. U is the product of admitted inputs and observations (returns, errors, and explicit effects). R is the declared forward relation. Complement entries are candidate inner bounds of U minus R, not complements certified from an approximate emulator. Converse relations preserve every compatible antecedent; no unique original text or history is claimed.

### nonbehavior

With finite valid event logs exclude expect_after adding nonadjacent transitions and exclude unknown-event activate writes. Failure of append is silent, so successful durable activation cannot be inferred from return ().

Scope: Finite English texts, finite positive unit quantities, year domain 1583..9999, in-range explicit u64 clock/i64 timezone, bounded event histories; named external log/graph/manual effects are conditional only. Fixed code and dependency contracts; evidence in tests.md. This is a conditional source relation, not a general proof. The explicit native fixtures are falsifiable observations; untested I/O schedules remain gaps.

### antecedents

An expectation distribution reconstructs all ordered traces with matching accepted adjacency counts and upper medians, including arbitrary excluded pairs. A stored detail has many preimages under sanitization/truncation; a silent activation return leaves both failed and successful append histories.

Scope: Finite English texts, finite positive unit quantities, year domain 1583..9999, in-range explicit u64 clock/i64 timezone, bounded event histories; named external log/graph/manual effects are conditional only. Fixed code and dependency contracts; evidence in tests.md. This is a conditional source relation, not a general proof. The explicit native fixtures are falsifiable observations; untested I/O schedules remain gaps.

### event_statistics

expect_after considers adjacent original pairs whose first event matches and second is neither message nor task; it does not reconnect across excluded events. Each group has floor(1000*n/N) and upper median of saturating time gaps. Sort descending probability then lexical event. Frequencies may sum below 1000.

Scope: Finite English texts, finite positive unit quantities, year domain 1583..9999, in-range explicit u64 clock/i64 timezone, bounded event histories; named external log/graph/manual effects are conditional only. Fixed code and dependency contracts; evidence in tests.md. This is a conditional source relation, not a general proof. The explicit native fixtures are falsifiable observations; untested I/O schedules remain gaps.

### io_clock

activate recognizes EVENTS, gets now, sanitizes tab/newline, truncates detail to 200 Unicode characters and best-effort appends; Task drop invokes task activation with Instant elapsed. episodes reads/reverses/truncates physical rows, not timestamp sorting. fire performs per-event reads then clock/timezone reads, so its input is not an atomic snapshot. This typed effect relation is unexecuted by bounded tests.

Scope: Finite English texts, finite positive unit quantities, year domain 1583..9999, in-range explicit u64 clock/i64 timezone, bounded event histories; named external log/graph/manual effects are conditional only. Fixed code and dependency contracts; evidence in tests.md. This is a conditional source relation, not a general proof. The explicit native fixtures are falsifiable observations; untested I/O schedules remain gaps.

### outcome

outcome_rate counts all physical rows whose second tab column matches event, even malformed rows, then substring-matches word anywhere in those rows. surprising requires at least 20 matching rows and hits*20 <= rows. expectation_line composes separate reads, not an atomic log snapshot; no native live-log execution.

Scope: Finite English texts, finite positive unit quantities, year domain 1583..9999, in-range explicit u64 clock/i64 timezone, bounded event histories; named external log/graph/manual effects are conditional only. Fixed code and dependency contracts; evidence in tests.md. This is a conditional source relation, not a general proof. The explicit native fixtures are falsifiable observations; untested I/O schedules remain gaps.

### tests

#### Bounded native evidence

Commands: cargo test -p world --lib bounded_models -- --test-threads=1; repeat with --release. New native modules contain five tests per source, including a compiled wrong-model discriminator. Independent finite tables cover partition, headings, malformed extraction, units, Gregorian dates, explicit UTC civil time and event ordering; enumeration covers 1,555 token sequences through length four and 85 unit quantities. The poly public rejection fixture creates a fresh scratch directory and preserves a sentinel output. No live hot-state access or parser acquisition is exercised.

External mutation controls remove the marker-order guard and replace the Gregorian century predicate, then compile and run the corresponding native tests; both must fail, after which originals are restored. Debug/release logs are normalized to sorted bounded test outcomes and compared twice per profile. Syntax projection is generated twice and compared byte-for-byte. Detailed receipts and fingerprints: evidence.json at the file root. These are finite observations, not exhaustive Rust or I/O proofs.