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

# algorithm-haar-wavelet

The groupant beside algorithms/src/haar_wavelet/mod.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
- **status:** partial descriptive instance
- **source:** [`algorithms/src/haar_wavelet/mod.rs`](https://github.com/ElamurAI/mova-free/blob/main/algorithms/src/haar_wavelet/mod.rs)
- **source SHA-256:** `7c06f6dc4fbc08bf…`
- **repository folder:** [`algorithms/src/haar_wavelet/mod.rs.groupant`](https://github.com/ElamurAI/mova-free/tree/main/algorithms/src/haar_wavelet/mod.rs.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` |
| **descriptant** | present | [descriptant](#descriptant) |
| **invariant** | partial | [approximant](#approximant) |
| **tests** | existing checks referenced | [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) |
| `packed_layout` | packed_layout | partial source derived model | [packed_layout](#packed-layout) |
| `orthogonal_pair` | orthogonal_pair | partial source derived model | [orthogonal_pair](#orthogonal-pair) |
| `inverse_schedule` | inverse_schedule | partial source derived model | [inverse_schedule](#inverse-schedule) |
| `boundary_partition` | boundary_partition | partial source derived model | [boundary_partition](#boundary-partition) |

## Model text


### descriptant

#### haar_wavelet / mod.rs

Original Rust; original algorithm citation appears in module documentation. Existing FFT and Householder QR reused where appropriate.

##### Prospective epoch

#### Prospective transform models
Before implementation: DCT II uses sqrt(1/n) DC and sqrt(2/n) others, cos(pi*(j+.5)*k/n), inverse transpose; n<=2048, empty identity; O(n²) work/O(n) space. Haar full dyadic transform packs coarse value then detail levels; pair sum/difference divided sqrt(2); n<=65536 power two, no extension; empty invalid; O(n) work/space. Bluestein uses chirp exp(sign*i*pi*j²/n), symmetric inverse chirp convolution padded to power two >=2n-1, existing FFT, n<=16384; inverse divides n; empty invalid; O(n log n)/O(n). Goertzel recurrence s=x+2cos(w)s1-s2, final real=cos(w)s1-s2, imaginary=sin(w)s1 (integer-bin phase correction), n<=65536, bins<=65536, all k<n; empty input only accepts empty bins; O(n*b)/O(b). SG n<=4096, odd window<=31 and <=n, degree<=6 and <window, shifted full window at boundaries; offsets scaled by window, Vandermonde QR solves local least squares, constant coefficient predicts target; O(n*w*d²)/O(w*d+n). All finite magnitudes <=1e50, no callbacks, allocations follow standard policy except reused QR fallible allocation. Validate shapes/limits before values then compute; roundoff and rank/nonfinite failures explicit, no universal percent or residual-to-solution guarantee. Polynomial reproduction, independent direct sums, orthogonality and reconstruction are finite checks. No timing or gain claim. References: Ahmed/Natarajan/Rao (1974) DCT; Haar (1910); Bluestein (1970) linear filtering DFT; Goertzel (1958); Savitzky/Golay (1964).

##### Mathematical combiner

Source and SHA-bound partial syntax define transition F; forward/invariant approximants model F, behavior complement models excluded pairs and reconstruction models compatible antecedents. Finite independent tests constrain F. Combining these observations is not a semantic proof; no macro expansion or semantic AST. Leaf children=[]; root integrates exports/ancestor bindings.

##### Observed epoch 2026-10-30

20 new tests pass in twice debug and twice release crate runs (713 total each) with identical normalized outcomes. Five compiled production mutants fail named assertions and exact source restoration passes four tests each. Strict all-target algorithm Clippy and focused formatting pass. No timing, speed or universal accuracy claim.

### model

### behavior_complement

For validated input x let F(x) be source-defined tagged floating output. Excluded relation is (x,y) where y differs from F(x), including wrong normalization, wrong grid/layout, invalid-domain success or nonfinite success. This models excluded outputs, not only a list of tests. Pair (a,b) -> ((a+b)/sqrt(2),(a-b)/sqrt(2)); recursively transform only average prefix. Inverse doubles prefix from 2 to n and interleaves sum/difference. Power-of-two n in 1..65536, finite |x|<=1e50.

### reverse_reconstruction

Known-length full coefficient vector uniquely specifies real samples through interleaving inverse; retaining only coarse average loses all details (e.g. [1,-1] and [0,0] have same coarse zero). Rounded coefficients do not guarantee bitwise recovery. Invalid-length error has many preimages.

### packed_layout

Index zero is coarsest average; indices count..2*count are detail for count equal-length blocks. Scratch is copied only over active prefix, preserving previously stored fine detail.

### orthogonal_pair

Pair squared norm is preserved in real arithmetic because each row has unit norm and rows are orthogonal. Floating sums/products introduce error.

### inverse_schedule

Inverse uses widths 2,4,...,n. Interleaving recovered halves expands the prefix while unread finer detail remains intact.

### boundary_partition

No padding, periodic extension or thresholding. Empty and nondyadic lengths reject; size1 is identity for either direction; input is immutable.

### approximant

#### Forward model and invariant

Pair (a,b) -> ((a+b)/sqrt(2),(a-b)/sqrt(2)); recursively transform only average prefix. Inverse doubles prefix from 2 to n and interleaves sum/difference. Power-of-two n in 1..65536, finite |x|<=1e50.

Cost: O(n) arithmetic and O(n) result plus scratch; geometric level sum <2n. Standard allocator policy.

Successful values remain finite and input arrays are immutable. Orthogonal/DFT inverse laws require the transformed coefficients to satisfy the second call input cap; large admissible forward samples can produce coefficients above that cap, so the bounded API is not globally closed under round trips. Invalid domain checks precede computation; same error tag can cover several invalid premises. No callbacks; allocation failure is outside ordinary Result except errors inside reused QR. Transform algebra is exact over reals, implementation is rounded f64. Zero-reference relative error is undefined; cancellation precludes universal relative claims. No executable 1/2/5/10% surrogate certificate is supplied. Residuals, if present in reused QR, do not bound signal or solution error.

### tests

direct_haar_basis uses independent block sums and half-block differences; reconstruction_energy observes sizes through 1024; sign_layout checks directed detail, singleton and cap; rejected_domains checks empty/nonpowers/nonfinite.

Control: Replacing finest detail subtraction with addition compiles and fails direct_haar_basis.

Evidence: $MOVA_DATA/runs/octopus-wave26-transforms-2026-10-30. No allocator fault injection; finite arithmetic bounds and cap tests are not exhaustive f64 verification.