A topological characterization of stabilizing consensus

Ulrich Schmid, Stephan Felber, Hugo Rincon Galeana · 2026

Read A topological characterization of stabilizing consensus by Ulrich Schmid, Stephan Felber, Hugo Rincon Galeana (2026) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/PMC13287106.txt.

Description

Ulrich Schmid, Stephan Felber, and Hugo Rincon Galeana settle when networked computers can eventually agree in a 2026 theoretical paper. In stabilizing consensus, processes may flip their decisions freely but must finally settle on one shared value, a relaxation of the classic problem where answers lock forever. Some faulty networks forbid the classic version yet allow this one, and results until now came piecemeal.

Working in point-set topology over infinite executions, the authors prove a complete characterization covering nearly any model with mild process and message faults. Semi-open decision sets and semi-continuous maps, tools dating to 1963, turn out to be exactly the right lens, since they let a connected space map onto a split one. Weak and strong validity versions prove equivalent, and every known solvability result in the area gets a unified topological explanation.

Catalog record

CREATORUlrich Schmid, Stephan Felber, Hugo Rincon Galeana
YEAR2026
COLLECTIONPAPERS
FORMATTXT
FILE SIZE387664
LICENSEhttps://creativecommons.org/licenses/by/4.0
RIGHTSCC BY
SOURCEEurope PMC

Source: https://europepmc.org/article/MED/PMC13287106

Browse the full library · About the Tower of Babel