The problem
N nodes propose values. At most one value must be chosen. Even if some crash, the chosen value must be stable.
Advertisement
The problem
N nodes propose values. At most one value must be chosen. Even if some crash, the chosen value must be stable.
Advertisement
Phase 1: Prepare
Proposer picks number n, sends Prepare(n) to acceptors. Acceptor promises to reject anything < n and returns any previously accepted value.