Skip to content
DigitalNeuron
Chips & infrastructure

Databricks details Proteus system for specialized GPU kernel generation

Databricks says Proteus generates, validates and benchmarks shape-specific GPU kernels, including kernels for Qwen 3.5 122B.

By DigitalNeuron Desk2 min read

Quick answer

What did Databricks announce about its Proteus GPU kernel generation system?

Databricks unveiled Proteus, a system that uses agents to generate specialized GPU kernels and subjects candidates to controlled validation and repeated benchmarking. The company says individual kernels generated for Qwen 3.5 122B were 1.8 to 5.2 times faster than the best implementations available in vLLM.

Key takeaways

  • Databricks introduced Proteus, a system for generating GPU kernels specialized to runtime shapes.
  • The company says individual Qwen 3.5 122B kernels generated with Proteus were 1.8 to 5.2 times faster than the best implementations available in vLLM.
  • Proteus verifies proposed kernels against a controlled reference implementation and benchmarks only candidates that pass validation.
  • In a Gated DeltaNet packed-decode test on NVIDIA B200 GPUs, Databricks reported shape-specific gains of as much as 1.6 times.

Databricks has introduced Proteus, a system that uses agents to generate GPU kernels specialized for particular runtime shapes while applying controlled validation, repeated benchmarking and managed context.

The company says individual kernels produced for Qwen 3.5 122B were 1.8 to 5.2 times faster than the best implementations available in vLLM. Databricks presented the results alongside details of the harness it built to check proposed kernels and carry useful information between optimization attempts.

Validation before benchmarking

Proteus proposes kernels, verifies them against a controlled reference implementation, times candidates that pass verification and iteratively improves the strongest measured results. Databricks says validation became the central constraint because candidate kernels could appear fast without performing a fair version of the intended operation.

The company identified several sources of misleading results during development. A candidate could reuse compiled code from an earlier attempt, compare a replayed CUDA graph with a baseline that launched operations separately, or perform well only on input sizes visible during generation.

Databricks says its checker times both sides consistently and can use CUDA event timing, wall-clock time and CUPTI timing for cross-checks. It clears compiled state that should not persist, keeps setup and teardown ordering consistent, retests winning candidates and reserves some tests from the generating model. Automated consistency checks also flag claimed speedups above physical GPU bandwidth and compute limits, including results exceeding 100 times.

Limiting the context agents receive

Proteus also manages the information supplied to the kernel-generation model. Databricks says large prompts can include the current best kernel, failures, profiler guidance and notes from earlier runs, but may add cost and mix useful information with stale or conflicting advice. Prompts with too little context can cause repeated dead ends.

The company settled on a smaller knowledge layer containing actionable lessons tied to specific situations and concise failure notes from related parent runs. Proteus retrieves those lessons through hierarchical tag filtering and a hybrid of keyword and semantic search. Databricks says reorganizing and further distilling stored lessons should occur in background jobs rather than through repeated multi-step retrieval during every generation attempt.

Gated DeltaNet packed decode

Databricks tested the full loop on the Gated DeltaNet packed-decode path in Qwen 3.5 122B, using NVIDIA B200 GPUs and a Triton backend. The operation updates recurrent state and writes decode output from packed QKV inputs, gate parameters and state indices.

The reference implementation recorded latency of 0.025 milliseconds. An initial candidate passed validation but ran slower, after which Proteus divided the search into shape-specific paths. Databricks says Candidate 012 reached a 1.5-times result for the single-batch decode shape. On the serving-decode path, Candidate 030 recorded the lowest kernel latency at 0.018 milliseconds, while Candidate 036 delivered the highest shape speedup at 1.6 times.

The latter kernel specialized for a Batch=4, Key=128 and Value=128 layout and processed the value dimension in chunks of 64. Databricks described it as safe for that particular shape rather than a universal replacement.

Source: Databricks, “Achieving Extreme Efficiency through Specialized GPU Kernel Generation,” published September 4, 2026.

Frequently asked questions

What is Proteus?
Proteus is Databricks' system for using agents to propose and iteratively improve specialized GPU kernels. Its harness validates candidates against a controlled reference before timing them.
What performance did Databricks report?
Databricks says individual kernels generated for Qwen 3.5 122B were 1.8 to 5.2 times faster than the best implementations available in vLLM.
How does Proteus guard against misleading benchmark results?
Databricks says the system uses consistent setup and timing, hidden tests, repeated measurements and automated checks for theoretically impossible speedups. It can cross-check results with CUDA event, wall-clock and CUPTI timers.
What did the Gated DeltaNet case study show?
On NVIDIA B200 GPUs with a Triton backend, Databricks reported a Batch-1 candidate reaching 1.5 times the reference performance and a serving-decode candidate reaching a 1.6-times shape-specific speedup.

Sources

  1. Achieving Extreme Efficiency through Specialized GPU Kernel Generation | Databricks BlogDatabricks
Tagsdatabricksproteusgpu-kernelsqwen-3.5tritonnvidia-b200

Related reading

Analysis: self-hosting an open-weight model — the arithmetic that decides it, and the costs nobody budgets for

Only at high, steady utilisation. Self-hosting converts a variable per-token cost into a fixed hourly cost, so it wins when accelerators stay busy and loses badly when they idle. The honest comparison prices the full stack — accelerator hours, redundancy, engineering time, and the evaluation work needed to confirm the smaller model is good enough — against the API bill for the same traffic. Sovereignty, data residency and latency floors are separate reasons that can justify self-hosting regardless of the arithmetic.

6 min read

Why does AI use so much electricity?

AI accelerators draw far more power per rack than traditional servers, and that power has to be delivered, cooled and paid for continuously. Training a large model is a one-off spike; serving it to millions of users is a permanent load, and inference is what dominates energy use over a deployed model's life.

Updated 4 min read