0-5-3-understand-automatability-test

name	0.5.3-understand-automatability_test
description	[0.5.3] a process is automatable under a view iff the view's self-application trace reaches fixpoint — metacompile the

understand-automatability_test

CALL NUMBER: law.automatability_test : ee_v2_layer(9), map_layer(5) DEFINITION: a process is automatable under a view iff the view's self-application trace reaches fixpoint — metacompile the view, run it, read the meter; non-convergence means re-gauge the view, not give up

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

• fixpoint_meter (d1): zero newly-accreted structure across a cycle = stabilized; the kernel's own closure clause, measured
• metacompiler (d1): parses any chain-notation prompt into a kernel and runs it as a gated cycling KB compiler
• curried_compiler (d2): compile(kb, X, op): CEL context from the relative root of X, one seat, accrete, re-check — every agent is this curried
• cycle (d2): one walk of a kernel's nodes by fresh seats, ending in a harvest
• kernel (d2): a parsed recursive chain: named nodes with substeps plus a closure clause
• relative_root (d3): the least-fixed-point closure of everything X bundles from, walked to prims or to consumers, tagged by origin lib
• harvest (d3): the cycle-end dump of emerged concepts and relations into the persistent KB
• chain_notation (d3): the [Name]: N.Node: Na.step format — a prompt whose structure IS the program
• worklist (d4): the prover-minted backlog: define (referenced-but-undefined), connect (orphans), reconcile (near-duplicates)

from map_layer

• map_prover (d4): SWI-Prolog closed-world checker behind a typed construction boundary; the consistency typer for everything the seats emit
• authority_split (d5): seats author candidate facts only; the engine holds source facts; a seat can never witness itself
• certificate (d5): a replayable proof envelope over a construction: subject, payload, kappa, sha — monotone, never uncertifies
• consistency_typing (d5): the KB cannot become internally inconsistent: every emission passes the typer or its violations are named
• soup_frontier (d5): the named violations when a construction fails: dangling, orphan, ungrounded — the retry signal and the work queue

CONSUMERS (what needs this)

gauge_view, the_81_law

---

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