A computational essay that serves as 'Code as Proof,' formally modeling the foundational flaws of classical networking and demonstrating the superiority of the Dædælus transactional fabric. The notebook begins by deconstructing the shared-media contention of the 1976 Metcalfe-Boggs model and the latency-bound throughput of TCP (Mathis equation), proving how traditional bandwidth-multiplexing over unreliable links inevitably leads to efficiency collapse, the loss of epistemic certainty, and unbounded tail latency. It then contrasts this with the Dædælus architecture, simulating how a reliable N2N Lattice that uses Transaction-Multiplexing and the Reversible Snake protocol eliminates contention, is immune to packet loss, and provides the deterministic performance necessary for a Truncated Tail Latency.