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

Claude Opus 5.5 vs DeepSeek V4 Pro (0813)

vs

何时用哪一个

两者共用 1,000,000-token 的上下文窗口,因此区别在于模态、输出长度和价格:claude-opus-5-5 接受图像以及文本输入,并始终在启用 thinking 的情况下运行,每百万 token 输入 $4、输出 $20,大约是 deepseek-v4-pro-0813($1.32 和 $3.96)的 3x 和 5x。当您需要输入图像或想要其始终开启的推理模式时,请选择 claude-opus-5-5;当以较低成本进行纯文本聊天、代码和工具工作,或者单个回复必须很长时,请选择 deepseek-v4-pro-0813,因为它允许 393216 个输出 token 而不是 128000 个。

Benchmark 成绩

高于同侪均值无人分数更高Claude Opus 5.59 / 97 / 9DeepSeek V4 Pro (0813)13 / 211 / 21
Claude Opus 5.5 DeepSeek V4 Pro (0813) 其他被测模型 同侪均值 无人分数更高
Terminal-bench 4.0
无人分数更高 66.4%
12.4%
OSWorld 2.0 partial
无人分数更高 81.8%
N/A
Cybergym
N/A
83.3%
GDPval-AA v2 Elo · 1508-1769 据 Z.ai 公布 · 2026-09-04
N/A
1590
Humanity's Last Exam with tools
无人分数更高 67.7%
60%
Agents' Last Exam
N/A
25.7%
Chartography with tools
无人分数更高 89%
N/A

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

定价

Claude Opus 5.5 DeepSeek V4 Pro (0813) Δ
输入 / 1M tokens $4 $1.32
输出 / 1M tokens $20 $3.96 5.1×
缓存读取 / 1M tokens $0.2 $0.132 1.5×
缓存写入 1.25x (5m) / 2x (1h) 不单独收费 -

费率取自构建时的实时目录;每个模型页面均附有当前的费率卡。

它们的位置 — 以该计费单位计费的所有 74 个 聊天 模型的 每 1M token 的输入价格(对数刻度)

能力

Claude Opus 5.5 DeepSeek V4 Pro (0813)
工具使用
思考控制 始终开启 始终开启
结构化输出
提示词缓存 显式(由您标记前缀) 隐式(自动)
缓存生存时间 5m default, 1h option no fixed TTL (evicted when unused)
最小缓存前缀 1024 个 token 未公开

规格

Claude Opus 5.5 DeepSeek V4 Pro (0813)
输入模态 文本 图像 文本
输出模态 文本 文本
发布日期 2026-09-22 2026-08-13
知识截止日期 2026-06 -
上下文窗口 1M 1M
最大输出 128K 393K
思考参数 output_config.effort reasoning_effort
允许的值
output_config.effort
  • low
  • medium
  • high
  • xhigh
  • max
reasoning_effort
  • the model card documents low
  • high
  • max
默认值 medium -

规格转录自各供应商的文档;若供应商未发布某项数据,则直接省略该行,而非进行推断。 完整来源: Claude Opus 5.5 · DeepSeek V4 Pro (0813)

单个 Prompt,两个模型 —— 通过网关实测

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

Claude Opus 5.5 通过 · 3 sentences

When we turned on reasoning, the model began "thinking out loud" before each answer, generating thousands of internal working tokens that users never see but that we are billed for just like the final response. Those hidden tokens are charged at the output rate, typically the most expensive rate, so the same question with the same visible answer now costs roughly twice as much or more. We can bring the bill back down without losing the quality gains by capping the reasoning budget and reserving reasoning mode for the complex tasks that actually benefit from it.

输出 263 tok (+102 思考) 延迟 5.7 s

DeepSeek V4 Pro (0813) 通过 · 3 sentences

Enabling reasoning causes the model to generate a hidden chain-of-thought with many additional tokens before producing the final answer, which sharply increases compute consumption per request. Those extra reasoning tokens are billed at the same or higher rates, so total usage doubled even though the volume of final outputs stayed similar. We can control this by adjusting reasoning effort, setting token limits, or routing only complex requests through reasoning mode.

输出 308 tok (+226 思考) 延迟 5.1 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. 检查 修复通过测试

Claude Opus 5.5 通过 · 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 original code counted *matching adjacent pairs* rather than *items in a run*. Both `cur` and `best` started at 0, and `cur` reset to 0 on a mismatch, so a run of length *n* was reported as *n − 1*. For a single-element list the loop never executes, so it returned 0 instead of 1. For `[5, 5]` it returned 1 instead of 2. The fix treats every element as the start of a run of length 1: `best` and `cur` start at 1, and `cur` resets to 1 (not 0) when the value changes. An explicit check returns 0 for an empty list. The "misses runs at the last index" reports are the same off-by-one bug rather than a separate one. […]

输出 723 tok (+303 思考) 延迟 10.4 s

DeepSeek V4 Pro (0813) 通过 · 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 else: cur = 1 best = max(best, cur) return best ``` The bug is that `cur` was initialized to `0` and only counted adjacent matching pairs, so a run of length `n` produced `n - 1` (or `0` for a single element) instead of `n`. The code also reset to `0` on a change, when the new run should start at length `1`. Initializing `cur` and `best` to `1` fixes both the single-element case and runs ending at the last index.

输出 1315 tok (+1130 思考) 延迟 16.9 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 精确

Claude Opus 5.5 通过 · 5/5 fields, guidance "Withheld pending Q4 close"

```json { "company": "Meridian Robotics", "quarter": "September quarter", "revenue_usd_m": 412, "growth_pct": 11, "guidance": "Withheld pending Q4 close" } ``` **Judgment calls to check:** - **quarter**: Kept as "September quarter" rather than "Q3", since the fiscal calendar isn't stated. The text mentions an upcoming "Q4 close," so it may be fiscal Q3, but that's not certain. - **revenue_usd_m**: The text says only "412 for the topline." It doesn't state currency or units, and the figure is on a constant-currency basis, not reported USD. USD millions is an assumption. Use `null` if you need strictly stated values. - **growth_pct**: The source says "eleven and change," so the true figure is slightly above 11. 11 is an approximation. - **guidance**: Guidance was explicitly withheld. I recorded that rather than `null`, since the text addresses it directly.

输出 829 tok (+488 思考) 延迟 10.9 s

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

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

输出 2155 tok (+2121 思考) 延迟 26.0 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 个禁用词

Claude Opus 5.5 通过 · 120 words, 0 banned, 1 question

Today we're launching Cross-Provider Prompt Caching for our API gateway. Why pay twice for the same context? Our gateway now stores repeated prompt prefixes, system instructions, and document chunks, then reuses them whether your request goes to OpenAI, Anthropic, Google, or an open-source model. Teams running retrieval pipelines or long agent loops can cut token costs by up to 60 percent and trim latency on every cached call. Setup takes one configuration flag; no code changes are required. Cache rules respect tenant boundaries, expire on your schedule, and log every hit for audit review. Dashboards show savings by provider, route, and application in real time. Cross-Provider Prompt Caching is available on all Pro and Enterprise plans. Turn it on today.

输出 1263 tok (+1007 思考) 延迟 13.5 s

DeepSeek V4 Pro (0813) 通过 · 121 words, 0 banned, 1 question

Introducing cross-provider prompt caching in our API gateway. Send a prompt once, and the gateway stores its computed prefix across Anthropic, OpenAI, and other LLM providers. Subsequent requests with the same prompt hit the cache, cutting latency and token costs while keeping outputs consistent across routing decisions and provider failovers. Teams can route identical prompts between providers without reprocessing shared context or lengthy system instructions. How much could you save on repeated prompt prefixes? The cache respects provider-specific key formats, handles TTLs automatically, and works with streaming and batch requests. Enable it with one configuration flag—no changes to your application code. Available today on all plans. Monitor cache hit rates, token savings, and provider-specific performance metrics in the live dashboard.

输出 2845 tok (+2694 思考) 延迟 25.5 s

约束服从度(字数预算、禁用词表、唯一的那句问句)、文风指纹,以及长度控制。

只需一行代码即可在它们之间切换

两个 ID 都包含在下方的每个选项卡中 — 高亮显示的两行是唯一的修改。相同的端点,相同的密钥,相同的请求结构。

from openai import OpenAI

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

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

获取 API 密钥 →

常见问题

Claude Opus 5.5 和 DeepSeek V4 Pro (0813) 哪个更便宜?

在 输入 / 1m tokens 方面,DeepSeek V4 Pro (0813) 更便宜($1.32 对比 $4,相差 3.0×)。其他行可能得出相反的结论——上方表格提供了完整信息,实际成本取决于你的组合使用情况。

我可以在不进行两次集成的情况下,对 Claude Opus 5.5 和 DeepSeek V4 Pro (0813) 进行 A/B 测试吗?

可以。两者均通过同一个兼容 OpenAI 的端点提供服务,并使用同一把 API 密钥——切换只需更改一行模型字符串,因此你可以将一部分流量路由到各个模型并直接比较账单。

Claude Opus 5.5 和 DeepSeek V4 Pro (0813) 支持提示词缓存吗?

是的 —— 两者对缓存读取的计费均低于其输入费率,因此热前缀工作负载的成本低于标价。准确的缓存读取行位于上方的定价表中。

相关对比

来自我们的实测研究