新人 免费注册,送 10 次调用,最高 $1,无需绑卡。

DeepSeek V4 Flash (0731) vs DeepSeek V4 Pro

vs

什么时候选哪个

这两个 DeepSeek 同门在通常决定取舍的规格上一致——1000000 token 上下文、393216 最大输出、文本进文本出,以及同样的聊天、代码、推理和工具标记——所以真正的差别在价格和思考控制。deepseek-v4-flash-0731 在每一项费率上都更便宜,且幅度相近:输入 $0.44 对 $1.32,输出 $1.32 对 $3.96,缓存读取 $0.044 对 $0.132,各约 3 倍。想按次关闭思考时选 deepseek-v4-pro;单看价目表,包括缓存前缀在内,Flash 全面胜出。

Benchmark 成绩

高于同类均值DeepSeek V4 Flash (0731)10 / 28DeepSeek V4 Pro5 / 10
DeepSeek V4 Flash (0731) DeepSeek V4 Pro 其他参测模型 同类均值 ★ 没有模型得分更高
SWE-Bench Pro
56%
59%
Cybergym
76.7%
N/A
JobBench
41.3%
N/A
Humanity's Last Exam no tools
33.8%
37.7%
Agents' Last Exam
25.2%
N/A

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

价格

DeepSeek V4 Flash (0731) DeepSeek V4 Pro Δ
输入 / 1M token $0.44 $1.32 0.33×
输出 / 1M token $1.32 $3.96 0.33×
缓存读取 / 1M token $0.044 $0.132 0.33×
缓存写入 不单独收费 不单独收费 -

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

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

能力

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

规格

DeepSeek V4 Flash (0731) DeepSeek V4 Pro
输入模态 文本 文本
输出模态 文本 文本
发布日期 2026-07-31 2026-04-24
上下文窗口 1M 1M
最大输出 393K 393K
思考参数 -
  • thinking.type
  • reasoning_effort
可选值 -
thinking.type
  • enabled
  • disabled
reasoning_effort
  • high
  • max (low and medium map to high, xhigh maps to max)
默认值 -

enabled, with reasoning_effort high

some complex agent requests are automatically set to max

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

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

提示词 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

DeepSeek V4 Pro 通过 · 3 sentences

Enabling reasoning causes the model to generate a lengthy internal chain‑of‑thought before it delivers a visible answer, and we are billed for every one of those hidden reasoning tokens just as we are for the final output. In most interactions, the volume of these unseen tokens at least equals the visible response, effectively doubling the total tokens consumed per query. That doubled token consumption translates directly into a doubled per‑query cost, which is why our overall LLM bill doubled.

输出 641 tok (+545 思考) 延迟 11.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

DeepSeek V4 Pro 通过 · 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 ``` **Explanation:** The bug stems from initializing `cur = 0` and only incrementing it when two adjacent elements match, which counts the number of *additional* equal elements rather than the actual run length (which is `cur + 1`). As a result, the returned `best` is always one less than the true longest run—most obviously returning 0 for a single-element list instead of 1. […]

输出 2418 tok (+2131 思考) 延迟 35.6 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

DeepSeek V4 Pro 通过 · 5/5 fields, guidance null

{ "company": "Meridian Robotics", "quarter": "September quarter", "revenue_usd_m": 412, "growth_pct": "eleven and change", "guidance": null }

输出 1204 tok (+1153 思考) 延迟 19.9 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

DeepSeek V4 Pro 没有可供评分的回答 · no answer text within 16,384 tokens (all of it went to thinking)

模型没有返回回答文本,整个 token 预算都花在了隐藏的思考上。

输出 8193 tok (+8192 思考) 延迟 106.2 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="deepseek-v4-pro",  # 取消注释此行,注释上一行
    messages=[{"role": "user", "content": "Summarize this diff"}],
    reasoning_effort="medium",
)
print(resp.choices[0].message.content)

获取 API key →

常见问题

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

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

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

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

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

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

相关对比

我们的实测研究