モデル情報

DeepSeek-V3.2-GGUF

unsloth · DeepSeek-V3.2-GGUF

We introduce **DeepSeek-V3.2**, a model that harmonizes high computational efficiency with superior reasoning and agent performance. Our approach is built upon three key technical breakthroughs: 1. **DeepSeek Sparse Attention (DSA):** We introduce DSA, an efficient attention mechanism that substantially reduces computational complexity while preserving model performance, specifically optimized for long-context scenarios. 2. **Scalable Reinforcement Learning Framework:** By implementing a robust RL protocol and scaling post-training compute, *DeepSeek-V3.2* performs comparably to GPT-5. Notably, our high-compute variant, **DeepSeek-V3.2-Speciale**, **surpasses GPT-5** and exhibits reasoning proficiency on par with Gemini-3.0-Pro. - *Achievement:* 🥇 **Gold-medal performance** in the 2025 International Mathematical Olympiad (IMO) and International Olympiad in Informatics (IOI). 3. **Large-Scale Agentic Task Synthesis Pipeline:** To integrate **reasoning into tool-use** scenarios, we developed a novel synthesis pipeline that systematically generates training data at scale. This facilitates scalable agentic post-training, improving compliance and generalization in complex interactive environments. We have also released the final submissions for IOI 2025, ICPC World Finals, IMO 2025 and CMO 2025, which were selected based on our designed pipeline. These materials are provided for the community to conduct secondary verification. The files can be accessed at `assets/olympiad_cases`.

翻訳待ちのため原文を表示しています。

license:mit
コンテキスト長非公開
入力 → 出力待核验 → 待核验
モデルウェイト未確認
情報更新日時2026/11/2 19:16:25
OVERVIEW

モデル紹介

We introduce **DeepSeek-V3.2**, a model that harmonizes high computational efficiency with superior reasoning and agent performance. Our approach is built upon three key technical breakthroughs: 1. **DeepSeek Sparse Attention (DSA):** We introduce DSA, an efficient attention mechanism that substantially reduces computational complexity while preserving model performance, specifically optimized for long-context scenarios. 2. **Scalable Reinforcement Learning Framework:** By implementing a robust RL protocol and scaling post-training compute, *DeepSeek-V3.2* performs comparably to GPT-5. Notably, our high-compute variant, **DeepSeek-V3.2-Speciale**, **surpasses GPT-5** and exhibits reasoning proficiency on par with Gemini-3.0-Pro. - *Achievement:* 🥇 **Gold-medal performance** in the 2025 International Mathematical Olympiad (IMO) and International Olympiad in Informatics (IOI). 3. **Large-Scale Agentic Task Synthesis Pipeline:** To integrate **reasoning into tool-use** scenarios, we developed a novel synthesis pipeline that systematically generates training data at scale. This facilitates scalable agentic post-training, improving compliance and generalization in complex interactive environments. We have also released the final submissions for IOI 2025, ICPC World Finals, IMO 2025 and CMO 2025, which were selected based on our designed pipeline. These materials are provided for the community to conduct secondary verification. The files can be accessed at `assets/olympiad_cases`.

主な特徴

特点摘要待依据来源补齐,不凭模型名称推断能力。

制約と注意点

具体的な制約を判断する出典が不足しています。実際の性能、遅延、データ方針、ライセンス、提供期間を確認してください。

PRICING & COST

出典別料金と費用分析

料金はチャネル・地域・設定によって異なります。各チャネルの料金は個別に表示し、提供元の統一公式料金とは見なしません。

出典・チャネル入力出力課金単位収集日時
確認可能な料金がありません。出典を確認してください。

月額の基本トークン費用を試算

—

試算はキャッシュ割引、段階料金、マルチモーダル追加料金、検索、税金、追加推論出力を含みません。

INDEPENDENT BENCHMARKS

公開評価と実行設定

暂无已采集的可核验公开评分。模型未上榜不代表能力较低。

収録済みの全ランキング →

よくある質問

オープンウェイトなら無料で商用利用できますか?

必ずしもそうではありません。バージョン別のライセンス、商用条件、利用方針を確認してください。自前運用には計算資源と保守費用も必要です。

これはリアルタイムの請求料金ですか?

収集日時付きの料金スナップショットです。最新のバージョン、地域、割引、課金方式は各チャネルで確認してください。

出典と追跡記録

许可证:mit。模型介绍与第三方评测均以原来源的具体版本和方法为准。