FLP Impossibility Result
Fischer, Lynch, and Paterson's proof that no deterministic consensus protocol can guarantee termination in an asynchronous system if even one process may crash: an adversarial scheduler can keep the system in a bivalent (undecided) configuration forever. Practical protocols escape it via partial synchrony, randomization, or failure detectors — never by contradicting it.
This Concept is waiting for its first lesson!
Fischer, Lynch, and Paterson's proof that no deterministic consensus protocol can guarantee termination in an asynchronous system if even one process may crash: an adversarial scheduler can keep the system in a bivalent (undecided) configuration forever. Practical protocols escape it via partial synchrony, randomization, or failure detectors — never by contradicting it.
Are you a teacher? Sign in to start contributing.
Sign In