Twenty-one runnable research utilities

The twenty earlier utilities now include shared-switch permutation replay, tiny exact laws and seed-support arithmetic. Twenty-three saved component reports contain 2,500 passed checks: 2,297 earlier plus 176 permutation, 21 entropy and six documentary-contract controls. No full source proof or production sampler 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.