A Fully Open and Extremely Efficient Foundation Model for Math and Agentic Search

Zhongguancun Academy · Zhongguancun Institute of Artificial Intelligence

📄 Tech Report  ·  Model  ·  Data  ·  📊 Results  ·  Training Code  ·  💬 WeChat Community

ZGCM-1 is a 7.39B-parameter dense language model trained from scratch, built for mathematical reasoning and tool-assisted search. It combines deliberate internal thinking with active information gathering, supporting 256K-token context and both thinking and direct-response modes in a single model.

The project brings together an efficient hybrid-attention architecture, FP8 training with Muon, progressive long-context mid-training, and general-agentic supervised fine-tuning. Researcher-directed AI agents contribute throughout development, from data curation and cluster operations to evaluation and deployment.

• Math and reasoning at 7B scale. ZGCM-1 achieves 97.13% on MATH-500, 75.00% on AIME 2026, and 70.42% on HMMT 2025, with the best average rank across the report's 14 reasoning benchmarks among the seven compared 7B–8B models.
• Search beyond model memory. Multi-step tool use reaches 63.09% on WebWalkerQA, 19.43% on BrowseComp, and 62.00% on Binary Function Search.
• Efficient long context. Gated sliding-window and global attention deliver 3.94× training throughput at 256K compared with full attention in the report's architecture experiments. The report estimates an approximately 4.2× improvement in 16K pretraining time-to-loss from combined architecture, precision, optimizer, and normalization gains.
• An open research recipe. This repository provides data-processing, pretraining, mid-training, and SFT workflows, with stage-specific configurations and runtime documentation. Explore the model and data, or get started with the training workflows.

The following results are from the technical report, using the 256K SFT checkpoint in thinking mode. Non-agentic evaluations use temperature 1.0, top-p 1.0, and mean pass@1 over 32 runs unless otherwise specified.

Selected rows and models from Table 2; bold marks the best score in each displayed row. The full evaluation covers 20 benchmarks, including code, knowledge, and instruction following.

Source: Tables 3–4. Web research allows up to 64 search-and-read steps. Binary Function Search uses a separate protocol on 50 tasks from 10 held-out projects.

The training recipe described in the report has three main stages:

1. Pretraining: approximately 4.19T tokens, combining curriculum-based data mixing with hybrid FP8 precision and Muon optimization.
2. Mid-training: approximately 600B tokens with context extended from 16K → 64K → 256K. Interaction traces are reformulated as Markov Decision Process (MDP) state-action transitions to supervise individual decisions.
3. Supervised fine-tuning: joint general and agentic training with mixed thinking/direct-response examples, execution-verified trajectories, and assistant-only loss. The report also explores mixed RL for mathematics and code.

For model and dataset usage, see the corresponding Hugging Face cards. Model specifications, evaluation details, and figures are presented in ZGCM-1: A Fully Open and Extremely Efficient Foundation Model for Math and Agentic Search.

Choose the workflow you want to reproduce and follow its setup instructions. Each top-level directory contains its own code, configurations, and runtime documentation.

Enter the relevant directory and follow its README to prepare the environment, data, tokenizer, and checkpoints, then launch the workflow with the provided configuration.

Scan the QR code to join the ZGCM-1 community group. Click the image to open it at full size. If the code has expired, open an Issue and ask the maintainers for the latest one.

The repository is distributed under the MIT License. See the stage directories for bundled third-party licenses and notices, and the model and dataset cards for their respective terms.

If you find ZGCM-1 useful in your research, please cite our technical report:

@misc{zgcm1,
  title={ZGCM-1: A Fully Open and Extremely Efficient Foundation Model for Math and Agentic Search},
  author={Jiyan He and Guang Liang and Hao Liu and Haoxiang Guan and Jinbo Sun and Junyi Guo and Wenjun Feng and Yantai Xie and Yifei Shen and Bin Shao and Chuyang Wei and Kai Chen and Kexin Zhou and Minghang Zhu and Shuxin Zheng and Tie-Yan Liu and Taine Zhao and Wenhui Zhu and Xueyin Xu and Xiaoqing Zhang and Yatao Li and Yuxuan Ren},
  year={2026},
  eprint={2609.13356},
  archivePrefix={arXiv},
  primaryClass={cs.AI},
  url={https://arxiv.org/abs/2609.13356}
}