| name | 0.1.3-understand-agent_gauge |
| description | ["0.1.3"] |
| the triple embodied as SEPARATE SEATS in space | generator, challenger judge, observer — COG, DUO, WakingDreame |
understand-agent_gauge
CALL NUMBER: agent_triple.agent_gauge : ee_v2_layer(9), map_layer(5), gauge_dinf_conjecture_unverified(1), law(1)
DEFINITION: the triple embodied as SEPARATE SEATS in space: generator, challenger judge, observer — COG, DUO, WakingDreamer's three seats
Invoke this skill to understand agent_gauge 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
- kernel (d2): a parsed recursive chain: named nodes with substeps plus a closure clause
- fixpoint_meter (d3): zero newly-accreted structure across a cycle = stabilized; the kernel's own closure clause, measured
- metacompiler (d3): parses any chain-notation prompt into a kernel and runs it as a gated cycling KB compiler
- chain_notation (d3): the [Name]: N.Node: Na.step format — a prompt whose structure IS the program
- 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
- 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
- worklist (d6): the prover-minted backlog: define (referenced-but-undefined), connect (orphans), reconcile (near-duplicates)
from gauge_dinf_conjecture_unverified
- gauge_view (d1): a view or telling or kernel: a local frame in which the seat works; no privileged gauge; results select
from law
- automatability_test (d2): 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 (d6): SWI-Prolog closed-world checker behind a typed construction boundary; the consistency typer for everything the seats emit
- authority_split (d7): seats author candidate facts only; the engine holds source facts; a seat can never witness itself
- certificate (d7): a replayable proof envelope over a construction: subject, payload, kappa, sha — monotone, never uncertifies
- consistency_typing (d7): the KB cannot become internally inconsistent: every emission passes the typer or its violations are named
- soup_frontier (d7): the named violations when a construction fails: dangling, orphan, ungrounded — the retry signal and the work queue
CONSUMERS (what needs this)
cog_duo_triple
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.)
