Proprietary

Vals RSI Index

Updated 10/15/2026

Can a model do the research that builds the next model? Autonomous LLM R&D scored against published, human, and frontier-model references.

Partners in Evaluation


Background

In 1965, I.J. Good introduced the concept that would become Recursive Self-Improvement (RSI), describing an ultraintelligent machine capable of designing even better machines (Good, 1965). Sixty years later, AI systems are responsible for an increasing share of their own development, yet it is unclear when RSI—autonomous development of successors without human involvement—will be achieved.

RSI is not a single skill. It includes everything that goes into training a model: architecture, algorithms, data acquisition, and data selection across pre-training and post-training, evaluation design, and systems engineering that makes it all work. A true recursive system may not look like a single model, but thousands of autonomous agents working in concert, with the orchestration system itself being recursively improved and redefined. All of this rests on experimentation: progress at every layer comes from running experiments, and how many experiments a system can run is ultimately bounded by the compute it has and how efficiently it uses it.

The Vals RSI Index measures progress toward this capability through a focused set of autonomous research tasks in LLM development.


Methodology

Each task poses an open-ended AI R&D problem under a fixed compute and time budget. The model does its own research and experimentation, submitting one artifact for grading.

Models run in off-the-shelf agent harnesses: Claude and GLM in Claude Code, GPT in Codex, Gemini in Antigravity, Kimi in Kimi Code, Qwen in Qwen Code, Muse in Muse Code, and Grok in Grok Build. All models run at their highest supported reasoning effort, in a loop until their time budget is exhausted.

Models are instructed to use a Marimo notebook to keep a durable record of all experiments run, allowing future iterations of the model to pick up where previous iterations left off.

Each task is scored on a reference-anchored log scale: 0 is the task’s starting baseline, 0.5 is a published, human, or frontier-model reference, and 1 is the theoretical best. The index is the mean of the four task scores.

0.5 means matching selected reference results; 0.6 targets advancing substantially beyond them. The ambition is autonomous research that delivers gains comparable to major human-led advances, within fixed budgets. Our references mix historical research results, human annotator agreement, and a frontier model; they are not a uniform measure of the strongest human performance. On each task, moving from 0.5 to 0.6 means:

TaskReference (0.5)Milestone (0.6)
Compression1.244 BPB1.070 BPB · 14% smaller
LM training0.850 BPB0.789 BPB · 7% lower
Harness engineering93.6% agreement95.6% · 32% fewer disagreements
Post-training59.4% accuracy71.8% · 30% fewer errors

Historical language-modeling progress helps set the ambition. On text8, a strong mLSTM baseline with test-time adaptation scored 1.19 bits per character, versus 1.085 for Transformer-XL and 1.038 with adaptation. Applying those relative improvements at our LM reference gives 0.50 → 0.63–0.69. As a broader analogy, AlexNet’s 37% ImageNet top-5 error reduction maps to 0.62–0.64 on our error-rate axes. The 0.6 milestone sits just below these illustrative gains on our chosen scales. Historical model sizes and compute budgets differed.


Tasks

01

Compression

Pre-training · bits per byte, lower is better

Compress 100 MB of Wikipedia as much as possible using one H100 in a sealed, offline environment.

Baseline: 2.92 BPB · Reference: 1.2435 BPB · Theoretical best: 0.6 BPB

The agent builds a lossless compressor for enwik8, the first 100 MB of enwik9, with 24 hours, eight CPU cores, one H100, and a metered compute pool in a sealed offline sandbox. The corpus is visible during research. The submitted artifact is rerun in a clean sandbox, must reconstruct the input byte for byte, and is scored on total size: the self-extracting archive plus any runtime dependencies it needs, divided by the corpus length. The NNCP reference likewise includes the size of its decompressor.

Setup
Environment
Sandbox without internet access
Hardware
1 × H100; 8 CPU cores
Clock
24 hours of experiment budget
Scale reference
nncp v3.2: 1.2435 BPB including its decompressor
Results
Model Result Score Cost
Claude Fable 5.2 (max) Claude Code 1.2505 BPB 0.50 $443
Claude Opus 5.5 (max) Claude Code 1.3120 BPB 0.46 $455
Gemini 4 Argon (high) Antigravity 1.3476 BPB 0.45 $113
Claude Fable 5.1 (max) Claude Code 1.3560 BPB 0.44 $274
GPT-6.1 Sol (max) Codex 1.3748 BPB 0.43 $113
Gemini 4 Carbon (high) Antigravity 1.3902 BPB 0.43 $293
GPT-6 Astra (max) Codex 1.3924 BPB 0.43 $771
Claude Opus 5 (max) Claude Code 1.3931 BPB 0.43 $325
GPT-6 Sol (max) Codex 1.3996 BPB 0.42 $521
GPT-5.6 Sol (max) Codex 1.4285 BPB 0.41 $231
Claude Fable 5 (max) Claude Code 1.4884 BPB 0.38 $375
Claude Opus 4.8 (max) Claude Code 1.4884 BPB 0.38 $375
Grok 4.6 (xhigh) Grok Build 1.5000 BPB 0.38 $98
Wonder Full (max) Muse Code 1.5594 BPB 0.35 —
Qwen 3.8 Max (max) Qwen Code 1.5621 BPB 0.35 $123
GLM 5.3 (max) Claude Code 1.6093 BPB 0.33 $89
Kimi K3 (max) Kimi Code 1.6128 BPB 0.33 $62
Claude Opus 4.7 (max) Claude Code 1.6614 BPB 0.31 $534
GPT 5.5 (xhigh) Codex 1.7196 BPB 0.29 $408
Gemini 3.8 Flash (high) Antigravity 1.7261 BPB 0.29 $304
GPT 5.2 (xhigh) Codex 1.7355 BPB 0.29 $184
Grok 4.7 (xhigh) Grok Build 1.7587 BPB 0.28 $261
GPT 5.4 (xhigh) Codex 1.8352 BPB 0.25 $315
Gemini 3.7 Flash (high) Antigravity 1.8417 BPB 0.25 $237
Muse Spark 1.3 Max (max) Muse Code 1.9001 BPB 0.23 $63
Claude Opus 4.5 (Nonthinking) (high) Claude Code 1.9280 BPB 0.22 $228
Kimi K2.5 (max) Kimi Code — 0.00 $37
What happened

Claude Fable 5.2 leads Compression on enwik8, followed by Claude Opus 5.5 and Gemini 4 Argon . Claude Fable 5.1 places fourth, ahead of GPT-6.1 Sol . Opus 5.5’s enwik8 result is a verified exact round trip completed within the research budget. GPT-6 Astra’s submitted compressor also passed a full-enwik9 round trip at 141,736,253 bytes (1.133890024 BPB); that separate confirmation is not used in this enwik8 ranking.

Despite access to an H100, the leading submissions favored adaptive context mixing over neural compression. They combined predictions from byte and word contexts with repeated-string matches, then adjusted those predictions online as they processed the file. Research strategies varied sharply: some agents ran hundreds of cheap prefix tests before committing to a full run, while others spent most of the budget on a few long trials.

02

LM training

Pre-training · held-out validation bits per byte (BPB), lower is better

Improve a small GPT training program under a fixed budget, scored on a hidden test set.

Baseline: 1.3699 BPB · Reference: 0.85 BPB · Theoretical best: 0.6 BPB

The agent starts from a baseline GPT training program and edits it to push validation bits per byte as low as possible, with 24 hours of wall clock and 24 H100 accelerator-hours. During research it measures candidates on the development split. After the budget expires, the submitted program is retrained from scratch on fixed seeds and scored on data the agent has never seen. The starter scores 1.3699 BPB, and the published human reference is a 235M-parameter, 64-layer character transformer at 0.85 BPB. Chinchilla 70B reaches ≈0.66 BPB as a pretrained model under a different evaluation protocol.

Setup
Environment
Sandbox without internet access or package installs
Data
Byte-level enwik9 — 800 MB train / 100 MB dev / 100 MB test
Hardware
1 × H100-80GB, 24 accelerator-hours
Clock
24 hours wall clock, final hour reserved for packaging
Verification
Three 30-minute retrainings on held-out seeds; median BPB over 32,768 hidden windows
Human reference
Al-Rfou et al. (2019) 64-layer transformer, 0.85 BPB on held-out enwik9
Frontier context
Chinchilla 70B: ≈ 0.66 BPB on enwik9 under a different evaluation protocol
Results
Model Result Score Cost
Claude Fable 5.2 (max) Claude Code 0.8232 BPB 0.54 $294
Claude Opus 5.5 (max) Claude Code 0.8308 BPB 0.53 $404
Gemini 4 Carbon (high) Antigravity 0.8427 BPB 0.51 $245
Claude Fable 5.1 (max) Claude Code 0.8536 BPB 0.49 $300
GPT-6 Astra (max) Codex 0.8607 BPB 0.48 $589
Gemini 4 Argon (high) Antigravity 0.8627 BPB 0.48 $123
Wonder Full (max) Muse Code 0.8920 BPB 0.44 —
GPT-6.1 Sol (max) Codex 0.8978 BPB 0.43 $80
Claude Opus 5 (max) Claude Code 0.8983 BPB 0.43 $277
Grok 4.6 (xhigh) Grok Build 0.9021 BPB 0.42 $61
Grok 4.7 (xhigh) Grok Build 0.9066 BPB 0.42 $172
Muse Spark 1.3 Max (max) Muse Code 0.9119 BPB 0.41 $32
Claude Fable 5 (max) Claude Code 0.9122 BPB 0.41 $400
Claude Opus 4.8 (max) Claude Code 0.9122 BPB 0.41 $400
GLM 5.3 (max) Claude Code 0.9123 BPB 0.41 $25
Kimi K3 (max) Kimi Code 0.9152 BPB 0.40 $30
Gemini 3.7 Flash (high) Antigravity 0.9203 BPB 0.40 $133
Claude Opus 4.7 (max) Claude Code 0.9231 BPB 0.39 $276
Qwen 3.8 Max (max) Qwen Code 0.9310 BPB 0.38 $157
Gemini 3.8 Flash (high) Antigravity 0.9468 BPB 0.36 $125
GPT-5.6 Sol (max) Codex 0.9475 BPB 0.36 $174
GPT 5.5 (xhigh) Codex 0.9870 BPB 0.31 $289
GPT-6 Sol (max) Codex 0.9870 BPB 0.31 $485
GPT 5.2 (xhigh) Codex 0.9907 BPB 0.31 $80
GPT 5.4 (xhigh) Codex 1.0133 BPB 0.28 $138
Kimi K2.5 (max) Kimi Code 1.0370 BPB 0.25 $24
Claude Opus 4.5 (Nonthinking) (high) Claude Code 1.1074 BPB 0.18 $852
What happened

Every model improved on the 1.3699 BPB LM Training starter. Claude Fable 5.2 leads and beats the selected published reference of 0.85 BPB. Claude Opus 5.5 follows, and Gemini 4 Carbon places third. These results use the benchmark’s controlled enwik9 protocol; they are not a matched reproduction of the reference paper’s training and evaluation setup.

The strongest submissions converged on models of roughly 85 million parameters using RoPE, RMSNorm, QK normalization, and ReLU² or SwiGLU feed-forward layers. Experiment volume did not predict quality: GPT-5.6 Sol recorded 114 trials but finished behind most models, while Fable recorded 47. The important differences were which ideas agents tested, how long they trained them, and how carefully they selected the final program.

03

Harness engineering

Harness engineering · substep agreement, higher is better

Improve an agentic judge harness around a fixed model (Gemini 3.5 Flash-Lite).

Baseline: 50% · Human agreement reference: 93.6% · Theoretical best: 99%

The agent improves a judge harness built around Gemini 3.5 Flash-Lite, whose job is to grade Vibe Code Bench submissions. It may modify prompts, browser tools, memory, verification, planning, or subagent use. During research it receives aggregate agreement on 12 development apps without per-item labels. The frozen harness is evaluated three times on 24 held-out apps containing 205 scored substeps.

Setup
Environment
Sandbox with access only to the evaluation service
Hardware
No GPUs; hosted judge calls only
Clock
12 hours
Judge inputs
A running web app, its authoritative URL, and matching source code
Scale reference
Highest agreement between two human annotators: 93.6%
Results
Model Result Score Cost
GPT-6 Sol (max) Codex 81.46% 0.23 $320
Claude Fable 5.1 (max) Claude Code 81.30% 0.23 $202
Grok 4.6 (xhigh) Grok Build 80.65% 0.22 $52
GPT-6.1 Sol (max) Codex 79.35% 0.20 $49
Claude Fable 5.2 (max) Claude Code 78.70% 0.19 $371
Claude Opus 4.5 (Nonthinking) (high) Claude Code 78.37% 0.19 $168
Wonder Full (max) Muse Code 78.05% 0.19 —
GPT-5.6 Sol (max) Codex 77.89% 0.18 $259
Claude Fable 5 (max) Claude Code 77.56% 0.18 $344
GLM 5.3 (max) Claude Code 76.91% 0.17 $43
Gemini 4 Carbon (high) Antigravity 76.59% 0.17 $164
Claude Opus 4.8 (max) Claude Code 76.26% 0.17 $290
Claude Opus 5 (max) Claude Code 74.31% 0.15 $235
Gemini 3.8 Flash (high) Antigravity 73.98% 0.15 $547
Muse Spark 1.3 Max (max) Muse Code 73.98% 0.15 $53
Claude Opus 5.5 (max) Claude Code 73.98% 0.15 $248
Gemini 4 Argon (high) Antigravity 73.33% 0.14 $154
Qwen 3.8 Max (max) Qwen Code 72.85% 0.14 $63
Grok 4.7 (xhigh) Grok Build 70.24% 0.11 $191
Kimi K3 (max) Kimi Code 68.29% 0.10 $183
GPT-6 Astra (max) Codex 67.80% 0.10 $499
GPT 5.4 (xhigh) Codex 66.67% 0.09 $152
Gemini 3.7 Flash (high) Antigravity 66.18% 0.08 $161
Claude Opus 4.7 (max) Claude Code 61.79% 0.06 $300
GPT 5.5 (xhigh) Codex 61.79% 0.06 $321
GPT 5.2 (xhigh) Codex 58.70% 0.04 $48
Kimi K2.5 (max) Kimi Code 55.12% 0.02 $8
What happened

GPT-6 Sol leads, ahead of Claude Fable 5.1 and Grok 4.6 . Results were uneven across model generations: Claude Opus 4.5 scores higher than Claude Opus 5, while GPT-6 Astra also finished below GPT-5.6 Sol.

Coding was only part of the task. Agents had to discover how Gemini 3.5 Flash-Lite failed as a judge and redesign the surrounding scaffold. GPT-5.6 Sol converted recurring failure patterns into explicit rules backed by browser and DOM evidence. Qwen 3.8 Max discovered that identical harnesses could receive noticeably different development scores and began interleaving candidates with unchanged controls. The strongest submissions combined better prompting with evidence collection, persistent state, and an independent adjudication stage.

04

Post-training

Post-training · mean Finance Agent v2 score across three runs on 126 held-out tasks, higher is better

Improve a Qwen3.6-35B-A3B model on Finance Agent v2 tasks.

Baseline: 35.38% · Reference: 59.42% · Theoretical best: 99%

The agent receives a Qwen3.6-35B-A3B checkpoint, 30 hours on sixteen RTX PRO 6000s, unrestricted internet access, $100 in external-model inference credits, and 27 public FABv2 samples. It may use data generation, supervised fine-tuning, reinforcement learning, or any other method it devises, then submits one checkpoint and its generation settings. The checkpoint must derive from the provided model rather than a downloaded replacement, and its mean score is measured across three runs on 126 held-out questions.

Setup
Environment
Single agent, cluster job submission
Hardware
Two nodes of 8 x RTX PRO 6000 96GB
Internet
Unrestricted
Development data
27 public FABv2 samples
Inference
$100 in credits for external model calls
Clock
30 hours
Verification
Checkpoint and generation settings evaluated three times on 126 held-out FABv2 questions
Parent baseline
35.38%
Model reference
Muse Spark 1.2, 59.42%
Results
Model Result Score Cost
Claude Opus 5.5 (max) Claude Code 44.53% 0.35 $540
Claude Opus 5 (max) Claude Code 42.20% 0.32 $838
Claude Fable 5.2 (max) Claude Code 40.13% 0.28 $428
Claude Fable 5.1 (max) Claude Code 39.99% 0.28 $417
GPT-6 Sol (max) Codex 36.23% 0.16 $1,335
Gemini 4 Argon (high) Antigravity 36.11% 0.15 $329
GPT-6 Astra (max) Codex 35.46% 0.08 $1,179
Claude Opus 4.5 (Nonthinking) (high) Claude Code 0.00% 0.00 $215
GPT-5.6 Sol (max) Codex 33.83% 0.00 $724
Kimi K3 (max) Kimi Code 35.38% 0.00 $273
Qwen 3.8 Max (max) Qwen Code 32.07% 0.00 $112
GPT 5.2 (xhigh) Codex 9.75% 0.00 $97
Kimi K2.5 (max) Kimi Code 8.10% 0.00 $30
Gemini 3.8 Flash (high) Antigravity 3.54% 0.00 $352
Claude Fable 5 (max) Claude Code 34.30% 0.00 $846
Claude Opus 4.8 (max) Claude Code 35.38% 0.00 $796
Claude Opus 4.7 (max) Claude Code 17.42% 0.00 $2,901
GPT 5.4 (xhigh) Codex 34.52% 0.00 $542
GPT 5.5 (xhigh) Codex 1.50% 0.00 $2,411
GLM 5.3 (max) Claude Code 33.63% 0.00 $90
Muse Spark 1.3 Max (max) Muse Code 2.37% 0.00 $47
Grok 4.6 (xhigh) Grok Build 22.06% 0.00 $141
Gemini 3.7 Flash (high) Antigravity 31.51% 0.00 $190
Grok 4.7 (xhigh) Grok Build 24.73% 0.00 $324
GPT-6.1 Sol (max) Codex 29.11% 0.00 $151
Gemini 4 Carbon (high) Antigravity 34.74% 0.00 $220
Wonder Full (max) Muse Code 7.01% 0.00 —
What happened

Claude Opus 5.5 leads Post-Training, followed by Claude Opus 5 and Claude Fable 5.2 . The parent model scored 35.38%.

Claude Opus 5 found that the parent omitted a required tool argument on roughly 84% of early retrieval calls, then generated training examples specifically targeting that behavior. Fable’s result came from a different direction: it rejected both trained adapters after they failed its checks and submitted the original weights with finance-specific prompt guidance. Successful training was not necessarily the same as producing a better agent.


Model Profiles

Long-horizon open-ended tasks reveal behavioral differences that are not captured by final scores alone. The profiles below summarize recurring patterns across each model’s research campaigns.

Claude Fable 5.1 (max)

Makes candidates earn the right to survive progressively stronger tests.

Harness
Claude Code
Index
0.36 · rank 3 of 27
Cost
$1,193
Compression 0.44
LM training 0.49
Harness engineering 0.23
Post-training 0.28

Fable 5.1 organized its campaigns around progressively stronger qualification. Compression candidates were screened cheaply, tested on larger inputs, checked for exact reconstruction, and finally run on the full corpus. The selected compressor completed 16 recorded round-trip measurements and produced both its best enwik8 artifact, at 1.3560 BPB, and a successful full-enwik9 result. In LM Training, 47 development trials produced a submission with a 0.8536 median hidden BPB, compared with the published 0.85 BPB reference.

The same process produced 81.30% agreement in Harness Engineering. That result did not come from experiment volume alone: Fable repeatedly increased the strength of the test a candidate had to pass before promotion.

Post-Training provides the clearest illustration. Fable trained two LoRA candidates but rejected both when improvements in tool-use behavior failed to produce better answers. Its final artifact retained the parent weights and paired them with finance-specific prompt guidance, improving the score from the 35.38% parent baseline to 39.99%. Its distinctive strength was not a new training algorithm, but refusing to equate successful training with a better model.

Claude Opus 5 (max)

Makes large, coherent research bets—and sometimes bets on the wrong research program.

Harness
Claude Code
Index
0.33 · rank 4 of 27
Cost
$1,675
Compression 0.43
LM training 0.43
Harness engineering 0.15
Post-training 0.32

Opus 5 tended to identify one central bottleneck and reorganize the campaign around it. In Post-Training, it traced the parent model's failures to a concrete tool-use error: approximately 84% of its early retrieve_information calls omitted a required argument. It generated targeted training examples for that behavior, reducing the error rate from 84% to 35% in an initial probe and raising the submission rate from 71% to 100%. Its final checkpoint achieved 42.20%.

The same willingness to commit appeared elsewhere. In LM Training, it moved promising candidates into longer runs and replicated its finalists six times before submission.

This concentration can also become a weakness. Opus spent much of Compression developing an increasingly elaborate family of context models, even after marginal gains had become small. Its own retrospective argued that it should have switched earlier to an online neural approach. Opus is strongest when its diagnosis is correct; when it is wrong, it can spend most of the budget refining the wrong research program.

GPT-6 Astra (max)

Combines complementary techniques effectively, but gains don’t always carry over to the complete task.

Harness
Codex
Index
0.27 · rank 8 of 27
Cost
$3,038
Compression 0.43
LM training 0.48
Harness engineering 0.10
Post-training 0.08

Astra's strongest work combined several complementary techniques into a better final system. Its Compression and LM Training submissions both improved on GPT-5.6 Sol, with the submitted LM recipe reaching 0.8607 BPB.

Its experimentation was less consistent when choosing among late candidates. In LM Training, the selected configuration received only one full-length development run, leaving limited evidence of its repeatability before submission. In Harness Engineering, Astra explored browser-based and source-based judges before selecting a source-code approach. That candidate looked stronger in development but transferred poorly to new tasks, finishing below GPT-5.6 Sol.

Post-Training followed a more elaborate training process without a comparable payoff. Astra fine-tuned checkpoints for financial reasoning and tool use, compared multiple candidates, blended selected weight updates, and revised its prompting and generation settings. Narrow arithmetic and modeling exercises improved, but the final result barely moved: 35.46% against the parent model's 35.38%. Its distinctive strength was combining useful techniques; its recurring limitation was choosing development tests that reliably predicted improvement on the complete task.

GPT-5.6 Sol (max)

Builds excellent experiments but does not always make the decisive bet.

Harness
Codex
Index
0.24 · rank 14 of 27
Cost
$1,388
Compression 0.41
LM training 0.36
Harness engineering 0.18
Post-training 0.00

GPT-5.6 invested more heavily than the other systems in instrumentation and controlled comparison. In Harness Engineering, it combined source inspection, browser execution, screenshots, DOM evidence, persistent state, and deterministic rules for failures it found the judge model handled unreliably. It changed mechanisms separately, discovered errors in its own evaluation code, and abandoned source-only, browser-only, and additional-judge designs when broader tests contradicted their apparent gains. The resulting harness reached 77.89% agreement.

Its LM Training campaign contained 114 recorded trials, but its result trailed most models. The final LM candidate also received less full-duration confirmation than the campaign's overall experimental rigor would suggest.

GPT-5.6's limitation was therefore not a lack of experimentation, but the conversion of evidence into commitment. It was particularly good at constructing measurement systems, isolating variables, and detecting false gains, yet its many local comparisons did not always produce a correspondingly strong global change to the final artifact.

Qwen 3.8 Max (max)

Treats evaluator noise as part of the research problem.

Harness
Qwen Code
Index
0.22 · rank 16 of 27
Cost
$455
Compression 0.35
LM training 0.38
Harness engineering 0.14
Post-training 0.00

Qwen's most distinctive behavior appeared when it stopped assuming that evaluation results were trustworthy. In Harness Engineering, apparently improved harnesses sometimes produced inconsistent scores. Qwen responded by interleaving candidate evaluations with byte-identical control submissions, allowing it to estimate how much variation came from the evaluator rather than the harness. Across 45 evaluator runs, it used these controls and broader application panels to reject several changes that initially appeared beneficial. Its final artifact scored 73.17%, 74.63%, and 70.73% across three complete held-out evaluations, for a mean of 72.85%.

This reflects Qwen's broader incremental style. It generally preserved a working system, changed a small number of components, and allowed controlled comparisons to determine the next step.

The tradeoff is that local discipline does not guarantee a strong final direction. Its Post-Training artifact regressed to 32.07%, and some final candidates received less replication than its Harness methodology would imply. Qwen was unusually willing to challenge the meaning of its own measurements, but applied that skepticism more consistently in some campaigns than others.

Kimi K3 (max)

Protects the incumbent, sometimes until continuation reveals a better answer.

Harness
Kimi Code
Index
0.21 · rank 17 of 27
Cost
$547
Compression 0.33
LM training 0.40
Harness engineering 0.10
Post-training 0.00

Kimi K3 repeatedly treated the best confirmed artifact as something that should not be displaced by an uncertain gain. In LM Training, it selected a reliable candidate that could finish within the deadline rather than the configuration with the best isolated result. In Harness Engineering, identical artifacts produced unexpectedly different scores, leading it to replace peak-score selection with repeated means and minimum-score thresholds. In Post-Training, every trained child failed its comparison against the parent, so Kimi restored the unchanged parent rather than submit a model it believed had regressed.

This caution did not prevent rapid experimentation. Kimi moved through concrete architectural and training changes quickly, usually retaining a strong incumbent for comparison.

Kimi was therefore conservative about what it shipped, not about what it tried. Its weakness was premature closure: it sometimes considered a campaign finished before exhausting useful ideas, then found improvements when it resumed experimentation.

Gemini 3.8 Flash (high)

Persistently improves working implementations, but sometimes selects candidates on weak evidence.

Harness
Antigravity
Index
0.20 · rank 19 of 27
Cost
$1,328
Compression 0.29
LM training 0.36
Harness engineering 0.15
Post-training 0.00

Gemini 3.8 Flash concentrated on making working implementations and refining them through repeated experiments. Its Compression campaign refined a context-mixing design to a final result of 1.7261 BPB on enwik8, an improvement that stayed behind the stronger submissions.

LM Training explored broader architectural changes and repeatedly tested finalists, producing a submission that reached 0.9468 BPB. It selected its final candidate based on the strongest individual development result. Harness Engineering showed practical debugging ability: Flash built browser-based judges that used page structure and screenshots, repaired action handling, and maintained memory across steps. It repeatedly revised and tested these systems rather than stopping at the first working implementation.

Post-Training exposed the largest weakness in its experimental process. Flash expanded 242 scripted examples into 2,500 training trajectories through repetition, then selected a checkpoint using simulated tool interactions and successful completion. Those checks provided little evidence that the model could answer real financial questions accurately, and the submitted model fell to 3.54% from the parent's 35.38%. Its recurring limitation was treating a functioning pipeline or a promising individual result as sufficient evidence to select a candidate.


Experiment Ledgers

A final score says what a model achieved, but the experimental record says how it got there. Models were asked to maintain a running Marimo notebook documenting their experiments as they attempted each task and to synthesize a summary of their approach. Explore the interactive research explainers below, which describe the techniques, experiments, and results recorded in those ledgers:


Discussion

Our results show that frontier models can sustain long-horizon autonomous research: the agents managed compute budgets of 12 to 30 hours without intervention, and the leading artifacts improved on the starting baseline in all four tasks.

Progress remains uneven. Claude Opus 5.5 on LM Training passes the published 0.85 BPB result, and Claude Fable 5.1 is close to it. Both recipes train for 30 minutes on one H100 per seed; Al-Rfou et al. report 175 hours on a TPU v2 for T64. The references remain ahead in Compression, Harness Engineering, and Post-Training.

The strongest submissions primarily combined and tuned established techniques rather than introducing a new general-purpose method. The LM Training leaders are the clearest example: Opus 5.5 paired a byte-level Transformer with embeddings of multi-byte patterns and an auxiliary head that predicts one further byte, both from prior work, and Fable 5.1 paired a conventional Transformer with learned hashed byte n-gram inputs and extensive optimization of training speed, sampling, and schedules. Their results show that autonomous agents can produce substantial gains through effective integration and empirical refinement even without inventing a fundamentally new algorithm.

This was especially clear in Post-Training: Claude Opus 5, GPT-5.6 Sol, and Kimi K3 all used stronger teacher models to generate finance-agent examples and fine-tuned small adapters on the parent; none explored reinforcement learning, preference training, or external financial data.

Their strongest research behavior was running experiments and correcting misleading measurements, but they still lacked the judgment to identify higher-leverage directions and pursue them aggressively.

These results come from single runs on narrowly scoped tasks, under fixed compute and wall-clock budgets, in off-the-shelf agent harnesses. More compute, better orchestration, and research-specific tooling could change the picture.

The RSI Index provides a repeatable measure of autonomous LLM R&D, designed to track how these capabilities change as frontier systems advance.


Acknowledgements

We thank CoreWeave for providing the compute for these runs.

We thank the team at Marimo whose notebooks serve as the agents’ experiment ledgers and power the interactive notebooks on this page, and for fruitful discussions throughout.


Citation

Please cite this work as:

Citation (BibTeX)

@article{valsai2026rsiindex,
title        = {Vals RSI Index},
author       = {Oliver Chen and Geby Jaff and Langston Nashold and Rayan Krishnan},
year         = {2026},
month        = aug,
howpublished = {Vals AI},
url          = {https://vals.ai/benchmarks/rsi_index},
}