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

# global-build

The groupant beside global/build.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:** [`global/build.rs`](https://github.com/ElamurAI/mova-free/blob/main/global/build.rs)
- **source SHA-256:** `f51324dd9ccd11f9…`
- **repository folder:** [`global/build.rs.groupant`](https://github.com/ElamurAI/mova-free/tree/main/global/build.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 | [approximant](#approximant) |
| **ast** | partial | `syntax.json` |
| **composition** | partial | [composition](#composition) |
| **cost** | partial | [cost](#cost) |
| **descriptant** | present | [descriptant](#descriptant) |
| **invariant** | partial | [invariant](#invariant) |
| **tests** | executed bounded checks | [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 |
|---|---|---|---|
| `behavior_complement` | behavior_complement | partial source derived model | [behavior_complement](#behavior-complement) |
| `reverse_reconstruction` | reverse_reconstruction | partial source derived model | [reverse_reconstruction](#reverse-reconstruction) |
| `fence_language` | fence_language | partial source derived model | [fence_language](#fence-language) |
| `canonical_codes` | canonical_codes | partial source derived model | [canonical_codes](#canonical-codes) |
| `auxiliary_tables` | auxiliary_tables | partial source derived model | [auxiliary_tables](#auxiliary-tables) |
| `effect_order` | effect_order | partial source derived model | [effect_order](#effect-order) |

## Parts

- [global-build-fences](https://md.groupants.elamur.ai/free/en/mova/global/build.rs.groupant/fences.groupant/)
- [global-build-auxiliary](https://md.groupants.elamur.ai/free/en/mova/global/build.rs.groupant/auxiliary.groupant/)

## Model text


### descriptant

#### global-build

Independent build-time seed compiler: sorted markdown traversal, fenced blocks, declaration/link validation and Rust tables plus optional TSV compilation.

##### Modeling epoch — 2026-10-31

Source read before tests and models; retained prospective notes accompany the parent. Current evidence uses bounded invented inputs only. This is partial modeling, not proof or corpus accuracy.

### approximant

#### Forward relation

F(root,exclude,out) walks sorted *.md paths, excludes path substrings, extracts closed blocks, inserts declarations and verb-class concepts, validates canonical code uniqueness, link endpoints/pairs, *_cats and principle ids, then emits lexical concept indices. First encountered verb lemma wins. absurdity/idioms append tables; expressions writes before global.rs.

##### Executable approximant gap

Exact categorical structure, identifiers, parser decisions and effects have no useful percentage metric established here. No executable surrogate, automatic substitution or 1/2/5/10% guarantee is claimed.

### invariant

#### Invariant and domain

Declared link endpoints index lexical concept names. No atomic output transaction or general generated-Rust validity proof. This path has no kg dependency/adapter.

##### Cost and resources

B input bytes,C concepts,L links,R auxiliary rows: O(B+C log C+LC+R log R), plus linear duplicate scans of selections/measures/relations; retained tables/generated text. Recursive directory walk has no symlink-cycle/resource cap.

### cost

#### Cost and resources

B input bytes,C concepts,L links,R auxiliary rows: O(B+C log C+LC+R log R), plus linear duplicate scans of selections/measures/relations; retained tables/generated text. Recursive directory walk has no symlink-cycle/resource cap.

### composition

#### Composition

Independent build-time seed compiler: sorted markdown traversal, fenced blocks, declaration/link validation and Rust tables plus optional TSV compilation.

F(root,exclude,out) walks sorted *.md paths, excludes path substrings, extracts closed blocks, inserts declarations and verb-class concepts, validates canonical code uniqueness, link endpoints/pairs, *_cats and principle ids, then emits lexical concept indices. First encountered verb lemma wins. absurdity/idioms append tables; expressions writes before global.rs.

The parent invokes scoped transformations through the actual functions named in their source ranges. Children partition useful observations, not a complete semantic proof; boundaries can omit helpers, tests and effects.

### models

### behavior_complement

Success excludes duplicate canonical concept codes/link pairs and undeclared link endpoints. Unknown blocks/unclosed blocks disappear, negative measures are admitted, verb-class names bypass code_error, duplicate lemma triggers first-win. Optional read failures become empty tables.

### reverse_reconstruction

Generated tables admit seeds differing in whitespace/comments, ignored/excluded blocks, absent/unreadable optional files. Lexical indices do not reconstruct seed traversal; some provenance survives file fields. No preimage in kg Registry Id space is established.

### fence_language

Any triple-backtick prefix closes an open block regardless of kind; unmatched opener is discarded, bare fences outside blocks ignored.

### canonical_codes

a and en:a collide as en:a. Concept/category language is lowercase2/3 letters; components are nonempty lowercase/digit/underscore.

### auxiliary_tables

Real absurdity cells sort by (verb,noun), scores0..4; tale cells require existing pairs but preserve input order despite sorted comment. Idioms sort pairs, validate five kinds, discard count/source.

### effect_order

walk/read panics precede emission; optional reads default empty; expressions writes before global.rs. No rollback and no kg store access.


### tests

#### Evidence

Parent source checks (a fragment inherits only the behavior they actually exercise):

- wave29::block_and_code_boundaries
- wave29::isolated_seed_compile_and_duplicate_gate
- wave29::build_child

Selected kg tests: 15 named outcomes, twice debug/twice release, equal sorted outcomes. Standalone actual global/build.rs: 3 named outcomes per run, twice debug/twice optimized; build_child is normally no-op, parent fixture invokes it against isolated synthetic seeds. Eight compiled source mutations (one per source) each compiled successfully and exited101 on the focused assertion; exact source restoration followed by positive rerun.

This fragment's untested branches remain source-derived. No live graph, DB, corpus, teacher, GPU or held-out evaluation was used. Command specs and numeric exits are retained in the external wave29 graphlang receipt. Strict kg Clippy reports existing source lints; see receipt.

### prospective

#### Prospective graph-language encoding model — 2026-10-31

Read all eight sources before edits. No optimization proposed. All executable fixtures are tiny invented strings, compressed temp files, or isolated subprocess directories; no repository corpus, live store, teacher, GPU or held-out execution.

- global/build.rs: walk sorted markdown paths; close a block on any fence, discard unclosed block; parse declarations, insert verb concepts, reject canonical duplicate codes, missing/duplicate links, unknown *_cats and duplicate principle ids; emit lexical concepts/index links, first-seen verb lemma. Auxiliary absurdity cells sort real entries but tale rows preserve input order. closed_data is a separate optional branch; failed reads become empty. Build effects are output writes, expressions before global.rs, not atomic. Model independently of kg. Tests will compile actual build.rs with rustc --test, helper tests plus a child test process driving main against synthetic seed/data directories. Bound cost O(B + C log C + LC + R log R), tables and generated text retained.
- kg/src/cols.rs: six parallel public vectors; push, sort tuple permutation, all-bit filter, binary search outgoing range requires sorted src; modulo-u64 delta/zigzag, exact byteplanes, zstd files written sequentially then count. Actual raw width is 32 bytes/edge, not header's 28. Empty mask retains all, parsed empty mask rejects. u32 sort indices truncate lengths >=2^32; malformed public column lengths can panic; LEB accepts trailing/noncanonical bytes, rejects >10 continuation groups but does not validate top-group overflow. Test endpoints, error branches and synthetic file roundtrip; no crash consistency guarantee.
- kg/src/gram.rs: u32 fields with last recognized tag wins, gender implies singular only when number zero, unknown POS=13 except empty POS=0, unknown tags ignored. implicit_subject copies number/gender/person then noun+nominative+PRON+IMPLICIT. Display can panic for arbitrary public bitpatterns; dotted display is not VESUM input. Tests order and implicit projection; O(tag bytes), bounded fields.
- kg/src/id.rs: heap/name vector, per-heap lazily loaded name arrays and hash maps, reserved local zero; append only suffixes. open creates keys directory; malformed heaps checked before key loading; duplicate serialized keys collapse map to last occurrence. New keys reject tabs/newlines after existing-key lookup. Heap max +1 can overflow; append buffering can report success before ignored drop flush errors. Test tiny persistence, kind conflict, corrupt consecutive indices, key rejection; no concurrent writer/crash test. Hash lookup expected O(1), heap scan O(H), key load/save O(bytes).
- kg/src/morph.rs: normalized form map and lemma/grammar synthesis map; two complete bz2 passes, vocabulary filters analyses then selected lemma/paradigm keys select synthesis. Normalization drops seven marks and maps four apostrophes then Unicode lowercase; split_line is literal space based. Government inherited only by verb/prep, xp form marker enters lemma key. Tiny bz2 fixture checks unseen vocabulary excluded but selected lemma's unrequested forms synthesized. O(2 decompressed bytes + retained analyses/forms).
- kg/src/uk.rs: tokenize Unicode with context joiners; punctuation first (input-order failure), empty/length/digit/conjunction/unknown then dash-with-verb gate. Proper/common filtering; enumerate finite predicate analyses, greedy attachment and case preferences; deduplicate equal Facts, accept exactly one. Scope children: token/gates, verbal/nominal construction, render completeness. Render compares normalized word multisets after synthesis and restored relation words; not roles/order. Costs bounded sentence words <=8, analysis alternatives unbounded; scans O(P*n^2*a), equality overhead for candidate facts. Test precedence, simple actual parse, agreement and normalization/check damage. No linguistic accuracy claim.
- kg/src/textgen.rs: frequency lexicographic pair conditional/global, dictionary-first tie; after-preposition third-person pronoun n-form pool; attributes depth <=4; 1..12 heads; subset DP O(n^2*2^n), O(n*2^n) memory; strict transition > retains first predecessor and final max tie chooses last. Empty heads rejects before private zero DP. Frequency u32 overflow profile dependent. Test form tie, head bound and real three-word generation, no corpus order training.
- kg/src/main.rs: pattern-matched CLI dispatch; read_tatoeba strict three fields but language ignored. tatoeba pipeline needs existing store before Registry open because names.tsv created first; parse_lines drops malformed lines/ends at first line I/O error; loads names and morphology before output truncate. sub validates mask before reading store, writes columns only without registry. stats equal-count order unstable HashMap ties. Test strict compressed reader, parse_lines synthetic integration, sub invalid mask precedence. Do not invoke tatoeba_uk or held-out scoring.

Composition hypothesis: Morph::load uses Gram then uk::parse produces Fact; render_check gives only multiset completeness; main encodes each member into registry-backed parallel columns with grammar and flags; textgen consumes Fact/Morph not encoded Edges directly. No read-edges-to-Fact reconstruction adapter exists here. global's lexical concept indices have no established Registry Id translation. Complement and preimage relations must preserve these separate tags. No meaningful percentage surrogate for categorical parse, identifiers, codec or effects is established; record executable approximant as unsupported.

### Peta data outside the repository (2026-11-04)

`closed_data` reads the CC BY-SA tables from `$MOVA_PETA_DATA/global/` (environment, else the `MOVA_PETA_DATA=` line of `peta/paths.env`; neither → absent, empty tables), no longer from the sibling `peta/global/data`. Source hash, syntax projection and the auxiliary fragment's range were rebound deliberately; `receipt.json` stays bound to the 2026-10-31 source it was measured on.