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
• A borrowed pattern transfers only as far as source and target share a mechanism — shared mechanism licenses transfer without independent justification, only over the layer where it reaches; analogy must earn adoption by target-side evidence
• short-composable-notes-maximize-combinatorial-discovery — the library exists for co-loading; short atomic notes maximize the surface area for cross-cutting discovery
• Artifact classification separates content kind, lineage, and authority — three non-substitutable questions keep region-level belief or residual choice, production lineage, and path-relative force separate; the collection contract supplies a different whole-artifact input
• a universal knowledge framework demotes content taxonomies to defaults — content taxonomies demote to guarded defaults; what stays fixed is stipulated (answerability) or enforced (contract declaration), not certified universal
• A framework rule with a boundary-preserving rival is not an inherited constraint — the stable complement to the demotion claim: a one-way test where a boundary-preserving rival demotes a rule to a design choice, while finding no rival leaves the rule only undemoted, not certified
• a-knowledge-base-should-support-fluid-resolution-switching — treats fluid movement between abstraction levels as a qualitative KB design criterion, with measurement still open
• Knowledge-access architecture must be evaluated end to end, not by retrieval alone — synthesis: discovery, loading, transformation, activation, and upkeep expose separate failure boundaries, so local retrieval success cannot proxy for task-relative whole-path quality
• 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

• Problem matches guide method search; mechanism matches bound transfer — separates relevance-based source search, mechanism-bounded borrowing, and target-side composition; military command and residual agent work form the worked case
• first-principles analysis maps a design space before selecting within it — maps consequential alternatives before closure and tests claimed necessities against rival decompositions
• human analogies can motivate functions without determining component boundaries — retains useful functional hypotheses from human cognition while reopening their allocation across engineered components
• 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
• Derivation and inheritance give starting warrant; discriminating evidence or proof earns scope — derivation and inheritance give conditional or transferred starting warrant, an underdetermined choice gives none, and only discriminating evidence or proof earns the scope it actually covers

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

• soft degradation often binds before the hard cap when required evidence fits — for evidence-fitting work the soft degradation curve, not the hard token limit, is typically the binding constraint; 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 benchmark that holds the client fixed exports the least-warrantable decisions by design - A fixed-client benchmark measures worker capability; it leaves broader closure untested when the client supplies internal production decisions, while ordinary user requirements and acceptance may remain external
• A better-factory claim compares operative states under an antecedent assessment relation - The improvement claim's relata are predecessor and operative-successor states and its relation is declared before the development it judges; evaluator location is a separate declaration from the learner boundary
• A capable agent needs methodology selection, not just relevant knowledge - A capable agent may know many individually relevant but mutually incompatible approaches, so task control requires selecting a governing methodology rather than merely supplying relevant knowledge
• A failure explanation becomes search control only when it changes a later branch decision - An explanation of a failed branch becomes operative search control only when its retention changes a later choice about scope, priority, probing, continuation, or abandonment
• A hand-crafted bootstrap fits the Bitter Lesson only if learning can outgrow it - A hand-crafted starting state fits the Bitter Lesson only if scalable learning displaces the task- and family-specific production knowledge it supplies as claimed reach widens
• A method's ceiling bounds the method, not the transfer it already made - Separates envelope expansion, where a responsibility leaves the residual human work, from performance gains inside a fixed envelope, so a bounded method reaching its ceiling does not retract the transfer it already made
• A methodology governs its own extension only as far as it settles the meta-decisions it raises - A retained methodology governs the consequential extension decisions it supplies or imports; actor competence can carry the process further without making those choices settled by the method
• A proposal-selection improvement loop requires search, evaluation, and operative retention - A proposal-selection improvement loop — candidates generated, evaluated with possible non-adoption, and accepted changes made operative — requires search, reject-capable evaluation, 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
• A repeatable operative path keeps a redesign class open to revision - Operationalizes repeatable operative revision for a named redesign class as a causal path through representation, evidence-bearing determination, admission, installation, dependence, and continuity
• A retained-theory intervention isolates one surface, not the whole program theory - An intervention on retained theory estimates that surface's causal contribution under matched conditions; influence, explanatory guidance, acquisition, and whole-system theory possession remain different claims
• A retrieval miss is a local reflective-path failure - A missed relevant artifact leaves its represented aspect inert for the affected task and discovery route, while other loading paths and reflective aspects can remain causally connected
• A search controller is tested by what it brings to stronger evaluation - A search controller should be evaluated by the branches and probes it routes into stronger evaluation, not by treating every provisional judgment as an acceptance claim
• Access burden and transformation burden are distinct query dimensions - Separates the system-relative cost of finding required inputs from producing an answer, so query systems can diagnose which work remains as retrieval and reasoning interact
• 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 substrate becomes a software factory through family-specific production machinery - Maps the bounded-call agentic substrate to Greenfield's software-factory ontology without calling every generic harness or generated program a factory
• An artifact must preserve the scope of each named system choice - An artifact may inherit scope from context guaranteed to its consumers; for each named system choice it must preserve a proposition-relative reference rule or range plus the choice's role, not necessarily concrete identity or quantifier syntax
• An omitted improvement-loop function and a frozen one need different repairs - Five proposal-selection systems expose frozen functions, while a direct-update contrast shows why absence of a gate is not omission; HyperAgents supplies a preliminary partial unfreezing
• An open-domain theory builder becomes a software house when new domains require production-machinery changes - A persistent automated theory builder for external users becomes a software house when genuinely new domains require it to revise the software that performs theory production rather than only the theories produced
• Backtracking keeps lightweight search control provisional - Backtracking preserves the provisional status of a heuristic branch choice by restoring an earlier usable state and redirecting search after contrary evidence
• Behavior-determining organization - Definition — retained structure inside a declared system boundary that shapes later operation; a work product belongs when the system also retains and consumes it in that role
• Borrowing can operate through retained artifacts or weight activation - Established external methodologies can become operative either by being explicitly retained in the system or by activating a model's pretrained representation; the two routes trade context economy against inspectability and revisability
• Broad software demands create pressure for agentic factory development - Broad software demands make exhaustive predefinition of useful family-specific production machinery practically implausible, motivating agentic factory development without ruling out a fixed universal substrate in principle
• Candidacy evidence licenses escalation to assessment, not acceptance - Separates candidacy evidence, which routes a hypothesis to costly assessment, from verdict evidence, which decides it; pricing and source-grounding cases provide two worked witnesses
• Causal and proof obligations are two formal routes to assessing explanatory-reach - Causal and proof obligations demonstrate two ways formal symbolic systems can assess explanatory-reach inside a warranted model
• Citing retained theory at the decision point is a mediation trace - A decision record that cites the theory it followed supplies cheap, checkable evidence that the theory was consumed — necessary for a record-based mediation claim, but short of showing correct or load-bearing use
• Claim modality is the inference form of the refuter - The three claim modes are refuter-defined images of deduction, induction, and comparative abduction; grounds the mode list's closure for empirical claims and gives vacuity and genre drift precise readings
• Commonplace as a reflective self-improving system - Commonplace witnesses that a human-inclusive KB can be reflectively self-improving on one pathway despite uneven coverage and human-gated design judgment
• Compounding is tested in later improvement, not by the accepting metric - Compounding evidence must come from later improvement episodes through displaced productivity measures and causal traces, not from the metric that accepted the earlier change
• Computationally directed self-improvement is a fixed-boundary reallocation ending in contraction - The progress question for self-improving systems is not category membership but which decision-bearing functions humans still supply; the endpoint test is whether the boundary can be contracted to exclude them
• Current-task fit alone does not warrant costly structural entrenchment - Distinguishes reversible adoption from costly structural entrenchment and confines option reasoning to the timing of a commitment supported by an enduring constraint, scoped transfer warrant, or actual coordination value.
• Decorrelated reviewers still share the field's prior, so read their findings by the claim's stance - Decorrelating reviewers removes the author's errors, not the field's; judges converge on consensus where a claim is original, so findings are read by stance and as reconnaissance: engage where load-bearing, deflect where not
• Disconnected witnesses do not establish a full causal path through theory - Theory use, outcome, theory revision, and later use establish theory-mediated learning only when their witnesses identify the joins of the same full causal path
• Distinct residue classes require distinct functions in a self-improving architecture - Different reasons for an untransferred decision identify different missing functions; a single process can supply several, and the current carrier split is not a permanent requirement
• 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
• Factory construction is not evidence of production-knowledge acquisition - Recursive software-factory construction is prior art, but the demonstrated constructors receive the family definitions, metamodels, mappings, and expertise that determine the produced factory
• Factory development - Definition — factory development constructs or revises reusable family-level production machinery rather than one product's lifecycle state
• Factory learning is experience-responsive retention that improves the factory - Experience-responsive retention: production experience determines a retained change to reusable family machinery that later production depends on; factory-level learning is retention that improves the factory relative to a declared objective
• Factory-learning mechanisms should be compared on the same causal job - Compares factory-learning mechanisms on their shared causal job — experience-responsive retention — while separating update mechanisms from the project-theory function needed for open-ended coherent modification
• 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
• Gödel machines are a proof-governed case of reflective self-modification - A Gödel machine admits self-rewrites through proof under its current formalization; this restricts admission without establishing how many useful changes are reachable or how reliably they are found
• Holding a program theory means sustaining coherent search under delayed feedback - Holding a program's theory is tested by whether a partial, fallible account of what the program is for keeps modification search, backtracking, and recovery coherent until delayed evidence arrives, not by whether the first change is right
• Improvements can accumulate without compounding - Improvements accumulate when later improvement consumes or preserves retained results; compounding requires an earlier benefit to counterfactually improve a later episode, directly or through reinvested savings
• Improvements outside the admitted formal language need a pre-formal stage somewhere - An improvement whose concepts have no expression in a loop's admitted formal language is reached only through a pre-formal stage, inside the loop or fixed at design time in the choice of language; translation relocates that stage
• 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
• Intent controls a local choice only when it distinguishes its live alternatives - A stated intent controls a local choice only when it changes which live alternatives are admissible, preferred, worth further search, or sufficient to stop
• Lightweight search control allocates further search without licensing adoption - A search judgment is lightweight when its authority stops at allocating further investigation, probing, continuation, suspension, or abandonment rather than licensing an operative change
• Literature reuse can reverse a paper’s hierarchy of contributions - Explains why conceptual distinctions built to support a paper's stated result can become its most valuable reusable output in a different research context
• LLM-executed methodologies are metacircular interpreters, not compilers - Self-hosting LLM methodologies are closer to metacircular interpreters than compilers: agents re-interpret natural-language 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 what a retained method settles; computational closure tracks the absence of human decisions during the assessed operation, without requiring every judgment to have explicit criteria
• Moving the interpretation–enforcement boundary requires cross-form coverage - Moving responsibility between model-interpreted rules and formal enforcement crosses natural-language and symbolic forms, so governing the transfer requires coverage of both and their mapping
• Natural-language project state may specialize weight-resident search heuristics - The natural-language part of project state may specialize general search heuristics already represented in an LLM's weights by supplying current intent, theory, branch history, and constraints
• Naur's compiler case tests one historically bounded documentation-and-consumption system - Naur's compiler transfer failure rules out more documentation of the same kind, but tested one historically bounded package and consumption process rather than every possible rationale, indexing, retrieval, and activation system
• Naur's human-only conclusion needs more than the absence of explicit criteria - Naur's human-only conclusion needs a further premise connecting unformulated judgment to computational inability; this reading preserves his functional tests without claiming that learned criteria are inexpressible
• Open-ended construction builds an object and a theory of it - Proposes that construction which must discover and revise an object's organization produces project-specific understanding beyond the object, using programs and theories as its two main cases
• Open-ended improvement must allocate search before decisive evaluation is available - Open-ended improvement must choose which questions, candidates, experiments, or proof paths to develop before decisive evidence about them is available; even a Gödel machine's proof gate retains this prior search problem
• Open-ended theory learning and factory learning close the same reflective loop - Derives one reflective loop from both open-ended theory learning and software-factory learning, and places the Gödel machine by transition licensing and theory provenance
• 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
• Parametric reproduction alone cannot replace an authoritative record - Reproducing a record's content does not transfer its authority. Replacement requires a governed artifact with stable identity, integrity, contestability, and attribution; mutable records also require currentness and addressable revision.
• Preferential codification concentrates less predictable work at the agent boundary - Explains the negative-selection mechanism by which preferential codification changes the composition of work retained at an agent boundary
• Project-theory possession requires comparing new demands with existing organization - For open-ended modification, project-theory possession includes relating a new demand to existing responsibilities before parallel structure becomes the default; an explicit assimilation branch may counter additive coding-agent patches
• Reach-assessment - Definition — judging whether a commitment's claimed explanatory-reach is genuine across natural-language, symbolic, and distributed-parametric forms
• Real self-improving systems occupy combinations no single rung captures - Casebook of thirteen 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 accumulate 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 stated per represented form and operation profile; control of an external dependency does not make that dependency part of the system's reflective coverage
• Reflective system - Definition — a system is reflective relative to selected aspects when an internal process uses a causally connected self-representation of them in its operation
• Reflective theory refinement has separate structural, epistemic, and implementation lineages - No single predecessor is closest to reflective theory refinement: runtime self-modeling supplies the self-target, classical theory refinement the mechanism with different fillers, and Workspace Optimization only an implementation analogy
• Reflective theory refinement needs interpretation, retention, and independent read-back - Reflective theory refinement requires semantic interpretation, addressable retention, independent outcome read-back, and continuation on one causally co-indexed path; these are distinct functions that need not share one substrate
• 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
• Six reported self-improvement paths expose bounded redesign surfaces within supplied methods - Comparative evidence separates operative redesign, revision of governing machinery, and contributions to later improvement from declared editability across six reported self-improvement paths including HyperAgents
• Software factory - Definition — in the Greenfield lineage, a software factory is a configured family-specific software-production environment
• Software house - Definition — a software house is the complete persistent system responsible for developing and evolving software for external users
• Superseded choices need a historical witness; refuted beliefs lose subject-matter standing - Retention after supersession follows remaining truth role rather than maintenance operation: preserve a witness to the choice event, while a refuted belief loses subject-matter standing
• Task families and product families classify different things - Task families group obligations or evaluations; software product families group products through declared commonality, variability, and reusable production scope
• Technical constraints turn KB objective-function choice from philosophy into engineering - Three technical constraints and the codification lever make KB objective-function choice testable engineering, not philosophy; goals set the loss, local contracts specialize it, and oracle strength differs by objective
• The 2026-08-30 Commonplace revision used retained theory to guide computational search - A 2026-08-30 Commonplace revision shows retained project theory guiding computational search while the operator supplied decisive global-fit selection
• The bitter lesson selects production methods, not representational forms - The lesson's axis is production method — hand-crafted versus search-and-learning — not representational form. Learned localized forms are therefore a coherent scaling hypothesis, with cross-artifact credit assignment as the decisive open problem
• 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 mediation can coordinate heterogeneous factory development - Fallible natural-language project theory may provide an addressable way to coordinate heterogeneous factory development while search, testing, and backtracking construct and revise it
• Theory refinement - Definition — theory refinement revises an existing fallible explicit theory against empirical cases, seeking improved fit with limited changes; the KB extends its representation and subject
• Theory warrant should be tracked at the finest granularity evidence licenses - Treat support for a theory as warrant for only the most specific claim, conjunction, model, and scope the evidence identifies; do not distribute joint warrant beyond what it entails without additional attribution
• Tool usefulness, computational autonomy, warrant, and system power are separate dimensions - Tool usefulness, computational autonomy, warrant, and system power move independently in a human-agent system, so a progress claim has to say which one moved and autonomy gains do not license power claims
• Under sub-agent decomposition, feasibility is the heaviest fork's net load - Shows why decomposition changes feasibility from total operation cost to the largest residual load left on any fork after work is shifted to siblings or the parent
• Universal software factory needs a declared universality axis - Universal software factory is ambiguous unless the universality axis, covered class, supplied inputs, adequacy relation, and resource bounds are declared
• 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
• Warranted transfer out of the human cut leaves people the hardest-to-warrant decisions - When a system preferentially transfers decisions whose premises, criteria, and checks are available, the remaining human decisions become harder to warrant per decision; this predicts a residue composition, not structural computational openness
• Weight-resident methodologies provide context-efficient behavioral compression - A compact cue can activate a much larger methodology already represented in model weights, trading very low context cost for model-dependent reconstruction rather than exact retained specification
• 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