Sixteen runnable research utilities

The fourteen earlier utilities now include a bounded exact switch-chain reference and an all-cut tree auditor. The documentary registry has ten curated contracts, with graph kernel/host/time-accounting as the new failure mode. All source proofs and program formal verification remain independently unverified.

New graph protocol reference

audit_switch_chain.py enumerates a labeled degree fiber, builds the specified lazy rational kernel, checks row symmetry/laziness and connectivity, and propagates one-start laws exactly. Optional restricted hosts receive no complete-host source guarantee. It caps six vertices, 512 states, 64 steps and two million work units; exhaustion returns unknown. Work units are graph tests, degree updates, proposals and propagation transitions, not bit operations or wall time. It does not implement the unrestricted exact residual sampler.

python3 research/tools/audit_switch_chain.py research/fixtures/six-cycle-host-switch-2026-10-09-v1.json --steps 12

69 saved checks include every four-vertex degree fiber against separate enumeration, a closed-form finite TV law and two model counterexamples. The saved laws/schedules demonstrate restricted-host disconnection and generic accepted-event stationary bias. One-start convergence is not worst-case mixing evidence. The generic jump chain is not a complete audit of an external library.

New all-cut tree audit

audit_tree_thinness.py validates a supplied supported tree and scans every nontrivial cut up to complements. It returns exact connectivity, maximum tree/original-copy ratio, witnesses, the achieved k*alpha, and whether a supplied rational target is met. It caps 16 vertices, 256-bit positive multiplicities and five million cut-edge examinations. Multiplicities count distinct original edge copies. The scan is exponential; partial work cannot certify an all-cut target. It constructs no tree or source polynomial backend.

python3 research/tools/audit_tree_thinness.py research/fixtures/k4-path-thinness-2026-10-09-v1.json

30 saved checks cover all 16 K4 trees, exact targets, copy scaling, 2^100 binary copies, invalid trees and budget semantics. The K4 path example has fundamental-cut maximum 1/3 but true all-cut ratio 3/4.

Shared documentary evidence

The ten-contract registry adds eight linter checks. A complete manifest still grants no mathematical applicability or independently verified label. The new graph-chain report joins source hashes/static metadata with one self-authored restricted-host claim, flagging nine documentary gaps. It is not an external product claim or ten-claim expert benchmark. The older evidence bundle preserves its nine-contract edition.

Full utility directory

Thirteen saved component reports contain 1,745 passed checks: the prior 1,638 plus 69 switch-chain, 30 thinness and eight contract checks. These finite records do not prove the source results, broad algorithm superiority, buyer demand or profitability. Dated drivers/output paths preserve earlier editions and cannot be rerun into existing files. Construction limits.