Elamur Groupantsmath-plan-gate-enumeration
The groupant beside math/src/plan.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 |
| composition | partial | composition |
| descriptant | present | descriptant |
| invariant | partial | invariant |
| tests | partial bounded evidence | 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 |
failure_precedence | failure_precedence | partial source derived model | failure_precedence |
representation_transport | representation_transport | partial source derived model | representation_transport |
resource_boundary | resource_boundary | partial source derived model | resource_boundary |
domain_boundary | domain_boundary | partial source derived model | domain_boundary |
Model text
descriptant
Source-bound description
Dependent inclusive range recursion; leaf callback count/aggregate/claim. Successful return restores saved variable; callback error via ? can bypass restoration. Empty count/sum/list=0/0/[]; min/max/first empty error. Claim stops on first false and reports finite survival, not proof.
Epoch 2026-10-31: prospective model before bounded synthetic tests; production behavior unchanged. Source scope bytes[14635,20564). Finite checks not proof; no meaningful percentage surrogate for categorical gate. Not every branch in this fragment executed.
approximant
Forward relation
Dependent inclusive range recursion; leaf callback count/aggregate/claim. Successful return restores saved variable; callback error via ? can bypass restoration. Empty count/sum/list=0/0/[]; min/max/first empty error. Claim stops on first false and reports finite survival, not proof.
Domain: Integer bounds, reversed range empty; duplicate variable names shadow. Arithmetic in max_steps as i64 not generally certified.
Executable Rust approximant unsupported: categorical/effect observations have no useful percentage metric yet. Future caps1/2/5/10% only; no automatic substitution.
invariant
Invariant and cost
Empty match excludes min/max/first value; list>100000 or visited>max_steps excludes successful enumerate. Success does not prove universal claim.
Ordering: Parse ranges/condition/body then walk; where before aggregate; first halts; restoration only normal recursive return.
Cost: Product of dependent range widths plus eval body; O(depth+list storage), list bound100000. Only enumerate polls timeout every4096 visited leaves. claim has no leaf-level timeout poll and caps only condition-passing cases; delegated evaluator checks are separate, and rejected where cases do not consume that claim counter.
composition
Composition and epoch memory
walk exposes Env to enumerate/claim; error abort means leaked bindings remain local to failed run, not a reusable purity law.
Source scope bytes[14635,20564). Finite checks not proof; no meaningful percentage surrogate for categorical gate. Not every branch in this fragment executed.
Partial syntax and finite tests do not establish all caller assumptions.
models
behavior_complement
Empty match excludes min/max/first value; list>100000 or visited>max_steps excludes successful enumerate. Success does not prove universal claim.
reverse_reconstruction
Aggregate count admits all satisfying assignments of that cardinality; first result constrains only earliest passing assignment and not later suffix. Counterexample text constrains failing variable values.
failure_precedence
Parse ranges/condition/body then walk; where before aggregate; first halts; restoration only normal recursive return.
representation_transport
walk exposes Env to enumerate/claim; error abort means leaked bindings remain local to failed run, not a reusable purity law.
resource_boundary
Product of dependent range widths plus eval body; O(depth+list storage), list bound100000. Only enumerate polls timeout every4096 visited leaves. claim has no leaf-level timeout poll and caps only condition-passing cases; delegated evaluator checks are separate, and rejected where cases do not consume that claim counter.
domain_boundary
Integer bounds, reversed range empty; duplicate variable names shadow. Arithmetic in max_steps as i64 not generally certified.
tests
Evidence, 2026-10-31
Selected actual-source checks: cargo test -p math --lib plan::tests. Exact commands, numeric statuses, normalized outcomes, compiled assertion controls and restoration receipts are in the external wave28 mathcontrol run.
Source scope bytes[14635,20564). Finite checks not proof; no meaningful percentage surrogate for categorical gate. Not every branch in this fragment executed.
No live teacher/API, trained model, corpus/held-out, GPU, DB or expensive benchmark run. Parent syntax generated twice identically. Scope remains partial.
This page in Markdown → https://md.groupants.elamur.ai/free/en/mova/math/src/plan.rs.groupant/enumeration.groupant/