Kimi K2.7 Code vs MiniMax M3
MiniMax M3 已从我们的目录下线。下方是它最后公布的价格;这个模型已无法调用,对比中的另一个模型仍可正常调用。
什么时候选哪个
两款模型都接受文本、图像和视频输入并返回文本,都覆盖对话、代码、推理和工具,所以差别在价格和规模:minimax-m3 输入 $0.3、输出 $1.2,对比 kimi-k2.7-code 的 $0.95 和 $4,输入便宜约 3.2 倍、输出便宜约 3.3 倍,上下文 1000000 token、最大输出 524288,对比 256000 和 32768。超长输入、长生成,或想关闭思考时选 minimax-m3,因为 kimi-k2.7-code 始终在推理。如果你专门想要 Moonshot 的模型且在它 256000 token 的限制内,则选 kimi-k2.7-code。
Benchmark 成绩
MiniMax M3:供应商没有公布 benchmark 成绩。
供应商公布: Alibaba (Qwen) Alibaba (Qwen) Alibaba (Qwen) Alibaba (Qwen) Moonshot Moonshot OpenAI OpenAI Z.ai
价格
| Kimi K2.7 Code | MiniMax M3 | Δ | |
|---|---|---|---|
| 输入 / 1M token | $0.95 | $0.3 | 3.2× |
| 输出 / 1M token | $4 | $1.2 | 3.3× |
| 缓存读取 / 1M token | $0.19 | $0.06 | 3.2× |
| 缓存写入 | - | 不单独收费 | - |
价格取自构建时的实时目录,最新价格见各模型页面。
两个模型所处的位置:全部 91 个按同一单位计费的聊天模型的每 1M token 输入价分布(对数刻度)
能力
| Kimi K2.7 Code | MiniMax M3 | |
|---|---|---|
| 工具调用 | 是 | 是 |
| 思考控制 | 始终开启 | 可配置 |
| 提示词缓存 | 隐式(自动) | 隐式(自动) |
| 缓存有效期 | 未公布 | 未公布 |
| 最小缓存前缀 | 未公布 | 512 个 token |
规格
| Kimi K2.7 Code | MiniMax M3 | |
|---|---|---|
| 输入模态 | 文本 图像 视频 | 文本 图像 视频 |
| 输出模态 | 文本 | 文本 |
| 发布日期 | 2026-06 | 2026-06-01 |
| 上下文窗口 | 256,000 | 1,000,000 |
| 最大输出 | 32,768 | 524,288 |
| 思考参数 |
|
|
| 可选值 | type
keep
| thinking.type
reasoning_split
|
| 默认值 | 思考开启,Preserved Thinking 同时开启 | adaptive:思考开启,由模型判断何时需要额外推理 |
规格照录自各供应商的文档;供应商没有公布的项目,对应的行直接省略,不做推断。 完整来源: Kimi K2.7 Code · MiniMax M3
同一条提示词,两个模型,经网关实测
Kimi K2.7 Code 通过 · 3 sentences
Enabling reasoning mode causes the model to generate an internal chain-of-thought before producing each answer, and that hidden reasoning text is billed like any other output. Those extra reasoning tokens typically add up to much more than the final response itself, so every API call now costs significantly more than before. Because our overall usage volume did not change, the doubled bill reflects that each query consumes roughly twice as many billable tokens.
输出 259 tok (+174 思考) 延迟 5.4 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 计数暴露出的隐藏思考计费差额。
Kimi K2.7 Code 通过 · 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 bug is that the function counts *transitions* between equal neighbors instead of counting the items themselves, so a single-element list never enters the loop and returns `0` instead of `1`. Likewise, resetting `cur` to `0` on a mismatch forgets the current item that starts a new run, which causes runs that end at the last index to be undercounted. Initializing both `best` and `cur` to `1` and resetting `cur` to `1` fixes both issues.
输出 410 tok (+222 思考) 延迟 9.4 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 效率。
Kimi K2.7 Code 通过 · 5/5 fields, guidance "withheld pending the Q4 close"
```json { "company": "Meridian Robotics", "quarter": "September quarter", "revenue_usd_m": 412, "growth_pct": 11, "guidance": "withheld pending the Q4 close" } ```
输出 721 tok (+663 思考) 延迟 13.2 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),以及结构化输出路径的差异。
Kimi K2.7 Code 通过 · 120 words, 0 banned, 1 question
We're introducing Prompt Cache for our API Gateway, a new capability that stores prompt responses across multiple AI providers. By caching replies, you reduce redundant calls, lower latency, and cut costs without changing how you build. Teams using several model providers can now reuse identical prompt results instantly, keeping traffic consistent and budgets predictable. Responses are keyed by provider, model, and exact prompt, so you always get the right result. Configure TTL, hit thresholds, and eviction rules from a single dashboard. It fits into your existing routing and requires no code changes. Setup takes minutes and works with your current endpoints. Want to see how much latency and spend you can trim? Check the docs to enable Prompt Cache today.
输出 2375 tok (+2235 思考) 延迟 38.6 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,高亮的那两行是唯一要改的地方。端点不变,API key 不变,请求结构也不变。
from openai import OpenAI
client = OpenAI(
base_url="https://synthorai.io/v1",
api_key="sk-syn-...",
)
resp = client.chat.completions.create(
model="kimi-k2.7-code",
# 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: "kimi-k2.7-code",
// 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": "kimi-k2.7-code",
# "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: "kimi-k2.7-code",
// 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("kimi-k2.7-code")
// .model("minimax-m3") // 取消注释此行,注释上一行
.addUserMessage("Summarize this diff")
.reasoningEffort(ReasoningEffort.MEDIUM)
.build());
System.out.println(resp.choices().get(0).message().content().orElse(""));常见问题
Kimi K2.7 Code 和 MiniMax M3 哪个更便宜?
按「输入 / 1M token」算,MiniMax M3 更便宜($0.3 对 $0.95,相差 3.2×)。其他计费项的结论可能相反,完整价格见上方表格,实际成本取决于你的用量构成。
不用分别集成两次,就能对 Kimi K2.7 Code 和 MiniMax M3 做 A/B 测试吗?
可以。两个模型走同一个 OpenAI 兼容端点,用同一个 API key,切换时只要改一行里的模型名,所以可以给两个模型各分一部分流量,直接对比账单。
Kimi K2.7 Code 和 MiniMax M3 支持提示词缓存吗?
支持。两个模型的缓存读取价都低于各自的输入价,所以前缀能反复命中缓存的负载,实际成本会比按官网价估算的低。具体的缓存读取价见上方价格表。