DeepSeek V4 Flash (0731) vs MiniMax M3

MiniMax M3 已从我们的目录下线。下方是它最后公布的价格;这个模型已无法调用,对比中的另一个模型仍可正常调用。

vs

什么时候选哪个

deepseek-v4-flash-0731 和 minimax-m3 都是纯文本输出模型,拥有 1000000-token 的上下文,其中 minimax-m3 在新鲜 token 上略便宜:每百万输入 $0.3、输出 $1.2,对比 $0.44 和 $1.32。deepseek-v4-flash-0731 在复用上保持优势,缓存读取 $0.044 对比 $0.06,大约低 1.4x,不过其 393216-token 的最大输出低于 524288 的上限。当您需要图像或视频输入、更大的最大输出或可关闭思考时,请选择 minimax-m3。对于缓存前缀占账单大头的纯文本聊天、代码和推理工作,请选择 deepseek-v4-flash-0731。

Benchmark 成绩

MiniMax M3:供应商没有公布 benchmark 成绩。

高于同类均值DeepSeek V4 Flash (0731)10 / 28
DeepSeek V4 Flash (0731) MiniMax M3 其他参测模型 同类均值 ★ 没有模型得分更高
SWE-Bench Pro
56%
N/A
Cybergym
76.7%
N/A
JobBench
41.3%
N/A
GPQA Diamond
89.9%
N/A
Agents' Last Exam
25.2%
N/A

供应商公布: Alibaba (Qwen) Alibaba (Qwen) Alibaba (Qwen) Alibaba (Qwen) Alibaba (Qwen) Alibaba (Qwen) Alibaba (Qwen) Anthropic Anthropic Anthropic Anthropic ByteDance DeepSeek DeepSeek Google Google Google Google MiniMax Moonshot OpenAI OpenAI OpenAI OpenAI OpenAI Tencent Z.ai Z.ai Z.ai Z.ai

价格

DeepSeek V4 Flash (0731) MiniMax M3 Δ
输入 / 1M token $0.44 $0.3 1.5×
输出 / 1M token $1.32 $1.2 1.1×
缓存读取 / 1M token $0.044 $0.06 0.73×
缓存写入 不单独收费 不单独收费 -

价格取自构建时的实时目录,最新价格见各模型页面。

两个模型所处的位置:全部 91 个按同一单位计费的聊天模型的每 1M token 输入价分布(对数刻度)

能力

DeepSeek V4 Flash (0731) MiniMax M3
工具调用 是 是
思考控制 是,但供应商未公布调节参数 可配置
结构化输出 是 -
提示词缓存 隐式(自动) 隐式(自动)
缓存有效期 no fixed TTL (evicted when unused) 未公布
最小缓存前缀 未公布 512 个 token

规格

DeepSeek V4 Flash (0731) MiniMax M3
输入模态 文本 文本 图像 视频
输出模态 文本 文本
发布日期 2026-07-31 2026-06-01
上下文窗口 1,000,000 1,000,000
最大输出 393,216 524,288
思考参数 -
  • thinking.type
  • reasoning_split
可选值 -
thinking.type
  • adaptive
  • disabled
reasoning_split
  • boolean
默认值 - adaptive:思考开启,由模型判断何时需要额外推理

规格照录自各供应商的文档;供应商没有公布的项目,对应的行直接省略,不做推断。 完整来源: DeepSeek V4 Flash (0731) · MiniMax M3

同一条提示词,两个模型,经网关实测

提示词 Explain to a CFO, in exactly three sentences, why our LLM bill doubled after we enabled reasoning. 检查 恰好 3 句

DeepSeek V4 Flash (0731) 通过 · 3 sentences

Enabling reasoning mode prompts the model to generate extensive internal chain-of-thought tokens before answering, often multiplying total token output per query by several times. This directly inflates costs because we are billed per token, and these reasoning tokens are processed at a premium compute tier that carries a higher price per million tokens. However, this spend buys measurably higher accuracy and fewer failed calls, so we are tracking it against specific error-reduction KPIs to ensure the ROI justifies the increase.

输出 365 tok (+266 思考) 延迟 5.1 s

MiniMax M3 通过 · 3 sentences

Reasoning models don't just answer — they first generate extensive internal "thinking" tokens to work through the problem step-by-step, and you're billed for all of those tokens even though users never see them. A query that previously cost ~200 tokens may now cost 2,000–10,000 once reasoning is enabled, multiplying per-query spend by roughly 5–50x while the visible output stayed the same size — that's the doubling. The lever is tuning: cap reasoning effort on simple queries, cache the reasoning traces, and reserve the full reasoning model for only your hardest 10–20% of requests, which typically restores 60–80% of the savings.

输出 764 tok (+629 思考) 延迟 3.5 s

指令遵循(恰好三句,数得出来)、受众适配(对 CFO 说话的口吻),以及下方 token 计数暴露出的隐藏思考计费差额。

提示词 This function is supposed to return the longest run of consecutive equal items, but callers report it is off by one on single-element inputs and misses runs that end at the last index. Fix it and explain the bug in one paragraph. 检查 修复通过测试

DeepSeek V4 Flash (0731) 通过 · 8/8 cases

```python def longest_run(xs): if not xs: return 0 best = 1 cur = 1 for i in range(1, len(xs)): if xs[i] == xs[i - 1]: cur += 1 best = max(best, cur) else: cur = 1 return best ``` The original bug stems from initializing `cur` to 0 and only incrementing it when adjacent elements are equal, which counts the number of *equal transitions* rather than the actual run length—so every run of length L is reported as L−1, and a single‑element run (with no transitions) yields 0. Moreover, because `best` is updated only inside the equality branch, it never accounts for a run that ends at the last element if that run is longer than any previously seen (though the real issue remains the off‑by‑one). […]

输出 1268 tok (+1016 思考) 延迟 14.0 s

MiniMax M3 通过 · 8/8 cases

The bug is that the loop starts at index 1 and treats `cur` as the number of *equal transitions* rather than the run length, so a run of *k* consecutive equal items is reported as `k − 1`, and a single-element list (where the loop body never executes) returns 0 instead of 1. A correct version tracks the actual run length by seeding `cur = 1` and resetting it to 1 (not 0) on a mismatch: ```python def longest_run(xs): if not xs: return 0 best = cur = 1 for i in range(1, len(xs)): if xs[i] == xs[i - 1]: cur += 1 else: cur = 1 if cur > best: best = cur return best ``` Now `[5]` returns `1`, `[1,1,1]` returns `3`, and a run like `[1,2,2,2]` that ends at the last index is correctly captured as `3` because `cur` is updated before `best` is compared on every iteration, including the final one.

输出 845 tok (+596 思考) 延迟 3.5 s

修复是否真的正确(能运行)、解释的信息密度,以及在一个范围明确的任务上的 token 效率。

提示词 Extract a JSON object with fields {company, quarter, revenue_usd_m, growth_pct, guidance} from this text. Use null for anything not stated; add no other fields. 检查 合法 JSON,严格符合 schema

DeepSeek V4 Flash (0731) 通过 · 5/5 fields, guidance null

{ "company": "Meridian Robotics", "quarter": "Q3", "revenue_usd_m": 412, "growth_pct": null, "guidance": null }

输出 1119 tok (+1072 思考) 延迟 12.3 s

MiniMax M3 通过 · 5/5 fields, guidance null

```json { "company": null, "quarter": "Q3", "revenue_usd_m": 412, "growth_pct": null, "guidance": null } ```

输出 1002 tok (+955 思考) 延迟 3.6 s

是否严守 schema(不臆造字段)、能否顶住幻觉压力(原文明说暂不给出 guidance),以及结构化输出路径的差异。

提示词 Write a 120-word product announcement for an API gateway feature that caches prompts across providers. Forbidden words: "seamless", "unlock", "game-changer", "revolutionize", "empower". Exactly one sentence must be a question. 检查 120 词,0 个禁用词

DeepSeek V4 Flash (0731) 未通过 · 141 words, 0 banned, 1 question

**Introducing Prompt Cache for API Gateway** We are pleased to announce Prompt Cache, a new feature that stores and reuses identical prompt prefixes across all connected LLM providers. By automatically recognizing repeated requests, this cache reduces token consumption and lowers latency without altering your application logic. Whether you use OpenAI, Anthropic, or open-source models, the cache operates transparently, ensuring consistent behavior while cutting costs. Developers can configure cache TTL and scoping rules via a simple API call, giving you precise control over data freshness and privacy. This feature also minimizes redundant upstream calls, freeing provider rate limits for more critical workloads. Start caching today through the dashboard or CLI, and watch your operational expenses drop significantly. […]

输出 254 tok (+80 思考) 延迟 4.4 s

MiniMax M3 通过 · 121 words, 0 banned, 1 question

Introducing PromptCache, our intelligent caching layer for the API gateway. Tired of paying twice for identical requests? The feature stores prompt-response pairs across every connected provider, returning cached results instead of hitting costly endpoints. Deployment requires only a single configuration flag, and semantic similarity detection happens automatically. Latency drops up to 70% on repeated traffic while costs follow the same downward curve. Developers access detailed cache hit metrics, eviction logs, and provider breakdowns through the dashboard. Whether routing to OpenAI, Anthropic, or local models, every cached token saves time and money. The cache respects TTL policies, supports manual purging, and encrypts stored content. Available today for Pro and Enterprise tiers—enable PromptCache on existing endpoints and watch inference bills shrink immediately.

输出 2808 tok (+2656 思考) 延迟 6.0 s

是否守住约束(字数预算、禁用词表、只能有一个问句)、文风特征,以及长度控制。

改一行代码就能在两个模型之间切换

下方每个标签页里都有两个模型 ID,高亮的那两行是唯一要改的地方。端点不变,API key 不变,请求结构也不变。

from openai import OpenAI

client = OpenAI(
    base_url="https://synthorai.io/v1",
    api_key="sk-syn-...",
)

resp = client.chat.completions.create(
    model="deepseek-v4-flash-0731",
    # model="minimax-m3",  # 取消注释此行,注释上一行
    messages=[{"role": "user", "content": "Summarize this diff"}],
    reasoning_effort="medium",
)
print(resp.choices[0].message.content)

获取 API key →

常见问题

DeepSeek V4 Flash (0731) 和 MiniMax M3 哪个更便宜?

按「输入 / 1M token」算,MiniMax M3 更便宜($0.3 对 $0.44,相差 1.5×)。其他计费项的结论可能相反,完整价格见上方表格,实际成本取决于你的用量构成。

不用分别集成两次,就能对 DeepSeek V4 Flash (0731) 和 MiniMax M3 做 A/B 测试吗?

可以。两个模型走同一个 OpenAI 兼容端点,用同一个 API key,切换时只要改一行里的模型名,所以可以给两个模型各分一部分流量,直接对比账单。

DeepSeek V4 Flash (0731) 和 MiniMax M3 支持提示词缓存吗?

支持。两个模型的缓存读取价都低于各自的输入价,所以前缀能反复命中缓存的负载,实际成本会比按官网价估算的低。具体的缓存读取价见上方价格表。

相关对比

我们的实测研究