Stone Duality Proofs for Colorless Distributed Computability Theorems

TL;DR

This paper introduces a topological spectral space encoding for distributed protocols, providing a new proof of colorless task solvability using Stone duality, unifying models and revealing their computational equivalence.

Contribution

It develops a spectral space framework for distributed computing, offering new topological proofs and unifying colorless task solvability results.

Findings

Spectral space encoding captures distributed states after finite executions.

A new computability theorem links task solvability to spectral maps.

Colored and uncolored models have equivalent computational power.

Abstract

We introduce a new topological encoding of executions of round-based, full-information distributed protocols via spectral spaces. Such protocols constitute a model of distributed computations which are functorially presented and englobe message adversaries. We give a characterization of the solvability of colorless tasks against compact adversaries. Colorless tasks are an important class of distributed tasks, examples thereof including the ubiquitous agreement tasks. Therefore, our result is a significant step toward unifying topological methods in distributed computing. The main insight of this work is in considering global states obtained after finite executions of a distributed protocol not as abstract simplicial complexes as was previously done, but as spectral spaces, considering the Alexandrov topology on the associated face posets. Given an adversary $\mathcal{M}$ with a set of inputs $\mathcal{I}$, we define a limit object $\Pi^\infty_{\mathcal{M}}(\mathcal{I})$ by a projective limit in the category of spectral spaces. This encodes all distributed information about the adversary, allowing us to derive a new distributed computability theorem using Stone duality: there exists an algorithm solving a colorless task $(\mathcal{I},\mathcal{O},\Delta)$ against the compact adversary $\mathcal{M}$ if and only if there exists a spectral map $\Pi^\infty_{\mathcal{M}}(\mathcal{I})\rightarrow\mathcal{O}$ compatible with $\Delta$. From this characterization, we derive the known colorless computability theorems for (colored or uncolored) Iterated Immediate Snapshot. Quite surprisingly, colored and uncolored models have the same distributed computability power, i.e. they solve the same tasks. Our new proofs give topological reasons for this equivalence, previously known through algorithmic reductions.