▎Loyal Wingman

Consensus Algorithms

Distributed protocols ensuring agreement among nodes despite faults.

Definition

Consensus algorithms (Raft, Paxos, PBFT) let a set of nodes agree on a value despite crashes or, for Byzantine variants, arbitrary failures. Swarm autonomy stacks use lightweight consensus to elect leads, agree on shared world-model snapshots, and coordinate role assignments after partition events.

Reference attributes

Common variants: Raft, Paxos, PBFT, HotStuff
Failure model: Crash-stop or Byzantine

Related terms

Leader Election
Distributed primitive for selecting a single coordinator among peers.
Byzantine Fault Tolerance (BFT)
Property of agreeing despite arbitrary, including malicious, node behavior.

#distributed#fault-tolerance