[论文解读] The Semantic Arrow of Time, Part II: The Semantics of Open Atomic Ethernet

Paul Borrill|arXiv (Cornell University)|Mar 4, 2026

Distributed systems and fault tolerance被引用 0

一句话总结

论文提出 Open Atomic Ethernet (oae) 作为非前向时间仅定协议，特征为六状态链路状态机、无限时序（Indefinite Logical Timestamps）以及用于建立语义因果序的来回反射确认机制。

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.

研究动机与目标

• 展示计算中时间的语义箭头是由事务结构而非热力学或前向唯一性假设所构建的。
• 通过 Open Atomic Ethernet 链路定义一个具体的非 fito 协议架构。
• 提出三种形式化框架（链路状态机、Indefinite Logical Timestamps、Slowdown Theorem）以强制语义完整性和因果顺序。

提出的方法

• 将 oae 链路状态机定义为六个状态并强制反射以实现原子性与语义完整性。
• 引入 Indefinite Logical Timestamps（ilt）作为包含不定关系 a ↔ b 的四值因果结构。
• 应用 Slowdown Theorem 来论证往返是建立因果排序的最小交互量。
• 在链路层整合 Spekkens 的 Knowledge Balance Principle 以约束认知状态。
• 将 oae 与 RDMA、NVLink、UALink、CXL 进行在语义保证与共识能力方面的对比。

实验结果

研究问题

• RQ1 如何通过事务结构而非先验假设来创建因果顺序？
• RQ2 哪些形式化框架可表达网络链路中的不定因果顺序？
• RQ3 反射性确认如何影响高性能互连中的原子性与语义完整性？
• RQ4 oae 能否实现无限共识与并发对象的无等待实现？
• RQ5 现有互连在执行语义不变量方面有哪些不足？

主要发现

• oae 链路状态机在承诺前强制反射阶段，使得仅在双边确认后才进行语义承诺。
• Indefinite Logical Timestamps（ilt）引入真正的不定因果顺序，严格地比可确定因果顺序 (DCO) 对可逆链路协议更具表达性。
• Slowdown Theorem 指出往返是建立确定因果排序的最小交互量，从而在事务边界处产生语义箭头。
• 基于 kbP 的链路寄存器确保每个端点恰知一半链路状态，需要双边贡献才能进行承诺。
• 声称 oae 具有无限共识数，能够实现任意并发对象的无等待实现；而 RDMA、NVLink、UALink 具有有限共识数。
• RDMA、NVLink、CXL 被描述为缺乏完整的语义保证（A1–A3）和反射阶段，除非在某些部分特性存在时。