MiniMax M3 vs Qwen3.7 Plus
何時該用哪一個 — 綜合評斷，而非基準測試數據表
這兩者紙面上很接近：minimax-m3 和 qwen3.7-plus 都提供 1000000 token 脈絡、文字／影像／視訊輸入與文字輸出、同樣的對話、程式碼、推理、工具和長脈絡標誌，思考都可關閉，而且都在 2026-06-01 發布。區分點是價目表和輸出上限：qwen3.7-plus 在輸入（$0.4 對 $0.3）、輸出（$1.6 對 $1.2）和快取讀取（$0.08 對 $0.06）上都約為 minimax-m3 的 1.33 倍，而 minimax-m3 允許 524288 最大輸出 token 而非 65536，即 8 倍的空間。更便宜的執行和超長單次生成選 minimax-m3；偏好阿里作為廠商則選 qwen3.7-plus。
定價
| MiniMax M3 | Qwen3.7 Plus | Δ | |
|---|---|---|---|
| 輸入 / 1M tokens | $0.3 | $0.4 | 0.75× |
| 輸出 / 1M tokens | $1.2 | $1.6 | 0.75× |
| 快取讀取 / 1M tokens | $0.06 | $0.08 | 0.75× |
| 快取寫入 | 不額外計費 | 1.25x | — |
費率取自建置時的即時目錄；各模型頁面皆附有目前的費率卡。
它們的相對位置 — 在此計費單位下，所有 63 個 聊天 模型的 每 1M tokens 的輸入價格（對數尺度）
能力
| MiniMax M3 | Qwen3.7 Plus | |
|---|---|---|
| 工具使用 | 是 | 是 |
| 思考控制 | 可配置 | 可配置 |
| 結構化輸出 | — | 是 |
| 提示快取 | 隱式（自動） | 隱式 + 顯式 |
| 快取生命週期 | 未公開 | explicit: 5m, reset on hit |
| 最小快取前綴 | 512 個 token | 1024 個 token |
規格
| MiniMax M3 | Qwen3.7 Plus | |
|---|---|---|
| 輸入模態 | 文字 影像 影片 | 文字 影像 影片 |
| 輸出模態 | 文字 | 文字 |
| 發布日期 | 2026-06-01 | 2026-06-01 |
| 上下文視窗 | 1M | 1M |
| 最大輸出 | 524K | 66K |
| 思考參數 |
|
|
| 可接受的值 | thinking.type
reasoning_split
| enable_thinking
thinking_budget
preserve_thinking
|
| 預設值 | adaptive: thinking on, with the model deciding when extra reasoning helps | on the Qwen3.7 Plus series is hybrid thinking with thinking enabled by default, and preserve_thinking is off |
規格摘錄自各供應商的文件；供應商未發布的資料列會直接省略，而非自行推測。 完整來源： MiniMax M3 · Qwen3.7 Plus
單一提示詞，兩款模型 — 經由閘道測量
MiniMax M3 通過 · 3 sentences
Reasoning-enabled models deliberately produce extensive internal "chain-of-thought" tokens before answering, often consuming 5–10x more tokens per query than a standard model. Because LLM providers bill per token for both that reasoning trace and the final response, your cost-per-query rises proportionally—and that multiplier is the primary driver of the doubled bill. The right response isn't to disable reasoning, but to route only genuinely complex queries to it while keeping routine traffic on the cheaper standard tier, which typically recovers 60–80% of the cost without sacrificing quality where it matters.
輸出 665 tok (+548 思考) 延遲 5.7 s
Qwen3.7 Plus 通過 · 3 sentences
Enabling reasoning requires the model to generate extensive internal "thinking" tokens to process complex logic before delivering a final answer. Because our vendor charges us per token consumed, this hidden computational overhead effectively doubles our output volume for the exact same number of user requests. Consequently, our costs have doubled because we are now paying for the model's increased processing time to achieve higher-quality, more accurate results.
輸出 1428 tok (+1345 思考) 延遲 25.2 s
指令遵循（恰好三句，可數）、受眾適配（面向 CFO 的語氣），以及下方 token 計量所暴露的隱藏思考計費缺口。
MiniMax M3 通過 · 8/8 cases
The bug is in the loop bound: `range(1, len(xs))` iterates from index 1 up to but not including `len(xs) - 1`... wait, actually it goes up to `len(xs) - 1`, so the last index is included. The real problems are two: 1. **Starting `best` and `cur` at 0** and iterating from index 1 means a single-element list (`len(xs) == 1`) never enters the loop, so the function returns `0` instead of `1`. The fix is to either seed `best = cur = 1` when `xs` is non-empty, or include index 0 in the loop logic. 2. **Missing the final run**: the function only updates `best` *inside* the loop when it finds a continuation. If the longest run ends at the very last element, the loop body never gets to compare it after the increment — actually it does, but only if the run is longer than the previous `best`. […]
輸出 464 tok 延遲 7.9 s
Qwen3.7 Plus 通過 · 8/8 cases
## Fixed Code ```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 ``` ## Bug Explanation The function has two related bugs rooted in how it counts run lengths. First, `cur` is initialized to `0` and only incremented on matches, so it counts the number of *transitions* between equal elements rather than the total elements in the run—a run of N identical items only reaches `cur = N − 1`, undercounting by one. This also causes the single-element case to return `0`, since the loop never executes and `cur` never increments. […]
輸出 2317 tok (+2005 思考) 延遲 40.5 s
修復是否真的正確（可執行）、解釋的資訊密度，以及在一個邊界明確的任務上的 token 效率。
MiniMax M3 通過 · 5/5 fields, guidance null
```json { "company": "Meridian Robotics", "quarter": "September quarter", "revenue_usd_m": 412, "growth_pct": 11, "guidance": null } ```
輸出 2212 tok (+2161 思考) 延遲 23.3 s
Qwen3.7 Plus 通過 · 5/5 fields, guidance null
{ "company": "Meridian Robotics", "quarter": "September", "revenue_usd_m": 412, "growth_pct": 11, "guidance": null }
輸出 1807 tok (+1750 思考) 延遲 31.6 s
schema 服從度（不臆造欄位）、幻覺壓力（guidance 明確被暫緩給出），以及結構化輸出路徑的差異。
MiniMax M3 通過 · 120 words, 0 banned, 1 question
Introducing PromptCache, our new API gateway feature that caches prompts across multiple LLM providers. Developers can store prompt-completion pairs centrally, reducing redundant inference calls and lowering costs without sacrificing quality. How will your workflow change when repeated requests resolve instantly from a shared cache layer? The gateway intercepts outgoing requests, checks for matching prompt fingerprints, and serves previously generated completions when available, falling back to the original provider on misses. Compatible with OpenAI, Anthropic, Cohere, and custom endpoints, PromptCache integrates with existing routing rules and supports TTL, versioning, and per-tenant namespaces. Teams now gain predictable latency, reduced token spend, and improved throughput during traffic spikes today. […]
輸出 3256 tok (+2892 思考) 延遲 21.5 s
Qwen3.7 Plus 通過 · 120 words, 0 banned, 1 question
Introducing PromptCache, our new API gateway feature designed to store and reuse prompts across multiple artificial intelligence providers. Have you ever noticed how repeatedly sending identical queries drains your budget and increases latency? PromptCache solves this by intelligently storing responses at the gateway level. When your application requests the same prompt from a different provider, the system instantly returns the cached result. This drastically reduces API costs and accelerates response times for your users. You can configure custom expiration times and set specific fallback rules for each vendor. You must stop paying twice for the exact same computation. Please upgrade your entire infrastructure today and experience much faster and cheaper integrations without changing a single line of your application code.
輸出 4453 tok (+4312 思考) 延遲 76.8 s
約束服從度（字數預算、禁用詞表、唯一的那句問句）、文風指紋，以及長度控制。
只需一行程式碼即可在兩者間切換
以下每個頁籤中都有這兩個 ID — 醒目提示的這兩行是唯一的修改處。相同的端點，相同的金鑰，相同的請求結構。
from openai import OpenAI
client = OpenAI(
base_url="https://synthorai.io/v1",
api_key="sk-syn-...",
)
resp = client.chat.completions.create(
model="minimax-m3",
# model="qwen3.7-plus", # 取消註解此行，並註解上一行
messages=[{"role": "user", "content": "Summarize this diff"}],
reasoning_effort="medium",
)
print(resp.choices[0].message.content)import OpenAI from "openai";
const client = new OpenAI({
baseURL: "https://synthorai.io/v1",
apiKey: "sk-syn-...",
});
const resp = await client.chat.completions.create({
model: "minimax-m3",
// model: "qwen3.7-plus", // 取消註解此行，並註解上一行
messages: [{ role: "user", content: "Summarize this diff" }],
reasoning_effort: "medium",
});
console.log(resp.choices[0].message.content);curl https://synthorai.io/v1/chat/completions \
-H "Authorization: Bearer sk-syn-..." \
-H "Content-Type: application/json" \
-d '{
"model": "minimax-m3",
# "model": "qwen3.7-plus", # 取消註解此行，並註解上一行
"messages": [{"role": "user", "content": "Hello"}],
"reasoning_effort": "medium"
}'package main
import (
"context"
"fmt"
"github.com/openai/openai-go/v3"
"github.com/openai/openai-go/v3/option"
)
func main() {
client := openai.NewClient(
option.WithBaseURL("https://synthorai.io/v1"),
option.WithAPIKey("sk-syn-..."),
)
resp, _ := client.Chat.Completions.New(context.TODO(), openai.ChatCompletionNewParams{
Model: "minimax-m3",
// Model: "qwen3.7-plus", // 取消註解此行，並註解上一行
Messages: []openai.ChatCompletionMessageParamUnion{
openai.UserMessage("Summarize this diff"),
},
ReasoningEffort: openai.ReasoningEffortMedium,
})
fmt.Println(resp.Choices[0].Message.Content)
}import com.openai.client.OpenAIClient;
import com.openai.client.okhttp.OpenAIOkHttpClient;
import com.openai.models.chat.completions.*;
import com.openai.models.ReasoningEffort;
OpenAIClient client = OpenAIOkHttpClient.builder()
.baseUrl("https://synthorai.io/v1")
.apiKey("sk-syn-...")
.build();
ChatCompletion resp = client.chat().completions().create(
ChatCompletionCreateParams.builder()
.model("minimax-m3")
// .model("qwen3.7-plus") // 取消註解此行，並註解上一行
.addUserMessage("Summarize this diff")
.reasoningEffort(ReasoningEffort.MEDIUM)
.build());
System.out.println(resp.choices().get(0).message().content().orElse(""));常見問題
MiniMax M3 和 Qwen3.7 Plus 哪個比較便宜？
MiniMax M3 在 輸入 / 1m tokens 上較便宜（$0.3 對比 $0.4，相差 1.3×）。其他項目可能呈現相反結果 — 上表提供完整資訊，實際成本取決於您的使用組合。
我可以在不進行兩次整合的情況下，對 MiniMax M3 和 Qwen3.7 Plus 進行 A/B 測試嗎？
可以。兩者皆透過同一個相容 OpenAI 的端點提供服務，並使用同一把 API 金鑰 — 切換只需更改一行的模型字串，因此您可以將部分流量分別導向兩者並直接比較帳單。
MiniMax M3 與 Qwen3.7 Plus 支援提示快取嗎？
是的 — 兩者的快取讀取費率皆低於其輸入費率，因此具有暖前綴的工作負載成本會低於牌價所示。確切的快取讀取列請見上方的定價表。