Kimi K2.7 Code vs Kimi K3
Which one, when — curated verdict, not a benchmark table
K3 at $3/$15 is the generalist flagship; K2.7-Code at $0.95/$4 is the coding specialist at a third of the price. If the traffic is repository work, the specialist plus its cheaper cache read is the default; K3 earns its rate on mixed reasoning loads.
Pricing
| Kimi K2.7 Code | Kimi K3 | Δ | |
|---|---|---|---|
| Input / 1M tokens | $0.95 | $3 | 0.32× |
| Output / 1M tokens | $4 | $15 | 0.27× |
| Cache read / 1M tokens | $0.19 | $0.3 | 0.63× |
Rates from the live catalog at build time; each model page carries the current card.
Where they sit — input price per 1M tokens across all 63 chat models on this billing unit (log scale)
Capabilities
| Kimi K2.7 Code | Kimi K3 | |
|---|---|---|
| Tool use | yes | yes |
| Thinking control | always on | always on |
| Structured output | — | yes |
| Prompt caching | implicit (automatic) | implicit (automatic) |
| Cache lifetime | not published | not published |
| Minimum cached prefix | not published | not published |
Specs
| Kimi K2.7 Code | Kimi K3 | |
|---|---|---|
| Input modalities | text image video | text image video |
| Output modalities | text | text |
| Released | 2026-06 | — |
| Context window | 256K | 1M |
| Max output | 33K | 1M |
| Thinking parameter |
| reasoning_effort (top-level; the thinking object is not accepted) |
| Accepted values | type
keep
| reasoning_effort
|
| Default | thinking on with Preserved Thinking on | max |
Specs are transcribed from each vendor’s documentation; a row a vendor does not publish is left out rather than inferred. Full sources: Kimi K2.7 Code · Kimi K3
One prompt, both models — measured through the gateway
Kimi K2.7 Code passed · 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.
out 259 tok (+174 thinking) latency 5.4 s
Kimi K3 passed · 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.
out 755 tok (+637 thinking) latency 20.8 s
Instruction following (exactly three sentences — countable), audience shaping (CFO register), and the hidden-thinking billing gap the token meters below expose.
Kimi K2.7 Code passed · 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.
out 410 tok (+222 thinking) latency 9.4 s
Kimi K3 passed · 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. […]
out 1837 tok (+1547 thinking) latency 47.2 s
Whether the fix is actually correct (runnable), explanation density, and token efficiency on a bounded task.
Kimi K2.7 Code passed · 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" } ```
out 721 tok (+663 thinking) latency 13.2 s
Kimi K3 passed · 5/5 fields, guidance null
{ "company": "Meridian Robotics", "quarter": "September quarter", "revenue_usd_m": 412, "growth_pct": 11, "guidance": null }
out 924 tok (+863 thinking) latency 25.9 s
Schema obedience (no invented fields), hallucination pressure (guidance is explicitly withheld), and structured-output path differences.
Kimi K2.7 Code passed · 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.
out 2375 tok (+2235 thinking) latency 38.6 s
Kimi K3 passed · 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.
out 1527 tok (+1354 thinking) latency 37.9 s
Constraint obedience (word budget, banned-word list, the single question), style fingerprint, and length control.
Switch between them with one line
Both ids are in every tab below — the highlighted pair of lines is the only edit. Same endpoint, same key, same request shape.
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="kimi-k3", # uncomment this line, comment the one above
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: "kimi-k3", // uncomment this line, comment the one above
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": "kimi-k3", # uncomment this line, comment the one above
"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: "kimi-k3", // uncomment this line, comment the one above
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("kimi-k3") // uncomment this line, comment the one above
.addUserMessage("Summarize this diff")
.reasoningEffort(ReasoningEffort.MEDIUM)
.build());
System.out.println(resp.choices().get(0).message().content().orElse(""));FAQ
Which is cheaper, Kimi K2.7 Code or Kimi K3?
Kimi K2.7 Code is cheaper on input / 1m tokens ($0.95 vs $3, 3.2× apart). Other rows may point the other way — the table above carries the full card, and real cost depends on your mix.
Can I A/B test Kimi K2.7 Code against Kimi K3 without two integrations?
Yes. Both are served through the same OpenAI-compatible endpoint with one API key — switching is a one-line model-string change, so you can route a fraction of traffic to each and compare bills directly.
Do Kimi K2.7 Code and Kimi K3 support prompt caching?
Yes — both bill cached reads below their input rate, so warm-prefix workloads cost less than the list rates suggest. The exact cache-read rows are in the pricing table above.