| name | 0.1.3-understand-consistency |
| description | [0.1.3] The property that all nodes in a distributed system observe the same data state at the same time, or that oper |
understand-consistency
CALL NUMBER: ?.consistency
DEFINITION: The property that all nodes in a distributed system observe the same data state at the same time, or that operations appear to all processes in a globally consistent order per the model's guarantees.
Invoke this skill to understand consistency 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)
cap_theorem
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.)