[Paper Review] Spacetime-Entangled Networks (I) Relativity and Observability of Stepwise Consensus

Paul L. Borrill, Mark Burgess+2 more|arXiv (Cornell University)|Jul 23, 2018

Distributed systems and fault tolerance18 references3 citations

TL;DR

This paper proposes spacetime-entangled networks as a novel framework for achieving deterministic, transactional message delivery in distributed systems by enforcing co-dependent state evolution (entanglement) between communication endpoints. Using Promise Theory, it enables end-to-end, in-order, atomic delivery with mutual confirmation, forming a scalable, hierarchical foundation for consensus and common knowledge in unreliable networks.

ABSTRACT

Consensus protocols can be an effective tool for synchronizing small amounts of data over small regions. We describe the concept and implementation of entangled links, applied to data transmission, using the framework of Promise Theory as a tool to help bring certainty to distributed consensus. Entanglement describes co-dependent evolution of state. Networks formed by entanglement of agents keep certain promises: they deliver sequential messages, end-to-end, in order, and with atomic confirmation of delivery to both ends of the link. These properties can be used recursively to assure a hierarchy of conditional promises at any scale. This is a useful property where a consensus of state or `common knowledge' is required. We intentionally straddle theory and implementation in this discussion.

Motivation & Objective

• To address the lack of low-level observability and reliability in conventional network protocols by embedding reliability directly into link-layer communication.
• To enable a hierarchical, recursive model of consensus by building on irreducible, entangled communication links that maintain causal integrity and order.
• To provide a foundation for transactional communication at scale—especially in cloud and mission-critical systems—by ensuring atomic, ordered, and observable message delivery.
• To reduce reliance on application-layer recovery by pushing feedback and reliability mechanisms down to the network layer through entanglement.
• To explore how entanglement can be scaled across multiple hops while managing timing inconsistencies and potential instability in heterogeneous networks.

Proposed method

• Modeling communication links as entangled agents using Promise Theory, where each endpoint’s state depends causally and mutually on the other, enforcing co-determined behavior.
• Defining message transmission as a promise exchange: a sender proposes an intent, and the receiver confirms intent acknowledgment, forming a two-phase commitment akin to a two-phase commit protocol.
• Implementing entanglement via a recursive protocol stack where each layer ensures atomicity and integrity by relying on promises from lower layers, forming a 'turtles all the way down' reliability model.
• Using spanning trees to prevent redundant causal pathways and reduce interference in multi-hop networks, ensuring predictable and stable message propagation.
• Designing the system so that the internal indeterminism of network agents is reframed as quasi-deterministic behavior at the system level through synchronized promise-keeping.
• Applying eigenstates of entanglement to enforce correlated or anti-correlated behavior, enabling clear distinction of endpoints and minimizing noise interference in message transmission.

Experimental results

Research questions

• RQ1 Can a network link be designed to guarantee in-order, atomic, and end-to-end message delivery through entanglement of state between endpoints?
• RQ2 How can promise entanglement be used to build a hierarchical, recursive consensus mechanism that scales across multiple network hops?
• RQ3 What are the implications of serial composition of entangled links on timing and stability, especially in networks with variable latencies?
• RQ4 To what extent can entanglement-based communication reduce the need for application-layer failure recovery and improve observability in distributed systems?
• RQ5 How can timing storms or oscillatory instabilities be prevented when composing entangled links with differing promise-keeping rates?

Key findings

• Entangled links enforce a quasi-deterministic behavior where cause and effect appear synchronized across a shared clock, enabling reliable reasoning about message delivery order and state.
• The method allows for atomic confirmation of delivery at both ends of a link, effectively turning the link into a single, irreducible agent that maintains mutual consistency.
• By maintaining a uniform set of promises across agents, the system ensures fast equilibration of state and simplifies reasoning about data consistency and integrity.
• The approach enables transactional guarantees similar to database systems at the network layer, but without requiring application-level coordination for basic reliability.
• While entanglement cannot recover sessions lost due to application-level crashes, it significantly reduces the frequency of such failures by ensuring robust, low-level delivery guarantees.
• Scaling across multiple hops requires careful design—especially damping mechanisms—to prevent instability from differing link latencies and timing mismatches.