Distributed Computing Through Combinatorial Topology [upd] -

The core concept is the . Imagine you are an omniscient observer watching a distributed algorithm run. You record every possible global state the system could be in, given every possible schedule of message deliveries and process crashes. Then, you connect two global states if one can be reached from the other by a single step of the algorithm.

Distributed Computing Through Combinatorial Topology is a seminal theoretical work by Maurice Herlihy, Dmitry Kozlov, and Sergio Rajsbaum. It provides a bridge between two seemingly distinct fields: computer science (distributed algorithms) and mathematics (combinatorial topology). Distributed Computing Through Combinatorial Topology

DCCT is based on several key concepts and principles, including: The core concept is the

: The collection of all possible global states forms a simplicial complex , which captures every valid interleaving of process steps in a "frozen" geometric object. Then, you connect two global states if one

If all map to 0, then an input (1,1,1) would output 0 — violating validity (output must be some process's input, here none had 0). Hence impossible.

(meaning it has holes or is disconnected), the processes can never reach a unified agreement. In short: if the topology of the problem is more complex than the topology of the algorithm, the problem is unsolvable. Why It Matters Today