SDSignal Desk

Microsoft Research finds 8% of coding-agent sessions drive 44% of AI costs, plus a KLS proof

· Updated · Signal Desk newsroom

Analysis of reporting by Microsoft Research. How we work

Image: Microsoft Research

This Research Focus roundup covers translation, tokenizers, a Tokyo internship and a 31-year-old geometry problem. The most practical item: long coding sessions that need context compaction are a sliver of usage but nearly half the bill, and background compaction can cut it.

Key takeaways

  • In 13.5 million coding sessions, fewer than 8% needed context compaction, but they accounted for 44% of AI processing costs.
  • Microsoft’s APEC method prepares summaries in the background; it reports cost cuts up to 25.4% and 9.6% faster execution, with better coding performance.
  • COMPACTIONBENCH is a new benchmark for how agents handle compaction.
  • Microsoft says research resolved the KLS conjecture, open for 31 years, with independent validation and computer-assisted formal verification.
  • The Latent Core Tokenizer produced more linguistically meaningful tokens across 104 languages at comparable efficiency.

Where coding-agent costs hide

This edition of Microsoft Research Focus, hosted by Anson Ho, includes a study of 13.5 million coding sessions. Fewer than 8% needed context compaction, the process of summarizing earlier work when a session runs out of room, yet those sessions accounted for 44% of total AI processing costs. That is a striking concentration of spend in a small slice of usage.

Microsoft researchers built COMPACTIONBENCH to evaluate how agents handle compaction, and a method called APEC that prepares summaries in the background instead of stopping the agent. They report cost reductions of up to 25.4% and execution time down 9.6%, with improved coding performance. These are Microsoft’s numbers and need replication, but the direction is right. Long sessions are where teams get the most value and where bills climb, so cheaper long tasks are what make agents usable for real engineering. The previous edition had the same theme of cheaper, more honest agents (Edition #97), as does Microsoft’s Agent Lightning framework for training agents in the harness they ship in (coverage).

The KLS conjecture

Microsoft says new research has resolved the KLS conjecture, a central open problem in high-dimensional geometry for 31 years, with independent validation and computer-assisted formal verification. In plain terms, it shows that simple flat cuts can find the narrowest bottlenecks of a broad class of distributions within a fixed factor, regardless of dimension. That matters for understanding how efficiently randomized algorithms run. The roundup doesn’t say what role, if any, AI played, so none should be assumed. It lands amid other claimed breakthroughs on long-open problems, where verification and access have become the debate (OpenAI’s math claims).

Tokenizers and fairness across languages

The Latent Core Tokenizer identifies reusable word parts before building a shared vocabulary. Across 104 languages it produced more linguistically meaningful tokens at comparable efficiency and improved results on four multilingual benchmarks. Tokenizers built mainly to compress text tend to serve some languages better than others, so preserving linguistic structure is a quiet step toward models that work well beyond English.

Translation and the rest

The translation segment is more aspiration than result: a pointer to a podcast conversation with Applied Science Manager Jinyu Li about progress and remaining challenges toward a universal translator. It’s a worthy goal, and one where errors in medical, legal or diplomatic settings carry real harm, so evidence should come before excitement. The internship segment profiles a computer vision researcher who worked with robotics and physical-intelligence researchers at the Tokyo lab. Each item links to a fuller write-up on the Microsoft Research blog. More in our Microsoft coverage and research coverage.

Who feels it

Engineering teams using coding agents
Long sessions drive a disproportionate share of cost; background compaction could cut bills.
Agent tool builders
A compaction benchmark to compare how products handle long-running work.
Multilingual AI developers
Structure-aware tokenization without sacrificing efficiency.
Mathematicians and algorithm researchers
A resolved KLS conjecture removes a major obstacle in analyzing randomized algorithms.

What to watch

  1. Release of COMPACTIONBENCH and APEC for outside testing.
  2. Background compaction in commercial coding agents.
  3. Peer response to the KLS proof.
  4. Whether the Latent Core Tokenizer reaches production models.

FAQ

What is context compaction in coding agents?

Summarizing earlier work when a session runs out of context room so the agent can continue.

How much do long coding sessions cost?

In Microsoft’s study, fewer than 8% of sessions needed compaction but they made up 44% of AI processing costs.

What is the KLS conjecture?

A 31-year-old problem in high-dimensional geometry about how well simple cuts find bottlenecks in distributions; Microsoft says it has been resolved.

Read the original

Continue at the source.

Microsoft Research

Companies: Microsoft

More on Microsoft

All Microsoft coverage →