The Real OpenAI Ultrafast Mode Speedup, Workload by Workload
OpenAI Ultrafast mode promises up to 14x speed, but decode is only part of request latency. Here is the math for chat, RAG, tool loops, and voice agents.

In this article
- 1.What OpenAI Ultrafast Mode Actually Speeds Up
- 2.The Formula That Predicts Your Real Speedup
- 3.Single-Shot Chat and Reasoning Calls, the Best Case
- 4.Short-answer chat
- 5.Reasoning-heavy calls
- 6.Long-Prefill RAG, the First Collapse
- 7.Multi-Step Tool Loops and Agent Workflows
- 8.Streaming Chat and Voice Agents
- 9.A Routing Rule for OpenAI Ultrafast Mode
OpenAI Ultrafast mode puts GPT-5.6 Sol on Cerebras inference hardware and promises up to 750 output tokens per second, up to 14x the decode speed of the standard tier. Those are real numbers, and for some workloads they will survive contact with production. For others, the same tier buys almost nothing, because the figures describe one stage of request processing while your users wait on all of them. The number that predicts your real-world speedup is decode's share of total request wall clock, and you can estimate it today from logs you already keep, per the Ultrafast preview announcement.
Stay in the loop.
Get the latest posts and exclusive content delivered to your inbox.
Join 3 readers. No spam. Unsubscribe in one click, anytime.
That fraction is the whole game. This piece computes it for five topologies teams actually run: single-shot chat, reasoning-heavy calls, long-prefill RAG, multi-step tool loops, and voice. Every worked number below is an illustrative estimate with its assumptions printed beside it, not a measured benchmark, and the output is a one-line routing rule you can apply per workload instead of a blanket upgrade decision.
What OpenAI Ultrafast Mode Actually Speeds Up
A request's total LLM inference latency is roughly the sum of five stages:
- Queueing before the request is scheduled
- Prefill, which processes your prompt and sets time to first token (TTFT)
- Decode, which emits output tokens one at a time
- Network overhead between you and the API
- Tool round trips, for agents that call out mid-run
Prefill and decode behave very differently, and the difference is the crux. A good prefill versus decode explainer covers the mechanics in depth; the short version is that prefill chews through the prompt in large parallel chunks while decode emits one token at a time, each dependent on the last. Long prompts make prefill expensive. Long outputs make decode expensive.
Ultrafast mode's headline figures, up to 14x and up to 750 output tokens per second, attach to decode throughput, the rate at which output tokens are produced once generation starts. The service runs on Cerebras silicon, per the Cerebras partnership announcement. Two caveats belong beside those numbers everywhere you use them. First, "up to" is doing load-bearing work: peak throughput varies with output length, prompt size, and load, so treat sustained speed as something you measure, not a constant you assume. Second, the public figures say nothing about queueing, prefill, or TTFT. Until your own traces show otherwise, assume the tier accelerates decode only. That assumption is exactly what the formula below prices in.
The Formula That Predicts Your Real Speedup

This is Amdahl's law wearing an API badge. Call f the decode share of request latency, the fraction of baseline wall clock spent generating tokens. If the tier accelerates decode by at most 14x:
realized speedup ≈ 1 / ((1 - f) + f / 14)
The untouched (1 - f) fraction sets the ceiling:
| Decode share f | End-to-end speedup |
|---|---|
| 20% | 1.2x |
| 35% | 1.5x |
| 50% | 1.9x |
| 70% | 2.9x |
| 90% | 6.1x |
| 95% | 8.5x |
A 50% decode share, generous for many production patterns, caps the gain under 2x. A 90% share tops out near 6x. Only almost-pure decode workloads approach the headline, and 14 is itself the never-exceeded peak.
Two refinements make the bound usable. Replace 14 with your measured decode-rate ratio between tiers; if Ultrafast sustains 8x on your output lengths, run the formula with 8. Then compute f from telemetry you already collect: with streaming responses, timestamp the first content chunk (TTFT) and the final chunk (total time). Decode time is approximately total minus TTFT, so f is approximately 1 minus TTFT over total. Standard benchmark metric definitions keep TTFT and inter-token throughput as separate axes for precisely this reason, so provider and observability fields map cleanly onto the formula. For non-streaming endpoints, a one-off streaming probe yields both numbers.
Single-Shot Chat and Reasoning Calls, the Best Case
Short-answer chat
Short prompt, long answer, decode share runs high. Illustrative numbers: a 350-token answer on the standard tier at 50 tokens per second is 7 seconds of decode against roughly 0.4 seconds of TTFT and overhead. Decode share is about 0.95, the formula predicts roughly 8x end to end, and the request falls from about 7.4 seconds to just under one. The headline multiple mostly survives.
Reasoning-heavy calls
This is the tier's real sweet spot, for a subtle reason. A high-effort reasoning call emits thousands of thinking tokens before the visible answer, and every one of them is decode: generated serially, metered, and invisible to the user. Take 2,000 reasoning tokens plus a 300-token answer at 50 tokens per second. That is 46 seconds of decode against about a second of prefill and overhead, a decode share near 0.98, and a predicted speedup north of 10x. A 47-second call becomes roughly a 4-second one. Because the user was waiting for the finished answer regardless, faster decode converts almost entirely into wall-clock savings without changing perceived pacing at all. One more wrinkle: thinking volume is a knob, not a constant. OpenAI's reasoning guide documents the reasoning effort parameter, so a faster decode tier also changes which effort level you can afford per call, the same way cheaper tokens change how many you buy.
Long-Prefill RAG, the First Collapse
RAG inverts the chat picture: huge prompt, short answer. Take a 30,000-token retrieved context feeding a 200-token answer. Prefilling 30k tokens commonly puts TTFT in the multiple-second range even on fast providers, and long-context prefill infrastructure costs grow with the window. Illustrative baseline: 4 seconds of TTFT, 4 seconds of decode at 50 tokens per second, 8 seconds total. Decode share is 0.5, the bound is 1.9x, and the realized result is a request that still takes about 4.3 seconds, because Ultrafast crushed the decode stage to 0.3 seconds while prefill stood still. A 14x decode speedup bought a 1.8x improvement in end-to-end RAG latency, and in typical configurations the honest expectation is a 1.5x to 2x band. Stretch the context toward 100k tokens or trim the answer to 80 tokens and the multiple shrinks further. Prompt caching helps repeat requests, not first passes, and a growing context pays full prefill price again at each cache miss.
Multi-Step Tool Loops and Agent Workflows

Agents stack the problem, because every step re-prefills a growing transcript and waits on an external tool. Illustrative loop: six steps, each with about 1.2 seconds of prefill on the accumulated context, 150 tokens of decode at 50 tokens per second (3 seconds), and a 1.5-second tool round trip. Each step runs about 5.7 seconds and the whole run about 34, of which 18 seconds are decode, a share near 0.53. The formula predicts roughly 1.9x, and the run drops to about 17.5 seconds.
Whether Ultrafast mode is worth it for agents at a 1.9x multiple depends on what the fast tier costs relative to the standard one. The more useful observation is where the surviving 17.5 seconds live: 9 seconds of tool execution, 7.2 seconds of prefill, 1.3 seconds of decode. Cutting tool latency from 1.5 seconds to 0.5 saves 6 seconds with no tier change at all, and a production tool latency breakdown will usually surface cacheable tool results, parallelizable calls, and endpoints you control. Removing one step from the loop saves another 5.7. Per-step decode savings do compound across a run, so long, output-heavy steps still benefit; the point is that step count and tool round trips cap the multiple before tokens per second gets a vote. In agent latency optimization, generation speed is one lever among three, and often the smallest.
Streaming Chat and Voice Agents
For paced interfaces, decode speed saturates against human bandwidth rather than architecture. Common reading speed statistics put the average adult around 200 to 250 words per minute, roughly 4 words per second. A standard tier streaming at 50 tokens per second already delivers text several times faster than anyone reads; Ultrafast at 750 produces on the order of a hundred times reading speed. Once tokens are flowing, the human is the bottleneck and additional decode rate is imperceptible. Voice agent responsiveness is even more lopsided: speech output runs near 150 words per minute, about 2.5 words per second, and natural turn-taking gaps sit in the low hundreds of milliseconds, which is why voice AI latency guidance fixates on TTFT and streaming into synthesis rather than raw generation speed.
For both modalities, perceived responsiveness is governed by TTFT plus downstream synthesis pacing, so decode beyond what the output channel can consume adds close to nothing. The honest question for streaming and voice traffic is whether the tier improves TTFT, which the published figures do not address, not decode, which they do.
A Routing Rule for OpenAI Ultrafast Mode
The five cases, all illustrative:
| Workload | Decode share | End-to-end result |
|---|---|---|
| Single-shot chat, 350-token answer | ~0.95 | ~8x |
| Reasoning call, 2.3k output tokens | ~0.98 | ~10x |
| Long-prefill RAG, 30k in / 200 out | ~0.5 | ~1.8x |
| Tool loop, 6 steps with 1.5s tools | ~0.53 | ~1.9x |
| Streaming and voice, human-paced | not the constraint | little perceived gain |
The rule:
Log TTFT and total time per request. Compute f = 1 - TTFT / total. Route workloads above roughly 0.7, your interactive decode-bound traffic, to OpenAI Ultrafast mode. Leave batch jobs, prefill-heavy RAG, and human-paced streaming on the standard tier, and spend the difference on the actual bottleneck.
This treats speed as a priced architectural variable, the same discipline this series applies to token inflation and cost per resolution. Before committing, check current Ultrafast pricing and divide expected wall-clock savings by any per-token premium, per workload: roughly 8x on interactive reasoning almost certainly clears a modest markup, while 1.8x on internal RAG traffic probably does not. A scan of independent latency benchmarks is worth the minutes, to sanity-check sustained throughput at your output lengths before trusting the peak.
The 14x is real. Cerebras-backed decode at 750 tokens per second will collapse some request times by an order of magnitude, and reasoning-heavy products will feel it first. It just will not happen evenly, and one number tells you which side of the line each workload sits on. You can compute it this afternoon.
Stay in the loop.
Get the latest posts and exclusive content delivered to your inbox.
Join 3 readers. No spam. Unsubscribe in one click, anytime.
About the author
Megan Caldwell
AI Engineering Lead
Megan has spent the last eight years building production ML systems, from recommendation engines to today's language model pipelines. She writes about the engineering that holds up under real load: retrieval, evaluation, and the unglamorous parts of shipping AI software.
Related Posts
LangChain vs LangGraph for Stateful AI Agent Orchestration
The langchain vs langgraph decision is a shift from stateless DAGs to cyclic state machines for building stateful autonomous AI agents in production.
Muse Glimmer Local Review Tests 30B Agents Under 20GB
This Muse Glimmer local review analyzes how 30B models compressed under 20GB VRAM trade latency, tool accuracy, and context for local agent workflows.
Claude Opus 5 Prompt Injection Hits 0% Across 129 Tests
Claude Opus 5 prompt injection tests show 0% success with Auto Mode versus 3.7% without across 129 scenarios, making resistance a model selection metric.


