Claude Opus 5 vs MiniMax M3

MiniMax M3 已從我們的目錄下架。下方是它最後公布的費率;它已經無法呼叫,這組比較裡的另一個模型則仍可呼叫。

vs

什麼情況選哪一個

兩者皆具備 1000000 個 token 的上下文視窗並接受文字與圖像輸入,因此差異在於成本與形態:minimax-m3 的費用為輸入 $0.3 與輸出 $1.2,對比 claude-opus-5 的 $5 與 $25,大約便宜了 16x 與 20x,且它亦接受影片輸入,具備 524288 個 token 的最大輸出。當您在高價值工作上需要其顯式思考能力(可被停用)以及其 Anthropic 工具與程式碼堆疊時,請選擇 claude-opus-5;若需要影片輸入、非常長的生成,或 $0.06 快取讀取費率相當重要的大量推論工作時,請選擇 minimax-m3。

Benchmark 成績

MiniMax M3:供應商沒有公布 benchmark 成績。

高於平均沒有模型更高Claude Opus 538 / 468 / 46
Claude Opus 5 MiniMax M3 其他有成績的模型 其他模型平均 ★ 沒有模型分數更高
DeepSWE 1.1
68.8%
N/A
BioMysteryBench hard
49.4%
N/A
OSWorld 2.0
沒有模型分數更高 70.6%
N/A
ExploitBench (Cap%)
70%
N/A
HealthBench Professional
59.8%
N/A
Finance Agent v2
58.6%
N/A
Legal Agent Benchmark
6.7%
N/A
GPQA Diamond
93.4%
N/A
BrowseComp
90.8%
N/A
LVBench
75.4%
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 OpenAI OpenAI Tencent Z.ai Z.ai Z.ai Z.ai

定價

Claude Opus 5 MiniMax M3 Δ
輸入 / 1M tokens $5 $0.3 17×
輸出 / 1M tokens $25 $1.2 21×
快取讀取 / 1M tokens $0.5 $0.06 8.3×
快取寫入 1.25x (5m) / 2x (1h) 不額外計費 -

費率取自網站建置時的即時目錄;各模型頁面都列有最新的價目。

兩者的相對位置:每 1M tokens 的輸入價格,涵蓋同一計費單位下全部 91 個聊天模型(對數尺度)

Claude Opus 5 · $5 MiniMax M3 · $0.3
$0.05 · Qwen3 VL Flash $30 · GPT-5.4 Pro

功能

Claude Opus 5 MiniMax M3
工具使用 是 是
思考控制 可設定 可設定
結構化輸出 是 -
提示詞快取 顯式(由你標記前綴) 隱式(自動)
快取存活時間 5m default, 1h option 未公布
最小快取前綴 512 個 token 512 個 token

規格

Claude Opus 5 MiniMax M3
輸入模態 文字 圖像 文字 圖像 影片
輸出模態 文字 文字
發布日期 2026-07-24 2026-06-01
知識截止日期 2026-05 -
上下文視窗 1,000,000 1,000,000
最大輸出 128,000 524,288
思考參數
  • thinking.type
  • output_config.effort
  • thinking.type
  • reasoning_split
可接受的值
thinking.type
  • adaptive
  • disabled
effort
  • low
  • medium
  • high
  • xhigh
  • max
thinking.type
  • adaptive
  • disabled
reasoning_split
  • boolean
預設值 思考開啟;effort 為 high(Claude API 與 Claude Code) 自適應:思考開啟,由模型判斷何時需要額外推理

規格摘錄自各供應商的文件;供應商沒有公布的項目就直接略過,不自行推測。 完整來源: Claude Opus 5 · MiniMax M3

同一段提示詞,兩個模型,經閘道實測

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

Claude Opus 5 通過 · 3 sentences

When reasoning is enabled, the model generates a hidden chain of "thinking" tokens before it writes the visible answer, and those internal tokens are billed at the output rate even though no one ever sees them — commonly 3–10x more tokens than the response itself. Because output tokens are priced several times higher than input tokens, that added volume hits us at our most expensive rate, which is why the bill roughly doubled while our request count stayed flat. The spend is controllable: we can cap the reasoning budget per call, route only genuinely hard requests to reasoning mode and cheaper models for the rest, and track cost per successfully completed task rather than cost per token, since a single correct answer usually beats three cheap retries plus human cleanup.

輸出 529 tok 延遲 9.0 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. 檢查 修正後通過測試

Claude Opus 5 通過 · 8/8 cases

## Fixed version ```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 if cur > best: best = cur return best ``` ## The bug The counters were tracking the wrong quantity: `cur` counted *matching adjacent pairs* rather than *elements in the current run*, and both counters started at `0` instead of `1`. Since a run of length *n* contains only *n − 1* adjacent equal pairs, every result came back one too small — `[1, 1]` returned 1, `[3, 3, 3]` returned 2 — and a single-element list returned 0 because the loop body never executed and `best` kept its initial value of `0`. […]

輸出 1094 tok 延遲 16.1 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

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

```json { "company": "Meridian Robotics", "quarter": "Q3", "revenue_usd_m": 412, "growth_pct": 11, "guidance": "Withheld pending Q4 close" } ``` Notes on judgment calls: - **quarter**: "September quarter" is labeled Q3 because the text refers to an upcoming "Q4 close," implying a calendar-aligned fiscal year. No fiscal year is given. - **revenue_usd_m**: 412 is stated as constant-currency and hedged ("call it"), so it's approximate; the currency is not explicitly stated as USD. - **growth_pct**: "up eleven and change" means slightly more than 11, so 11 is a floor rather than an exact figure.

輸出 539 tok 延遲 7.6 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 個禁用詞

Claude Opus 5 通過 · 123 words, 0 banned, 1 question

**Cross-Provider Prompt Caching** We're introducing Cross-Provider Prompt Caching in the API Gateway. Repeated system prompts, long documents, and few-shot examples are stored once at the gateway layer and reused across OpenAI, Anthropic, Google, and self-hosted models. Instead of paying full input token costs on every request, your application sends a cache reference, and the gateway rehydrates the context before forwarding it downstream. Why does that matter? Teams running high-volume agents and retrieval pipelines typically see input token spend fall 40 to 70 percent, with median latency dropping by several hundred milliseconds. Caches are scoped per project, encrypted at rest, and invalidated automatically when a prompt template changes. Enable it with a single header, and see the docs for TTL tuning and per-route controls.

輸出 1593 tok 延遲 19.1 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,要改的只有醒目標示的那兩行。端點、金鑰和請求格式都不變。

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",
    # model="minimax-m3",  # 取消這一行的註解,並把上一行註解掉
    messages=[{"role": "user", "content": "Summarize this diff"}],
    reasoning_effort="medium",
)
print(resp.choices[0].message.content)

取得 API 金鑰 →

常見問題

Claude Opus 5 和 MiniMax M3 哪個比較便宜?

以「輸入 / 1M tokens」來看,MiniMax M3 比較便宜($0.3 對 $5,相差 17×)。其他項目的結果可能相反,完整價目請看上表;實際成本要看你的用量組合。

可以只串接一次,就對 Claude Opus 5 和 MiniMax M3 做 A/B 測試嗎?

可以。兩個模型都走同一個 OpenAI 相容端點,用的也是同一把 API 金鑰,切換時只要改一行裡的模型名稱字串。你可以把一部分流量分別導到兩邊,再直接比較帳單。

Claude Opus 5 與 MiniMax M3 支援提示詞快取嗎?

支援。兩者的快取讀取費率都低於輸入費率,所以前綴已經進快取的工作負載,實際成本會比官網價算出來的低。確切的快取讀取價格請見上方定價表。

相關比較