AI Coding Live News

Empirical Benchmark Unmasks Sub-Agent Concurrency: SWE-bench Success Drops 24% as Token Costs Surge up to 3.3x

A comprehensive empirical study evaluated native sub-agent concurrency across 2,124 runs on Claude Code, Codex, and Kimi Code (354 tasks, ~$20.8K API cost). On 100 standard SWE-bench Verified tasks, enabling sub-agents caused Claude Code's solve rate to collapse from 83% to 59% (with latency increasing from 17.5 to 27.8 minutes) and Kimi Code from 77% to 59%, while token consumption inflated by 1.41x to 3.31x. The study revealed severe failure modes including budget-exhausting fan-outs, orphaned child processes, and concurrent delivery race conditions.

Empirical Benchmark Unmasks Sub-Agent Concurrency: SWE-bench Success Drops 24% as Token Costs Surge up to 3.3x

Key Takeaways

  • A $20,800 empirical study across 2,124 runs revealed the real costs of native sub-agent concurrency in Claude Code, Codex, and Kimi Code
  • On SWE-bench Verified, sub-agent concurrency dropped Claude Code's solve rate from 83% to 59% and Kimi Code from 77% to 59%
  • Token consumption inflated by 1.41x-3.31x while execution times lengthened, caused by thread race conditions and budget exhaustion
  • Delivered gains only on massive multi-file projects (LoopsBench: 7.1% to 21.4%); authors recommend sequential execution as the default
Read full story
Linked Models & Agents:

REMORY: HKUST and Alibaba Introduce Residual Memory for Agent Context Compaction, Matching Full Context with Only 5.2% Token Overhead

As autonomous agents execute complex multi-step workflows across terminal consoles and web browsers, context window expansion and escalating token costs impose severe operational bottlenecks. Conventional compaction methods rely on text summarization or token pruning, both of which discard crucial state variables and induce semantic drift over extended sessions. Researchers from HKUST and Alibaba present REMORY (arXiv:2610.11287), introducing a residual memory paradigm designed for sequence-level context compaction. REMORY combines lossy natural language summaries with bounded sets of learned soft memory tokens, effectively forming a residual connection in the sequence dimension. While text summaries convey high-level narrative continuity, the soft memory tokens reconstruct lost fine-grained execution artifacts, API arguments, and intermediate environment states. On challenging benchmarks including BrowseComp and Terminal-Bench 2.1, REMORY retains 97% of full-context task performance while occupying only 5.2% of the original input token footprint, slashing redundant tool retries and loops by more than 40%.

Key Takeaways

  • HKUST and Alibaba propose REMORY, establishing sequence-dimension residual memory connections to resolve agent context bloat
  • Matches 97.2% of full-context capability using only 5.2% of token positions, slashing repetitive tool errors by 41.5% on Terminal-Bench
  • Non-invasive plug-and-play architecture reduces TTFT latency by 73.8%, setting a new benchmark for long-horizon agent efficiency
Read full story
Linked Models & Agents:

SHIFT: Dynamic Multi-Agent Harness Search Per-Query via Predictive MCTS Outperforms Static Baselines by 7.2%

Designing optimal multi-agent harnesses—specifying roles, prompts, tool registries, and communication graphs—is foundational to task performance. However, because different user requests demand wildly disparate cognitive workflows, static hand-crafted multi-agent topologies fail to generalize; conversely, running exhaustive trial-and-error executions at inference time incurs prohibitive latency and cost. Researchers from Google Cloud AI Research, Georgia Tech, and UC Davis introduce SHIFT (arXiv:2610.04137), an architecture that decouples physical execution from the per-query search loop. SHIFT trains a local LLM architect policy over harness-building actions paired with a learned value function predicting the utility frontier between accuracy and execution token cost. For every incoming query, Monte Carlo Tree Search (MCTS) constructs a customized multi-agent topology tailored to the problem. Evaluated across 9,193 tasks spanning six diverse benchmarks with a Gemini 3.5 Flash executor, SHIFT achieves an unprecedented ~80% mean accuracy, beating 17 competitive baselines by up to 7.2 percentage points while slashing execution tokens by 32%.

Key Takeaways

  • Introduces SHIFT, a framework dynamically generating tailored multi-agent harnesses per-query via predictive Monte Carlo Tree Search
  • Decouples execution from the search loop using an LLM architect policy and a learned value function balancing accuracy against token cost
  • Achieves ~80% mean accuracy across 9,193 tasks in six benchmarks with Gemini 3.5 Flash, outperforming 17 baselines while cutting execution tokens by 32%
Read full story

Mid-Harness Scales Action Compute at Model-Harness Boundary for Terminal Agents, Driving Pass@1 from 50% to 68%

Terminal agents execute stochastic model outputs directly in real bash environments, where an erroneous command (e.g., misconfigured dependency install, file deletion) irreversibly corrupts system state and derails downstream progress. Researchers introduce Mid-Harness, a paradigm that allocates test-time compute precisely at the boundary between model generation and the evaluation harness. By sampling and verifying candidate actions before sending them to the terminal—rather than expensively generating multiple full rollout trajectories—Mid-Harness elevates Pass@1 on TerminalBench-Lite from 50.00% to 68.03% under action scaling, achieving vastly higher reliability at substantially lower token cost.

Mid-Harness Scales Action Compute at Model-Harness Boundary for Terminal Agents, Driving Pass@1 from 50% to 68%

Key Takeaways

  • Pioneers Mid-Harness to allocate test-time compute at the model-harness boundary before terminal execution
  • Catapults Pass@1 on TerminalBench-Lite from 50.00% to 68.03% via 8-action sampling under capable verification
  • Proves action scaling achieves superior success rates at lower token budgets compared to full trajectory scaling
Read full story
ADSponsored

KAIST Introduces CorpusMap: Entity-Anchored Navigation Layer for Agentic Search Slashes Token Costs Across Multi-Document Tasks

Completing multi-hop tasks across large document collections requires connecting disjoint evidence scattered across disparate files—such as project approvals in one document, architectural requirements in a second, and incident reports in a third. Existing search agents iterate over flat file collections where documents offer zero clues regarding their cross-file relationships, forcing agents to blindly rediscover inter-document links for every single query while incurring immense token overhead and missing complementary evidence. KAIST and Microsoft researchers introduce CorpusMap, an entity-anchored navigation layer that organizes the document collection around recurring, cross-document entities. By constructing offline Entity Pages that aggregate mentions and link to all referencing source documents, CorpusMap exposes a navigable topological graph that agents traverse to unearth scattered evidence. Evaluated across 7 models and 3 benchmarks, CorpusMap delivers superior evidence discovery and answer accuracy while consuming significantly fewer tokens.

KAIST Introduces CorpusMap: Entity-Anchored Navigation Layer for Agentic Search Slashes Token Costs Across Multi-Document Tasks

Key Takeaways

  • Offline Entity Graph Eradicates Search Redundancy: Pre-resolves recurring entities into bidirectional Entity Pages offline, transforming flat files into a navigable graph and sparing agents from repeatedly rediscovering relationships.
  • Substantial Token Savings in Multi-Hop Retrieval: Replaces blind iterative keyword sweeps with surgical graph traversal, drastically reducing total prompt token overhead on complex multi-document questions.
  • Cross-Model Superiority Across 7 Backbones: Rigorously benchmarked across seven diverse LLM architectures and three evaluation suites, outperforming raw search and four alternate navigation layers in evidence discovery and fidelity.
Read full story

Cursor cuts agent token costs 7% via harness: ~66% shorter system prompt, dynamic tools, cache breakpoints

Cursor (@cursor_ai) shipped agent-harness efficiency work that cut user token costs ~7% with no quality drop: trimming the system prompt ~66%, loading built-in tools on demand (prior MCP dynamic context saved 46.9% tokens in sessions that called MCP tools), explicit cache breakpoints that cut cold-cache misses 20%, and numbering only every 10th line on file reads (−1.6% cache-read tokens).

Cursor cuts agent token costs 7% via harness: ~66% shorter system prompt, dynamic tools, cache breakpoints

Key Takeaways

  • Harness changes cut user token costs ~7% without reducing agent quality.
  • System prompt trimmed ~66% as stronger models need fewer DO NOT/Important guardrails.
  • Built-in tools load on demand; earlier MCP dynamic context saved 46.9% tokens on MCP-calling sessions.
  • Explicit cache breakpoints cut cold-cache misses 20%; Read numbers every 10th line (−1.6% cache-read tokens).
Read full story

fast-jev-compaction swaps Claude Code summarization for Jev decision-based compaction

@aiRobertDaily highlighted fast-jev-compaction, a Claude Code plugin that replaces traditional LLM summarization with Jev-driven, decision-based context compaction. It quickly filters tool calls and results, drops or truncates stale content, and keeps only the necessary parts of valuable text; a related Codex-facing Jev context server was also noted. The aim is lower token cost and faster delivery.

Key Takeaways

  • A Claude Code plugin replaces classic summarization with Jev decision-based compaction.
  • Filters tool-call results, drops or truncates stale context, and keeps necessary signal.
  • Targets lower token cost and faster delivery; a Codex-facing Jev path is also noted.
Read full story
Linked Models & Agents:

Antigravity Brain Visualizer v0.6.0: single-pass Gemini 3.8 Flash session analysis plus git diffs, artifacts, token cost

Guillaume Laforge (@glaforge) shipped Antigravity Brain Visualizer v0.6.0 for inspecting, understanding, and debugging Antigravity agent sessions. Highlights: single-pass Gemini 3.8 Flash session analysis, git checkpoint diffs, an artifacts explorer, and token/cost estimates.

Key Takeaways

  • Release: Antigravity Brain Visualizer v0.6.0.
  • Capabilities: single-pass Gemini 3.8 Flash session analysis; git checkpoint diffs; artifacts explorer; token/cost estimates.
  • Use: inspect and debug Antigravity agent sessions.
Read full story
Linked Models & Agents:

RTK: open-source tool compresses terminal output before the model — claims ~70% token savings

Developer @midudev highlights open-source RTK (github.com/rtk-ai/rtk): it intercepts terminal command output and compresses it before it reaches coding agents such as Claude Code, Cursor, Copilot, and Codex, claiming about 70% token savings with automatic operation. Aimed at cutting token cost from verbose shell/log context in agent loops.

Key Takeaways

  • RTK intercepts and compresses terminal output before it hits the model.
  • Claims ~70% token savings with automatic operation.
  • Works with Claude Code, Cursor, Copilot, Codex; open-source at rtk-ai/rtk.
Read full story

Aider introduces Architect/Editor dual-model pairing, separating planning and code edits to cut token costs by 45%

Open-source terminal tool Aider introduced Architect/Editor dual-model pairing. Complex reasoning and architectural decisions are handled by top-tier models (o3-mini / Claude 3.7 Sonnet), while diff editing and file patching are delegated to fast, economical models (DeepSeek-V3 / Qwen-Coder), slashing API costs by 45% while preserving 90%+ solve rates.

Key Takeaways

  • Reasoning models plan architectures while fast models emit precise file diffs.
  • Maintains rigorous design logic while reducing overall API billing costs by 45%.
  • Live in latest Aider release via --architect and --editor flags.
Read full story
ADSponsored

NVIDIA Vera Rubin Posts First On-Silicon Agentic Numbers: Up to 30x Throughput per MW vs GB300

NVIDIA published the first on-silicon benchmark metrics for its Vera Rubin architecture on long-horizon agent workloads, demonstrating up to 30x throughput per megawatt and 35x lower token cost versus GB300 NVL72.

Key Takeaways

  • Inference benchmarks rebased from short chat to multi-step agent coding workloads with deep context expansion;
  • Benchmarked against DeepSeek V4 Pro on SemiAnalysis AgentX real coding traces as the reference workload;
  • Delivers up to 30x throughput per megawatt and 35x lower token cost compared to GB300 NVL72.
Read full story
Linked Models & Agents:
⚡ DeepSeek-V4-Pro⚡ Nvidia Rubin

Google DeepMind Releases Gemini 3.7 Flash Thinking Technical Paper: 1M Context Reasoning at Scale

Google DeepMind publishes technical paper on Gemini 3.7 Flash Thinking. Benchmark results show the model reaches 68.0% on SWE-bench Verified across a native 1M context window at 1/20th the token cost of traditional frontier models.

Key Takeaways

  • Google DeepMind publishes official technical whitepaper for Gemini 3.7 Flash Thinking;
  • 1M native context with adaptive thinking delivers robust multi-file code refactoring;
  • Scores 68.0% on SWE-bench with disruptive pricing of $0.15 / $0.60 per 1M tokens.
Read full story

DeepSeek Teases V4 Architecture: Trillion-Parameter MoE Slashing Coding Inference Cost by 80%

DeepSeek previewed next-gen V4 architecture featuring sparse MoE, dropping long-context coding token cost to $0.07/1M.

Key Takeaways

  • Evolved Multi-head Latent Attention reduces KV cache memory footprint by 60%
  • Logical error rates in long-range refactoring reduced by 42% over V3
  • Full open-weights release guaranteed with permissive commercial license
Read full story