Twenty-two runnable research utilities

The previous twenty-one utilities now include a separate decimal-wire/provider reference. Twenty-seven saved component reports contain 2,601 passed checks: 2,500 earlier, 62 provider controls, 14 initial synthetic-workload controls, 14 repeated controls after an allocation fix and 11 post-fix plan/buffer/refusal checks. The repeated benchmark was justified by the observed loader allocation bug; these phases are not independent performance samples. No full source proof, production SDK or customer value was verified.

Exact finite movement comparison

kserver_reference.py accepts a rational metric, initial labeled tuple and fixed request word. It computes an attained offline optimum by conventional DP, replays a witness, and evaluates fixed-label, nearest-label and independent uniform-label policies exactly. It implements no source competitive policy. It rejects nonmetrics and caps eight points, four servers, 64 requests and three million state-label transitions. Budget exhaustion leaves the complete comparison unknown. Dimensions bound frontier/backpointer storage; work units exclude input validation and do not represent bit operations or wall time.

python3 research/tools/kserver_reference.py research/fixtures/movement-startup-2026-10-09-v1.json

137 checks compare complete short label-string enumeration with DP and policy expectations, then check witness replay, horizon distinctions, metrics and budgets. The saved 30-request startup fixture has fixed-label cost 30 and offline optimum 2. This is a small finite control for the source's activation/additive-cost distinction, not performance evidence on a customer workload.

Exact transport sharpness geometry

transport_sharpness_reference.py reproduces the source's uniform-square three-atom example. It clips rational affine halfplanes, integrates nine map-cell intersections, and compares masses and map norm with analytic formulas. Target W1/W2 use the explicit matching and second-coordinate lower witness; no general transport optimizer runs. It accepts a 256-bit rational parameter 0<a<1/2 and caps 10,000 polygon-vertex examinations. Partial work returns unknown. It proves no arbitrary transport-map or solver guarantee.

python3 research/tools/transport_sharpness_reference.py research/fixtures/transport-three-atom-2026-10-09-v1.json

131 checks cover rational geometry, target metrics, exact half-exponent growth and input/budget boundaries. Saved examples include movement comparisons, explicitly conditional activation schedules and transport controls. No source constructor time is measured.

Documentary and semantic records

The thirteen-contract registry adds language-class, uniform k-server and Brenier-map contracts, with 12 checks. Complete documentation still grants no applicability/independent-verification certificate and does not verify supplied evidence contents. The new joined report flags eleven gaps in one self-authored startup claim. It archives all six exact report inputs. Earlier bundles also have separately recovered input archives whose bytes match the original recorded hashes; their original manifests/reports remain preserved. 31 archive checks verify those bytes and historical registry counts without executing the archived tools.

65 selected definition observations have no detected intended-model mismatch in this limited review. All ten interfaces in this finite static queue are reviewed at source level; whole imports, proofs and programs remain pending. This is source inspection, not a trusted checker or whole-proof result. Operational limits.

Fourier and algebra references

audit_fourier_aliasing.py compares exact sparse |u|^(p-1)u with centered modulo-grid folding. It uses physical rational coefficients rather than weighted Sobolev coordinates. 110 controls include closed cubic formulas, independent direct expansions, complex single-wave formulas, a twelve-dimensional axis fixture and failure limits. Saved grid-three report.

python3 research/tools/audit_fourier_aliasing.py research/fixtures/fourier-aliasing-12d-2026-10-09-v1.json

chromatic_basis_reference.py enumerates proper colorings and reconstructs the entire exact finite polynomial after elementary-basis conversion for at most six vertices. An optional supplied nondescent-permutation witness is compared coefficient by coefficient. 106 controls cover closed formulas, all eligible h through four vertices, paper/Sage examples, witness mutation and budgets. This does not implement the source packet construction or certify its all-r witness. Algebra dossier.

python3 research/tools/chromatic_basis_reference.py research/fixtures/chromatic-path-three-witness-2026-10-09-v1.json

Prepared ten-claim experiment

The review packet contains ten self-authored scenarios, eight intentional scope errors and two synthetic documentary-completeness controls. It preserves source-only/report-assisted cards, a separate self-authored answer key and blank expert results. 25 controls check expected code boundaries and exact file pointers for all thirteen contracts. This is a prepared experiment; expert benefit, accuracy and buyer value remain unmeasured. Enriched registry.

Queryable permutation reference

queryable_permutation_reference.py has three modes: explicit shared-bit point/inverse replay; exact tiny full permutation laws; and deterministic short-seed support bounds. Missing bits and exhausted law budgets are unknown. 176 switching/law controls use independent physical all-coin enumeration and materialized/cycle tests. 21 support controls distinguish statistical full-law guarantees from seeded application goals. Four-card calibration does not select a universal sweep count.

python3 research/tools/queryable_permutation_reference.py research/fixtures/coordinate-sparse-63bit-2026-10-09-v1.json
python3 research/tools/queryable_permutation_reference.py research/fixtures/coordinate-law-d3-L1-m8-2026-10-09-v1.json
python3 research/tools/queryable_permutation_reference.py research/fixtures/permutation-entropy-d30-b256-2026-10-09-v1.json

The fourteen-contract enriched registry adds source trace-smoothing and shared-randomness obligations, with six controls. A synthetic complete record still verifies no evidence or mathematics. The new joined report flags twelve documentary gaps in a self-authored four-sweep seeded claim and archives its six exact inputs. New application dossier, SDK specification.

Full utility directory

| Fourier aliasing reference | Exact sparse odd-power convolution/circular-grid comparison | | Chromatic basis reference | Exact finite elementary expansion and supplied-witness audit |

| Queryable permutation reference | Shared-bit point/inverse, tiny laws and seeded-support bounds |

Dated validation drivers/output files preserve their earlier editions. Existing successful output paths cannot be reused. Finite checks, syntax/hash consistency and an elapsed work window do not establish broad algorithm superiority, buyer demand or profitability.

Shared-bit provider reference

permutation_provider_reference.py implements exact decimal-string point/inverse requests under an immutable plan. A 256-bit HMAC mapping provides reproducible seeded values, with no source statistical or security guarantee. A separate local POSIX append-only store assigns an OS-entropy bit once per switch, locks a whole bounded request batch, flushes/fsyncs every new row and reuses rows after restart. Its actual fairness, network filesystem behavior and power-loss recovery are unverified. A visibly separate test-tape kind supports explicit controls.

62 controls compare materialized swaps, query order, inverse/cycle behavior, high indices, local processes, bounded lock waits, capacity exhaustion, wrong epochs and preserved damaged files. 11 hardening controls check immutable plan isolation and the corrected small-store loader. Canonical/hash-linked records are not an authenticated history; tail removal and suitably rewritten hashes cannot be detected without an external anchor. Damaged stores are refused and never repaired by truncation.

python3 research/tools/permutation_provider_reference.py research/fixtures/permutation-provider-seeded-63bit-2026-10-09-v1.json --seed-hex 0000000000000000000000000000000000000000000000000000000000000000

The initial workload exposed a needless 8 MB read allocation. The preserved repeated run used the bounded actual file size: 16 queries on 256 slots retained 249 switches/35,972 store bytes, then full traversal reached 2,048 switches/293,486 bytes. A packed int64 permutation array for that domain is 2,048 bytes; this is a representation baseline, not measured Python list storage. Traced Python sparse peak was 43,318 bytes after the fix. No PyTorch, production network service, shard batching or real dataset task ran. The materialized reference is a simple Python oracle, not an optimized performance baseline; no latency speedup is inferred.

Initial and repeated workload controls each passed 14 checks. Timing phases share one provider assignment and are dependent, and the OS bits differ between runs. Tool bytes are preserved; the second run's provider source was explicitly reconstructed by reversing its later plan-isolation patch. Current production source, probability law and profitability remain unverified. Constant audit, SDK specification.