0-1-2-understand-agreement

name	0.1.2-understand-agreement
description	[0.1.2] The property that a set of distributed processes reach the same decision outcome on a given value. Uniform agr

understand-agreement

CALL NUMBER: ?.agreement DEFINITION: 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.

Invoke this skill to understand agreement 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)

CONSUMERS (what needs this)

consensus

---

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.)