Foundations

Type: kb/types/tag-readme.md

Core theory that the rest of the KB builds on. These notes define the quality criteria, the design methodology, and the fundamental constraints that shape every other decision.

Notes

• agent memory needs discoverable, composable, trusted knowledge under bounded context — unifying theory: three properties form the minimal artifact-quality basis for remembered knowledge that serves contextual competence
• context-efficiency-is-the-central-design-concern-in-agent-systems — context is the scarce resource; nearly every architectural pattern is a response to volume or complexity pressure
• programming-patterns-get-a-fast-pass-but-other-borrowed-ideas-must-earn-first-principles-support — borrow from any source, filter through first principles; programming patterns get a fast pass
• short-composable-notes-maximize-combinatorial-discovery — the library exists for co-loading; short atomic notes maximize the surface area for cross-cutting discovery
• a knowledge base holds theories, descriptions, and prescriptions with asymmetric linking — content registers explain why theory, description, and prescription need distinct quality goals and asymmetric maintenance rules
• a universal knowledge framework demotes content taxonomies to defaults and keeps answerability — universality keeps second-order obligations (declared contracts, answerability) and demotes content taxonomies to guarded defaults; contradicts the tripartition's exhaustiveness claim
• first principles are inherited constraints, not design choices — the stable complement to the demotion claim: a membership test (inherited from consumer, substrate, domain, or machinery coherence) plus the principles that currently pass it
• a-knowledge-base-should-support-fluid-resolution-switching — KB quality measured by how fluidly it supports moving between abstraction levels
• charting-the-knowledge-access-problem-beyond-rag — exploratory decomposition: separates substrate, pointers, navigation modes, synthesis, and maintenance so RAG-vs-filesystem debates stop collapsing unlike tasks
• mechanistic constraints make Popperian KB recommendations actionable — bridges conjecture-and-refutation with bounded-context mechanics

Self-improving systems

• self-improving systems — evidence-responsive operative change to a system's own organization; reflective versus non-reflective self-improvement is the central distinction, and warranted autonomy is what costs
• actionable methodology — the prior vocabulary: a methodology supplies an intervention-relevant mapping; actionability relates it to an operator, operations, target, and setting

Rationale and design method

• design rationale management in Commonplace — descriptive companion: how workshops, proposals, ADRs, and contracts distribute constraints, alternatives, and decisions—and what continuity shipped contracts do not enforce

• Alexander's patterns connect to knowledge system design at multiple levels — (speculative) pattern language as document types, generative processes as codification

• agent context is constrained by soft degradation not hard token limits — the binding constraint is the soft degradation curve, not the hard token limit; agents are in the same soft-bound family as human cognition and organizational learning

• soft-bound traditions as sources for context engineering strategies — catalog of twelve traditions with transfer assessment: what's already working, what's plausible, what's aspirational

Other tagged notes

• A methodology governs its own extension only as far as it settles the meta-decisions it raises - A methodology governs its own extension only as far as it settles the meta-decisions its recommendations raise — representational form, verification, and authority
• A proposal-selection improvement loop requires search, evaluation, and operative retention - A proposal-selection improvement loop — candidates generated, evaluated with possible non-adoption, selectively retained — requires search, evaluation that can reject, and operative retention
• A proximate target is checked for achievement, not for warrant - Between an improvement objective and its oracles sits a target level — a property pursued because it is held to serve the objective — whose linking claim no check in the loop evaluates
• Access burden and transformation burden are independent query dimensions - Queries have two independent difficulty axes — finding inputs (access) and producing the answer (transformation) — conflating them misroutes symbolic transformations through semantic processing
• Accumulation counts dependence through the retained result, not through the evidence it caused - Cumulativity counts dependence through the retained result only; counting the evidence channel that result caused would make it coextensive with operativity
• An adversarial human-agent loop can reconstruct the writing-is-thinking filter - The writing-is-thinking filter is the loop's, not the pen's — an adversarial human-agent loop can reconstruct what naive delegation loses, but only while the human stays the judge
• An agentic KB maximizes contextual competence through discoverable, composable, trusted knowledge - Retired note kept as a backlink target; its general memory-quality claim and KB-specific ingress claim now live in narrower successor notes.
• Behavior-determining organization - Definition — the retained structure that shapes how a system will operate: parameters, policies, memory, rules, workflows, tools, code, architecture, evaluators; outputs and environment excluded
• Evidence bearing on an improvement objective - Definition — evidence bears on an improvement objective when it carries information about the criterion: gradients, rewards, errors, viability signals, tests, judgments; no evaluator required
• False-positive generation is filtered; false-positive acceptance becomes operative - False-positive generation faces evaluation before retention, while false-positive acceptance becomes operative and can compound
• Formal symbolic systems assess explanatory-reach only through causal and proof obligations - Formal symbolic systems assess explanatory-reach only after claimed generality is translated into causal or proof obligations inside a warranted model
• Gödel machines are a proof-governed case of reflective self-modification - The Gödel machine realizes reflective self-modification with a proof-gated acceptance rule, gaining model-relative rigor at the cost of excluding useful changes it cannot prove
• Improving an agentic system crosses the prose-symbolic boundary - The error-correction asymmetry sorts agentic behavior between prose and code, so reliability-improving changes cross the boundary; reflective coverage of one form cannot carry them
• Increasing computational autonomy relocates human effort to the frontier instead of reducing it - In an open-ended system, increasing computational autonomy need not cut total human hours — attention moves to the frontier — so measure improvements per human judgment, not human time
• LLM-executed methodologies are metacircular interpreters, not compilers - Self-hosting LLM methodologies are closer to metacircular interpreters than compilers: agents re-interpret prose rules each session, while stable paths codify into validators and commands
• Measuring autonomy well enough to see it improve is an open problem - Autonomy is reported per function rather than scored as a percentage, but that profile does not yet support comparison across systems or time
• Methodological and computational closure track different changes - Methodological closure tracks whether a retained method settles consequential decisions; computational closure tracks whether those decisions require a human actor
• Operative change - Definition — a change is operative when it affects the system's subsequent operation over the relevant, declared horizon through a behavioral-authority path; operativity does not require permanence
• Reach-assessment - Definition — judging whether a commitment's claimed explanatory-reach is genuine across prose, symbolic, and distributed-parametric forms
• Real self-improving systems occupy combinations no single rung captures - Casebook of eight placements on selected pathway-profile fields — Homeostat to Commonplace — reflection, cumulativity, allocation, and evidential limit in combinations no rung expresses
• Reflection buys addressability - Self-improvement can compound without reflection — parametric learners do — but non-reflective retention gives only indirect handles; reflective retention makes the changed object addressable
• Reflection makes retained lessons second-order: a lesson can reject or rescope a prior commitment - Reflection lets a retained lesson target a prior commitment explicitly — rejecting, revising, or rescoping it — while non-reflective correction acts indirectly through the substrate
• Reflective coverage is graded across representational forms - Reflective coverage is graded per representational form and operation profile; selection among opaque components — pinning a model — is real but selection-only coverage of the parametric form
• Reflective system - Definition — a reflective system has an aspect-bounded, causally connected self-representation available to processes inside a declared system boundary
• Retrieval failure is reflection failure - Where a self-representation is retained artifacts, retrieval is the wire it acts along — a search that misses a represented constraint breaks the causal connection, not just convenience
• Revising an improvement objective is licensed from outside it or is not improvement - Objective change is improvement only against a level outside both objectives; proxy revision, re-indexing, and surfaced under-specification subtract most apparent cases
• Self-improvement is relative to a declared objective - The improvement objective is a declared parameter alongside boundary and horizon, carrying two separable conditions — indexed by the analyst, antecedent in the pathway — whose failures differ in kind
• Self-improving system - Definition — operative, evidence-responsive change to a system's own behavior-determining organization, read against a declared boundary, horizon, and improvement objective
• Task-fitted structure costs cross-task reuse - Structure fitted to the questions a KB is asked today loses value when the questions change; wikis accumulate the damage because structure is cheap to add and nothing forces its removal
• Technical constraints turn KB objective-function choice from philosophy into engineering - Four technical constraints make KB objective-function choice testable engineering, not philosophy; goals set the loss, contracts and profiles specialize it, and oracle strength differs per profile
• The self-improving-system definition classifies its boundary cases without ad hoc exceptions - Ten boundary cases run against the self-improving-system definition — each classifies by the stated criteria alone; the stress they apply falls on boundary declaration, not on the membership clauses
• Theory-mediated self-improvement needs both interpretation and retention from one substrate - Reflective self-improvement inherits the theory-mediated sample-efficiency conjecture only where one substrate both interprets a theory about the system's own operation and retains it addressably
• Under sub-agent decomposition, feasibility is the heaviest fork's net load - Once work is split across sub-agents, the per-window feasibility ceiling becomes per-agent — set by the heaviest fork's net load (what decomposition leaves on it after work is pushed across to siblings or up to the parent), which comes apart from the operation's summed cost
• Warranted autonomy is bounded by oracle domain - Bare autonomy is free, but warranted evaluation autonomy extends only to the candidates an oracle can assess with the required confidence
• World models assess explanatory-reach through action-conditioned prediction - Learned world models can assess explanatory-reach when action-conditioned predictions are tested across the interventions or shifts a commitment claims