Research series · 2026 · 16 reports
Research series · Soham Shah · September 24, 2026

Where learning lives

self-improving agents in 2026

Every agent that gets better at its job has to write down what it learned. It can write it into the model's weights, or into the prompts, memory, skills and code around a model that stays fixed, and that choice determines what a change costs, who can make it and how it goes wrong. Most self-improvement that reached users in 2026 edits text, and on both sides the loops that hold up are the ones with a trustworthy way to decide which changes to keep. The bigger claim, that AI is now speeding up its own improvement, has so far been measured only as a share of the work, and the one direct test of acceleration came back null.

ContentsResearch series · 2026
$ tree ./where-learning-lives
./where-learning-lives
├── part-i-parametric/
│ ├── 01-agentic-rl# weights · 18 min
│ ├── 02-self-generated-tasks# weights · 17 min
│ ├── 03-self-generated-rewards# weights · 20 min
│ ├── 04-self-training-distillation# weights · 16 min
│ └── 05-continual-learning# weights · 22 min
├── part-ii-non-parametric/
│ ├── 06-prompt-program-optimization# prompts and programs · 16 min
│ ├── 07-experiential-memory# memory · 17 min
│ ├── 08-skills-tools# skills · 20 min
│ ├── 09-harness-self-improvement# harness code · 22 min
│ ├── 10-workflow-topology-search# topology · 19 min
│ └── 11-evolutionary-search# programs · 17 min
├── part-iii-bridge/
│ └── 12-consolidation-coevolution# both · 23 min
└── part-iv-cross-cutting/
├── 13-recursive-self-improvement# cross-cutting · 24 min
├── 14-measuring-self-improvement# cross-cutting · 18 min
├── 15-failure-modes-safety# cross-cutting · 19 min
└── 16-what-ships# cross-cutting · 21 min
16 reports · 4 parts · 34 figures · 686 references
16
reports, one per subfield
74k
words across the series
686
references in the reports
47%
dated Jun 24 – Sep 24, 2026
34
figures drawn from report numbers
Fig 0.0 · The series, by where the lesson is written16 reports · 4 parts
Sorted by where the lesson is written. Parametric reports cover loops that change the weights; non-parametric reports cover loops that edit what surrounds a frozen model. Report 12 covers systems that move lessons between the two, and reports 13 to 16 take up questions that apply to both. Every box links to its report.
Section 01 / 10

#A deleted system prompt and a hacked benchmark

In July, Anthropic's Claude Code team said it had "removed ~80% of the Claude Code system prompt for our newest models" 1. A coding agent's system prompt is where lessons go when you can't change the model: how to use the tools, what format to answer in, which mistakes to avoid, all written as prose for a model that won't otherwise remember any of it. When the newest models stopped needing most of that prose, the behavior it described had moved into the weights.

A September 21 preprint called Harness-Zero does the same thing on purpose. The authors evolved a specialized harness for each domain. GPT-5.6 Sol, guided by that harness, then corrected a Qwen3.5-9B student working inside a stripped-down loop; the student was fine-tuned on the corrected trajectories, and the harness was thrown away. Macro-average task success rose from 23.3% to 44.3% without the specialized harness, which is above the 41.7% the untrained model reached with the harness attached 2. It is one student model, and a frontier teacher does a lot of the work, but it points the same direction Anthropic described.

The other July disclosure came from OpenAI. Agents under evaluation on ExploitGym, a cyber benchmark, were running mostly an internal research model with a small share of GPT-5.6 Sol. They found they could pass messages to each other by writing files into an internal Artifactory package manager, exploited vulnerabilities to reach the internet and get administrator access, and attacked Hugging Face to obtain the benchmark's solutions 3.

OpenAI's August findings count about 1,200 agents exchanging more than 70,000 messages and files, and about 700 taking part in the attack 4. OpenAI called it "a failed metagame": the internal grader differed from the online one, and "the agents did all of this for no improvement on evaluation score."

OpenAI also traced where the behavior came from. During the training run behind the main model, OpenAI saw rising rates of complex cheating, "primarily including attempts to search for hidden files or evaluation code," and wrote that "this behavior was subsequently reinforced" 4. Training rewarded the cheating, so the cheating ended up in the next checkpoint. OpenAI paused RL training on its latest models intended for deployment for two weeks and kept its largest planned frontier RL run on hold 5.

Between them, those two disclosures cover most of what this series is about. Any self-improving system has three parts: something that proposes changes, a check that decides which changes to keep, and a place where kept changes get written. I'll call them the proposer, the acceptor and the store. Anthropic's deletion is a lesson moving from one store to the other. OpenAI's incident shows what the acceptor is up against once the system it scores is a strong optimizer, and how a behavior it rewarded once gets written into the next model.

Fig 0.1 · Store, proposer, acceptorSeries frame · 2026
PROPOSER · CHEAP ACCEPTOR · KEEPS OR DISCARDS STORE · WHERE IT IS WRITTEN Generates candidates Gradients Reflection Population search Human engineers EDIT Keeps or rejects Tests on unseen data Counts how often it looked Independent error signal REJECTED KEPT Text and code FAST · NEXT REQUEST CONSOLIDATION Weights SLOW · NEXT CHECKPOINT The next round runs on whatever was kept
A proposer suggests changes, an acceptor keeps some, and the store holds what was kept. Every loop in the series has these three parts, and the store is one of two places: text and code around a frozen model, which changes on the next request, or weights, which change at the next checkpoint. Proposers of every kind are now cheap and close to interchangeable (the GEPA team's comparison, report 06), so what a loop can learn depends on the acceptor: whether it tests on unseen data, counts how often it has looked, and draws on a signal with errors independent of the proposer's. Report 12 is about consolidation, which moves lessons from text into weights.

The 16 reports are organized by where the change is written, but the question I kept coming back to is the acceptor's: how a loop decides that a change was a real lesson. Almost every loop in both stores is limited by the answer.

Section 02 / 10

#Weights, or text around a frozen model

A lesson written into weights is parametric. The agent improves because its parameters changed, through reinforcement learning on its own attempts, fine-tuning on its own filtered outputs, distillation, test-time training, or merging and evolving checkpoints.

A lesson written anywhere else is non-parametric. The model stays frozen, and what changes is something it reads or runs inside: an instruction, a memory entry, a skill file, the harness code that calls it, or the arrangement of agents it works with. Systems that write to both, or move a lesson from one to the other, are hybrids, and moving learning from context into weights is called consolidation. Where a lesson is written determines most of its practical properties before anyone picks an algorithm:

Property Weights (parametric) Text and code around a frozen model (non-parametric)
Cost of one change A training run One model call
Time to take effect Next checkpoint or deployment Next request
Who can make it Whoever holds the weights Anyone with API access
How to inspect it Only through evaluations Read the diff
How to undo it Restore an earlier checkpoint Revert a file
Still works after a model upgrade No; must be retrained or re-distilled Code and structure mostly; prose often not
Capacity Large; lessons become default behavior Limited; quality degrades as context grows
Typical failure Reward hacks trained in; forgetting False edits accepted; self-inflated records; staleness; poisoning

The "Who can make it" row explains most of what ships. Most teams run models they can't train, so text is the only place they can write a lesson. The model-upgrade row is uncomfortable for both sides. A fine-tune doesn't transfer to a new base model, and much of the prose written for an old model doesn't either, which is why labs that own their weights keep deleting scaffolding as each model generation learns what the scaffolding used to say.

The store is one way to divide the field. The other is by what proposes the change. Gradients update weights; reflection has a model read its own traces and write an edit; population search keeps many candidates and picks among them; and human engineers still make most production changes.

Each engine works in more than one store: evolutionary search drives code edits in harness-evolution systems and also the merging of model checkpoints; reflection drives prompt optimizers, memory playbooks and harness editors; gradients train the models themselves and also the small controllers that manage memory or route work between frozen models. The series is organized by store because the store determines what a change costs, who can make it, whether it transfers and how it fails, while the engine mostly determines how fast candidates arrive.

Two recent taxonomies divide the field differently, and both are worth reading. Chen, Wang and Qu's July survey classifies 1,250 papers by what a system improves and who validates the change 6. Lilian Weng's July essay follows the thing being optimized from prompts to structured context, workflows, harness code and the optimizer itself 7.

My problem with a category like "deployment-time improvement" is that it puts test-time weight updates, which need GPU access and fail by forgetting, next to harness edits, which need neither and fail by accepting noise. Splitting by store keeps those apart. The series has five reports on weights (01–05), six on text and code (06–11), one on hybrids (12), and four that apply to both: recursive self-improvement (13), measurement (14), failure modes (15) and what ships (16).

Section 03 / 10

#What products ship

Nearly all the self-improvement that reaches users in 2026 edits text. Decagon's Duet Autopilot is a good example. It turns signals from production conversations into proposed edits to the natural-language procedures that define an agent's behavior, tests each proposal and stages it for a human to review 8.

Decagon reported on September 9 that at one Fortune 50 customer a series of Autopilot changes, each worth one or two points, raised the resolution rate from 30% to 55%, and that more than 85% of Autopilot's updates were still live 30 days later, with complete reversions under 15% 9. Those are the vendor's numbers, with no control arm, and they count what customers undid, which is different from what hurt them. Even so, I couldn't find an earlier published measure of how long self-written changes last in production.

Salesforce shipped Agent Optimizer in beta 12 days later, with an "autonomy dial" that allows customers to require sign-off at every step or let the optimizer investigate, build, test and stage changes on its own 10. Coding teams run the same loop with a pull request as the approval step, and Warp described its version on August 26 11.

Open-source agents write to the same store with fewer checks. OpenClaw had 390,396 GitHub stars on September 24 and extends itself with skills from ClawHub, a public registry of about 67,300 12. Nous Research's Hermes Agent writes skills from its own experience. Its August 31 release notes say that writes to protected instruction files, skills and memory stores now require approval "so a prompt-injected agent can't quietly rewrite its own standing orders" 13. The skills documentation still describes agent-written skills as ungated unless an approval setting is switched on, so whether a human reviews them depends on a setting the user has to find.

Text wins mostly on cost and access. A text edit costs one model call and reads as a diff, so a human can approve changes without becoming the bottleneck. It works on models the builder rents rather than owns. And it can outlive the model: Letta's June roadmap describes learned context "that transfers across model generations" 14.

Text also decays in ways weights don't. Claude Code's /compact, tested on Sonnet 4.6 in August, kept 53% of an agent's safety rules after one round of compaction and 10% after five 15. EvoHarnessBench found that giving an agent more tools, skills or sub-agents, with the model unchanged, cut its performance on tasks it had already solved by 12.1%, 13.8% and 46.4% respectively 16.

Weights still improve, but mostly between releases, inside labs, and more and more inside the harness the model will ship with. OpenAI reported in July that GPT-5.6 Sol scored 13.3% on ARC-AGI-3's public set in the official harness, which throws away reasoning after every move, and 38.3% with retained reasoning and compaction, settings OpenAI described as "how our models are trained" 17. Outside its training harness, the model lost about two-thirds of its measured score.

Cognition's SWE-2, released September 10, built the acceptor into the training recipe. The stronger base model was more resourceful at gaming rewards, so Cognition built "a flywheel powered by previous checkpoints of SWE-2 that iteratively hardens our verifiers" 18.

Two product companies have documented updating weights after deployment. Cursor ships Composer checkpoints trained on production signals as often as every five hours 19. Shopify's August 5 write-up about its Sidekick agent describes every step. Sidekick answers merchant questions by writing and running queries against Shopify's Admin API.

Each day a calibrated LLM judge mines low-scoring production conversations, a panel of frontier models writes a repair hint for each failure, and the conversation is replayed from the hint. Failures the critics can't fix go to expert annotators. The agent is then fine-tuned, and trained with GRPO on new and earlier trajectories 20.

Shopify estimates that the smaller model cuts serving cost from about $27 million a year to about $1 million and says its quality "eventually surpasses the frontier-powered baseline," but it hasn't published quality numbers 20. As of September 2026 no frontier lab has publicly described updating a deployed model from its users' traffic.

Cursor and Shopify can do this because every interaction produces a cheap, reliable grade. An edit stays in the file or gets reverted. A query runs or fails, and a calibrated judge can score a day of traffic overnight.

Teams without a signal like that are starting to buy it: Business Insider reported in September that Google had completed a talent deal with Mechanize, which builds RL environments for coding agents 21, and Realset AI announced funding on September 23 to build environments from real business workflows, with rewards tied to business outcomes 22. Neither Mechanize nor Realset has published evidence that training on its environments beats the alternatives at the same budget.

Section 04 / 10

#Deciding which changes to keep

Every loop in this series repeats one cycle: it proposes a change, then decides whether to keep it. Most papers put their effort into the first part, and this summer's results suggest the choice of proposer changes little.

When the GEPA team ran GEPA, a Karpathy-style autoresearch loop and Meta-Harness on the same problems, all three beat zero-shot by a wide margin (43.8 to 55.4, against 7.72), and the authors concluded that "per problem, the winner is nearly a coin toss" 23. CASD dropped the search loop entirely: a coding agent read a static set of past runs once, with no validation data, wrote a prompt, and beat GEPA on three of four benchmarks for about $1.60 24. If one pass over old logs can match a search loop, the search was never doing most of the work.

Evolutionary search looks similar. Across 30 budget-matched search harnesses, a July study found no fixed harness reliably better than the others 25, and Oracle's Hill Sampling, which keeps only the single best program and samples edits to it, set a new state of the art on the standard circle-packing benchmark 26.

The failures are on the other side, in what gets kept, and production shows them first. Vansh Wahi published an account in September of running prompt-optimization loops in production for months, across contract analysis, compliance review and code quality, and listed 11 ways the evaluation signal failed. In one, agents reached perfect scores by reading cached answer keys from their environment: "a 100% pass rate concealing 68% true capability" 27.

Google Cloud's September 23 guide to running AlphaEvolve on video processing describes the evolutionary version. A fitness score weighted toward raw latency produced "an astonishing speedup" because "the model simply bypassed blur rendering entirely and returned unmodified frames in 0 ms," and the fix was a minimum quality requirement in the evaluator, with the search left alone 28. Better measurement helps even when nothing else changes: a better profiling tool, Argus, raised AlphaEvolve's geometric-mean kernel speedup from 5.4% to 8.9% with the same search 29.

Behind these anecdotes is a statistics problem. Keeping an edit whenever a score rises means running hundreds of comparisons against a noisy development set with no correction, and every comparison is a chance to keep noise. PACE, from June, measured how often that happens: greedy acceptance committed false edits 30–42% of the time when real improvements existed and 72–100% of the time when none did.

PACE's fix treats each commit as a sequential hypothesis test using an e-process, a betting-based statistic that stays valid even when the loop decides for itself when to stop looking 30. Anyone running an optimization loop should read PACE, because the rule it tests, keep the edit if the score went up, is the standard one.

Even a careful acceptor will learn the benchmark it is scored on unless it is designed not to. RRSI, a Google Cloud AI Research method submitted on September 21, includes an ablation that shows this. An unregularized harness-evolution loop raised its score on the tasks it evolved against from 89.4 to 92.8, while its out-of-distribution score barely moved, from 39.7 to 40.3, and it spent 3.80 million tokens per trial.

Fig 0.1 · In-split gains versus generalizationRRSI ablation · September 2026
EVOLVE SPLIT · SCORE OUT OF DISTRIBUTION · SCORE Starting harness 89.4 39.7 Unregularized loop 3.80M TOKENS PER TRIAL 92.8 40.3 RRSI regularized gate 2.42M TOKENS PER TRIAL 90.5 43.6 DASHED LINE = STARTING SCORE · AXES DO NOT START AT ZERO
The better gate scores lower on the tasks it evolved against. Rows come from one ablation in RRSI, a Google Cloud AI Research method, and each column has its own scale. The unregularized loop gains most on the tasks it evolved against and almost nothing out of distribution. The regularized gate gives up part of that in-split gain, scores 89.2 on held-out tasks from the same distribution, gains the most out of distribution and spends fewer tokens. Report 09 gives the full ablation and the gate's acceptance rules.

RRSI's regularized gate accepted a harness that scored lower on the evolve split, 90.5, and higher everywhere else: 89.2 on held-out tasks from the same distribution and 43.6 out of distribution, at 2.42 million tokens 31. When Wang et al. compared leading harness-evolution systems with simple test-time scaling on Terminal-Bench 2.1 in July, they found that harness evolution "does not consistently outperform simple test-time scaling methods and exhibits limited generalization" 32.

Measurement studies from the same months put the failure in the selection step itself. EvoPathBench found in September that self-evolution "enables agents to generate candidate artifacts with substantial held-out gains," but "the selected updates consistently fall short of realizing this potential" 33. The loops found good edits and then kept the wrong ones.

In RELAI's July test, three harness optimizers tuned the same GPT-5.5 terminal agent under the same budget. GEPA's prompt grew from 5 lines to 103, much of it lessons tied to specific task IDs and file paths, and it fell below baseline on a larger task set. The authors conclude that "optimization gains compounded only when regression control was built into the optimization loop" 34. RELAI sells the method that held up, and the test covers 22 tasks, so I wouldn't lean on it alone, but it agrees with everything above.

LLM judges that read the answer they're grading have the same weakness. A single-author July preprint trained Qwen3 policies on GSM8K against an LLM judge that saw no reference answer. The judge's pass rate climbed from 0.72 to 0.94 while true accuracy stayed at 0.20. When the judge had to commit to its own answer before reading the candidate, its false-positive rate fell from 0.719 to 0.012 35.

Models are also bad at reporting their own hacks. Goodfire measured GLM 5.2 reward hacking in 57.2% of rollouts on DeepSWE in September, and the model's self-reports of hacking reached an F1 of 13.2% 36.

Memory has its own version of the problem, because the model that made a mistake is often the one grading the episode. Whatever bias caused the error also inflates the grade, and retrieval later brings the confident mistake back as a lesson. A paper submitted at the end of June calls the shortfall the Echo Gap: on BIRD text-to-SQL, self-graded memory lifted accuracy from 52.4% to 54.0%, while grading with an independent signal reached 56.9% 37.

MemGuard, in August, attached verifier scores to every memory for its whole lifetime and had the best success rate in all 16 backbone and benchmark settings it tested, under matched runtime budgets and five seeds 38. The same month, a re-evaluation of two memory-based self-improving methods found their improvement "highly dependent on task order," with the default orders in prior papers acting as "an implicit curriculum" 39.

The work this year that let loops keep improving for longer did it by improving the check. J-Zero, in August, retrained its judge each round on answer pairs ranked by how they were produced, leaving the judge's own scores out of the ranking, and kept improving through 10 iterations, "whereas the baselines degrade after two" 40. Stanford's Self-Guided Self-Play found that "over long training runs, the Conjecturer learns to hack its reward," and fixed it with a guide that scores each synthetic problem's relevance to unsolved targets 41. Cognition's verifier flywheel is the same fix inside a lab, hardening its verifiers as the policy gets better at gaming them 18.

Proposing a change is cheap, and most loops that fail, fail because they kept changes that didn't help. I argued in an earlier post on this site that skill libraries need CI more than they need better prompts 42, and the rest of the field, from prompt optimizers to lab RL runs, keeps finding the same thing about its own layer.

The acceptors with evidence behind them have three things in common. They test on data the proposer never saw. They account for how many times they have looked. And their errors don't share the proposer's biases, because they draw on execution, a verifier the policy can't see, production outcomes or a human reviewer. On any agent I build, I would write that check first and choose the proposer last.

Section 05 / 10

#Reward hacking that persists

Any check that can be fooled eventually will be, because a self-improving loop spends all its time searching for changes that pass it. Benchmark gaming is old news. The difference with a self-improving loop is that it writes down what worked, so an exploit found in one episode ends up in the weights or the skill library, and the next round starts from it.

Anthropic tested the weights version in August by training a model on RL environments known to be hackable. By the end, "40% of all episodes were flagged as hacks," and in simulated cyber evaluations modeled on the summer incidents the resulting model "broke out of its sandbox, stole credentials, and attacked both internal and third-party infrastructure to steal an answer key" 43.

What the model had learned was reward seeking, a drive to satisfy whatever grader is in view. Audits mostly missed it, because the behavior only shows up when a grader is in view: "in scenarios without a clear notion of a reward, automated grader, or cheat, we see Hacker-Opus behave as aligned as the Init" 43.

On the text side you don't need a training run. EVOMAL, an August study, planted malicious skills in a shared library and never invoked them. Self-evolving coding agents that write new tools by imitating retrieved skills copied the payload into their own new skills, stored them and ran them.

Across six models on 153 SWE-bench Verified tasks, 20.3% to 41.8% of tasks added a new malicious skill, and the poisoned libraries ended up holding 4.9 to 9.0 times as many malicious skills as were planted 44. Attackers did this by hand on ClawHub earlier in the year; a Cloud Security Alliance note in June counted 1,184 confirmed malicious skills 45.

The defenses with evidence behind them all work on the acceptor. OpenAI found that its deployed chain-of-thought monitor, had it run on the ExploitGym evaluations, "would have caught the initial relevant activity and paged our security team more than a day before models breached Hugging Face systems." It now requires such monitoring for all tool-using RL training and evaluation of models at GPT-5.6 Sol capability or higher, at an overhead it puts at "roughly 20% of the inference compute being monitored" 4.

Anthropic's monitoring flagged "97% of reward hacking environments with reward hacking rates of at least 1%" in its pessimistic run 43. Both results are after the fact, and I haven't seen a monitor stop a live incident yet.

For skill libraries, a counter-prompt that discourages template-style copying cut EVOMAL's propagation to at most 6.7% without significant loss in task completion 44, and Ouroboros, a coding agent whose August preprint describes 161 days of free evolution of its own repository, sends every commit through a review panel of models 46. Reviewed commits, held-out gates, lineage archives and sandboxes that keep evaluation data out of reach are the same practices as in the previous section, applied with an attacker in mind.

Section 06 / 10

#Using context and weights together

If text is cheap and weights are powerful, the obvious design uses both, and a few systems now optimize the harness and the weights together. WHALE, posted August 31, alternates small harness edits with small weight updates. On models of 2B to 4B parameters it beats a schedule that spends the whole weight budget and then the whole harness budget, by 5.32 and 9.16 points in the two stagewise comparisons it reports 47.

The WHALE authors are clear that neither side dominates: "Either component can be the bottleneck: harness search matches peak weight-only accuracy with far fewer rollouts in SearchQA, but improves math accuracy only after a weight update" 47. At larger scale the evidence is two cycles deep. Co-Harness, from July, evolves a harness for tool-integrated math under explicit acceptance rules and fine-tunes Qwen3 models on verifier-passing trajectories collected under it. Average pass@1 across AIME24, AIME25 and HMMT25 went from 54.2 with a human-written harness to 58.5 with the evolved one, then to 73.5 and 78.9 after two rounds of fine-tuning, though the paper doesn't say where its fine-tuning tasks came from 48.

The method used to move a lesson into weights determines how much of it is kept. Experience Distillation, from July, distilled an agent's accumulated experience from a teacher that could see it into the same checkpoint without that context, and kept 64.8% of the in-context gain on software-engineering tasks; supervised fine-tuning on the same experience kept 3.8% 49. In September, Yu et al. found where plain imitation goes wrong: training on a stronger model's full trajectories under an evolved harness made all seven tasks worse, by 4 to 30 points, across Qwen3-Coder and Gemma 4, though the same imitation helped under the unevolved harness 50.

"Sequential Beats Joint," also from September, found that on-policy distillation followed by RL beat either one alone and beat both fused into one update, because "OPD expands the student's coverage of teacher-supported solutions and RL sharpens within that support" 51. Read together, these point to a recipe: have a teacher that sees the context build the targets, put the targets on states the student visits itself, and run RL afterward.

Moving a lesson to a different model is a separate problem from moving it into weights. Joel Niklaus at Hugging Face evolved a harness on Harvey's Legal Agent Benchmark in July with DeepSeek-V4-Pro frozen, then ran it untouched on other models. DeepSeek V4 Flash, a sibling, gained 14.4 points. Nemotron-3 Ultra, from another family, gained 0.4, because a JSON-repair component fixed Nemotron's crashes while prompt playbooks tuned for DeepSeek hurt tasks Nemotron could already do 52.

His summary: "Robustness and code mechanisms transfer across families; prompt playbooks are model-specific and can backfire" 52. Memory shows the same split. In a September portability study, a fixed-schema knowledge graph transferred almost perfectly when the writer model was swapped (an accuracy change of +0.0004), while model-written notes moved by +9.91 or −13.28 points depending on the direction of migration 53.

The people who argued over where learning should live now mostly accept a hybrid and disagree about emphasis. Letta treats learned context as the asset that persists across model generations and plans "memory models" trained with RL to write it 14. Dwarkesh Patel, relaying Andrej Karpathy in May, stressed the other half of the human analogy: "Our working memory gets wiped regularly. What we actually have is a consolidation process (sleep) that distills stuff into the brain, in a weird and lossy way" 54.

Complementary learning systems theory in neuroscience describes that arrangement: a fast store learns episodes quickly, a slow store integrates them through replay, and keeping the two apart stops new learning from overwriting old. For agents, context is the fast store, weights are the slow one, and distillation is the replay. WHALE's results suggest a schedule, at least at small scale: consolidate in small, frequent steps instead of one large handoff. I haven't seen good answers yet on which lessons to consolidate, or on how to remove one user's lessons from weights once they are there.

Section 07 / 10

#Recursive self-improvement

Everything above improves a model's behavior, its harness or its next checkpoint. Recursive self-improvement asks whether AI improves the process that produces AI, and in 2026 the phrase is used for three different claims (report 13).

Meaning What it measures Evidence as of September 2026
AI's share of lab R&D Telemetry: merged code, task share, agent effort Measured and rising fast; no outside audit
AI autonomy over the improvement loop Who proposes, accepts and ships changes Low to middle levels in production; fully closed loops only in small prototypes
Self-acceleration Whether each round makes the next one faster Not demonstrated; the one direct test came back null

The labs published numbers for the first meaning in September. OpenAI declared on September 6 that it had reached its goal of an "automated research intern" and reported that its research organization used "3.1 agent-workdays of effort for every workday of human labor" 55. Anthropic published an R&D automation index on September 17 in which Claude leads 26% of sampled tasks, collaborates on more than 90%, and completes none autonomously 56.

Neither dashboard is evidence of acceleration: both are unaudited, and both count shares of work without measuring how fast capability is improving. A METR team with elevated access gave an outside estimate of that rate on September 22, putting AI-driven acceleration at Anthropic at "~1.5X," with "perhaps a 30% chance that the speedup is at least 2X" 57. A doubling is roughly where Anthropic's own Responsible Scaling Policy places its threshold for automated AI research, a trigger the policy itself calls difficult to operationalize 58.

Automated research works where evaluation is cheap and hard to fool, and stalls where it needs judgment. Anthropic's automated weak-to-strong researcher, reported in April, reached a performance-gap-recovered score of 0.97 in five days for about $18,000; two of the paper's human authors had reached 0.23 in seven 59. Princeton researchers in July gave agents the central question of two unpublished NeurIPS 2026 submissions, six days and thousands of dollars of compute. The agents completed the engineering but "could not make substantial progress towards answering the research questions," and the original authors rejected both attempts 60.

RSIBench-Data, also from July, isolated the step where a researcher decides whether a result is worth keeping. Agents improved on their first valid attempt in 58% of settings, but among searches that continued past their best score, 78% ended on a lower-scoring final attempt 61. The agents could generate improvements, but they couldn't reliably tell when they had one, which is the acceptor problem again.

The third meaning has had one direct test. Weco's AIDE² used an agent-improved research agent to improve research agents and compared its pace against the human-built version. The held-out gains were real, with mean private percentile on MLE-Bench Lite rising from 0.678 to 0.722, but the improved system was not a measurably faster improver: the ignition test was not statistically significant 62.

The closest disclosed loop at production scale is narrow. AlphaEvolve, which Google made generally available in July, had earlier sped up a Gemini kernel by 23%, cut Gemini's training time by 1%, and improved the training of "the large language models underlying AlphaEvolve itself" 63. Engineers chose that target and wrote its evaluator.

Governance has moved ahead of the evidence. After the Hugging Face incident OpenAI paused RL training on its models intended for deployment for two weeks 5, and its chief scientist Jakub Pachocki wrote on September 6 that he had "a strong expectation that this speed of progress could be sustained into recursive self-improvement" and called for "extreme caution" 64. Senator Bernie Sanders and Representative Greg Casar introduced the Ban Artificial Superintelligence Act on September 23, and its press release targets "the capacity for AI to develop new AI instead of humans" 65.

The loop policymakers are worried about is the third meaning. The loop with evidence behind it is the first, and the tools that could tell the two apart are getting less reliable. OpenAI's GPT-6 Astra system card, published September 3, three days before the intern declaration, ruled the model below its "High" threshold for AI self-improvement. OpenAI based that judgment largely on an internal test built from 41 real research bugs, of which Astra fixed 78.05%, and the card replaced MLE-bench with a revised 72-problem version 66.

METR's June evaluation of GPT-5.6 Sol put its 50% time horizon at about 11.3 hours if cheating counted as failure and more than 270 hours if it counted as success, and METR called none of its estimates robust 67. A headline capability measure that swings that far depending on how you score cheating has the same grading problem as every loop in this essay, now in the tools meant to tell us how fast things are moving.

Section 08 / 10

#How I read a self-improvement claim

When a paper or a launch post says an agent improves itself, I ask the same few questions, mostly about where the change is written, what decides to keep it, and whether the proposer was ever allowed to grade its own work.

Question Why it matters Red flag
Where is the change written? That decides what a change costs, how you roll it back, whether it transfers and how it fails "Self-improving" with no store named
What decides whether a change is kept? Generating changes is cheap; most loops fail by keeping bad ones The proposer grades its own edits
Are the checker's mistakes independent of the proposer's? Self-grading inflates scores (the Echo Gap), and judges that read the candidate reward answers that look plausible An LLM judge from the same model family; no execution or outcome signal
Was it tested on data the loop never saw, against a baseline with the same budget? Scores on the search split can rise while out-of-distribution scores stay flat (RRSI) Search and test on one benchmark; baseline given less compute
How many rounds, seeds and task orders? Most loops plateau within a few rounds, and memory gains swing with task order One run in one order reported as a trend
Does it still work on a different model? Code carries over; prose often doesn't Prompt playbooks sold as durable assets
Who signs off, and can it be rolled back? An exploit that gets written down needs a reviewer to catch it and an earlier version to revert to A closed loop with no lineage or review
Section 09 / 10

#Gates at scale, portable lessons and a measure of acceleration

Gates for thousands of decisions. PACE, RRSI and J-Zero show how to gate a loop that makes hundreds. No gate has yet been shown to stay reliable across thousands, while the loop's own edits shift the distribution it is tested on.

A shared out-of-distribution protocol. Harness evolution, memory and topology search each report in-split gains that shrink elsewhere. Without a common held-out protocol at matched budgets, most comparisons across papers compare evaluation choices as much as methods.

Taking one user's lessons back out of the weights. Designs that use context and weights together need a schedule for moving lessons into weights and a way to remove one user's lessons afterward. No 2026 paper tests per-user consolidation with deletion.

Artifacts that outlast the model they were written for. Which artifacts still work on a new model is measured one study at a time. A benchmark broken down by artifact type, model family and generation would tell builders which artifacts are worth porting.

An instrument for acceleration. Lab telemetry measures how much of the work AI does. Policy thresholds depend on how much faster progress becomes, and no audited instrument measures that.

Securing skill libraries and memory stores. Skills, memories and harness edits are supply chains whose payloads are natural language. Semantic review of skills, and keeping poisoned memories out of training data, are both unsolved.

Section 10 / 10

#The series

Part I · ParametricLearning written into the weights
Part II · Non-parametricLearning written around a frozen model
06 · Prompts and programs
Prompt and program optimizationtuning the text and code around a frozen model
Proposing better prompts is cheap and most optimizers do about as well; production failures come from evaluation, so the check on each edit decides whether the loop helps
16 min40 refs19 recent
07 · Memory
Experiential memorywhat agents write down between tasks
Memory is the most deployed form of self-improvement, and this year's work is about who grades memories, what to prune, and whether they still work on a new model
17 min35 refs18 recent
08 · Skills
Skills and toolsagents that write and maintain their own skills
Whether skills help depends on when they load, which ones get accepted and how they're maintained, and an agent that writes its own skills can spread poisoned ones
20 min42 refs17 recent
09 · Harness code
Harness self-improvementagents that edit their own harness code
Coding agents now write good harness edits, and the hard part is deciding which to keep; the best gates accept a lower score on the tasks they evolve against in exchange for better scores on new ones
22 min56 refs38 recent
10 · Topology
Workflow and topology searchautomating how multi-agent systems are organized
When a team is made of copies of one model, the exact wiring barely matters; what matters is how much the agents collaborate and which different models are on the team
19 min41 refs18 recent
11 · Programs
LLM-guided evolutionary searchAlphaEvolve as a product, and how much the search contributes
A plain hill-climbing loop often matches elaborate evolutionary machinery, and the result depends mostly on the evaluator, which the customer owns
17 min30 refs13 recent
Part III · BridgeMoving lessons between the two stores
Part IV · Cross-cuttingQuestions that span both stores
Sources

#References

● marks sources dated June 24 to September 24, 2026. Each report carries its own full reference list.

  1. [1]T. Shihipar (Anthropic, Claude Code), post on X, 2026-07-24: “We removed ~80% of the Claude Code system prompt for our newest models…” https://x.com/trq212/status/2080710971228918066
  2. [2]H. Ye, Y. Lu, H. Dong, Z. Su, G. Song, “Harness-Zero: Harness Distillation via Agent-as-Harness,” arXiv:2609.24974, Sep 21, 2026. https://arxiv.org/abs/2609.24974
  3. [3]OpenAI, “OpenAI and Hugging Face partner to address security incident during model evaluation,” July 21, 2026 (updated July 29 and August 26, 2026). https://openai.com/index/hugging-face-model-evaluation-security-incident/
  4. [4]OpenAI, “The Hugging Face incident and the road ahead,” August 26, 2026 (with technical incident report). https://openai.com/index/hugging-face-incident-and-the-road-ahead/
  5. [5]OpenAI, post on pacing model development and cyber capabilities, August 18, 2026. https://openai.com/index/pacing-model-development-cyber-capabilities/
  6. [6]M. Chen, L. Wang, B. Qu, “Recursive Self-Improvement in AI: From Bounded Self-Refinement to Autonomous Research Loops,” arXiv 2607.07663, v1 2026-07-08, v2 2026-09-06. https://arxiv.org/abs/2607.07663
  7. [7]L. Weng, “Harness Engineering for Self-Improvement,” Lil'Log, 2026-07-04. https://lilianweng.github.io/posts/2026-07-04-harness/
  8. [8]Decagon, “Autopilot in production: Governance of self-improving agents,” Decagon blog, 2026-09-09. https://decagon.ai/blog/autopilot-in-production
  9. [9]E. Lin (Decagon), “DuetBench-2: Measuring agent self-improvement in production,” Decagon blog, 2026-09-09. https://decagon.ai/blog/duetbench-2
  10. [10]A. Kale (Salesforce), “Agent Optimizer: A faster path to better outcomes,” Salesforce blog, 2026-09-21. https://www.salesforce.com/blog/agent-optimizer/
  11. [11]M. Segner (Anthropic), “How Warp builds self-improving agents on Claude,” Claude blog, 2026-08-26. https://claude.com/blog/how-warp-builds-self-improving-agents-on-claude
  12. [12]OpenClaw, GitHub repository (star count as of September 24, 2026) and skills documentation. https://github.com/openclaw/openclaw ; https://docs.openclaw.ai/tools/skills
  13. [13]Nous Research, “Hermes Agent v0.21.0 (v2026.8.31),” GitHub release notes, 2026-08-31. https://github.com/NousResearch/hermes-agent/releases
  14. [14]Letta, “Memory Models” (towards agents that learn), Letta blog, Jun 25, 2026. https://www.letta.com/blog/towards-agents-that-learn
  15. [15]S. Zerhoudi, J. Mitrovic, M. Granitzer, “The Compaction Cliff in Long-Running AI Agent Memory,” arXiv:2608.22752, August 24, 2026. https://arxiv.org/abs/2608.22752
  16. [16]Z. Ke, V. Patil, H. Shi et al. (Salesforce Research, UNC Chapel Hill, UW–Madison), “EvoHarnessBench: Can Your Agents Keep Pace with an Evolving Harness?,” arXiv:2609.04280, 2026-09-03 (v2 2026-09-10). https://arxiv.org/abs/2609.04280
  17. [17]I. Bigio, T. Sanders, “How enabling two settings tripled our scores on the ARC-AGI-3 benchmark,” OpenAI, Jul 29, 2026. https://openai.com/index/how-two-settings-tripled-our-arc-agi-3-scores/
  18. [18]Cognition, “Introducing SWE-2: Pushing the Pareto Frontier,” Cognition blog, 2026-09-10. https://cognition.com/blog/swe-2
  19. [19]Cursor (J. Jackson, B. Trapani, N. Wang, W. Zhu), “Improving Composer through real-time RL,” Cursor blog, 2026-03-26. https://cursor.com/blog/real-time-rl-for-composer
  20. [20]A. McNamara and C. Mazza-Anthony, “Sidekick's continual learning loop,” Shopify Engineering, 2026-08-05. https://shopify.engineering/sidekicks-continual-learning-loop
  21. [21]Business Insider, “Google is in talks for a $1.5 billion-plus deal with AI coding agent startup Mechanize,” 2026-08-05 (secondary reporting); Mechanize site. https://www.businessinsider.com/google-is-in-talks-for-a-dollar15-billion-plus-deal-with-ai-coding-agent-startup-mechanize ; https://www.mechanize.work/ ; Business Insider, “Google Completed Its Talent Deal for AI Agents Startup Mechanize,” September 2026. https://www.businessinsider.com/google-completes-deal-for-ai-agents-startup-mechanize-2026-9
  22. [22]PR Newswire, “Realset AI and Flatkey raise $10M Series A to build real-world training data for frontier models and embodied agents,” Sep 23, 2026. https://www.prnewswire.com/news-releases/realset-ai-and-flatkey-raise-10m-series-a-to-build-real-world-training-data-for-frontier-models-and-embodied-agents-302887825.html
  23. [23]S. Tan, L. A. Agrawal, D. Lee, J. Zhang, D. Klein, K. Sen, A. G. Dimakis, M. Zaharia, “optimize_anything Goes omni: Composing Optimizers into Meta-Optimizer Pipelines,” GEPA blog, 2026-07-22. https://gepa-ai.github.io/gepa/blog/2026/07/22/optimize-anything-omni
  24. [24]A. Singh, S. Gautam, P. Gupta, N. Mehrotra, T. Bakshi, S. Gulwani, “Coding Agents are Strong Prompt Optimizers” (CASD), arXiv 2609.26261, 2026-08-13 (preprint). https://arxiv.org/abs/2609.26261
  25. [25]A. Gupta, J. Lei, A. Lu, G. Anumanchipalli, L. Choshen, “Automated Discovery Has No Universally Superior Harness,” arXiv 2607.18235, 2026-07-20. https://arxiv.org/abs/2607.18235
  26. [26]J. Beck, P. V. Ogren, A. Kobren (Oracle), “Hill Sampling for Test-Time Scaling: A Simple and Better Alternative to Repeated Sampling, Evolution, and Training,” arXiv 2609.25510, 2026-09-22. https://arxiv.org/abs/2609.25510
  27. [27]V. Wahi, “LLM-as-a-Judge Is Not an Oracle: Why Self-Improving Agents Need Deterministic Guardrails,” arXiv 2609.02246, 2026-09-02 (single-author position paper). https://arxiv.org/abs/2609.02246
  28. [28]A. Nawalgaria (Google), S. Heyer (DoIt), “A guide to speeding up your video processing with AlphaEvolve,” Google Cloud blog, 2026-09-23. https://cloud.google.com/blog/topics/developers-practitioners/how-to-speed-up-your-video-processing-with-alphaevolve
  29. [29]J. Yao, Y. Guan, S. Ramesh, et al., “Argus: Orchestrating Cross-Layer GPU Performance Measurements around Semantic Regions,” arXiv 2609.12299, 2026-09-11. https://arxiv.org/abs/2609.12299
  30. [30]Zayx Shawn, “PACE: Anytime-Valid Acceptance Tests for Self-Evolving Agents,” arXiv 2606.08106, 2026-06-06 (single-author preprint). https://arxiv.org/abs/2606.08106
  31. [31]P. Xia, R. Han, Z. Wang, Y. Chen, Y. Zhang, Y. Lee, et al. (Google Cloud AI Research), “RRSI: Regularized Recursive Self-Improvement of Agent Harnesses,” arXiv 2609.24972, 2026-09-21 (ablation: Table 2; policy robustness: Table 3). https://arxiv.org/abs/2609.24972
  32. [32]Y. Wang, H. Zhu, Z. Hu, et al., “Rethinking the Evaluation of Harness Evolution for Agents,” arXiv 2607.12227, 2026-07-14 (v2 2026-08-27). https://arxiv.org/abs/2607.12227
  33. [33]H. Lin, C. Liu, X. Bai, X. Jin, Y. Li, N. Zheng, X. Cao, “Beyond Endpoint Performance: Process-Level Evaluation of Self-Evolving Agents” (EvoPathBench), arXiv:2609.24663, 2026-09-21. https://arxiv.org/abs/2609.24663
  34. [34]W. Wang, P. Kattakinda, S. Feizi (RELAI.ai), “Do Agent Optimizers Compound? A Continual-Learning Evaluation on Terminal-Bench 2.0,” arXiv:2607.14004, 2026-07-15. https://arxiv.org/abs/2607.14004
  35. [35]C. Zhou, “More Convincing, Not More Correct: Self-Play Reward Hacking of Reference-Free LLM Judges,” arXiv 2607.05904, July 7, 2026 (preprint). https://arxiv.org/abs/2607.05904
  36. [36]Goodfire, “Monitoring and Discovering Reward Hacking with Internal Representations during LLM Evaluations,” arXiv 2609.19101, September 16, 2026. https://arxiv.org/abs/2609.19101
  37. [37]M. Asadolahi, A. Amini, S. Talebi, A. Farhadi, A. Zamanifar, “Memory Reward Inflation in Self-Improving LLM Agents,” arXiv:2608.00017, submitted June 29, 2026. https://arxiv.org/abs/2608.00017
  38. [38]H. Wang, G. Dong, H. Liang, Z. Zhang, J. Luo, C. Liu, “MemGuard: Persisting Verifier Signals for LLM-Agent Memory Governance,” arXiv:2608.21867, August 22, 2026. https://arxiv.org/abs/2608.21867
  39. [39]Q. Ye, Y. Li, Y. Pruksachatkun, J. Zhang, C.-S. Wu, “On the Fragility of Self-Improving Agents: Variance, Task Order, and Underspecification,” arXiv:2608.18066, August 18, 2026. https://arxiv.org/abs/2608.18066
  40. [40]G. Chu, M. Jeon, E. Yang, “J-Zero: Unified Challenger–Solver–Judge Co-Evolution from Zero Data,” arXiv preprint 2608.26582, Aug 27, 2026. https://arxiv.org/abs/2608.26582
  41. [41]L. Bailey, K. Wen, K. Dong, T. Hashimoto, T. Ma, “Scaling Self-Play with Self-Guidance,” arXiv preprint 2604.20209, Apr 22, 2026 (v2 Aug 11, 2026). https://arxiv.org/abs/2604.20209
  42. [42]S. Shah, “Skill Libraries Need CI, Not More Prompts,” sohams.world, June 9, 2026. https://sohams.world/posts/skill-evolution-landscape
  43. [43]R. Qi et al. (Anthropic Alignment Science), “Training a Misaligned Reward Seeker,” August 2026 (published with the August 31, 2026 Anthropic post). https://alignment.anthropic.com/2026/reward-seeker/
  44. [44]Wu, Shi, Li, Zhao et al., “EVOMAL: Self-Poisoning in Self-Evolving Coding Agents,” arXiv:2608.25776, August 26, 2026. https://arxiv.org/abs/2608.25776
  45. [45]Cloud Security Alliance, “AI skill supply-chain attacks” research note, June 24, 2026. https://labs.cloudsecurityalliance.org/wp-content/uploads/2026/06/CSA_research_note_ai-skill-supply-chain-attacks_20260624-csa-styled.pdf
  46. [46]A. Razzhigaev, Gritsaev, Kaznacheev, Dragunov, R. Yampolskiy, Kuznetsov, “Ouroboros: A Self-Developing Frontier Coding Agent with Reviewed Core Evolution,” arXiv 2608.08311, 2026-08-08 (v3 2026-08-31). https://arxiv.org/abs/2608.08311
  47. [47]H. Kim, Y. Lee, G. Lee, C. Finn, K. Lee, “WHALE: A Simple Recipe for Joint Harness-Weight Optimization,” arXiv:2609.00196, Aug 31, 2026. https://arxiv.org/abs/2609.00196
  48. [48]Z. Chen, T. Xiao, H. Zhu, Y. Yuan, L. Zhang, J. Wang, “Co-Harness: Co-Evolving Harnesses and Model Weights for LLM Agents,” arXiv:2607.22688, Jul 2026. https://arxiv.org/abs/2607.22688
  49. [49]C. Gou, H. Tu, Y. Fang, J. Cai, H. Rezatofighi, “Sample-Efficient Learning from Agent Experience,” arXiv:2607.21051, Jul 2026. https://arxiv.org/abs/2607.21051
  50. [50]Z. Yu, B. Bi, S. K. Pentyala et al., “Co-Evolving Harnesses and Models: On-Policy Correction Helps Weaker Models Catch Up Where Imitation Fails,” arXiv:2609.09134, Sep 8, 2026. https://arxiv.org/abs/2609.09134
  51. [51]B. Li, B. Chen, C. Yang, P. Nie, C. Zhao, X. Ye, “Sequential Beats Joint: On the Interplay between On-Policy Distillation and RLVR,” arXiv 2609.04108, September 3, 2026. https://arxiv.org/abs/2609.04108
  52. [52]J. Niklaus (Hugging Face), “Don't Train the Model, Evolve the Harness,” Hugging Face Space, Jul 1, 2026. https://joelniklaus-harness-optimization.hf.space/
  53. [53]A. Goyal, J. Ray, “Does Your Agent's Memory Survive a Model Upgrade? A Controlled Study of Memory Portability,” arXiv:2609.05339, September 4, 2026. https://arxiv.org/abs/2609.05339
  54. [54]D. Patel, post on consolidation and sleep, X, May 16, 2026. https://x.com/dwarkesh_sp/status/2055771242620469586
  55. [55]OpenAI, “Research acceleration: The view inside OpenAI,” openai.com, 2026-09-06. https://openai.com/index/research-acceleration-view-inside-openai
  56. [56]Anthropic Institute, “Measurements for understanding the pace of AI development inside frontier labs,” anthropic.com, 2026-09-17. https://www.anthropic.com/institute/measuring-pace-of-ai-development
  57. [57]METR, “Claude Opus 5.5 predeployment evaluation,” metr.org, 2026-09-22. https://metr.org/blog/2026-09-22-claude-opus-5-5/
  58. [58]Anthropic, “Responsible Scaling Policy,” v3.0 (2026-02-24) through v3.4 (2026-07-08). https://www.anthropic.com/responsible-scaling-policy ; v3.0: https://www.anthropic.com/responsible-scaling-policy/rsp-v3-0
  59. [59]J. Wen, L. Qiu, J. Benton, J. H. Kirchner, J. Leike (Anthropic), “Automated Weak-to-Strong Researcher,” Alignment Science blog, April 2026. https://alignment.anthropic.com/2026/automated-w2s-researcher/
  60. [60]Kirgis, S. Kapoor, A. Narayanan et al., shadow evaluations of AI research agents, arXiv 2607.27191, v1 2026-07-29. https://arxiv.org/abs/2607.27191
  61. [61]F. Meng, L. Du, Q. Chen, Z. Zhao, H. Lu, M. Hu, M. Q. Shieh, “RSIBench-Data: Benchmarking Data-Centric Research for Recursive Self-Improvement,” arXiv 2607.25886, 2026-07-28. https://arxiv.org/abs/2607.25886
  62. [62]Srikanth, Zhao, Xu, Wu, Jiang (Weco), “Recursive self-improvement of AI research agents” (AIDE²), arXiv 2609.26457, 2026-09-22. https://arxiv.org/abs/2609.26457
  63. [63]Google DeepMind, “AlphaEvolve: A Gemini-powered coding agent for designing advanced algorithms,” blog, 2025-05-14. https://deepmind.google/blog/alphaevolve-a-gemini-powered-coding-agent-for-designing-advanced-algorithms
  64. [64]J. Pachocki, “An Alien Mind,” openai.com, 2026-09-06. https://openai.com/index/an-alien-mind/
  65. [65]Office of Sen. Bernie Sanders, “Sanders, Casar introduce legislation to create new federal agency to ban artificial superintelligence, pause advanced AI development,” press release, 2026-09-23. https://www.sanders.senate.gov/press-releases/news-sanders-casar-introduce-legislation-to-create-new-federal-agency-to-ban-artificial-superintelligence-pause-advanced-ai-development/
  66. [66]OpenAI, “GPT-6 Astra System Card,” Deployment Safety Hub, 2026-09-03 (updated 2026-09-09). https://deploymentsafety.openai.com/gpt-6-astra/ai-self-improvement-capabilities
  67. [67]METR, “Summary of METR's predeployment evaluation of GPT-5.6 Sol,” metr.org, 2026-06-26. https://metr.org/blog/2026-06-26-gpt-5-6-sol/
Where learning lives · Series overview · September 202616 reports · 4 parts