Gemini 3.8 Flash vs Kimi K2.7 Code

vs

什么时候选哪个

当任务需要长输入或混合输入时,请选择 gemini-3.8-flash:它在 1048576-token 上下文内支持文本、图像、音频和视频,是 kimi-k2.7-code 的 256000 的四倍,最大输出翻倍(65536 对比 32768),且缓存读取更便宜,每百万 token 为 $0.075 对比 $0.19,便宜约 2.5x。它的全新 token 也更便宜,输入为 $0.75 对比 $0.95,输出为 $3.75 对比 $4,因此在缓存密集型工作负载上的差距会进一步拉大。对于文本、图像和视频的编码以及工具工作,如果需要始终开启推理功能,请选择 kimi-k2.7-code,因为它的思考模式无法被关闭。

Benchmark 成绩

高于同类均值无更高分Gemini 3.8 Flash12 / 175 / 17Kimi K2.7 Code1 / 50 / 5
Gemini 3.8 Flash Kimi K2.7 Code 其他参测模型 同类均值 ★ 没有模型得分更高
DeepSWE 1.1
73.7%
N/A
BioMysteryBench hard
没有模型得分更高 56.5%
N/A
OSWorld 2.0 Partial score, batch tool enabled
59%
N/A
HealthBench Professional
52.1%
N/A
Finance Agent v2
没有模型得分更高 61.4%
N/A
Legal Agent Benchmark
10%
N/A
GPQA Diamond
95.3%
N/A
MCP-Atlas
N/A
76%
CharXiv (RQ) no tools
没有模型得分更高 86.2%
N/A

供应商公布: Alibaba (Qwen) Anthropic ByteDance DeepSeek Google MiniMax Moonshot OpenAI Tencent Z.ai

价格

Gemini 3.8 Flash Kimi K2.7 Code Δ
输入 / 1M token $0.75 $0.95 0.79×
输出 / 1M token $3.75 $4 0.94×
缓存读取 / 1M token $0.075 $0.19 0.39×

价格取自构建时的实时目录,最新价格见各模型页面。

两个模型所处的位置:全部 80 个按同一单位计费的聊天模型的每 1M token 输入价分布(对数刻度)

Gemini 3.8 Flash · $0.75 Kimi K2.7 Code · $0.95
$0.05 · Qwen3 VL Flash $30 · GPT-5.4 Pro

能力

Gemini 3.8 Flash Kimi K2.7 Code
工具调用 是 是
思考控制 是,但供应商未公布调节参数 始终开启
结构化输出 是 -
提示词缓存 隐式 + 显式 隐式(自动)
缓存有效期 未公布 未公布
最小缓存前缀 4,096 个 token 未公布

规格

Gemini 3.8 Flash Kimi K2.7 Code
输入模态 文本 图像 音频 视频 文本 图像 视频
输出模态 文本 文本
发布日期 2026-09-02 2026-06
知识截止日期 2026-03 -
上下文窗口 1M 256K
最大输出 66K 33K
思考参数 -
  • thinking.type
  • thinking.keep
可选值 -
type
  • accepts only enabled
keep
  • accepts only all
默认值 - thinking on with Preserved Thinking on

规格照录自各供应商的文档;供应商没有公布的项目,对应的行直接省略,不做推断。 完整来源: Gemini 3.8 Flash · Kimi K2.7 Code

同一条提示词,两个模型,经网关实测

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

Gemini 3.8 Flash 通过 · 3 sentences

When we enabled reasoning, the model began generating hidden "thinking tokens" to work through logic step-by-step before producing a final answer. Because AI vendors bill for every single token processed—visible or not—this internal deliberation dramatically inflated our billable volume per query. In short, while our total number of user requests remained flat, the cost per transaction doubled to buy higher accuracy on complex tasks.

输出 705 tok (+624 思考) 延迟 6.4 s

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

指令遵循(恰好三句,数得出来)、受众适配(对 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. 检查 修复通过测试

Gemini 3.8 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 best = max(best, cur) else: cur = 1 return best ``` ### Explanation of the Bug The original function counted equal-neighbor transitions rather than the actual items making up each run. Because `cur` started at `0` (and was reset to `0` on mismatches), every run was undercounted by one: single-element lists returned `0` because the loop never executed, and any subsequent run—including those ending at the last index—recorded a count of $N - 1$ instead of $N$. The fix handles empty input upfront, initializes both `cur` and `best` to `1` (since any single element forms a run of length 1), and resets `cur` to `1` whenever a new run begins.

输出 1393 tok (+1149 思考) 延迟 10.1 s

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

修复是否真的正确(能运行)、解释的信息密度,以及在一个范围明确的任务上的 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

Gemini 3.8 Flash 通过 · 5/5 fields, guidance null

```json { "company": "Meridian Robotics", "quarter": "September quarter", "revenue_usd_m": 412, "growth_pct": null, "guidance": null } ```

输出 3989 tok (+3932 思考) 延迟 30.4 s

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

是否严守 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 个禁用词

Gemini 3.8 Flash 通过 · 120 words, 0 banned, 1 question

Why pay multiple model providers for the exact same output? Introducing Universal Prompt Cache, our latest API gateway capability engineered to cut compute expenses and drop inference latency. When your application makes a call, the gateway inspects a central memory layer before routing traffic to external LLMs. If an identical query was previously processed by OpenAI, Anthropic, or Mistral, our gateway returns that response immediately. This shared cache eliminates duplicate token fees and insulates your production apps from vendor rate limits or unexpected downtime. Developers can easily customize expiration settings, enforce strict data privacy controls, and configure invalidation logic across every endpoint. Stop wasting your budget on repeated queries. Enable prompt caching in your dashboard to accelerate your pipeline today.

输出 3833 tok (+3688 思考) 延迟 21.8 s

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

是否守住约束(字数预算、禁用词表、只能有一个问句)、文风特征,以及长度控制。

改一行代码就能在两个模型之间切换

下方每个标签页里都有两个模型 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.8-flash",
    # model="kimi-k2.7-code",  # 取消注释此行,注释上一行
    messages=[{"role": "user", "content": "Summarize this diff"}],
    reasoning_effort="medium",
)
print(resp.choices[0].message.content)

获取 API key →

常见问题

Gemini 3.8 Flash 和 Kimi K2.7 Code 哪个更便宜?

按「输入 / 1M token」算,Gemini 3.8 Flash 更便宜($0.75 对 $0.95,相差 1.3×)。其他计费项的结论可能相反,完整价格见上方表格,实际成本取决于你的用量构成。

不用分别集成两次,就能对 Gemini 3.8 Flash 和 Kimi K2.7 Code 做 A/B 测试吗?

可以。两个模型走同一个 OpenAI 兼容端点,用同一个 API key,切换时只要改一行里的模型名,所以可以给两个模型各分一部分流量,直接对比账单。

Gemini 3.8 Flash 和 Kimi K2.7 Code 支持提示词缓存吗?

支持。两个模型的缓存读取价都低于各自的输入价,所以前缀能反复命中缓存的负载,实际成本会比按官网价估算的低。具体的缓存读取价见上方价格表。

相关对比

我们的实测研究