| name | 0.2.1-understand-toy_app |
| description | [0.2.1] the single public app that knows the whole stack and speaks the chain protocol — the neurosymbolic demonstrati |
understand-toy_app
CALL NUMBER: app_layer_unverified.toy_app : ee_v2_layer(12), law(8), map_layer(5), skilltree_lib(3), gauge_dinf_conjecture_unverified(3), lfpoop_lib(3)
DEFINITION: the single public app that knows the whole stack and speaks the chain protocol — the neurosymbolic demonstration artifact
Invoke this skill to understand toy_app 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 ?
- meta_metacompiler (d1): «undefined»
from app_layer_unverified
- chain_protocol (d1): the human-interaction contract: state a desire, release, receive emergence, select branches, revise, re-enter
- orchestrator_chain (d1): the runner of runs itself operates by the same chain: release = async dispatch, emergence = returned artifacts
- reality_join (d1): the loop closes through the human's real desire in and real artifacts out — simulation and observable reality as one feedback chain
from ee_v2_layer
- library_projection (d1): project the certified KB as understand-X skilltree skills; call number = home class colon facets = the dependency web
- metacompiler (d1): parses any chain-notation prompt into a kernel and runs it as a gated cycling KB compiler
- worklist (d1): the prover-minted backlog: define (referenced-but-undefined), connect (orphans), reconcile (near-duplicates)
- understand_skill (d2): a loadable unit of competence: X plus its relative root, consistency-typed
- 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
- fixpoint_meter (d3): zero newly-accreted structure across a cycle = stabilized; the kernel's own closure clause, measured
- 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
- ee_journey (d3): the 72-node emergence-engine walk: dir-is-the-state, per-order horizon, gated emissions
from gauge_dinf_conjecture_unverified
- order_gradation (d3): the ^4: grade-shifts of the position triple; the grading becomes dynamics the moment a grade-raising operator exists (emission, next_level, retype_up)
- position_triple (d3): 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)
- grade_raiser (d4): the operator that makes gradation dynamical: emission at pass end, lfpoop next_level with goldenization, the tower step
from law
- way_of_life_framework (d1): the usage discipline for agents distilled from the worked example: KBs first, compile on demand, worklists drained on heartbeats
- dogfooding_loop (d2): run the system on its own design KB: proving the plan fortifies the plan and mints its backlog
- the_81_law (d2): to generally explain a thing to the point you can program it, apply it to itself 3^4 times — one triple (concept, general constructor, specific instance) at four scales; explanation is complete when it has become a generator
- collapse_principle (d3): every planned integration is first a certified KB region, not code — the long-wise reification is skipped until the law fires
- 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
- futamura_tower (d3): the projection ladder: specializing an interpreter to a program yields a compiler; specializing the specializer compounds
- order_3_introspection (d3): the automator's requirement: observe the output, observe the observer (the authority split), observe the observing protocol (the meter and rulebook) — an order-3+ cybernetic system applied to itself
- recompilation_law (d4): bind a KB region to code only when its output is needed without lookup — reproduce with specialization
from lfpoop_lib
- lfpoop_ladder (d5): the 10-rung realization ladder of ONE identity: function, program, graph_entity, skill, manual, agent, application, distribution, golden_artifact, compiler_improvement; next_level admits exactly the next rung
- architecture_chain (d6): the 8-link chain: code_thing, graph_mirror_entity, runtime_object, actor, network, compiler, meta_compiler, repository_ecology
- goldenization (d6): hot artifacts cool through execution, testing, witnessing — the cooling dynamics of the ladder
from map_layer
- soup_frontier (d2): the named violations when a construction fails: dangling, orphan, ungrounded — the retry signal and the work queue
- certificate (d3): a replayable proof envelope over a construction: subject, payload, kappa, sha — monotone, never uncertifies
- map_prover (d4): SWI-Prolog closed-world checker behind a typed construction boundary; the consistency typer for everything the seats emit
- authority_split (d4): seats author candidate facts only; the engine holds source facts; a seat can never witness itself
- consistency_typing (d5): the KB cannot become internally inconsistent: every emission passes the typer or its violations are named
from skilltree_lib
- skilltree (d2): coordinate-addressed tree of skill dirs wired by Read-tool breadcrumbs, with validation and an FTS5 index
- skilltree_coordinate (d3): the hierarchical address of a node: root 0, child i = parent.i — the home class of the call number
- skilltree_rag (d3): build_index: one FTS5/BM25 table over every SKILL.md — retrieval returns ranked hits with shelf addresses
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.)
