Contention and State: A Formal Analysis of Classical Ethernet and Spekkens Toy Models

Ideas
, , , ,
1

A computational essay presented in two parts, first deconstructing the foundational flaws of classical networking, and then exploring the abstract state dynamics that inform the Daedaelus architecture. The first section provides an agent-based simulation of the 1976 Metcalfe-Boggs protocol. It visualizes the chaotic nature of statistical arbitration on a shared medium, where frequent packet collisions represent the "irreversible smash…of Shannon information" and the microscopic origin of unbounded tail latency. The second section explores a Spekkens Toy Model, a framework inspired by Quantum Information Theory. Through interactive visualizations of state-transition graphs, it provides a ‘Code as Proof’ artifact for understanding the principles of Token Dynamics and Reversible Subtransactions, which are the mathematical bedrock of our deterministic, contention-free protocols.

◔