Home > Research > Publications & Outputs > Cliff-edge consensus
View graph of relations

Cliff-edge consensus: agreeing on the precipice

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNChapter



This paper presents a new form of consensus that allows nodes to agree locally on the extent of crashed regions in networks of arbitrary size. One key property of our algorithm is that it shows local complexity, i.e. its cost is independent of the size of the complete system, and only depends on the shape and extent of the crashed region to be agreed upon. In this paper, we motivate the need for such an algorithm, formally define this new consensus problem, propose a fault-tolerant solution, and prove its correctness.