SU-01-GGUF

SU-01: Achieving Gold-Medal-Level Olympiad Reasoning via Simple and Unified Scaling

A compact 30B-A3B reasoning model for rigorous mathematical and scientific olympiad problem solving.

The model was presented in the paper Achieving Gold-Medal-Level Olympiad Reasoning via Simple and Unified Scaling.

<p align="center"> <img src="https://github.com/Simplified-Reasoning/SU-01/raw/main/page/source_html/simplex-pipeline-hires.png" alt="SU-01 training and inference pipeline" width="100%"> </p> <p align="center"> <a href="http://arxiv.org/abs/2605.13301"> <img src="https://img.shields.io/badge/Technical_Report-A42C25?style=for-the-badge&logo=arxiv&logoColor=white" alt="Technical Report"> </a> <a href="https://simplified-reasoning.github.io/SU-01/"> <img src="https://img.shields.io/badge/Project_Page-4285F4?style=for-the-badge&logo=googlechrome&logoColor=white" alt="Project Page"> </a> <a href="https://github.com/Simplified-Reasoning/SU-01"> <img src="https://img.shields.io/badge/SU--01-000000?style=for-the-badge&logo=github&logoColor=white" alt="GitHub"> </a> <a href="https://huggingface.co/Simplified-Reasoning/SU-01"> <img src="https://img.shields.io/badge/SU--01-fcd022?style=for-the-badge&logo=huggingface&logoColor=000" alt="Hugging Face Model"> </a> </p> <div align="center"> <p> <a href="#introduction" style="text-decoration: none;">📖 Introduction</a> • <a href="#key-highlights" style="text-decoration: none;">🏆 Key Highlights</a> </p> <p> <a href="#getting-started" style="text-decoration: none;">🚀 Getting Started</a> • <a href="#training-code" style="text-decoration: none;">🔧 Training Code</a> • <a href="#test-time-scaling" style="text-decoration: none;">🧪 Test-Time Scaling</a> • <a href="#evaluation" style="text-decoration: none;">📊 Evaluation</a> </p> <p> <a href="#acknowledgement" style="text-decoration: none; ">✨ Acknowledgement</a> • <a href="#citation" style="text-decoration: none;">📝 Citation</a> </p> </div>

---

<a id="introduction"></a>

📖 Introduction

SU-01 is a 30B-A3B olympiad reasoning model trained with a simple and unified post-training recipe for mathematical and scientific problem solving. The goal is to turn a broadly capable post-trained reasoning backbone into a rigorous long-horizon proof solver without relying on external tools, code execution, or dedicated symbolic solvers.

The recipe first applies reverse-perplexity curriculum SFT on roughly 338K sub-8K-token trajectories to install explicit, proof-oriented reasoning behavior. It then uses 200 steps of two-stage reinforcement learning to improve both answer-seeking ability and complete-proof quality. Finally, SU-01 uses a multi-round generate-verify-revise loop at inference time, enabling coherent natural-language reasoning trajectories beyond 100K tokens on difficult olympiad problems.

In competition-style evaluations, test-time scaling brings SU-01 to 35 points on IMO 2025 and 35 points on USAMO 2026, reaching gold-medal-level performance. SU-01 also exceeds the gold cutoff on IPhO 2024/2025 and substantially improves over similarly sized models on proof-level benchmarks such as IMO-ProofBench.

---

<a id="key-highlights"></a>

🏆 Key Highlights

• Reverse-perplexity curriculum SFT: sorts long-CoT training examples by descending PPL within each epoch, exposing the model first to teacher trajectories most mismatched with the current policy.
• Two-stage RL: starts with verifiable-reward training for answer-seeking behavior, then shifts to proof-quality optimization with self-refinement and experience replay.
• Long-horizon proof repair: uses iterative generation, verification, issue localization, and refinement to produce complete olympiad-style solutions.
• Gold-medal-level results: reaches 35 points on both IMO 2025 and USAMO 2026 with test-time scaling, and passes IPhO 2024/2025 gold lines.

<p align="center"> <img src="https://github.com/Simplified-Reasoning/SU-01/raw/main/page/source_png/proofbench_overall.png" alt="SU-01 ProofBench overview" width="80%"> </p>

Gold-Medal Competition Results

IMO 2025

USAMO 2026

* denotes results graded by human experts. Medal lines for IMO 2025 are 35/28/19 points for gold/silver/bronze, and medal lines for USAMO 2026 are 25/18/11 points.

Getting Started

This Hugging Face repository hosts the model weights. The training and evaluation code is maintained in the GitHub repository:

• GitHub repo: Simplified-Reasoning/SU-01
• Training code: su01-train-slime
• Evaluation code: su01-eval

Installation

Clone the code repository:

git clone https://github.com/Simplified-Reasoning/SU-01.git
cd SU-01

The project uses the slimerl/slime:nightly-dev-20260202c Docker image.

docker pull slimerl/slime:nightly-dev-20260202c

docker run --gpus all --ipc=host --network=host -it \
  -v "$PWD":/workspace/SU-01 \
  -w /workspace/SU-01/su01-train-slime \
  slimerl/slime:nightly-dev-20260202c \
  /bin/bash

Inside the container, install the local training package:

pip install -e . --no-deps --no-index --disable-pip-version-check --no-build-isolation

Adjust cluster mounts, model paths, data paths, Ray environment variables, and reward-server URLs according to your infrastructure.

---

<a id="training-code"></a>

🔧 Training Code

The released training code contains the three major training stages used by SU-01:

su01-train-slime/scripts
├── sft.sh          # Stage 1: reverse-perplexity curriculum SFT
├── coarse_rl.sh    # Stage 2: coarse RL with verifiable rewards
└── refined_rl.sh   # Stage 3: refined RL with proof rewards, self-refinement, and experience replay

GitHub links:

• su01-train-slime/scripts
• sft.sh
• coarse_rl.sh
• refined_rl.sh

---

<a id="test-time-scaling"></a>

🧪 Test-Time Scaling

SU-01 uses a model-internal verification-and-refinement loop:

1. Generate an initial complete solution.
2. Verify the full proof and produce a structured critique or bug report.
3. Refine the solution conditioned on the critique.
4. Repeat until the solution is accepted or the refinement budget is exhausted.

This expands the model's own natural-language proof-search computation rather than calling an external theorem prover, symbolic solver, or code executor. In the reported USAMO 2026 TTS traces, initial solution generations have a median length of approximately 106K tokens, while refinement stages have a median length of approximately 83K tokens.

The released TTS implementation is in su01-eval/decode, including direct decoding, TTS decoding, batch decoding, and SGLang server helpers. See su01-eval/decode/README.md for launch commands, input layout, decoding options, and smoke tests.

<p align="center"> <img src="https://github.com/Simplified-Reasoning/SU-01/raw/main/page/source_png/tts_action_length_distribution_1.png" alt="Test-time scaling action length distribution" width="80%"> </p>

---

<a id="evaluation"></a>

📊 Evaluation

Evaluation code is released under su01-eval. Use su01-eval/decode to generate direct or TTS predictions, and use su01-eval/verifiable_bench to score answer-verifiable benchmarks and FrontierScience Olympiad predictions.

See su01-eval/decode/README.md and su01-eval/verifiable_bench/README.md for commands, input formats, output formats, and configuration options.

Table 1: Performance on Answer-Verifiable Reasoning Tasks

AnswerBench, AMO-Bench, AIME 25/26, and FrontierScience-Olympiad are averaged over 4, 8, 8, and 4 runs, respectively. Avg. is the mean of AnswerBench, AMO-Bench, AIME 2025, AIME 2026, and FrontierScience-Olympiad.

Table 2: Performance on Non-Verifiable Benchmarks

FrontierScience-Research refers to the research subset of FrontierScience. For SU-01, x/y reports scores without and with TTS on IMO-ProofBench.

Table 3: Performance on Olympiad Competition Problems

For IPhO, x/y reports scores without and with TTS. Gold lines for IPhO 2024/2025 are 20.8/19.7 points. Medal lines for IMO 2025 are 35/28/19 points, and medal lines for USAMO 2026 are 25/18/11 points.

IPhO 2024/2025

IMO 2025

USAMO 2026

* denotes TTS results graded by human experts.

---

<a id="acknowledgement"></a>

✨ Acknowledgement

This work was supported by the Shanghai Artificial Intelligence Laboratory.

We thank the authors and maintainers of prior open research and infrastructure that made this work possible. In particular, we are grateful to DeepSeek for open-sourcing strong reasoning policies and generative reward models, which provided an important reference point for our work. IMO-Bench, AMO-Bench, and FrontierScience helped guide the overall system optimization by offering challenging mathematical and scientific reasoning benchmarks and evaluation protocols.

We also thank prior data efforts that supported our SFT and RL data curation, including DeepMath, NaturalReasoning, Eurus, OpenCodeReasoning, P1, and OPC, as well as the many public problem sources and communities that cannot all be listed here. We further acknowledge the broader open-source infrastructure ecosystem, including slime for training and SGLang for efficient inference and serving.

---

<a id="citation"></a>

📝 Citation

If you find SU-01 useful, please cite the project:

@misc{su012026,
  title={Achieving Gold-Medal-Level Olympiad Reasoning via Simple and Unified Scaling},
  author={Yafu Li and Runzhe Zhan and Haoran Zhang and Shunkai Zhang and Yizhuo Li and Zhilin Wang and Jiacheng Chen and Futing Wang and Xuyang Hu and Yuchen Fan and Bangjie Xu and Yucheng Su and Xinmiao Han and Chenxi Li and Haodi Lei and Yufeng Zhao and Zejin Lin and Qianjia Cheng and Tong Zhu and Xiaoye Qu and Ganqu Cui and Peng Ye and Yun Luo and Zhouchen Lin and Yu Qiao and Bowen Zhou and Ning Ding and Yu Cheng},
  year={2026},
  url={http://arxiv.org/abs/2605.13301}
}