Case packet
Neutral case identifier: case-0f41b0d385292b
The possible directed relationship from Artifact A to Artifact B is under review.
Artifact A
Machinery persists by warrant, not position, in a reflective loop
[The bitter lesson] has two modes, and its folk application remembers only one. The apply-mode is a selection rule over existing methods: prefer the techniques "that have been shown to scale." The build-mode is in Sutton's own conclusion — "time is better invested in finding simple scalable solutions" — and it is what compliance means where no scaled method exists yet: building one. [The two-axis reading] locates the localized forms in exactly that situation.
The build-mode's own history shows what gets hand-crafted. Every victory in Sutton's list is hand-designed machinery whose content is produced by computation: Deep Blue's alpha-beta search, the hidden Markov models that beat hand-crafted speech pipelines, the convolutional architecture that beat hand-coded features. The lesson never opposed hand-crafting as such — it requires it, at the meta-method level — and damns it only for content. [Sutton's own closing says so directly]: "we should build in only the meta-methods that can find and capture this arbitrary complexity… We want AI agents that can discover like we can, not which contain what we have discovered." Hand-craft the machine that learns; never hand-write what it should have learned.
Sutton's geometry has an outside; reflection erases it
That prescription has a clean geometry: the meta-method sits outside the learned system. The researcher designs the architecture; the architecture learns the content; the boundary never moves — and the frozen outside is also where gradient descent's stability comes from, since the machinery doing the selecting is never itself under selection.
A [reflective system] has no outside. Its machinery — types, gates, validators, skills, the loop's own instructions — is artifacts in the localized forms, sitting in the same repository, revisable by the same loop. This is not a design flaw to engineer away; it is already operative: the traced tag-readme episode is machinery produced by the loop (an operational strain became validator code), [oracle accumulation is machinery-production as a standing channel], and [the symbolic layer is a learning target with codification as its write path]. "Hand-craft the meta-method, learn the content" cannot be stated as an architecture here, because no component is structurally not content.
What replaces the outside
Three substitutions, each already carried by a standing claim:
- The hand-crafted/learned boundary becomes a per-artifact, time-indexed provenance fact. "Hand-crafted" says who produced the current version, nothing more. Everything starts hand-crafted — that is what bootstrapping means — and the loop takes over production progressively, content first, machinery later. The boundary is a frontier that moves, not a partition that holds.
- Exemption by position becomes persistence by warrant. In the frozen geometry the meta-method escapes selection by sitting outside it. Here nothing escapes by position: a gate survives because its criterion keeps discriminating, a type because its carve keeps earning use — [the earned-reach standard] applied uniformly, machinery included. This is more lesson-compliant than the frozen geometry, not less: even the meta-method faces search and selection.
- The permanently external becomes a function class, not a component class. What stays outside the loop is not any artifact but the functions no loop can perform for itself: [the objective], commitments, and the adoption "no" — external by category, however much of its machinery the loop comes to rewrite.
The cost is the fixed point
Gradient descent buys stability precisely from its frozen meta-method. A reflective loop judges proposed changes with machinery that is itself in scope — the trusting-trust condition, with fuzzier tools than Thompson had. Giving up exemption-by-position means giving up the free fixed point, and what stands in for it is governance: an adoption decision [allocated outside the text being judged], acceptances kept localized and reversible, and [accumulated oracles whose exhaustive wire does not depend on the judgment currently under revision]. The reflective build-mode is harder than Sutton's for exactly this reason — the fixed point is replaced by governance — and pretending the machinery is exempt would not restore stability; it would only hide where the trust is being spent.
Scope
- The claim is about what licenses persistence, not about current production ratios: one traced instance of loop-produced machinery plus one standing channel do not make the loop the main producer of its own machinery today. Content-first-machinery-later is an observed bootstrap order, not a law.
Open Questions
- Is there a minimal kernel that must stay fixed for the loop to remain stable — a trusted-computing-base analog for reflective improvement — or can governance plus reversibility fully replace the fixed point?
- What warrant would license moving a piece of machinery's production into the loop, as distinct from its revision — the migration-earned criterion applied to authorship rather than judgment?
Relevant Notes:
Artifact B
Warranted autonomy is bounded by oracle domain
Autonomy — how much of an improvement pathway runs without a person — is a separate gradient over a [self-improving system]. This note concerns the pathway shape that has a gate: the [proposal-selection improvement loop], where candidates are evaluated and can fail to be adopted. Bare autonomy is free: hand the gate to a model with a rubric and no human runs it. More autonomy strengthens that attribution, but it is not automatically a better design. What is bounded is warranted autonomy — a loop that runs unattended and can still be trusted with what it accepts.
Warranted evaluation autonomy extends only to the candidates the available oracle can assess with the required confidence, [since the boundary of automation is the boundary of verification]. Outside that domain, unattended evaluation remains possible but unwarranted.
Strength, strictness, and domain
Oracle strength concerns how reliably a check discriminates relative to the objective and what its result establishes. Strictness concerns how much evidence the gate demands before accepting. Domain is the range of candidates the oracle's strength, at whatever strictness is set, suffices to warrant — distinct from a claim's own [explanatory-reach] and from a generator's [search range], the cluster's two other limit vocabularies. Increasing strictness under a fixed oracle usually narrows acceptance: uncertain candidates are rejected or deferred so the remaining acceptances carry more assurance.
Strengthening discrimination can instead expand the warranted domain. A better verifier may reject bad candidates the old one passed while also accepting good candidates the old one could not distinguish from bad ones. Test suites, proofs, model judges, and human judgment therefore do not form nested acceptance sets; they establish different things over overlapping domains.
The [Gödel machine] is the limiting case of assurance obtained through strict acceptance: a rewrite runs only when the machine proves that switching helps under its formalization. It gains warranted total autonomy within that proof surface and excludes improvements it cannot prove. The cost follows from its proof requirement, not from a general law that stronger oracles always accept less.
[Commonplace] composes several oracles: tests and validators for structural constraints, human judgment for criteria that are not adequately automated. It could hand the latter gates to a model tomorrow and become more autonomous without becoming more warranted. Expanding warranted autonomy requires improving the relevant oracle's discrimination or narrowing the gate to cases it can establish.
The useful questions are therefore both how autonomous is the loop? and which of that autonomy is warranted by its oracles?
Oracle hardening moves the boundary
Oracle hardening can move a gate from unwarranted to warranted autonomy: a rubric becomes a validator, a heuristic becomes a test, or an unmeasured property becomes observable. The [oracle-strength spectrum] describes different verification surfaces, not a total order over their acceptance rates.
Hardening may expand the warranted domain by resolving cases the old oracle could not discriminate. Where criteria still outrun the oracle, the system must retain a human evaluator, narrow the unattended gate, or accept unwarranted autonomy.
Scope
- The claim concerns evaluation autonomy, so it is scoped to proposal-selection pathways — a direct evidence-driven update has no gate to hand over, and its trustworthiness is a question about the objective and the update rule instead. Search has a different failure surface, [since false-positive generation faces evaluation before retention].
- Bare autonomy means nobody is required at the gate. Warranted autonomy additionally claims that the unattended gate is reliable enough for its use.
- Warrant is objective-, risk-, and threshold-relative. No oracle is warranted for every decision merely because it is mechanical.
- Several oracles may govern different parts of one acceptance decision; their combined domain need not equal the union of what each accepts independently.
Relevant Notes:
Under-review context phrase
the governance that stands in for the fixed point