新人 免费注册,送 10 次调用,最高 $1,免绑卡。

GPT-6 Luna vs Kimi K3

vs

何时用哪一个

两款模型的上下文规模大致相同(gpt-6-luna 为 1,050,000 token,而 kimi-k3 为 1,048,576),因此真正的区别在于价格、输出长度和输入:kimi-k3 的成本为每百万输入 $3,每百万输出 $15,是 gpt-6-luna $0.1 和 $0.5 的 30x,缓存读取也是 30x($0.3 对比 $0.01)。如果你需要处理大规模的文本和图像任务,并且也想要关闭思考的选项,请选择 gpt-6-luna。当你需要视频输入或高达 1,048,576 token 的单次响应(远远超出了 gpt-6-luna 128,000 的上限)时,请选择 kimi-k3。

Benchmark 成绩

高于同侪均值无人分数更高GPT-6 Luna仅 1 项可比Kimi K352 / 6712 / 67
GPT-6 Luna Kimi K3 其他被测模型 同侪均值 无人分数更高
DeepSWE 1.1
66.6%
67.5%
OSWorld-Verified
N/A
84.8%
Cybergym
N/A
80%
Finance Agent v2
N/A
54.4%
Harvey Lab-AA
N/A
无人分数更高 94.6%
GPQA Diamond
N/A
93.5%
BrowseComp
N/A
91.2%
Video-MME (w. sub)
N/A
无人分数更高 90%

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

定价

GPT-6 Luna Kimi K3 Δ
输入 / 1M tokens $0.1 $3 0.033×
输出 / 1M tokens $0.5 $15 0.033×
缓存读取 / 1M tokens $0.01 $0.3 0.033×
缓存写入 不单独收费 - -

费率取自构建时的实时目录;每个模型页面均附有当前的费率卡。

它们的位置 — 以该计费单位计费的所有 74 个 聊天 模型的 每 1M token 的输入价格(对数刻度)

GPT-6 Luna · $0.1 Kimi K3 · $3
$0.05 · Qwen3 VL Flash $30 · GPT-5.4 Pro

能力

GPT-6 Luna Kimi K3
工具使用
思考控制 可配置 始终开启
结构化输出
提示词缓存 隐式(自动) 隐式(自动)
缓存生存时间 5-10m, up to 1h 未公开
最小缓存前缀 1024 个 token 未公开

规格

GPT-6 Luna Kimi K3
输入模态 文本 图像 文本 图像 视频
输出模态 文本 文本
发布日期 2026-09-22 -
知识截止日期 2026-05 -
上下文窗口 1.1M 1M
最大输出 128K 1M
思考参数 reasoning.effort reasoning_effort (top-level; the thinking object is not accepted)
允许的值
reasoning.effort
  • none
  • low
  • medium
  • high
  • xhigh
  • max
reasoning_effort
  • low
  • high
  • max
默认值 medium max

规格转录自各供应商的文档;若供应商未发布某项数据,则直接省略该行,而非进行推断。 完整来源: GPT-6 Luna · Kimi K3

单个 Prompt,两个模型 —— 通过网关实测

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

GPT-6 Luna 通过 · 3 sentences

Enabling reasoning typically makes the model process more information and generate more internal tokens before producing its answer. Because usage is billed by tokens—and reasoning may also route requests to a more expensive model—the cost per request can rise sharply. If request volume stayed similar, that higher cost per request could explain why the bill doubled.

输出 117 tok (+48 思考) 延迟 3.4 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 计量所暴露的隐藏思考计费缺口。

提示词 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. 检查 修复通过测试

GPT-6 Luna 通过 · 8/8 cases

```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 best = max(best, cur) return best ``` The original code counted matching *adjacent pairs* rather than items, so a run of length `n` was reported as `n - 1`, and a single-item input returned `0`. This version counts the current item as part of each run and updates `best` at every index, including the last; it returns `0` for an empty input.

输出 514 tok (+356 思考) 延迟 6.9 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 效率。

提示词 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 精确

GPT-6 Luna 通过 · 5/5 fields, guidance "Withheld pending the Q4 close"

{"company":"Meridian Robotics","quarter":"September quarter","revenue_usd_m":412,"growth_pct":null,"guidance":"Withheld pending the Q4 close"}

输出 161 tok (+119 思考) 延迟 21.7 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 明确被暂缓给出),以及结构化输出路径的差异。

提示词 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 个禁用词

GPT-6 Luna 通过 · 120 words, 0 banned, 1 question

Introducing Prompt Cache, a new API gateway feature that recognizes repeat prompt prefixes and reuses provider-side cached context across supported models. Teams can route requests to different AI providers while preserving eligible cache hits, reducing redundant input processing and helping lower latency and token costs. Configure cache policies in one place, monitor hit rates by provider, and keep existing client integrations unchanged. The gateway applies provider-specific rules automatically, so developers do not need to build separate caching logic for each endpoint. Which workflows could benefit from faster responses and predictable spend? Prompt Cache is available today in preview for eligible accounts, with usage details, supported providers, and setup guidance in the dashboard. Start with one route, compare results, then expand.

输出 959 tok (+813 思考) 延迟 14.6 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 都包含在下方的每个选项卡中 — 高亮显示的两行是唯一的修改。相同的端点,相同的密钥,相同的请求结构。

from openai import OpenAI

client = OpenAI(
    base_url="https://synthorai.io/v1",
    api_key="sk-syn-...",
)

resp = client.chat.completions.create(
    model="gpt-6-luna",
    # model="kimi-k3",  # 取消注释此行,注释上一行
    messages=[{"role": "user", "content": "Summarize this diff"}],
    reasoning_effort="medium",
)
print(resp.choices[0].message.content)

获取 API 密钥 →

常见问题

GPT-6 Luna 和 Kimi K3 哪个更便宜?

在 输入 / 1m tokens 方面,GPT-6 Luna 更便宜($0.1 对比 $3,相差 30×)。其他行可能得出相反的结论——上方表格提供了完整信息,实际成本取决于你的组合使用情况。

我可以在不进行两次集成的情况下,对 GPT-6 Luna 和 Kimi K3 进行 A/B 测试吗?

可以。两者均通过同一个兼容 OpenAI 的端点提供服务,并使用同一把 API 密钥——切换只需更改一行模型字符串,因此你可以将一部分流量路由到各个模型并直接比较账单。

GPT-6 Luna 和 Kimi K3 支持提示词缓存吗?

是的 —— 两者对缓存读取的计费均低于其输入费率,因此热前缀工作负载的成本低于标价。准确的缓存读取行位于上方的定价表中。

相关对比

来自我们的实测研究