OpenBMBOpen Source

MiniCPM5-1B

Compare this model

A lightweight, high-performance model developed by OpenBMB. It achieves efficient inference with only 1B parameters.

Parameters

10.8

Context Window

128K

License

Apache 2.0

Release Date

2026-05-01

Japanese Language Capability

🌐Multilingual

General multilingual model. Basic Japanese processing is possible, but inferior to specialized models.

API Pricing

API pricing for this model is not yet available

Strengths

    Weaknesses

      Use Cases

        Deep Analysis

        Parameters

        1.08B

        Dense LlamaForCausalLM architecture

        Artificial Analysis Intelligence Index

        12

        #2 among comparable open-weight models

        Context Window

        131,072 tokens

        128K native

        License

        Apache 2.0

        Fully open-source

        Price (Self-hosted)

        $0.00

        Free to run locally

        AIME 2025 (Thinking)

        40.42

        vs LFM2.5-1.2B: 31.88

        Strengths

        • Exceptional 1B-class SOTA in tool use, code, and reasoning tasks
        • Hybrid Think/No-Think reasoning via same checkpoint for deployment flexibility
        • Superior efficiency with up to 31x fewer output tokens than reasoning peers it surpasses

        Weaknesses

        • Limited general world knowledge and instruction following compared to larger 4B+ models
        • Performance lags on complex scientific reasoning (e.g., GPQA Diamond)
        • Slower generation speed than larger, optimized models on high-end hardware

        Competitor Comparison

        ModelArenaSWEGPQAPrice
        Qwen3-0.6B/thinkN/AN/AN/AFree (Apache 2.0)
        LFM2.5-1.2B-ThinkingN/AN/A34.85Free
        Qwen3.5-0.8B/thinkN/AN/AN/AFree

        MiniCPM5-1B is a 1.08 billion parameter dense language model from OpenBMB, released in May 2026 under the Apache 2.0 license. It is positioned as the state-of-the-art (SOTA) model within the 1B-class open-weight category, with its primary strengths in agentic tool use, code generation, and competitive mathematics. Its core innovation lies not in raw size, but in its post-training methodology: a three-stage pipeline of Supervised Fine-Tuning (SFT), Reinforcement Learning (RL), and On-Policy Distillation (OPD). This RL+OPD process trains specialized domain teachers (for math, code, QA) and distills them into a single model, yielding a +16-point average score improvement over the SFT-only baseline while drastically reducing overlong, inefficient responses.

        The model is architected for efficiency and on-device deployment. It uses the standard LlamaForCausalLM architecture, ensuring compatibility with all major inference engines (vLLM, SGLang, llama.cpp, Ollama, etc.). A key feature is its hybrid reasoning capability, toggled via a `` template and enable_thinking parameter, allowing a single checkpoint to function as both a fast conversational assistant and a deliberate reasoner. With a 128K context window and a footprint of under 1GB at Q4 quantization, it is explicitly designed for local assistants, coding agents, tool-use workflows, and resource-constrained edge scenarios where latency and token efficiency are critical. Benchmarks show it significantly outperforms models like Qwen3-0.6B and LFM2.5-1.2B in areas like AIME mathematics and τ2-Bench agentic tasks.

        Analysis generated: 2026-07-17