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

# court-report-protocol

The groupant beside yom-hadin/src/report.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 derived models
- **source:** [`yom-hadin/src/report.rs`](https://github.com/ElamurAI/mova-free/blob/main/yom-hadin/src/report.rs)
- **source SHA-256:** `eb60c61212e8f64a…`
- **covers:** FNV byte recurrence and protocol observation boundary. (bytes 35921–37657)
- **part of:** [court-report](https://md.groupants.elamur.ai/free/en/mova/yom-hadin/src/report.rs.groupant/)
- **repository folder:** [`yom-hadin/src/report.rs.groupant/protocol.groupant`](https://github.com/ElamurAI/mova-free/tree/main/yom-hadin/src/report.rs.groupant/protocol.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` |
| **cost** | partial | `model.md` |
| **descriptant** | present | [descriptant](#descriptant) |
| **invariant** | partial | [Invariant](#invariant) |
| **tests** | finite native 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) |
| `wrapping_recurrence` | wrapping_recurrence | partial source derived model | [wrapping_recurrence](#wrapping-recurrence) |
| `disk_memory_split` | disk_memory_split | partial source derived model | [disk_memory_split](#disk-memory-split) |
| `recomputation_join` | recomputation_join | partial source derived model | [recomputation_join](#recomputation-join) |
| `snapshot_assumption` | snapshot_assumption | partial source derived model | [snapshot_assumption](#snapshot-assumption) |

## Model text


### descriptant

#### FNV byte recurrence and protocol observation boundary.

##### Epoch 2026-10-31

Prospective review preceded test edits. Runtime logic unchanged; three sources gain tests. Synthetic witnesses do not validate legal conclusions.

Composition: Start offset basis, xor each byte then wrapping multiply; protocol reads current rules bytes or empty on error, renders metadata/report and recomputed lattice summaries.

Retained limits: partial syntax, opaque macros; no live corpus, teacher, parser model, production filesystem or frozen gold. Complete semantics and executable approximants remain open.

### approximant

#### Forward model

FNV byte recurrence and protocol observation boundary.

Start offset basis, xor each byte then wrapping multiply; protocol reads current rules bytes or empty on error, renders metadata/report and recomputed lattice summaries.

Not an executable substitute. Percentage approximation is unsupported without a useful metric; future profiles limited to 1/2/5/10% require actual-reference comparison.

### models

## Typed models: FNV byte recurrence and protocol observation boundary.

Subject: yom-hadin/src/report.rs, SHA-256 eb60c61212e8f64ad0b3c67ed5dfbd9623e384479ec54567ed762cc8504b58ff. Domain: bounded finite synthetic rules/cases; valid indices and successful allocation unless a section narrows this. Each relation observes implementation, not legal authority. Status: partial source-derived model, finite evidence mapped in tests.md.

### behavior_complement

Protocol itself cannot write files; failed rules read cannot produce a distinct read-error record because default bytes replace it.

Operator: stated relation on this source projection. Assumptions: named domain and unchanged dependencies. Evidence: tests.md maps finite observations; other branches remain source review only.

### reverse_reconstruction

Fingerprint preimage includes all byte strings hashing to64-bit value; missing and empty files coincide. Full protocol still omits full rules serialization.

Operator: stated relation on this source projection. Assumptions: named domain and unchanged dependencies. Evidence: tests.md maps finite observations; other branches remain source review only.

### wrapping_recurrence

h_{i+1}=(h_i xor byte_i)*0x100000001b3 mod2^64; debug/release agree because multiplication explicitly wraps.

Operator: stated relation on this source projection. Assumptions: named domain and unchanged dependencies. Evidence: tests.md maps finite observations; other branches remain source review only.

### disk_memory_split

Hash comes from j.dir/rules.tsv while count metadata comes from j.rules; they may disagree without error.

Operator: stated relation on this source projection. Assumptions: named domain and unchanged dependencies. Evidence: tests.md maps finite observations; other branches remain source review only.

### recomputation_join

protocol calls judge_all again per defendant, requiring same case/options/jurisdiction semantics as supplied rep for coherent record; arbitrary caller rep may disagree.

Operator: stated relation on this source projection. Assumptions: named domain and unchanged dependencies. Evidence: tests.md maps finite observations; other branches remain source review only.

### snapshot_assumption

Each file read occurs sequentially; concurrent changes can mix revisions, no atomic multi-file snapshot guarantee.

Operator: stated relation on this source projection. Assumptions: named domain and unchanged dependencies. Evidence: tests.md maps finite observations; other branches remain source review only.


### tests

#### Checks and evidence

External run label: octopus-wave31-court-2026-10-31; exact commands in native-commands.json, per-source observations in source-test-map.json, numeric exits and named outcomes in raw logs.

19 exact selected native tests twice debug and twice release execute actual linked code on bounded hand-built cases. CLI covers argument helpers only. Full extraction/model initialization, actual jurisdiction loading, protocol disk errors, resource exhaustion and malformed public lattices are unexecuted. Module declarations have compile evidence only.

Three compiled source-behavior mutants: count weight, precedence tie, modal tie; each requires compile success, named assertion failure, exact byte/hash restoration and positive rerun. Legacy fixture interventions count separately. Final observations: external evidence-summary.md.

This node observes: FNV byte recurrence and protocol observation boundary.. Unmapped models remain source-derived/prospective, not verified by the whole test count.

Parent source witness map: [source-evidence.md](https://md.groupants.elamur.ai/free/en/mova/yom-hadin/src/report.rs.groupant/#source-evidence). Only the described fragment observation is supported; parent test names do not imply every fragment branch executed.

### invariant-and-cost

## Invariant and cost

### Invariant

No timestamp or machine path in formatted protocol; stability requires same external file bytes and inputs.

### Cost

O(file bytes+rendered bytes+judge_all work), whole file buffers.

Symbolic bounds, not timings. Resource exhaustion is not tested.
