Paxos Algorithm
Version 1.0.0 · Updated 2026-07-28
CORE DEFINITION
The Paxos algorithm is a protocol for solving the consensus problem in distributed systems, proposed by Leslie Lamport (the 'La' in LaTeX) in 1990. It aims to enable multiple processes (nodes) to agree on a single value in an environment where the network may be delayed, nodes may fail, but messages are not maliciously tampered with. Note that Paxos is often mistakenly referred to as a 'consistency algorithm'. However, 'consistency' and 'consensus' are not the same concept. Paxos is a consensus algorithm.
SCAFFOLDING EFFECT
Reduce cognitive load
The Paxos algorithm is a protocol for solving the consensus problem in distributed systems, proposed by Leslie Lamport (the 'La' in LaTeX) in 1990. It aims to enable multiple processes (nodes) to agree on a single value in an environment where the network may be delayed, nodes may fail, but messages are not maliciously tampered with. Note that Paxos is often mistakenly referred to as a 'consistency algorithm'.
Anchor fast decisions
In an asynchronous network where messages may be lost and nodes may crash, reaching consensus on a value cannot rely on a single command. Paxos uses two phases: Propose (proposer sends a numbered proposal) → Promise (majority promises not to accept earlier proposals) → Accept (accept) → Learn (notify all). As long as a majority is alive, the system can always converge to the same value, achieving 'reliability from unreliability'.
MINIMUM ACTION
In progress 0/5Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- zh.wikipedia.orghttps://zh.wikipedia.org/wiki/Paxos%E7%AE%97%E6%B3%95verified
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