| name | 0.4.2-understand-gauge_view |
| description | ["0.4.2"] |
| a view or telling or kernel | a local frame in which the seat works; no privileged gauge; results select |
understand-gauge_view
CALL NUMBER: gauge_dinf_conjecture_unverified.gauge_view : ee_v2_layer(9), map_layer(5), law(1)
DEFINITION: a view or telling or kernel: a local frame in which the seat works; no privileged gauge; results select
Invoke this skill to understand gauge_view 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 (d1): a parsed recursive chain: named nodes with substeps plus a closure clause
- fixpoint_meter (d2): zero newly-accreted structure across a cycle = stabilized; the kernel's own closure clause, measured
- metacompiler (d2): parses any chain-notation prompt into a kernel and runs it as a gated cycling KB compiler
- chain_notation (d2): the [Name]: N.Node: Na.step format — a prompt whose structure IS the program
- curried_compiler (d3): compile(kb, X, op): CEL context from the relative root of X, one seat, accrete, re-check — every agent is this curried
- cycle (d3): one walk of a kernel's nodes by fresh seats, ending in a harvest
- relative_root (d4): the least-fixed-point closure of everything X bundles from, walked to prims or to consumers, tagged by origin lib
- harvest (d4): the cycle-end dump of emerged concepts and relations into the persistent KB
- worklist (d5): the prover-minted backlog: define (referenced-but-undefined), connect (orphans), reconcile (near-duplicates)
from law
- automatability_test (d1): 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 (d5): SWI-Prolog closed-world checker behind a typed construction boundary; the consistency typer for everything the seats emit
- authority_split (d6): seats author candidate facts only; the engine holds source facts; a seat can never witness itself
- certificate (d6): a replayable proof envelope over a construction: subject, payload, kappa, sha — monotone, never uncertifies
- consistency_typing (d6): the KB cannot become internally inconsistent: every emission passes the typer or its violations are named
- soup_frontier (d6): the named violations when a construction fails: dangling, orphan, ungrounded — the retry signal and the work queue
CONSUMERS (what needs this)
agent_gauge, gauge_theory_of_dinf, prompt_gauge
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.)
