roundtrip-derived-piece-codec-tree-validation

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

component	label	where
approximant	partial	approximant
ast	partial	`../syntax.json`
cost	symbolic source derived	invariant-and-cost
descriptant	present	descriptant
invariant	partial	invariant-and-cost
tests	executed bounded checks	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
`reverse_reconstruction`	reverse_reconstruction	partial source derived model	reverse_reconstruction
`sequential_ids`	sequential_ids	partial source derived model	sequential_ids
`relation_base`	relation_base	partial source derived model	relation_base
`root_forest`	root_forest	partial source derived model	root_forest
`case_loss`	case_loss	partial source derived model	case_loss

Model text

descriptant

Description and epoch memory

Ignore comments/fences/blanks; skip well-width range/decimal rows; require integer ids1..n, known relation or base subtype, parse heads, then reject empty/out-of-range/self/no-root/cycles.

Epoch 2026-10-31

Prospective model retained externally before edits. Existing production bytes preserved; only bounded inline tests appended to six owned files. Models distinguish byte reconstruction with residual from semantic understanding and persistent learning. Finite tests and compiled mutants support selected boundaries only. Source inspection identified noninjective projections and explicit admissibility restrictions; no bug repair or performance claim.

Combiner input is this source snapshot, syntax projection, models, costs and retained receipts. Proposed next epoch: target the stated unexecuted branches with bounded witnesses before expanding any claim. AST remains partial, macros opaque; no name resolution or proof.

approximant

Forward relation

Ignore comments/fences/blanks; skip well-width range/decimal rows; require integer ids1..n, known relation or base subtype, parse heads, then reject empty/out-of-range/self/no-root/cycles.

Domain: Same model/lexicon/environment at encode/decode; valid references and 10-column patches; LCS dimensions/counts fit usize/u32 and memory. Tests execute pure scripts/tree validation/reference/damage, not model-backed encoder.

No executable percentage surrogate is supplied: these categorical codec/effect observations have no justified lossy metric. Future caps are 1/2/5/10% only after defining metric, zero behavior and differential reference.

catalog

Source-bound typed models

Each section is a partial source-derived relation on the bound snapshot and declared domain; finite checks are falsification evidence, not a universal proof. Observation horizon is one call unless history is explicitly named.

behavior_complement

No accepted graph contains cycle, self-loop or head>n; acceptance does not exclude multiple roots or unknown tags.

Domain and held state: Same model/lexicon/environment at encode/decode; valid references and 10-column patches; LCS dimensions/counts fit usize/u32 and memory. Tests execute pure scripts/tree validation/reference/damage, not model-backed encoder.