0-3-4-understand-kernel

name	0.3.4-understand-kernel
description	["0.3.4"]
a parsed recursive chain	named nodes with substeps plus a closure clause

understand-kernel

CALL NUMBER: ee_v2_layer.kernel DEFINITION: a parsed recursive chain: named nodes with substeps plus a closure clause

Invoke this skill to understand kernel 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 ee_v2_layer

• chain_notation (d1): the [Name]: N.Node: Na.step format — a prompt whose structure IS the program

CONSUMERS (what needs this)

gauge_view, metacompiler

---

Projected from the the_toy_stack KB (57 concepts / 84 relations) — consistency-typed by MAP; the facet list after the colon IS the cross-lib dependency web.

(leaf — this is an actual skill.)