Bootstrapping an Autonomous Theory Builder with Commonplace
Type: articles/types/article.md ยท Status: draft
Draft. The claims and structure of this article may change. Comments and counterexamples are welcome on the repository's GitHub Discussions page.
The lead article bets that a fully automated theory builder that learns can be built with today's fixed-weight LLMs. A theory builder is a system that states its theories in natural or formal language, acts on them, criticizes and revises them, and keeps the results for its next round of work. This article describes how Commonplace, the knowledge base behind these articles, builds one that is autonomous.
A theory builder is autonomous when computation performs every internal operation: noticing problems, diagnosing failures, producing and evaluating revisions, choosing which theory to keep, and repairing the method by which it does this. People remain as users: they supply tasks and judge the results against what they asked for.
Designing such a builder whole would require knowing in advance how computation should perform each of these operations, and we do not know that. So Commonplace builds it by bootstrapping. It starts as a system in which a human operator performs many of the operations and computation performs the rest. Because the builder includes whoever performs its operations, this system is already a theory builder, staffed partly by people. It is also reflective from the start: its own method is one of the theories it states, criticizes, and revises. The bootstrap moves operations from the operator to computation one at a time, each once evidence shows that computation performs it adequately.
Throughout, what is learned must be retained in the system, change later behaviour, and change it for the better; the lead article says how that last condition is tested. The bootstrap is working while the number of human decisions each completed, verified improvement requires holds steady or falls as the system grows. The strongest evidence of success is an improvement process that still completes when the operator's decisions are withheld. The last section states both tests.
Retain learning in the system
Successful learning must leave durable changes in the system. In Commonplace those changes take the form of theories, instructions, schemas, validators, tests, code, and other persistent artifacts.
Who contributes the learning matters less at the start. The operator may contribute anywhere in the process: choosing problems, criticizing results, interpreting evidence, approving changes, or supplying missing capabilities. Which functions to automate first can be decided as the work proceeds.
This works only while the operator keeps contributing, which requires a system people want to use. Then the judgments they supply are part of work they would do anyway. Commonplace is built to be such a system: its operator builds and uses the knowledge base for their own work, and that use is what first selects theories for fit, before any fixed test of a theory's fit exists.
Use reflection to improve the learning method
Some of what the system learns concerns its own operation. A recurring failure in review, decomposition, evaluation, or representation can become an object of learning, and the resulting knowledge can change the method used in future learning. A builder whose methods are stated as theories, consumed by its operations and criticized against records of its own operation, is what the knowledge base calls reflective.
This opens a feedback loop:
learning โ improved learning method โ greater future learning capacity โ further learning
An improvement to the method would be reused by every later episode, so over a long horizon its return can exceed that of immediate learning, and where it does, an optimal long-run learning strategy invests in its own machinery.
Reflection makes the method open to criticism. To close the loop, method changes must also compound, making later improvement cheaper, more reliable, or newly possible. That takes two further things. The builder must be able to change its method beyond revising text, which the next section takes up. Its evaluators must be able to tell a better method from a worse one, and that evidence must come from outside the builder's theory of its own method. Showing that compounding happened takes a later improvement episode, measured independently of the check that accepted the change, with a trace connecting the two; the compounding test states what counts.
So far the record shows only the loop's starting point: retention and later use, with no change to the learning method and no demonstrated improvement in later performance. In a 2026-08-30 revision, the model read the retained project theory, searched over reformulations of the research program, and proposed the edits. The operator supplied the decisive judgments about which formulation fit. Later commits built on the revised state.
Let the builder build its own software
Improving the method can take more than revising text. A new theory can call for new tools, experiments, search procedures, or schedulers. Testing hypotheses reliably or at scale can require exact symbolic computation. So Commonplace uses LLMs both to revise retained knowledge and to build and modify the software that puts it into operation.
The LLM handles semantic interpretation. Software handles exact bookkeeping, orchestration, and enforceable checks, where it is more reliable, following the error-correction asymmetry between schedulers and LLMs. The boundary between them moves: the software is part of the system and changes as learning reveals new requirements. With model weights held fixed, procedures the builder acquires must persist outside the weights, and code is one place to keep them.
General learning may even require this ability, if new theories keep creating new ways to test, organize, and apply knowledge.
Move functions from the operator to computation
A hand-built start fits Richard Sutton's Bitter Lesson only if learning outgrows it: computation must take over supplying the knowledge each new demand needs. Automation therefore grows one function at a time.
A judgment the operator makes repeatedly can move by one of two routes once its scope has stabilized. It can be codified into a test, validator, or check with formal semantics, which settles the judgment in the retained method. Or it can be delegated to the LLM under a retained natural-language procedure, which automates the judgment while the method leaves it open. These are different changes, and the record should say which one happened.
A function has moved when computation makes the decision and evidence shows that it decides adequately within a stated scope. The evidence condition matters because handing a decision to an unattended model is easy; a computational decision can be trusted only where its checks are reliable. A function can also move back: it returns to the operator when its check turns out to be a poor stand-in for what it was meant to catch.
Each transfer and each return is recorded, so that a later reader can see what moved, by which route, and when. So is what stays with the operator. A person still in the loop is named, and their contribution is credited to them. That record is informative, because transfer leaves people the decisions hardest to warrant. The functions that remain with the operator show where the means to automate them are missing, where an objective is unsettled, where authority is deliberately kept, or where transfer costs more than it returns.
The bootstrap
Commonplace is therefore an environment in which what the operator and computation learn together is retained, applied reflectively to the learning method, turned into new software, and moved function by function from the operator to computation. The aim is to use that process to build the capabilities an autonomous theory builder requires.
The hard part is the work that currently makes improvement possible at all: noticing the next problem, diagnosing it, and deciding which change serves the objective better. We conjecture that this process can transfer that work too, beyond the judgments it has already stabilized. The conjecture does not cover choosing the objective itself. The objective stays declared, and changing it counts as improvement only against a standard outside it.
Progress is measured by the number of human decisions each completed, verified improvement requires. Operator hours are a poor measure: in an open-ended system, attention freed from routine work moves to harder work, so they can stay flat while the bootstrap succeeds. The conjecture fails, in the terms of the bootstrap condition, if that number grows as the system grows. The strongest evidence of success is a removal test: withhold the operator's decisions and check whether an improvement process still completes, over a stated scope and time horizon. The testing supplement says how these decisions are recorded.