Gemini 3.6 Flash vs Kimi K3
什么时候选哪个
两者共享 1,048,576 token 上下文窗口，所以差别在价格、输出长度和输入：gemini-3.6-flash 每百万输入 $1.5、输出 $7.5，正好是 kimi-k3 的 $3 和 $15 的一半，而且它是唯一接受音频的（按每百万音频输入 token $5 计费，缓存 $0.5）。更便宜的大批量文本、图像、视频或音频工作选 gemini-3.6-flash，缓存读取 $0.15 对 $0.3。当需要远超 65,536 token 的单次回复时选 kimi-k3，它的最大输出可达 1,048,576；它的推理能力标志重要时也选它。
Benchmark 成绩
5 项两边都有成绩。
供应商公布： Alibaba (Qwen) Anthropic ByteDance DeepSeek Google MiniMax Moonshot OpenAI Tencent Z.ai
价格
| Gemini 3.6 Flash | Kimi K3 | Δ | |
|---|---|---|---|
| 输入 / 1M token | $1.5 | $3 | 0.5× |
| 输出 / 1M token | $7.5 | $15 | 0.5× |
| 缓存读取 / 1M token | $0.15 | $0.3 | 0.5× |
价格取自构建时的实时目录，最新价格见各模型页面。
两个模型所处的位置：全部 76 个按同一单位计费的聊天模型的每 1M token 输入价分布（对数刻度）
能力
| Gemini 3.6 Flash | Kimi K3 | |
|---|---|---|
| 工具调用 | 是 | 是 |
| 思考控制 | 始终开启 | 始终开启 |
| 结构化输出 | 是 | 是 |
| 提示词缓存 | 隐式 + 显式 | 隐式（自动） |
| 缓存有效期 | 未公布 | 未公布 |
| 最小缓存前缀 | 4096 个 token | 未公布 |
规格
| Gemini 3.6 Flash | Kimi K3 | |
|---|---|---|
| 输入模态 | 文本 图像 音频 视频 | 文本 图像 视频 |
| 输出模态 | 文本 | 文本 |
| 发布日期 | 2026-07-21 | 2026-07-16 |
| 知识截止日期 | 2026-03 | - |
| 上下文窗口 | 1M | 1M |
| 最大输出 | 66K | 1M |
| 思考参数 | thinkingLevel | reasoning_effort (top-level; the thinking object is not accepted) |
| 可选值 |
| reasoning_effort
|
| 默认值 | medium | max |
规格照录自各供应商的文档；供应商没有公布的项目，对应的行直接省略，不做推断。 完整来源： Gemini 3.6 Flash · Kimi K3
同一条提示词，两个模型，经网关实测
Gemini 3.6 Flash 通过 · 3 sentences
Enabling reasoning causes the model to generate thousands of internal "thinking" tokens behind the scenes to process logic before delivering the final response. Because our vendor bills us for every token generated—including these intermediate processing steps—our billable output volume per query surged significantly. Since output tokens carry a much higher unit cost than input tokens, this jump in processing volume directly doubled our overall spend.
输出 893 tok (+816 思考) 延迟 4.7 s
Kimi K3 通过 · 3 sentences
Reasoning models don't just answer questions—they "think" first, generating long internal chains of step-by-step logic before producing a response. Those hidden thinking steps are billed as output tokens (the most expensive kind, typically 3–5x the price of input tokens), and a single query can generate thousands of them even when the visible answer is only a paragraph long. So you're paying for dramatically more compute per request: the bill doubled because the model does far more work behind the scenes, not because usage increased.
输出 755 tok (+637 思考) 延迟 20.8 s
指令遵循（恰好三句，数得出来）、受众适配（对 CFO 说话的口吻），以及下方 token 计数暴露出的隐藏思考计费差额。
Gemini 3.6 Flash 通过 · 8/8 cases
Here is the fixed function along with an explanation of the bugs: ```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 The original function initialized `cur` and `best` to `0` and incremented `cur` on matching adjacent items, which meant it was counting identical adjacent *pairs* rather than the total number of *elements* in a run. This caused single-element inputs to skip the loop and return `0` instead of `1`, and undercounted all run lengths by 1 (for example, a run of two items at the end of the list resulted in `cur = 1`). […]
输出 2034 tok (+1768 思考) 延迟 10.0 s
Kimi K3 通过 · 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 a fencepost error: `cur` counts *matching adjacent pairs* rather than *items in the run*, because it starts at 0 and only increments when `xs[i] == xs[i - 1]`. A run of length L contains L−1 equal pairs, so every run was undercounted by exactly one. For a single-element list (a run of length 1) the loop never runs and the function returns 0 instead of 1; likewise any run ending at the last index — e.g. the two `2`s in `[1, 2, 2]` — reported 1 instead of 2, making it look like no run existed at all. […]
输出 1837 tok (+1547 思考) 延迟 47.2 s
修复是否真的正确（能运行）、解释的信息密度，以及在一个范围明确的任务上的 token 效率。
Gemini 3.6 Flash 通过 · 5/5 fields, guidance "withheld"
```json { "company": "Meridian Robotics", "quarter": "September quarter", "revenue_usd_m": 412, "growth_pct": null, "guidance": "withheld" } ```
输出 2843 tok (+2783 思考) 延迟 13.1 s
Kimi K3 通过 · 5/5 fields, guidance null
{ "company": "Meridian Robotics", "quarter": "September quarter", "revenue_usd_m": 412, "growth_pct": 11, "guidance": null }
输出 924 tok (+863 思考) 延迟 25.9 s
是否严守 schema（不臆造字段）、能否顶住幻觉压力（原文明说暂不给出 guidance），以及结构化输出路径的差异。
Gemini 3.6 Flash 未通过 · 60 words, 0 banned, 0 questions
72: reducing 73: your 74: monthly 75: token 76: spend. S6 (21): 77: You 78: can 79: easily 80: set 81: custom 82: expiration 83: rules, 84: configure 85: TTL 86: settings, 87: and 88: manage 89: cache 90: invalidation 91: across 92: all 93: vendors 94: from 95: one 96: centralized 97: dashboard. S7 (23): 98: Start 99: optimizing […]
输出 4092 tok (+3929 思考) 延迟 16.3 s
Kimi K3 通过 · 120 words, 0 banned, 1 question
Meet Prompt Cache, a new API gateway capability that stores prompt responses and serves them across OpenAI, Anthropic, Google, and Azure endpoints. It matches requests by model, prompt hash, tools, temperature, and tenant policy, so repeated work returns fast while sensitive contexts stay isolated. Teams set TTLs, stale rules, encryption scopes, and bypass flags per route. Analytics show hit rate, latency saved, token spend avoided, and drift risk by provider. What changes for developers? Keep one integration, add cache headers, and watch fallback logic respect consent, residency, and audit needs. During rollout, canary keys compare fresh answers with cached copies before promotion. Prompt Cache cuts vendor calls, steadies p95 latency, and gives platform owners controls for cost, quality, and compliance.
输出 1527 tok (+1354 思考) 延迟 37.9 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="gemini-3.6-flash",
# model="kimi-k3", # 取消注释此行，注释上一行
messages=[{"role": "user", "content": "Summarize this diff"}],
)
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.6-flash",
// model: "kimi-k3", // 取消注释此行，注释上一行
messages: [{ role: "user", content: "Summarize this diff" }],
});
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.6-flash",
# "model": "kimi-k3", # 取消注释此行，注释上一行
"messages": [{"role": "user", "content": "Hello"}]
}'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.6-flash",
// Model: "kimi-k3", // 取消注释此行，注释上一行
Messages: []openai.ChatCompletionMessageParamUnion{
openai.UserMessage("Summarize this diff"),
},
})
fmt.Println(resp.Choices[0].Message.Content)
}import com.openai.client.OpenAIClient;
import com.openai.client.okhttp.OpenAIOkHttpClient;
import com.openai.models.chat.completions.*;
OpenAIClient client = OpenAIOkHttpClient.builder()
.baseUrl("https://synthorai.io/v1")
.apiKey("sk-syn-...")
.build();
ChatCompletion resp = client.chat().completions().create(
ChatCompletionCreateParams.builder()
.model("gemini-3.6-flash")
// .model("kimi-k3") // 取消注释此行，注释上一行
.addUserMessage("Summarize this diff")
.build());
System.out.println(resp.choices().get(0).message().content().orElse(""));常见问题
Gemini 3.6 Flash 和 Kimi K3 哪个更便宜？
按「输入 / 1M token」算，Gemini 3.6 Flash 更便宜（$1.5 对 $3，相差 2.0×）。其他计费项的结论可能相反，完整价格见上方表格，实际成本取决于你的用量构成。
不用分别集成两次，就能对 Gemini 3.6 Flash 和 Kimi K3 做 A/B 测试吗？
可以。两个模型走同一个 OpenAI 兼容端点，用同一个 API key，切换时只要改一行里的模型名，所以可以给两个模型各分一部分流量，直接对比账单。
Gemini 3.6 Flash 和 Kimi K3 支持提示词缓存吗？
支持。两个模型的缓存读取价都低于各自的输入价，所以前缀能反复命中缓存的负载，实际成本会比按官网价估算的低。具体的缓存读取价见上方价格表。