MagLev.
Research & evaluation
Benchmark 02
← Back to all benchmarks
Benchmark 02 · Long-horizon continuity

Six prompts. No recaps.
The thread is never lost.

Build a dependency-free Python package across six sequential prompts, with delayed requirements, changed requirements, distractor specifications, and a sealed evaluator revealed to nobody. Each prompt says continue — never restate.

The brief forbids re-explanation. The system must resume from its own project state, honor constraints stated prompts earlier, and absorb requirement mutations without breaking behavior it already shipped. Every system here ran on the same frontier models. The difference is what each one carried forward.

6 sequential promptsSealed hidden evaluator3 model-matched compute pairingsSame model on both sides
What this benchmark tests
  • Functional correctness: Task store, planner, dependency resolution, atomic persistence, and a deterministic CLI.
  • Continuity without recap: Resume each prompt from project state alone; no user re-explanation is permitted.
  • Delayed requirements: Implement constraints named early and required only several prompts later.
  • Requirement mutation: Add dependency and filtering rules without breaking previously shipped behavior.
  • Distractor resistance: Ignore tempting specifications for databases, web layers, and third-party packages.
  • Sealed acceptance: Pass a hidden evaluator the system never sees, run from outside the session.
  • Bounded context: Complete all six stages without letting resident context grow unchecked.
75.9%
Less attention compute

Mean of three MagLev runs against the mean of the three same-model native harnesses, at completion.

98–99
Graded quality, out of 100

Higher than its own pairing in every comparison. Nothing was traded away to get the compute number.

1.95×
MagLev context growth, first call to last

Its counterpart on the identical model finished at 15.3× its opening size, and was still climbing.

4.0×
MagLev work volume on Opus 5

MagLev did several times the work of Claude Code on the identical model, and still spent far less total compute.

Every figure on this page is computed per request from each system’s own metered logs, using identical formulas on both sides.

01 / Output quality

MagLev graded higher in every comparison.

Independent rubric scoring on the shipped artifact: functional behavior, continuity, and sealed-evaluator acceptance.

GPT-5.6-SOL: 98 vs 92 · Grok 4.6: 98 vs 97 · Router: 99 vs 41

Native harnesses: Codex, Grok Build Terminal, and OpenRouter Auto, respectively. The router comparison is unpaired on model identity and is reported separately from the three model-matched compute pairings; its 9-of-9 sealed acceptance against 0-of-9 is the source of the score gap. Scores are the reported Benchmark 2 rubric results, not a new evaluation.

02 / Context carried on every call

One curve is flat. The other never stops climbing.

The same six prompts, the same models, the same finished software. This is how large the prompt had grown on each individual model call, from the first call of the session to the last. Every compute and energy figure on this page is a consequence of this one behavior.

ArmMean tokens / callPeakFinal callGrowth
Claude Code (Opus 5)173,492338,548338,54815.3×
Codex (GPT-5.6-SOL)54,03587,34587,3453.53×
Grok Terminal (Grok 4.6)72,508133,199133,1997.93×
MagLev (Opus 5)33,04555,98433,0501.95×
MagLev (GPT-5.6-SOL)15,59822,13514,0541.53×
MagLev (Grok 4.6)28,64848,25239,4983.31×

Every native harness ends the session above its own average and still rising — Claude Code finishes at 338,548 tokens per call, 15.3× where it started. MagLev finishes at 33,050, within a rounding error of its opening 16,918, at the end of a longer run on the same model solving the same task. It is not truncating the work and it is not answering with less: it graded higher.

MagLev never loses the thread. Persistent memory means the sixth prompt is answered with the same discipline as the first — the project state is remembered, not re-read. Nothing is re-sent to be re-understood, so the cost of the tenth hour looks like the cost of the first. A session that runs all day does not become a session that costs all day.

Prompt tokens per call as reported by each provider’s own meter, interpolated onto the shared progress grid. Cached and uncached input are both included: this is the size of the package the model was handed, before any billing discount is applied.

03 / Average cumulative quadratic attention

75.9% less attention at completion.

The mean of all three metered non-MagLev runs against the mean of all three metered MagLev runs. Equal weight for every run; both curves start at zero and accumulate over the session.

Each run is independently normalized to 0–100% progress, with linear interpolation onto a 5% grid. Progress indicates position within the recorded session—not verified feature completion. No curve smoothing is applied.

04 / Per-pairing cumulative quadratic compute

Three comparisons. Same model on both sides.

Every curve begins at zero. The native harnesses climb steeply as the session lengthens; the MagLev curves flatten.

Claude Code (Opus 5) vs MagLev (Opus 5)

Opus 5

77.4% less attention
Decode KV traffic & uncached scenario

Attention state streamed out of memory during decode, and the separate uncached counterfactual. Both are token-derived proxies, not measured hardware FLOPs.

Decode KV traffic · S3S

83.5% less decode KV traffic.

Uncached scenario · S4

88.5% less under the uncached ceiling.

Codex (GPT-5.6-SOL) vs MagLev (GPT-5.6-SOL)

GPT-5.6-SOL

79.3% less attention
Decode KV traffic & uncached scenario

Attention state streamed out of memory during decode, and the separate uncached counterfactual. Both are token-derived proxies, not measured hardware FLOPs.

Decode KV traffic · S3S

87.8% less decode KV traffic.

Uncached scenario · S4

96.1% less under the uncached ceiling.

Grok Terminal (Grok 4.6) vs MagLev (Grok 4.6)

Grok 4.6

70.9% less attention
Decode KV traffic & uncached scenario

Attention state streamed out of memory during decode, and the separate uncached counterfactual. Both are token-derived proxies, not measured hardware FLOPs.

Decode KV traffic · S3S

53.5% less decode KV traffic.

Uncached scenario · S4

83.8% less under the uncached ceiling.

The main curves show causal attention pairs. Expand each comparison to view decode KV traffic (S3S) and the uncached scenario (S4); the latter is counterfactual, not actual hardware work.

05 / Per-pairing energy savings

Less modeled energy to produce better software.

Cumulative modeled memory-traffic energy at the same normalized progress. Dashed lines are KV-cache energy; solid lines are total modeled energy.

Claude Code (Opus 5) vs MagLev (Opus 5)

Opus 5

83.4% KV energy saved

At completion: 83.4% less KV cache energy and 40.6% less total modeled energy.

Codex (GPT-5.6-SOL) vs MagLev (GPT-5.6-SOL)

GPT-5.6-SOL

87.1% KV energy saved

At completion: 87.1% less KV cache energy and 58.8% less total modeled energy.

Grok Terminal (Grok 4.6) vs MagLev (Grok 4.6)

Grok 4.6

46.2% KV energy saved

At completion: 46.2% less KV cache energy.

Total modeled energy includes KV-cache and decode weight traffic. Surfaces where MagLev did not finish lower are not plotted: in the Grok 4.6 pairing, MagLev generated substantially more output, so only KV-cache energy is shown. These are estimates under identical fixed assumptions—not measured device or datacenter electricity.

06 / Compute per delivered token

Divide by the work actually delivered.

Every figure above is a session total, and a total punishes the system that produced more software. These surfaces divide the same metered work by the output tokens that work produced. Same logs, same formulas, corrected units — and the gap widens.

9.19×
Compute per delivered token

Mean across these pairings. Work divided by the output it produced, so a longer answer is never charged as a loss.

60.3×
Terminal rate, final decile

What the end of the session costs — not the average of an easy first hour and an expensive last one.

5.62×
Less context escalation

How much the prompt grows from the first decile of calls to the last. Dimensionless, so it compares across every vendor.

3.40×
Decode throughput

441 output tokens per second against 130, at each arm's own mean context.

PairingPer delivered tokenTerminal rateEscalationSessions / cardDecode rate
MagLev (Opus 5) vs Claude Code (Opus 5)7.34×16.6×9.10×5.25×5.25×
MagLev (GPT-5.6-SOL) vs Codex (GPT-5.6-SOL)11.9×34.6×2.76×3.46×3.46×
MagLev (Grok 4.6) vs Grok Terminal (Grok 4.6)8.32×130×4.99×2.53×2.53×

The capacity statement.

A model call is bounded by how much KV state has to be streamed from memory for every token it writes. Context size therefore converts directly into how many of these sessions fit on one card — here, at each arm's own mean context. The strongest terminal result on this page is MagLev (Grok 4.6) vs Grok Terminal (Grok 4.6) · V1 at 130×.

Ratios are MagLev advantage: how many times more compute the native harness spent to deliver the same unit of output. Sessions per card and decode rate assume one 80 GB H100 SXM at 3.35 TB/s with decode bound by KV traffic; the constants are fixed and identical on both sides. Terminal rate uses the final decile of model calls, with a minimum window so a short arm reports no rate rather than a single-sample one.

Stronger software.
A fraction of the compute.

MagLev graded higher in every Benchmark 2 comparison while using less reported attention compute, less decode KV traffic, and less KV-cache energy in all three metered pairings — on the same frontier models its counterparts ran on. The task was identical. What each system had to re-read before it could answer was not.

All of it comes from one property: persistent memory. MagLev remembers the project instead of re-reading it, so the thread is never lost and the prompt never swells. The sixth prompt is answered with the discipline of the first, and it costs what the first one cost. Same model, same silicon, same job — a fraction of the work.

← Back to all benchmarks