The remaining processes cannot "bridge" the gap because the connectivity of the complex has changed.
The counter-measure fired. The Glitch vanished. distributed computing through combinatorial topology pdf
You have $n$ processes. They have inputs. They talk to each other. Some might crash. The order in which they speak changes the outcome. Trying to model every possible execution path is like trying to map every grain of sand in a desert. The remaining processes cannot "bridge" the gap because
Proving FLP traditionally requires a complex combinatorial argument about "bivalent" configurations and "faulty" executions. With combinatorial topology, the proof becomes a clean statement about : You have $n$ processes
Combinatorial topology is a field of mathematics that studies the topological properties of simplicial complexes, which are mathematical objects composed of simple building blocks called simplices. Simplices are the higher-dimensional analogs of points, lines, and triangles. Combinatorial topology provides a framework for describing the connectivity and holes in a complex, which is essential for understanding its topological properties.