Artificial Intelligence1 min read

StateBench: Testing how language models track state changes over long documents

By · Published by Everything Blog

In short

The new StateBench framework rigorously tests language models on tracking dynamic information across long-form texts. Its structure splits challenges into four mathematical tiers, spanning from immutable values to intricate variable swapping. While recurrent architectures like Gated DeltaNet excel when trained for these duties, leading proprietary systems continue to falter on the most complex tracking scenarios over extended contexts.

Key points

  • Frontier models including Gemini 3.8 Flash, Claude Opus 5.5, and GPT-6 variants still str…: Frontier models including Gemini 3.8 Flash, Claude Opus 5.5, and GPT-6 variants still struggle with hard state tracking in long inputs.
  • The framework spans simple R-trivial immutable values up to General finite tasks involvin…: The framework spans simple R-trivial immutable values up to General finite tasks involving interconnected variable swaps.
  • Soluble tasks specifically test a model's ability to process self-referential updates tha…: Soluble tasks specifically test a model's ability to process self-referential updates that build upon prior states.

Sources checked by our analysis pipeline: 1

📄 Tech Report | 🤗 Data | 💻 Code

We’re introducing StateBench, a benchmark for long-context state tracking—how well language models keep track of information about entities in long documents as they evolve.

State tracking underlies tasks from reading code, where variables are assigned and reassigned, to following a story as characters physically move around and objects change hands. For example, if a mystery novel states that “John gave Mary the knife” right before a murder occurs, it’s important to know that the state of each character has changed. However, not all state-tracking problems are created equal: some require only finding the latest update; harder ones require following a chain of changes, where one missed step can throw off the final answer. For example, a harder variant of our mystery state tracking would be if John gave Mary the item in his backpack, with it previously known that Edward put a knife in John’s backpack.

Transformers have well-documented theoretical limits on hard variants of state tracking with long dependency chains, helping motivate recurrent and hybrid architectures such as Gated DeltaNet…

Artificial Intelligence