0-2-3-understand-memory-order-acquire

name	0.2.3-understand-memory_order_acquire
description	[0.2.3] Memory ordering barrier ensuring all loads and stores after the barrier in program order cannot be reordered b

understand-memory_order_acquire

CALL NUMBER: ?.memory_order_acquire DEFINITION: Memory ordering barrier ensuring all loads and stores after the barrier in program order cannot be reordered before it, synchronizing with release stores.

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

mcs_lock, memory_order_consume

---

Projected from the concurrency synchronization primitives and memory models KB (155 concepts / 137 relations) — consistency-typed by MAP; the facet list after the colon IS the cross-lib dependency web.

(leaf — this is an actual skill.)