A The ARC Atlas

Appendix H · The field kit

The essential ARC-AGI links, in one place.

Browse 59 links to official benchmarks, research, developer docs, open code, competitions, community sites, and selected winner interviews. Filter by website or theme, or search by text.

59
Curated links
7
Themes
8
Websites

How to use this

This curated shelf combines primary sources with selected winner interviews, organized as a path from understanding ARC-AGI to running an agent and preparing a competition submission.

For the broader, living collection of community papers, videos, tools, solutions, courses, and tutorials, use the ARC Prize resource library ↗.

Winner notes are Atlas paraphrases. Except for the NVARC interview, full transcripts were unavailable during review, so each card identifies the synopsis or on-page material used.

Narrow the field

Filter the library.

Combine text search with website and theme filters. Each card opens the original resource in a new tab.

Search
59 of 59 resources
Website
Theme
6 links

Start here

The best entry points for understanding ARC-AGI and finding the wider research ecosystem.

11 links

Official code

Every public repository currently maintained by the ARC Prize Foundation on GitHub.

Featured · Agents

ARC-AGI-3 Agents

Reference agents and approaches for ARC-AGI-3. A particularly useful place to study how others structure interactive agents.

GitHub · Open ↗
SDK

ARC-AGI Toolkit

The Python interface and tooling layer for interacting with ARC-AGI-3 environments locally or through the API.

GitHub · Open ↗
Dataset

ARC-AGI-2

Official ARC-AGI-2 dataset, evaluation data, and benchmark materials.

GitHub · Open ↗
Starter

ARC-AGI-3 Kaggle Starter

Starter project for packaging and submitting an ARC-AGI-3 agent on Kaggle.

GitHub · Open ↗
Evaluation

ARC-AGI benchmarking

Open tooling and results for testing baseline language-model performance on ARC-AGI-1 and ARC-AGI-2.

GitHub · Open ↗
Evaluation

ARC-AGI-3 benchmarking

Code and artifacts for evaluating frontier systems on the interactive ARC-AGI-3 benchmark.

GitHub · Open ↗
Documentation

ARC Prize docs

Source repository for the official ARC-AGI-3 developer documentation.

GitHub · Open ↗
Engine

ARCEngine

The simple Python game engine underlying ARC-AGI-3 environments.

GitHub · Open ↗
Community

Community Leaderboard

Open submissions showcasing novel, general-purpose ARC-AGI methods.

GitHub · Open ↗
Analysis

Hierarchical Reasoning Model analysis

ARC Prize Foundation's analysis of the Hierarchical Reasoning Model and its ARC-AGI results.

GitHub · Open ↗
GitHub

ARC Prize GitHub organization

Browse the complete organization and follow newly released ARC Prize projects.

GitHub · Open ↗
12 links

Benchmarks, tasks & results

Official benchmark overviews, playable tasks, leaderboards, human baselines, and technical reports.

Benchmark

ARC-AGI-1

The original 2019 static abstraction and reasoning benchmark.

ARC Prize · Open ↗
Benchmark

ARC-AGI-2

The 2025 benchmark designed to stress-test frontier reasoning systems.

ARC Prize · Open ↗
Benchmark

ARC-AGI-3

The interactive benchmark for agents that must explore, infer goals, model, plan, and adapt.

ARC Prize · Open ↗
Task explorer

Explore all ARC tasks

Browse and interact with the public task collection across ARC-AGI versions.

ARC Prize · Open ↗
Playground

Play ARC-AGI-3

Play the public interactive environments and inspect how the games work firsthand.

ARC Prize · Open ↗
Leaderboard

Verified leaderboard

Verified model and system results across ARC-AGI-1, ARC-AGI-2, and ARC-AGI-3.

ARC Prize · Open ↗
Leaderboard

Community leaderboard

Community-submitted, reproducible ARC-AGI approaches and results.

ARC Prize · Open ↗
Human baseline

ARC-AGI-3 human leaderboard

Human performance and action-efficiency baselines for ARC-AGI-3 games.

ARC Prize · Open ↗
Paper

ARC-AGI-3 technical report

Benchmark design, scoring framework, environment construction, validation, and human calibration.

ARC Prize · Open ↗
Dataset

ARC-AGI-3 human dataset

Methodology and results from the large-scale human baseline study for ARC-AGI-3.

ARC Prize · Open ↗
Paper

ARC-AGI-2 technical report

The rationale, construction, human testing, and frontier-system results behind ARC-AGI-2.

ARC Prize · Open ↗
Paper

ARC Prize 2024 technical report

Competition findings, winning approaches, open implementations, and lessons from ARC-AGI-1.

ARC Prize · Open ↗
7 links

Build for ARC-AGI-3

The official path from a first local agent to API access, scoring, and a competition submission.

9 links

Competitions & prizes

Current tracks, Kaggle entry points, paper prizes, rules, and prior ARC Prize competitions.

7 links

News & community

Official channels for releases, events, discussion, videos, and competition updates.

7 links

Winner talks & interviews

First-party winner deep dives and one independent team interview, with Atlas viewing notes and an explicit evidence basis for every summary.

Winner video · 36:04

ARC Prize 2025 Top Score 1st Place: NVARC

Ivan and JF explain how NVARC made test-time training competitive under Kaggle constraints: move expensive puzzle generation offline, distill synthetic curricula into compact models, then adapt those models to each evaluation task. An improved ARChitects-style model supplied most of the score; a smaller Tiny Recursive Model added a weaker but usefully different ensemble vote.

YouTube · Watch ↗
Summary & key points

2025 top score · 1st place · NVARC · 2025-12-05

  • The team pivoted toward synthetic data after early reasoning-model experiments could not run within the offline time and hardware limits.
  • Synthetic puzzles were generated from human H-ARC descriptions, with higher-cost code generation performed offline and distilled into a small submission model.
  • Test-time fine-tuning was decisive: the TRM component moved from effectively zero to roughly ten percent in a constrained two-hour run.
  • A modest standalone component can still help when its errors differ from the stronger ensemble member.
  • Daily validation, bug fixing, and resistance to leaderboard overfitting were part of the method—not merely competition hygiene.

Evidence basis: Full YouTube transcript, reviewed 2026-07-29.

Winner video · 38:42

ARC Prize 2025 Top Score 2nd Place: the ARChitects

The 2024 winners describe the system they rebuilt for ARC-AGI-2: a 2D-aware masked-diffusion language model, recursive self-refinement, and perspective-based scoring. The architecture treats a grid less like a text string and gives candidate answers repeated opportunities to repair themselves.

YouTube · Watch ↗
Summary & key points

2025 top score · 2nd place · the ARChitects · 2025-12-05

  • The 2025 system moved beyond the team's 2024 autoregressive, text-like grid formulation.
  • Two-dimensional positional structure is part of the representation, not something the model must rediscover from a flattened sequence.
  • Masked diffusion supports iterative answer construction rather than a single left-to-right commitment.
  • Recursive refinement and perspective scoring turn generation into a propose, inspect, and repair loop.

Evidence basis: Verified ARC Prize video synopsis.

Winner video · 48:31

ARC Prize 2025 Top Score 3rd Place: MindsAI

MindsAI presents a deliberately engineered test-time-training pipeline. Test-time fine-tuning, augmentation ensembles, tokenizer dropout, and pretraining changes work together; the result is less a single trick than a stack designed to make task-local adaptation robust.

YouTube · Watch ↗
Summary & key points

2025 top score · 3rd place · MindsAI · Tufa Labs · 2025-12-05

  • Test-time fine-tuning remains the central adaptation mechanism.
  • Augmentation ensembles expose the solver to multiple equivalent views of the same transformation.
  • Tokenizer dropout reduces dependence on one brittle encoding of grids.
  • Pretraining choices and inference-time machinery must be designed as one system.

Evidence basis: Verified ARC Prize video synopsis.

Winner video · 39:08

ARC Prize 2025 Paper Award 1st Place: TRM

Alexia Jolicoeur-Martineau explains TRM as a small recurrent reasoner that improves an answer through repeated internal refinement. Separate latent and answer states let one network revisit the same puzzle many times, showing that useful recursive computation does not require a giant pretrained model.

YouTube · Watch ↗
Summary & key points

2025 paper award · 1st place · Tiny Recursive Model · 2025-12-05

  • TRM uses roughly seven million parameters in a single recursive network.
  • It maintains distinct latent-reasoning and answer states.
  • Deep supervision teaches intermediate refinements rather than rewarding only the final output.
  • Its ARC-AGI-2 drop, despite strong ARC-AGI-1 performance, helps locate the remaining difficulty in task generalization rather than model size alone.

Evidence basis: Verified ARC Prize video synopsis and on-page YouTube summary.

Winner video · 35:07

ARC Prize 2025 Paper Award 2nd Place: SOAR

SOAR combines evolutionary program synthesis with self-improvement. It searches for executable solutions and uses the resulting traces to fine-tune its language model, so later searches begin with a better proposal distribution.

YouTube · Watch ↗
Summary & key points

2025 paper award · 2nd place · SOAR · 2025-12-05

  • Evolution supplies an explicit test-and-select loop over candidate programs.
  • The model learns from its own search traces rather than relying on a hand-authored ARC DSL.
  • Search and learning alternate: execution produces feedback, and feedback reshapes later proposals.
  • The reported ARC-AGI-1 result reaches up to 52 percent without human solution datasets.

Evidence basis: Verified ARC Prize video synopsis.

Winner video · 37:51

ARC Prize 2025 Paper Award 3rd Place: ARC without Pretraining

Isaac Liao presents ARC solving as compression: train only on the current puzzle and prefer the shortest explanation that reproduces its demonstrations. The result is a neural code-golf system grounded in minimum description length, with no pretrained model or external task data.

YouTube · Watch ↗
Summary & key points

2025 paper award · 3rd place · CompressARC · 2025-12-05

  • Learning occurs from scratch on one puzzle rather than through a large pretrained prior.
  • Minimum description length ranks hypotheses by how compactly they explain the observed transformation.
  • Compression acts as an inductive bias against arbitrary memorization.
  • The approach is evidence that meaningful ARC performance can emerge from task-local learning alone, although ARC-AGI-2 remains difficult.

Evidence basis: Verified ARC Prize video synopsis and on-page YouTube summary.

Winner video · 1:24:35

ARC-AGI-3 winning team: Millennia of minds, compressed into words

The Tufa Labs team uses its ARC-AGI-3 preview experience to separate curiosity from competence. StochasticGoose's action-effect prior worked on visible preview games but performed worse under action-efficiency scoring and on unseen environments. The discussion reframes the benchmark around goal acquisition, causal world models, and recovery when an agent commits to the wrong objective.

YouTube · Watch ↗
Summary & key points

ARC-AGI-3 preview · StochasticGoose · Tufa Labs · 2026-07-01

  • A useful preview heuristic—favor actions that change the frame—can confuse novelty with progress.
  • Action-efficiency scoring and unseen games expose policies that explore broadly without learning which changes matter.
  • Priors are necessary to bootstrap learning, but a strong prior can become a trap when the environment violates it.
  • An agent needs to revise goals as well as tactics; optimizing the wrong inferred objective creates a self-reinforcing failure loop.
  • The deeper target is a compact causal world model that supports counterfactual planning, not a larger store of remembered frames.

Evidence basis: Verified chaptered description and on-page YouTube summary; the interview discloses Tufa Labs as an MLST sponsor.

YouTube first · local synths follow

ARC Radio

01 / 12 🦉 8-Bit Chiptune Playlist 🦉 Retro Video Game Music for Nostalgic Vibes YouTube · external stream

The 4 requested YouTube selections play first and require a network connection; their titles refresh from YouTube when they load. 8 original AI-composed retro-game loops follow and are generated live in your browser. Audio keeps playing when you close this panel and stops only when you press Pause.

Field notes · reader review

Help improve this guide

Found a wrong score, broken link, missing paper, or unclear passage? Tell us what you noticed.

How useful is it? optional
- / 5
What kind of note? optional

No account, no tracking. Sent straight to the maintainer.