0-1-4-understand-emergent-repair

name	0.1.4-understand-emergent_repair
description	["0.1.4"]
correction by re-representation at the next grade instead of rejection	SOUP tolerated locally, flattened by l

understand-emergent_repair

CALL NUMBER: agent_triple.emergent_repair : ee_v2_layer(10), map_layer(5), gauge_dinf_conjecture_unverified(1), law(1) DEFINITION: correction by re-representation at the next grade instead of rejection: SOUP tolerated locally, flattened by later metalang phases — the worklist philosophy at micro scale

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

• prompt_gauge (d1): the triple embodied as STRUCTURAL POSITIONS IN TIME walked by one seat: phases force re-description (observation), layers are the metalang (meta-observation), MAP holds the judge seat
• forced_redescription (d2): the prompt system as observer: each phase makes the seat describe what it did, then describe that — judgment distributed into structure instead of a second agent

from ee_v2_layer

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

from gauge_dinf_conjecture_unverified

• gauge_view (d2): a view or telling or kernel: a local frame in which the seat works; no privileged gauge; results select

from law

• automatability_test (d3): 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

from map_layer

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

---

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