Back to Devoured - October 05, 2026
DEVOURED
Prime Inference: Fast, Reliable Serving for Frontier Open Models

Prime Inference: Fast, Reliable Serving for Frontier Open Models

AI Prime Intellect
Prime Intellect is launching a serverless inference platform designed to handle large-scale agentic workloads by disaggregating prefill and decode tasks.
What: The new Prime Inference service, which has processed nearly a trillion tokens per day for internal agentic rollouts, uses NVIDIA Blackwell GPUs and a stack including vLLM, FlashInfer, and Mooncake. By splitting prefill and decode across dedicated GPU pools and using block-major KV layout (BLHNC) to reduce NVLink transfer fragmentation, the system achieves consistent 100 tokens/second interactivity for multi-turn agent sessions.
Why it matters: This signals a trend where production-grade LLM serving moves away from monolithic GPU allocation toward fine-grained, topology-aware orchestration to manage the memory-intensive requirements of long-context agentic memory (KV caching).
Takeaway: If you are struggling with latency in multi-turn agent tasks, consider evaluating the Prime Inference CLI or API (api.pinference.ai) to see if disaggregated prefill/decode architecture reduces your p90 inter-token latency.
Deep dive
  • Prime Inference supports both serverless and reserved capacity, using NVIDIA Blackwell and InfiniBand-connected clusters.
  • The architecture utilizes NVIDIA Dynamo for orchestration and vLLM for model execution.
  • They implemented 'chunked prefill' to prevent long-context prompts from stalling token generation for ongoing sessions.
  • KV-aware routing keeps session history localized to specific decoders to maximize cache reuse.
  • They contributed a native NVFP4-sparse MLA kernel to FlashInfer, increasing KV-cache capacity by approximately 50%.
  • The BLHNC block-major layout significantly reduced NVLink transfer descriptor count and latency compared to layer-major layouts.
  • Structural-tag support was added to Dynamo to enforce tool-call schemas and reduce error rates in agentic workflows.
Decoder
  • KV Cache: The cached attention keys and values for previously generated tokens, essential for avoiding recomputation in multi-turn conversations.
  • Disaggregation: Separating the computational workloads of prefill (prompt processing) and decode (token generation) to optimize hardware utilization.
  • Tensor Parallelism (TP): Distributing model weights across multiple GPUs to reduce per-GPU memory usage and latency.
  • MLA (Multi-Head Latent Attention): An attention architecture that compresses KV caches to reduce memory footprint at the cost of slight precision loss.
  • NVFP4: A 4-bit floating point format used for compressing KV cache entries.
Original article

Prime Inference: Fast, Reliable Serving for Frontier Open Models

Prime's mission is to build frontier open models and the open superintelligence stack for continuously improving agents. We already provide end-to-end post-training infrastructure, from prime-rl and verifiers to sandboxes and RL environments. But the continual learning loop is not complete until a trained model can serve real users, generate new experience, and feed those production traces back into training.

We're excited to release Prime Inference today. It covers both serverless endpoints and reserved capacity and offers resilient serving of frontier open-source models on our GPU infrastructure across multiple datacenters.

Prime Inference began as the serving platform we needed ourselves. Long before public release, it powered large-scale RL rollouts, synthetic data generation, evaluations, and long-running coding agents, processing nearly a trillion tokens every day just internally. Beyond our own workloads, we've also been serving large-scale customer deployments in production since January. This scale pushed us to optimize for sustained performance, quality, and reliability, rather than benchmark speed alone.

Our first public deployment, GLM-5.3, went live on OpenRouter on September 22. It currently ranks among the fastest GLM-5.3 endpoints on OpenRouter, with a near-zero tool-call error rate and 100% uptime since launch.

Prime Inference at a glance

  • Low-latency: Our GLM-5.3 endpoint on OpenRouter is continuously evaluated for quality, with production SLAs, security, and privacy built in from the start.
  • Premium infrastructure across data centers: Prime-hosted models run on NVIDIA Blackwell today, with Vera Rubin coming soon.
  • Uptime: Automatic failover across data centers keeps traffic moving to healthy deployments.
  • OpenAI compatible: Connect your existing tools and SDKs using a Prime endpoint and API key.
  • Scaling: Serverless endpoints for variable demand, with reserved capacity for sustained workloads.
  • Cost: Unified billing and team-level usage tracking across models, making inference spend easier to manage.
  • Robust open-source infrastructure: Our stack combines NVIDIA Dynamo, vLLM, Mooncake, and FlashInfer, developed in close partnership with Inferact and NVIDIA, with improvements contributed upstream.

Get started

prime inference chat 'z-ai/glm-5.3' "Write a haiku about KV caches."

Or point any OpenAI SDK at https://api.pinference.ai/api/v1. See the docs for the full API reference.

Built for production SLAs

Prime Inference separates the public API from the model fleet, so capacity can move, fail, or scale without changing the client endpoint.

Our shared circuit breakers let every gateway replica react to failures consistently, while lease-based admission control prevents overload and automatically recovers capacity when a process disappears.

Below the software layer, every cluster is continuously monitored, with health checks that reach all the way down to NVLink and InfiniBand. Alerts go to an on-call team staffed 24/7, so GPU failures are caught and repaired quickly instead of slowly degrading service. And because Prime maintains significant overflow capacity, we can reroute traffic and bring up new deployments whenever more capacity is needed.

How we serve production agent traffic

Workload

A typical agent turn adds about 6K tokens to a 140K-token prompt, reusing most of the conversation history. Under load, these returning sessions run alongside new requests with long, uncached prompts.

We benchmark this mix with AgentX from SemiAnalysis, which replays multi-turn agent sessions. Our benchmark harness also injects cold arrivals with long prompts. We measure end-to-end tokens per second per user for interactivity and output tokens per second per GPU for efficiency.

Prefill/decode disaggregation

On shared GPUs, processing a long prompt can interrupt token generation for existing sessions. Chunked prefill limits these interruptions, but both workloads still compete for GPU time.

We run prefill and decode on separate GPU groups. NVIDIA Dynamo handles routing and orchestration, while vLLM runs the model on each group. Once prefill finishes, the decoder pulls the computed KV through NIXL and adds the request to its batch.

With Dynamo coordinating separate prefill and decode pools, we reduced p90 inter-token latency by nearly 40% in our tests.

Caching and routing

Dynamo's KV-aware router chooses a prefill worker based on how much of the prompt it already has cached and how much work is queued there. Workers publish cache updates so the router can track where prefixes are available. We also keep sessions on the same decoder between turns to support KV reuse.

Mooncake provides a second cache tier in host DRAM. Prefixes offloaded from GPU memory can be retrieved instead of recomputed, allowing us to retain more conversation history.

Performance: GLM-5.3 on GB200 NVL72

Long-context agentic serving is as much a cache-management problem as a compute problem. Performance therefore depends on retaining that history, scheduling new work promptly, and moving cached state without interrupting ongoing generation.

Our interactivity target was 100 end-to-end tokens per second per user. We tune for the number of concurrent sessions we can support at that speed.

We optimized these paths separately: prefill topology and scheduling to reduce time to first token; compressed KV and a fused attention kernel to support low-latency decoding; and a transfer-friendly cache layout to reduce the overhead of moving KV between workers.

Technical deep dive

The sections below cover our work on topology, scheduling, compressed attention, and KV transfer:

  1. Choosing the right topology for prefill and decode
  2. Reducing the scheduler bubble on prefill
  3. NVFP4 KV compression on FlashInfer
  4. Faster NIXL transfers on NVLink with the BLHNC layout

Prefill: time to first token

Choosing the right topology

We chose DEP8: eight data-parallel attention ranks with expert parallelism across the group. DEP8 distributes requests across eight attention workers while sharing the model's experts across the group. With the MLA cache layout we used, TEP8 replicated each request's KV across all eight ranks, while DEP8 let the ranks cache different requests. Even after accounting for the extra weight memory this requires, we had roughly five times more usable prefix-cache capacity on the same hardware compared to a topology like TEP8, which was also benchmarked.

Scheduler bubble and the token budget

Cache capacity does not eliminate scheduling delays. We found that a request's cached KV could already be available while the request still waited to enter the running batch.

Workers check for completed loads between forward passes. Results then pass through a batch queue and scheduler, where a ready request can miss the current decision and wait another step. Under load, requests already in progress can fill the next prefill batch, delaying admission even when the cached history is ready. This creates a scheduler bubble.

To reduce this bubble, we halved the number of prompt tokens processed in each prefill step, from 8K to 4K per GPU. Shorter steps let waiting requests start sooner. On our configuration, median queue wait fell from 550ms to 110ms, reducing median time to first token by roughly 20%.

Decode: NVFP4 KV compression

Making room for low-latency decode

We compressed the 512-value MLA latent using NVFP4: four bits per value, with an FP8 scale for each group of 16 values. The 64-value positional component remained FP8. Including scales, each MLA cache row shrank from 576 to 352 bytes.

With the indexer and other state unchanged, total cache capacity increased by roughly 50%, from 1.09 million to 1.63 million cached tokens per decoder at the same memory budget.

A native NVFP4 sparse-MLA decode kernel

We built a native sparse-MLA kernel to remove that intermediate buffer. It consumes the positions selected by the sparse indexer, loads the compressed rows, and unpacks them on-chip as attention needs them. NVFP4 is the storage format; the attention computation uses FP16 operands with FP32 accumulation.

For each query token, a cluster of cooperating thread blocks divides the selected rows. In the GB200 configuration, each cluster spans three to eight SMs. The blocks combine their partial results through distributed shared memory, without a second kernel launch.

NVFP4 KV accuracy

We ran a rigorous evaluation suite, with particular emphasis on long-context tasks, to ensure that NVFP4 KV compression does not degrade accuracy.

KV transfer: reducing copy overhead on NVLink

We use vLLM's NIXL connector to let each decoder pull KV from the prefill workers over multi-node NVLink. In an early comparison, the NVLink configuration added roughly 292 ms to time to first token relative to InfiniBand. The faster interconnect was not translating into faster serving.

The bottleneck was transfer fragmentation.

Changing the layout to reduce fragmentation

We tested BLHNC, a block-major layout recently introduced by the vLLM community. It places a block's data from multiple layers together in memory, allowing NIXL to transfer those contiguous regions with fewer, larger copy operations.

Reliable tool calls

Performance is only part of production agent serving. Agents also need reliable tool calls to read files, run commands, and make edits. If the model calls the wrong tool or produces unusable arguments, the agent must retry or stop.

We contributed a structural-tag builder to Dynamo to translate tool definitions into rules that restrict the names and arguments the model can generate.

vLLM uses xgrammar to enforce those rules during decoding, masking tokens that would violate the tool-call grammar. We also fixed errors introduced during parsing: literal strings such as < were being converted into <, altering code or file contents, while some schema references and nullable argument types were interpreted incorrectly.

Built on open source, with great partners

  • vLLM and Inferact. Our stack runs on the vLLM inference engine. We thank Inferact for their deep collaboration on performance and production serving, and vLLM contributors around the world for continually advancing the engine.
  • NVIDIA Dynamo. The operating system beneath our LLM inference platform coordinates disaggregated workers, routes requests and KV state, and turns a distributed GPU fleet into one resilient serving system.

On the roadmap

  • Batch and async inference for large offline jobs at lower prices.
  • Dedicated and 1-click deployments on your own reserved capacity, including your fine-tuned models from Prime training runs.
Explore all 67 articles in today's digest

Fresh dev news, AI-digested daily. Never miss a trend at devoured.fyi