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

# prag-agree-report

The groupant beside prag/src/agree.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:** [`prag/src/agree.rs`](https://github.com/ElamurAI/mova-free/blob/main/prag/src/agree.rs)
- **source SHA-256:** `b50e6b91851fb5a1…`
- **covers:** run normalizes CRLF to LF, splits sentence blocks and joins by exact sent_id. Duplicate tree IDs keep the last form. Iterate unique label IDs in BTree order; witness-only/tree-only IDs add no output row. Missing act/form use the same empty defaults as agree_one. Emit one TSV row per retained label ID, count rule applications and form/act changes; move ties retain lexical order. (bytes 6436–8818)
- **part of:** [prag-agree](https://md.groupants.elamur.ai/free/en/mova/prag/src/agree.rs.groupant/)
- **repository folder:** [`prag/src/agree.rs.groupant/report.groupant`](https://github.com/ElamurAI/mova-free/tree/main/prag/src/agree.rs.groupant/report.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 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 |
|---|---|---|---|
| `prag-agree-report-behavior-complement` | behavior_complement | partial source model | [behavior-complement](#behavior-complement) |
| `prag-agree-report-reverse-reconstruction` | reverse_reconstruction | partial source model | [reverse-reconstruction](#reverse-reconstruction) |
| `prag-agree-report-intervention` | counterfactual_relation | partial source model | [intervention](#intervention) |

## Model text


### forward

run normalizes CRLF to LF, splits sentence blocks and joins by exact sent_id. Duplicate tree IDs keep the last form. Iterate unique label IDs in BTree order; witness-only/tree-only IDs add no output row. Missing act/form use the same empty defaults as agree_one. Emit one TSV row per retained label ID, count rule applications and form/act changes; move ties retain lexical order.

### invariant

Report n equals distinct retained label-table IDs (including an empty ID on a nonempty TSV row), not raw rows, witnesses or changed rows. Rule totals can exceed n across multiple rules. Output fields retain id association; CRLF must preserve block boundaries. Polarity/hedge changes are not included in move counts.

### cost

O(B) normalization allocation precedes table/tree maps O(N log N), followed by fixed rule checks per label and O(M log M) sorting M distinct move descriptions. No speedup claim; normalization deliberately adds one string allocation.

### composition

Public APIs table, tree_form, agree_one and run compose supplied strings by exact sent_id. Native run->tree_form->agree_one->table joins execute. prag CLI reads three files before run and writes two outputs; CLI filesystem behavior is inspected only.

### epoch-memory

2026-10-30 initial source-bound epoch. Old-code witnesses exposed CRLF sentence-block merging and missing act/form key panics in report accounting. Normalization repairs block identity and map defaults now agree with agree_one. Last-row-wins duplicate semantics are preserved, not silently relabeled as one observation per raw line. Costs are prospective source models; no optimization, timing gain or percentage-error guarantee is claimed.

### checks

cargo test -p prag --lib agree:: -- --test-threads=1; the wave12_models submodule contains new finite checks. File evidence.md binds old witnesses, repeated profiles and compiled production mutations. Syntax projections are partial and macro bodies opaque.

### behavior-complement

Domain: finite inputs satisfying this fragment's forward premises and the parent API tag/state constraints; output is its scoped observation. Let J_fragment(x,y) impose the concrete relations: run normalizes CRLF to LF, splits sentence blocks and joins by exact sent_id. Duplicate tree IDs keep the last form. Iterate unique label IDs in BTree order; witness-only/tree-only IDs add no output row. Missing act/form use the same empty defaults as agree_one. Emit one TSV row per retained label ID, count rule applications and form/act changes; move ties retain lexical order. Also require: Report n equals distinct retained label-table IDs (including an empty ID on a nonempty TSV row), not raw rows, witnesses or changed rows. Rule totals can exceed n across multiple rules. Output fields retain id association; CRLF must preserve block boundaries. Polarity/hedge changes are not included in move counts. The inner absent-behavior model is {(x,y): not J_fragment(x,y)}. This excludes wrong indices, selections or outputs, rather than treating a scope disclaimer as a behavioral predicate. Finite checks support selected cases; unknown external semantics remain outside this claim.

### reverse-reconstruction

Counts alone preserve all row sets yielding the same changes, losing which IDs changed. A final TSV row may combine labels, tree and witness rows; preserving all three supplied inputs is needed for provenance, and even they do not establish actual speech intent.

Formally retain every parent-tagged input and compatible intermediate state satisfying the forward relation with the observed fragment output. Do not merge antecedents merely because their projected result agrees; no unique inverse or complete executed solver is claimed.

### intervention

Line-ending intervention holds logical rows fixed while mapping LF to CRLF. The old implementation merged blocks and misjoined forms. The native run/table join checks output identity, two-sentence denominator and two P0 plus one P1 applications; duplicate label IDs intentionally reduce the denominator.

All typed records bind the exact source revision and scope in manifest.json. Domains, observations and operators are above. Stable dependencies and successful termination are premises. These partial relations retain ambiguous antecedents; no universal solver, unique inverse or actual causal inference is supplied.