Benchmarks · Long context & retrieval

GraphWalks

also: Graphwalks

Can a model reason across a context of up to a million tokens, connecting facts scattered through it, rather than simply retrieving one fact from it?

OpenAIReleased 14 April 2025Live

Long-context benchmarks often test retrieval: hide one fact in a long document and ask for it back. OpenAI released GraphWalks with GPT-4.1 in April 2025 to test something harder. The whole context is a graph, written as hundreds of thousands of edges between random names, and the model has to follow paths through it — every node exactly three steps from a given start, for instance. OpenAI said the task “cannot be solved sequentially”: the model must connect edges scattered across the whole input.

It became a standard long-context entry in both OpenAI’s and Anthropic’s launch tables through mid-2026, usually reported separately for contexts around 256,000 tokens and around one million. Scores at a million tokens stayed well below those at 256,000. Anthropic’s Opus 4.6 card also found errors in the published answers, which OpenAI corrected in February 2026. Because each lab runs its own version with its own prompt and grader, figures from different labs are only loosely comparable.

Both labs dropped it from their later launches. Google kept using it: its Gemini 4 Carbon table reported 96.2% on the 256k–1M split, against 66.8% for Claude Opus 5.5 and 71.8% for GPT-6 Astra. Google ran all of those models itself, so the comparison is internally consistent but has no independent check.

The set

The context is filled with a large directed graph written as a list of edges between random hexadecimal node names, and the model is asked either to perform a breadth-first search to a given depth or to list a node's parents. The answer is a set of nodes, scored by F1 against the true set. The dataset is split into problems of up to 128,000 tokens and problems of 256,000 to one million; the long split has 100 BFS problems at about 256,000 tokens and 100 at about one million.

Example

Perform a BFS from node abcd with depth 1.huggingface.co

Where it stands

There is no leaderboard: every published score is a lab's own run, and the labs have used different prompts, graders and subsets. OpenAI fixed wrong answers in the short split and reworded the BFS prompt in February 2026, after Anthropic's Opus 4.6 system card flagged the problem. Anthropic stopped reporting it after Claude Opus 4.8 and Mythos 5, and OpenAI's GPT-6 launch posts do not include it.

How the top score changed hands

Best reported score at each point the lead changed hands. Tap a marker for the entry.

  1. April 2025GPT-4.161.7% (BFS, under 128k)OpenAI's launch figure when it released the dataset; 19.0% on the over-128k BFS problems.
  2. February 2026Claude Opus 4.638.7% (BFS, 256k–1M)Anthropic's figure; its system card noted half the 256k–1M problems exceed the public API's 1M-token limit.
  3. April 2026Claude Mythos Preview80.0% (BFS, 256k–1M)Anthropic's figure, average of five trials.

Current best: Gemini 4 Carbon — 96.2% BFS F1 on the 256k–1M split, self-computed by Google for every model in its Carbon table: Carbon 96.2, Gemini 4 Argon 84.2, GPT-6 Astra 71.8, Claude Opus 5.5 66.8, Claude Fable 5.1 65.0. The best figure a lab has published for its own model on the same split is Anthropic's 80.0 for Claude Mythos Preview.

More long context & retrieval benchmarks