Table of Contents
Fetching ...

Message Passing Without Temporal Direction: Constraint Semantics and the FITO Category Mistake

Paul Borrill

TL;DR

It is argued that conventional message systems embed a category mistake: they misinterpret logical dependency relations as temporal propagation processes and prove an equivalence theorem: under mild assumptions, a broad class of message-passing executions can be represented as constraint satisfaction problems, and conversely, constraint satisfaction instances can be realized as message-passing protocols.

Abstract

Message passing is widely assumed to be a fundamental primitive of distributed systems. This paper argues that conventional message systems embed a category mistake: they misinterpret logical dependency relations as temporal propagation processes. This error arises from an implicit Forward-In-Time-Only (FITO) assumption, which treats causality as intrinsically directed along a temporal axis. We formalize FITO as the imposition of a partial order over events and show that clocks, scheduling, and message propagation are representational artifacts rather than ontological primitives. We then reformulate interaction in terms of symmetric constraint relations, identify the minimal substrate of interaction independent of temporal direction, and prove an equivalence theorem: under mild assumptions, a broad class of message-passing executions can be represented as constraint satisfaction problems, and conversely, constraint satisfaction instances can be realized as message-passing protocols. We connect the result to Lamport clocks, Hewitt actors, Pratt pomsets, category theory, relativity, and indefinite causal order, and interpret engineering consequences for reflective and reversible link architectures such as Open Atomic Ethernet.

Message Passing Without Temporal Direction: Constraint Semantics and the FITO Category Mistake

TL;DR

It is argued that conventional message systems embed a category mistake: they misinterpret logical dependency relations as temporal propagation processes and prove an equivalence theorem: under mild assumptions, a broad class of message-passing executions can be represented as constraint satisfaction problems, and conversely, constraint satisfaction instances can be realized as message-passing protocols.

Abstract

Message passing is widely assumed to be a fundamental primitive of distributed systems. This paper argues that conventional message systems embed a category mistake: they misinterpret logical dependency relations as temporal propagation processes. This error arises from an implicit Forward-In-Time-Only (FITO) assumption, which treats causality as intrinsically directed along a temporal axis. We formalize FITO as the imposition of a partial order over events and show that clocks, scheduling, and message propagation are representational artifacts rather than ontological primitives. We then reformulate interaction in terms of symmetric constraint relations, identify the minimal substrate of interaction independent of temporal direction, and prove an equivalence theorem: under mild assumptions, a broad class of message-passing executions can be represented as constraint satisfaction problems, and conversely, constraint satisfaction instances can be realized as message-passing protocols. We connect the result to Lamport clocks, Hewitt actors, Pratt pomsets, category theory, relativity, and indefinite causal order, and interpret engineering consequences for reflective and reversible link architectures such as Open Atomic Ethernet.
Paper Structure (22 sections, 2 theorems, 3 equations)

This paper contains 22 sections, 2 theorems, 3 equations.

Key Result

Theorem 1

Consider a message-passing protocol in which (i) each message can be interpreted as a verifiable claim about a sender local commitment, and (ii) the protocol acceptance condition can be expressed as a predicate over the set of local commitments. Then any finite execution trace of the protocol induce

Theorems & Definitions (9)

  • Definition 1: FITO ordering
  • Definition 2: Constraint system
  • Definition 3: Symmetric compatibility
  • Definition 4: Category mistake in message ontology
  • Definition 5: Run constraint set
  • Theorem 1: Message-to-constraint representation
  • proof
  • Theorem 2: Constraint-to-message realization
  • proof