Gemini 3.7 Flash vs MiniMax M3
何时使用哪一个 — 经过整理的结论,而非基准测试表格
当输入包含音频时选 gemini-3.7-flash,它接受文本、图像、音频和视频,音频输入每百万 $0.75,缓存读取 $0.075。minimax-m3 在相同单位上更便宜,输入 $0.3、输出 $1.2,对比 $0.75 和 $3.75,读便宜 2.5 倍、写便宜 3.125 倍,并且允许最多 524288 输出 token 而非 65536,思考也可以关闭。上下文基本持平,1048576 对 1000000,两者都覆盖对话、视觉、代码、工具和推理,所以真正的差别是音频输入对价格与长生成的取舍。
定价
| Gemini 3.7 Flash | MiniMax M3 | Δ | |
|---|---|---|---|
| 输入 / 1M tokens | $0.75 | $0.3 | 2.5× |
| 输出 / 1M tokens | $3.75 | $1.2 | 3.1× |
| 缓存读取 / 1M tokens | $0.075 | $0.06 | 1.3× |
| 缓存写入 | — | 不单独收费 | — |
费率取自构建时的实时目录;每个模型页面均附有当前的费率卡。
它们的位置 — 以该计费单位计费的所有 63 个 聊天 模型的 每 1M token 的输入价格(对数刻度)
能力
| Gemini 3.7 Flash | MiniMax M3 | |
|---|---|---|
| 工具使用 | 是 | 是 |
| 思考控制 | 是 —— 厂商未公布调节参数 | 可配置 |
| 结构化输出 | 是 | — |
| 提示词缓存 | 隐式 + 显式 | 隐式(自动) |
| 缓存生存时间 | 未公开 | 未公开 |
| 最小缓存前缀 | 4096 个 token | 512 个 token |
规格
| Gemini 3.7 Flash | MiniMax M3 | |
|---|---|---|
| 输入模态 | 文本 图像 音频 视频 | 文本 图像 视频 |
| 输出模态 | 文本 | 文本 |
| 发布日期 | 2026-08-13 | 2026-06-01 |
| 上下文窗口 | 1M | 1M |
| 最大输出 | 66K | 524K |
| 思考参数 | — |
|
| 允许的值 | — | thinking.type
reasoning_split
|
| 默认值 | — | adaptive: thinking on, with the model deciding when extra reasoning helps |
规格转录自各供应商的文档;若供应商未发布某项数据,则直接省略该行,而非进行推断。 完整来源: Gemini 3.7 Flash · MiniMax M3
单个 Prompt,两个模型 —— 通过网关实测
Gemini 3.7 Flash 通过 · 3 sentences
Enabling reasoning causes the model to generate a high volume of invisible "thinking tokens" behind the scenes to deliberate and solve complex logic before delivering a final response. Because our vendor bills strictly on token volume, this additional internal computation effectively doubled our billable output per query. In short, our costs increased because we are now paying for the extra compute capacity required to produce significantly higher-accuracy answers.
输出 878 tok (+799 思考) 延迟 6.9 s
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
指令遵循(恰好三句,可数)、受众适配(面向 CFO 的语气),以及下方 token 计量所暴露的隐藏思考计费缺口。
Gemini 3.7 Flash 通过 · 8/8 cases
Here is the corrected function: ```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 ``` ### Explanation of the Bug The original function tracked equal adjacent transitions instead of the actual number of elements in a run, causing all non-empty run lengths to be undercounted by one (e.g., returning `0` instead of `1` for single-element lists because the loop never executes, and `1` instead of `2` for pairs). Initializing both `best` and `cur` to `1` (after handling empty inputs) and resetting `cur` to `1` on a mismatch ensures every individual element is counted as a valid run of at least length one.
输出 1050 tok (+827 思考) 延迟 6.4 s
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
修复是否真的正确(可运行)、解释的信息密度,以及在一个边界明确的任务上的 token 效率。
Gemini 3.7 Flash 通过 · 5/5 fields, guidance "withheld"
```json { "company": "Meridian Robotics", "quarter": "September quarter", "revenue_usd_m": 412, "growth_pct": null, "guidance": "withheld" } ```
输出 918 tok (+858 思考) 延迟 6.2 s
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
schema 服从度(不臆造字段)、幻觉压力(guidance 明确被暂缓给出),以及结构化输出路径的差异。
Gemini 3.7 Flash 通过 · 120 words, 0 banned, 1 question
Why pay twice for identical AI queries simply because you routed them to different model vendors? Today, we introduce Universal Prompt Caching directly within our unified API gateway architecture. This capability stores repeated prompt contexts across OpenAI, Anthropic, and local models, instantly returning stored results to eliminate redundant computation fees. When your application sends an LLM request, the gateway inspects the payload, identifies semantic matches, and returns accurate cached responses in under ten milliseconds. Engineering teams can now slash inference latency by eighty percent while dramatically reducing monthly token expenditures across diverse production deployments. You retain complete privacy control, flexible cache eviction policies, and granular metrics through a single dashboard. Update your routing settings today to accelerate overall system performance.
输出 2858 tok (+2718 思考) 延迟 14.1 s
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
约束服从度(字数预算、禁用词表、唯一的那句问句)、文风指纹,以及长度控制。
只需一行代码即可在它们之间切换
两个 ID 都包含在下方的每个选项卡中 — 高亮显示的两行是唯一的修改。相同的端点,相同的密钥,相同的请求结构。
from openai import OpenAI
client = OpenAI(
base_url="https://synthorai.io/v1",
api_key="sk-syn-...",
)
resp = client.chat.completions.create(
model="gemini-3.7-flash",
# model="minimax-m3", # 取消注释此行,注释上一行
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: "gemini-3.7-flash",
// model: "minimax-m3", // 取消注释此行,注释上一行
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": "gemini-3.7-flash",
# "model": "minimax-m3", # 取消注释此行,注释上一行
"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: "gemini-3.7-flash",
// Model: "minimax-m3", // 取消注释此行,注释上一行
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("gemini-3.7-flash")
// .model("minimax-m3") // 取消注释此行,注释上一行
.addUserMessage("Summarize this diff")
.reasoningEffort(ReasoningEffort.MEDIUM)
.build());
System.out.println(resp.choices().get(0).message().content().orElse(""));常见问题
Gemini 3.7 Flash 和 MiniMax M3 哪个更便宜?
在 输入 / 1m tokens 方面,MiniMax M3 更便宜($0.3 对比 $0.75,相差 2.5×)。其他行可能得出相反的结论——上方表格提供了完整信息,实际成本取决于你的组合使用情况。
我可以在不进行两次集成的情况下,对 Gemini 3.7 Flash 和 MiniMax M3 进行 A/B 测试吗?
可以。两者均通过同一个兼容 OpenAI 的端点提供服务,并使用同一把 API 密钥——切换只需更改一行模型字符串,因此你可以将一部分流量路由到各个模型并直接比较账单。
Gemini 3.7 Flash 和 MiniMax M3 支持提示词缓存吗?
是的 —— 两者对缓存读取的计费均低于其输入费率,因此热前缀工作负载的成本低于标价。准确的缓存读取行位于上方的定价表中。