This paper models program translation as a graph of languages and reasoning targets, with directional, per-program commuting conditions and composable contracts. Each hop records an assurance class, direction, preserved observables, and measured cost; a route takes the componentwise meet of its contracts. The core calculus, including a lax telescope, is mechanized in Lean 4. Its hurdy-gurdy implementation separates an answer-use plane from a human-registered graph-evolution plane. LLM builders and players are untrusted, while answers carry replayable evidence. The reported July 2026 snapshot includes conjoined coverage, dual-route agreement for two ISAs, witness replay, certified-unreachability rechecking, and gate escape rates.
No heat snapshots are available in the last 24 hours.