0-1-2-understand-cog-duo-triple

name	0.1.2-understand-cog_duo_triple
description	["0.1.2"]
MetaObserver over [generator <-> judge]	the agent-side transposition of the position triple; in cave-teams as

understand-cog_duo_triple

CALL NUMBER: agent_triple.cog_duo_triple : ee_v2_layer(9), map_layer(5), gauge_dinf_conjecture_unverified(2), law(1) DEFINITION: MetaObserver over [generator <-> judge]: the agent-side transposition of the position triple; in cave-teams as the eval_chain and loop_refine evaluator loops

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

• agent_gauge (d1): the triple embodied as SEPARATE SEATS in space: generator, challenger judge, observer — COG, DUO, WakingDreamer's three seats
• bilimit_cell (d1): generator = e (build), judge = p (review), metaobserver = limit-taker: the e-p-limit structure of the D-infinity construction itself

from ee_v2_layer

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

from gauge_dinf_conjecture_unverified

• position_triple (d1): the 3 in the 81 law: the three positions of D=[D->D] — object, map-space, evaluation; EE's layer frames are literally these (what-is / how-build / build-this)
• 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 (d7): SWI-Prolog closed-world checker behind a typed construction boundary; the consistency typer for everything the seats emit
• authority_split (d8): seats author candidate facts only; the engine holds source facts; a seat can never witness itself
• certificate (d8): a replayable proof envelope over a construction: subject, payload, kappa, sha — monotone, never uncertifies
• consistency_typing (d8): the KB cannot become internally inconsistent: every emission passes the typer or its violations are named
• soup_frontier (d8): the named violations when a construction fails: dangling, orphan, ungrounded — the retry signal and the work queue

---

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