Stone Duality Proofs for Colorless Distributed Computability Theorems
Cameron Calk, Emmanuel Godard
TL;DR
This work introduces a spectral-space-based encoding of round-based full-information distributed computations and proves a colorless computability theorem: a colorless task $(\mathcal{I},\mathcal{O},Δ)$ is solvable against a compact adversary $\mathcal{M}$ iff there exists a spectral map $Π^\infty_{\mathcal{M}}(\mathcal{I}) \to \mathcal{O}$ carried by $Δ$. The limit object $Π^\infty_{\mathcal{M}}(\mathcal{I})$ is obtained as a projective limit of spectral spaces arising from protocol rounds, with Stone duality linking the spectral space to a lattice of subcomplexes; solvability is characterized by the existence of a compatible spectral map. The framework recovers classical colorless IIS results, shows the colored and colorless IIS models share the same computability power, and provides topological explanations for this equivalence via specialization order in the spectral space. By unifying geometric subdivisions with spectral-classification, the approach broadens topology-based computability to arbitrary round-based full-information models and suggests extensions to non-compact adversaries and colored tasks. Overall, the work offers a principled, topological foundation for distributed computability, connecting spectral topology, Stone duality, and category-theoretic protocol modeling to yield new proofs and insights for colorless tasks.
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 $Π^\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},Δ)$ against the compact adversary $\mathcal{M}$ if and only if there exists a spectral map $Π^\infty_{\mathcal{M}}(\mathcal{I})\rightarrow\mathcal{O}$ compatible with $Δ$. 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.