| name | 0.4.4-understand-raft |
| description | [0.4.4] Consensus algorithm designed for understandability, using leader election, log replication, and safety viaterm |
understand-raft
CALL NUMBER: distributed_consensus_and_replication_protocols.raft : deep_raft(6)
DEFINITION: Consensus algorithm designed for understandability, using leader election, log replication, and safety viaterm numbers.
Invoke this skill to understand raft down to its primitives. The RELATIVE ROOT below is the least-fixed-point closure of everything it bundles from — the full import cone, grouped by the lib each prim comes from. Projected from a prover-typed KB (MAP/SWI-Prolog consistency gate): every reference below resolves.
THE RELATIVE ROOT (the import cone, by lib)
from ?
- agreement (d2): The property that a set of distributed processes reach the same decision outcome on a given value. Uniform agreement requires all processes including those that later crash to decide identically; asymmetric agreement permits different decision classes for different process roles such as primary versus backup.
from deep_raft
- a007 (d2): Quorum in agreement: a subset of processes sufficient to guarantee agreement can be reached, typically intersecting any valid quorum to ensure overlap.
- a008 (d2): Threshold in agreement: the minimum number of correct processes required to guarantee safety and liveness under given failure assumptions.
- a005 (d2): Uniform agreement: all processes including those that later fail must decide on the same value, stricter than ordinary agreement which only binds correct processes.
- a009 (d3): Asymmetric agreement: one class of processes (e.g., primary) must agree while another class (e.g., backups) may reach different decisions, used in primary-backup protocols.
- a002 (d3): Validity in agreement: the decided value must have been proposed by some process in the system, guaranteeing agreements are grounded in actual proposals.
- a004 (d4): Termination in agreement: every correct process eventually decides some value, ensuring the protocol makes progress and does not stall indefinitely.
from distributed_consensus_and_replication_protocols
- consensus (d1): Agreement on a single value among a set of distributed processes; the core problem consensus protocols solve.
- replicated_log (d1): Ordered log of commands maintained across replicas; foundation of state machine replication.
- fault_tolerance (d2): System's ability to continue operating correctly despite component failures.
CONSUMERS (what needs this)
candidate, cockroachdb, consul, election_timeout, etcd, heartbeat_timeout, leader, pre_vote, term
Projected from the distributed consensus and replication protocols KB (196 concepts / 187 relations) — consistency-typed by MAP; the facet list after the colon IS the cross-lib dependency web.
(leaf — this is an actual skill.)
