FLP Impossibility Result
Updated 2026-08-08
INTRODUCTION
English translation pending.
CORE DEFINITION
A foundational result in distributed computing published by Michael Fischer, Nancy Lynch, and Michael Paterson. In a fully asynchronous network, message delays are unbounded and no process can distinguish a slow node from a crashed one. Under these conditions, with even a single crash failure permitted, no deterministic algorithm can guarantee that all correct nodes eventually agree. Safety and liveness therefore cannot both be assured. The theorem bounds what consensus can promise, and practical systems escape it by weakening the model.
SCAFFOLDING EFFECT
Reduce cognitive load
- Consensus realism: stop demanding unanimous agreement in a noisy setting where delays are unbounded. - Tradeoff naming: state explicitly whether you are sacrificing safety or liveness, and why. - Model weakening: introduce timeouts, a leader, randomization, or partial synchrony to make agreement reachable.
Anchor fast decisions
The impossibility follows from indistinguishability. In an asynchronous system, a node that is merely slow looks exactly like a node that has crashed, so any deterministic protocol has an execution in which it waits for a message that never arrives. An adversarial scheduler can keep extending the ambiguity, and the protocol must either decide without the missing information, risking disagreement, or keep waiting forever, risking deadlock. Both escape routes are excluded, so no deterministic protocol satisfies both properties.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Consensus_%28computer_science%29verified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS