🤖 AI Summary
This work addresses the limitations of traditional network protocols that rely on the Fixed-In-Time Ordering (FITO) assumption, which fails to ensure semantic consistency and causal reversibility at the link layer. The authors propose the Open Atomic Ethernet (OAE) semantic model, which dispenses with a priori causal ordering and instead dynamically establishes causality through transactional structures. OAE incorporates a reflection acknowledgment mechanism and Indefinite Logical Timestamps (ILT), operating via a six-state finite state machine (e.g., TENTATIVE → REFLECTING → COMMITTED) that permits arbitrary aborts before commitment and finalizes transactions only after bidirectional semantic validation. Leveraging the link-level Slowdown theorem and the principle of knowledge balance, OAE theoretically achieves unbounded consensus capability, whereas protocols such as RDMA, NVLink, and UALink—constrained by FITO semantics—are limited to bounded consensus.
📝 Abstract
This is the second of five papers comprising The Semantic Arrow of Time. Part I established that computing's arrow of time is semantic rather than thermodynamic, and that the Forward-In-Time-Only (FITO) assumption constitutes a category mistake. This paper develops the constructive alternative. We present the semantics of Open Atomic Ethernet (OAE) links as a concrete realization of a non-FITO protocol architecture. The key insight is that causal order is not assumed a priori but created through transaction structure: the link state machine progresses through TENTATIVE to REFLECTING to COMMITTED, with the option to abort at any point before commitment. Delivery does not imply commitment; commitment requires reflective acknowledgment -- proof that information has round-tripped and been semantically validated by both endpoints. We formalize this through three frameworks. First, the OAE link state machine, a six-state finite automaton whose normative invariants guarantee that semantic corruption cannot occur at the link level. Second, Indefinite Logical Timestamps (ILT), a four-valued causal structure that admits a genuinely indefinite relation between concurrent events, resolving only after symmetric link-level exchange. Third, the Slowdown Theorem applied to links, which establishes that round-trip measurement is the minimum interaction required to establish causal order. We show that ILT is strictly more expressive than Definite Causal Order systems for reversible link protocols. We connect these results to the Knowledge Balance Principle from quantum information theory. The paper concludes with a comparative analysis showing that OAE achieves infinite consensus number while RDMA, NVLink, and UALink remain limited to finite consensus numbers due to their FITO semantics.