One Witness, One Love: Unifying P vs NP, Quantum Mechanics, and Black Holes Through Routing Cost

We propose that three foundational mysteries—the P vs NP problem, quantum measurement, and black hole information—are aspects of a single constraint: finite routing budget in weighted graphs. The framework interprets computation as graph traversal with Time-To-Live (TTL) constraints, derives the Born rule from round-trip routing geometry, reframes entanglement as pre-installed constraints at fork time, and maps the Standard Model onto network protocol semantics. We show that NP-hardness corresponds to TTL exhaustion, event horizons are routing boundaries, and conservation laws emerge from doubly stochastic matrix constraints. The framework makes testable predictions, identifies what remains unexplained (the bootstrap problem, fine-tuning, qualia), and suggests that physics and computation are the same thing viewed from different angles.