Forty-one runnable research utilities
Sixty-five saved component reports contain 32,107 passed checks. Random-SAT benchmark review adds one bounded utility and 679 controls.
Complete utility directory
| Utility | What it does | Material boundary |
|---|---|---|
| proof_preflight.py | Inspect selected formal configuration/module metadata | Static presence/trust settings, no proof execution |
| withdrawal_impact.py | Record explicit withdrawals and dependencies | Three notices/two explicit edges; not a full theorem graph |
| audit_embedding.py | Check finite embedding quantities | Sampled/finite floating calculation, no universal guarantee |
| gad_capacity.py | Evaluate scalar generalized-amplitude-damping expression | Numerical convention/optimization, no hardware or finite decoder certificate |
| audit_claim_contract.py | Lint documentary source/model obligations | Twenty-one curated contracts; supplied statuses and evidence contents unverified |
| periodic_interface_reference.py | Periodic interface formula reference | Specified finite geometry, no general optimizer |
| audit_binary_waveform.py | Exact finite correlation and sampled spectrum | No full channel or physical waveform certification |
| audit_ramanujan_graph.py | Rational contrast-space spectral acceptance | Supplied finite graph, not source constructor |
| cyclic_chain_reference.py | Tiny group cyclic-chain enumeration | At most sixteen elements, no effective spectrum witness |
| evidence_bundle.py | Join source hashes/static metadata/claim audit | Archives six exact inputs; no source/proof execution |
| contingency_reference.py | Exact bounded table count/rank/unrank/law | Dimension six/total128; conventional DP, not source sampler |
| audit_matching_certificate.py | Check matching and attaining cardinality bound | Exact supplied witness/bound, no extra allocation constraints |
| solve_and_audit_matching.py | Existing NetworkX proposal plus separate audit | Unit cardinality model, no source accelerated matcher |
| perfect_matching_reference.py | Tiny exact counts/ranks/edge fragility | At most24 vertices, no FPRAS |
| audit_switch_chain.py | Exact tiny specified-kernel TV | At most6 vertices/512 states/64 steps; complete-host model |
| audit_tree_thinness.py | Exact all-cut finite tree audit | At most16 vertices; not broad thin-tree construction |
| kserver_reference.py | Rational offline optimum and named-policy replay | At most8 points/4 servers/64 requests; no source online policy |
| transport_sharpness_reference.py | Exact three-atom rational geometry | Uniform-square example, no arbitrary transport solver |
| audit_fourier_aliasing.py | Sparse exact odd-power convolution/grid folding | Typed support/work/bit caps; no PDE solution certificate |
| chromatic_basis_reference.py | Tiny exact chromatic/e-basis reconstruction | At most6 vertices; not broad packet/witness theorem implementation |
| queryable_permutation_reference.py | Shared-switch point/inverse replay and tiny laws | Explicit bits/dyadic domain, no universal mixing constant |
| permutation_provider_reference.py | Decimal-wire seeded or locked local stored bits | Distinct randomness models; capped append-only JSON store |
| palindrome_minorant_reference.py | Exact tiny palindrome law/operator calibration | Two/four slots; no universal numerical P |
| audit_contingency_law.py | Complete finite law and fixed-event comparison | Explicit conditioning, at most2,000 tables, unknown on exhaustion |
| bounded_flow_reference.py | Signed-bound private-vertex flow reduction/counts | Tiny exact table engine; no unrestricted FPRAS/sampler |
| three_machine_reference.py | Unit-job schedule audit/exact tiny optimum/deadline evidence | At most18 jobs/50,000 states/2m transitions; exponential |
| solve_and_audit_three_machine.py | Existing CP-SAT proposal and finite independent evidence | Same strict unit model; solver status distinct from independent optimum |
| subset_sum_reference.py | Exact disjoint-half support/multiplicity/witness reference | Two–64 positive identified items; 50k sum records/2m generation/probe work, not source backend |
| subset_sum_schedule.py | Exact known guards and conditional decision-error/amplification algebra | Fixed main cutoffs unselected; source implementations and independence unvalidated |
| solve_and_audit_subset_sum.py | Existing integer CP-SAT proposal and original-ID witness evidence | Deliberate total/target cap 2^62-1; solver satisfaction status does not give uniqueness/count |
| superstring_packaging_reference.py | Emit indexed immutable byte-view artifacts and compare complete compressed bytes | At most128 records/16KiB literal bytes; exact DP at most 12 reduced strings; no source factor-two backend |
| superstring_counts_reference.py | Bounded paper forced-count recursion and balanced base graph | Reduced length 128/512 substrings/2m charges; no full layer/request/cycle construction or proof acceptance |
| numerical_range_polynomial_reference.py | Exact finite norm threshold, PSD support halfspaces and covered polynomial upper bounds | n≤8/m≤4/degree≤6; new constant two conditional, exact inputs and capped arithmetic only |
| metric_facility_reference.py | Strict metric, exact plan/LP-dual audit and bounded k-median enumeration | At most 48 locations, unweighted and uncapacitated; no source backend or physical-data bridge |
| noncommutative_hitting_reference.py | Exact ordered rational matrix witnesses via source-derived structured actions | Visible division-free tree; nonzero refutes a free identity, zero remains conditional/unknown; explicit bit/work/dimension caps |
| mean_payoff_label_reference.py | Bounded deterministic source recursion and separate threshold-region strategy checker | Ordinary signed-edge deterministic model; unknown on limits, completed labels source-conditional; no value-optimality or companion claim |
| facility_review_workbench.py | Stable-ID CSV import, exact model/plan review, optional OR-Tools and preserved HTML/JSON exports | Local strict/unweighted/uncapacitated model; no hosted uploads, automatic general duals or validated customer value |
| facility_assignment_audit.py | Exact weighted rectangular plan/capacity audit, optional existing solver and preserved HTML/JSON reports | Whole-client assignment, 512 clients/128 sites; no source-theorem extension, geographic validation or hosted uploads |
| finite_field_factorization_audit.py | Exact submitted factorization/irreducibility checks and bounded supplied-separator scan | Degree at most64, prime at most2^31-1, explicit byte/work caps; no source new backend |
| community_recovery_audit.py | Exact declared SBM scope/parameter-envelope audit and finite aligned-label baselines | Three-community iid-label model; no real-data fit, asymptotic proof or source-optimal detector |
| random_sat_stream_audit.py | Proper-clause stream evidence, exact tiny first failure, coupon controls and existing CP-SAT adapter | At most16 exact variables; declared law unverified, solver UNSAT unverified, no threshold estimator |
All dated validators, numerical comparisons, plotters, publishers and inert archives are supporting tooling. Previous edition preserves earlier releases.
SAT review exposes duplicate-law and censoring mistakes with independent finite controls. Facility Plan Auditor remains the first product experiment.