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

# onto-describe-field-render

The groupant beside onto/src/describe.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 bound model
- **source:** [`onto/src/describe.rs`](https://github.com/ElamurAI/mova-free/blob/main/onto/src/describe.rs)
- **source SHA-256:** `b1e054a392c1f8b6…`
- **covers:** For lists choose core-known-nonempty then graph then n/a then unknown; numbers core only;13 flags (bytes 3331–9367)
- **part of:** [onto-describe](https://md.groupants.elamur.ai/free/en/mova/onto/src/describe.rs.groupant/)
- **repository folder:** [`onto/src/describe.rs.groupant/field-render.groupant`](https://github.com/ElamurAI/mova-free/tree/main/onto/src/describe.rs.groupant/field-render.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 | [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) |
| `list_branch` | list_branch | partial source derived model | [list_branch](#list-branch) |
| `flag_counts` | flag_counts | partial source derived model | [flag_counts](#flag-counts) |
| `chain_cap` | chain_cap | partial source derived model | [chain_cap](#chain-cap) |
| `provenance` | provenance | partial source derived model | [provenance](#provenance) |

## Model text


### descriptant

#### onto-describe-field-render

For lists choose core-known-nonempty then graph then n/a then unknown; numbers core only;13 flags

##### Epoch 2026-10-31

Specialized source fragment bytes [3331,9367); shared parent AST. Excludes unrelated parent operations and added test module.

### approximant

#### Scoped forward

For lists choose core-known-nonempty then graph then n/a then unknown; numbers core only;13 flags

##### Domain

This byte-scoped operator uses the parent valid-state domain plus the following local restrictions:

Known empty list falls through; risks empty Known means none and filled

filled=Σapp&&known<=Σapp

First upward edge≤12, no full ancestor list

Known seed lines retain winning seed/layer/source snippet

No executable percentage surrogate established.

### invariant

#### Local observations

Nonempty core excludes graph substitution; character-only seed excludes props filled

Known empty list falls through; risks empty Known means none and filled

filled=Σapp&&known<=Σapp

First upward edge≤12, no full ancestor list

Known seed lines retain winning seed/layer/source snippet

### cost

#### Scoped cost

One resolve, one parts_of traversal, at most12 first-up steps, then17 Kb::prop calls. List graph rendering takes at most12 entries per relation after filtering; generated text and proof formatting memory depend on selected seeds/labels.

Symbolic accounting; no timing claim or whole-system speed bound.

### composition

#### Parent join

field-render supplies the parent relation: For lists choose core-known-nonempty then graph then n/a then unknown; numbers core only;13 flags

Output compatibility is conditional on the local domain and earlier-branch exclusions. Other parent branches are outside this fragment.

### models

### behavior_complement

Nonempty core excludes graph substitution; character-only seed excludes props filled

### reverse_reconstruction

Identical13 flags/text admit hidden graph edges past cap and nonselected core senses

### list_branch

Known empty list falls through; risks empty Known means none and filled

### flag_counts

filled=Σapp&&known<=Σapp

### chain_cap

First upward edge≤12, no full ancestor list

### provenance

Known seed lines retain winning seed/layer/source snippet


### tests

#### Evidence

Parent tests.md identifies selected actual-code checks. Fragment is a source-scoped partial model; parent finite fixtures do not establish exhaustive branch coverage or every local equation.