Elamur GroupantsāŒ•
☰

rt-mixed-heb

The groupant beside tools/roundtrip/src/mixed/heb.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

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

componentlabelwhere
approximantpartialapproximant
astpartialsyntax.json
compositionpartialcomposition
costsymbolic source derivedinvariant
descriptantpresentdescriptant
invariantpartialinvariant
testsexecuted bounded checkstests

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.

idtypelabelwhere
behavior_complementbehavior_complementpartial source derived modelbehavior_complement
reverse_reconstructionreverse_reconstructionpartial source derived modelreverse_reconstruction
nfc_gap_fibernfc_gap_fiberpartial source derived modelnfc_gap_fiber
lookup_tielookup_tiepartial source derived modellookup_tie
head_transporthead_transportpartial source derived modelhead_transport
residual_boundaryresidual_boundarypartial source derived modelresidual_boundary

Parts

Model text

descriptant

Descriptant

Prospective epoch

2026-10-31 source review predicted: tokens_up/down retain wrap, NFC deviations by whitespace-run ordinal, noncanonical (sentence,token) gaps and tail. Lookup selects maximum count then smallest form with full/tag/lemma backoff. tree_encode/decode retains form overrides, boundary XORs and written overrides. frames_encode aligns consonant lemmas then two head/relation passes; apply remaps one-based heads and patches zero-based Take coordinates. Resource model: NFC/token passes O(B) plus search costs; map lookup O(log L) times key lengths; tree O(W log W); frames align O(WRlemma_bytes) time and O(W+R+patch_bytes) space; read repeatedly scans children, at most quadratic; realize quote lookup can be quadratic. External prospective.md predates test additions and preserves APIs, effect order, hazards and interaction hypotheses.

Observed epoch

Bounded real helper checks in tests.md constrain these models; syntax is a partial lexical projection with no macro expansion, name resolution or proof. Production expressions unchanged; six inline test modules added. Compiled mutants are temporary and exactly restored. Existing malformed-input and nonfinite domains remain explicit, not silently repaired. Parent composes this scope with siblings without adding overlapping costs twice.

Finite synthetic helper evidence only; live corpora, parser/model loading, full orchestration and filesystem failure races excluded.

approximant

Forward relation

tokens_up/down retain wrap, NFC deviations by whitespace-run ordinal, noncanonical (sentence,token) gaps and tail. Lookup selects maximum count then smallest form with full/tag/lemma backoff. tree_encode/decode retains form overrides, boundary XORs and written overrides. frames_encode aligns consonant lemmas then two head/relation passes; apply remaps one-based heads and patches zero-based Take coordinates.

Domain: Valid UTF-8; words/forms lengths agree; positive group sizes sum to words; heads are zero or in range; generated scripts use unique valid Take indices. Residual metrics are finite nonnegative estimates, not compressed byte lengths.

invariant

Invariant and cost

Invariant

Valid UTF-8; words/forms lengths agree; positive group sizes sum to words; heads are zero or in range; generated scripts use unique valid Take indices. Residual metrics are finite nonnegative estimates, not compressed byte lengths.

Cost

NFC/token passes O(B) plus search costs; map lookup O(log L) times key lengths; tree O(W log W); frames align O(WRlemma_bytes) time and O(W+R+patch_bytes) space; read repeatedly scans children, at most quadratic; realize quote lookup can be quadratic.

Limits

Finite synthetic helper evidence only; live corpora, parser/model loading, full orchestration and filesystem failure races excluded. No percentage surrogate is implemented: categorical parsing/effect observations lack an admitted numerical error metric. Any future profile must define its metric/domain and use only1/2/5/10 percent caps.

composition

Local composition

tokens_up/down retain wrap, NFC deviations by whitespace-run ordinal, noncanonical (sentence,token) gaps and tail. Lookup selects maximum count then smallest form with full/tag/lemma backoff. tree_encode/decode retains form overrides, boundary XORs and written overrides. frames_encode aligns consonant lemmas then two head/relation passes; apply remaps one-based heads and patches zero-based Take coordinates.

Children select narrow source functions with their exact byte intervals. Remaining branches stay in the file model; fragments are not exhaustive partitions. Calls and state joins follow the forward relation, not folder order. Shared scans/helpers are counted once in whole-file costs. Complement of composition is not union of complements; reverse composition retains compatible intermediates and caller premises.

models

Typed source-bound relations

Subject: exact source SHA-256 in manifest. Domain and resource premises are in invariant.md. Each model is partial, source-derived, over a single helper invocation or the described finite trace. Complements are proposed inner exclusions under those premises; reverse relations retain all compatible antecedents, with no unique inverse claim. The oracle is the named checks in tests.md; unexecuted cases remain hypotheses. No numerical approximation certificate.

behavior_complement

Without residual, excluded claim: arbitrary original spacing, accents or missing forms are recovered. With generated residual valid domains exclude altered original token/tree bytes.

reverse_reconstruction

Token output alone admits all wrap/gap/NFC antecedents; (tokens,R1) reconstructs original text. Generated R3 plus fixed realized words recovers target words, but not unique parsed source forms.

nfc_gap_fiber

R1 raw indices count whitespace chunks, gaps count sentence/token pairs, never byte offsets.

lookup_tie

Equal frequency normalized forms choose lexicographically smallest; unknown lemma returns None, underscore excluded.

head_transport

Take.from is zero-based; stored head is one-based or zero; inverse alignment remaps heads before patches.

residual_boundary

R2 joins toggle canonical adjacency; written override precedes concatenated forms; no residual implies canonical forms.

tests

Checks and evidence

Named source/helper checks: mixed::heb::tests::tokens_come_back, mixed::heb::tests::script_gives_the_tree_back.

Wave32 on2026-10-31:10 distinct exact tests passed twice debug and twice release, with equal sorted named outcomes. This node claims only its listed subset; empty subset means source review only. Five actual source-behavior mutants compiled, failed assertions, restored exact bytes/hash, and passed focused green reruns. No assertion-only mutants; existing swapped-input controls are separate. Receipt bundle: $MOVA_DATA/runs/octopus-wave32-rt_mixed-2026-10-31 (native-commands.json, source-test-map.json, mutation-results.json, .status/.log). No live corpus, teacher, frozen assessment, download or production data used.

Finite synthetic helper evidence only; live corpora, parser/model loading, full orchestration and filesystem failure races excluded.

This page in Markdown → https://md.groupants.elamur.ai/free/en/mova/tools/roundtrip/src/mixed/heb.rs.groupant/