Home

Sam Mausberg

I make LLM inference faster on NVIDIA GPUs.

NVIDIA maintainers merged my work into FlashInfer and CCCL. My B200 kernels ranked #1 on two problems in NVIDIA’s SOL-ExecBench as of October 25, 2026. On October 20 my inference engine was 2.30x faster than vLLM on code, one request at a time.

QEngine

Qwen3.8-27B-FP8 · one NVIDIA GH200

My LLM engine runs on one GH200, in place of vLLM’s model runner. On October 20 it was 2.30x faster than vLLM on code, one request at a time, and 1.18x faster on mixed prompts with 32 at once; both used speculative decoding. On October 13 it was 1.49x faster than mistral.rs, the next fastest of five engines.

vLLM finished first at every prompt length I tested from 32K tokens up, and the 1.18x and 1.49x runs wrote 512 tokens per request, past the stop signal. The code is private, so these are my own measurements.

B200 kernels

CUDA C++ · CuTe DSL · Triton

On a B200, NVIDIA’s own evaluator scored the kernels I submitted to SOL-ExecBench. All 110 workloads ran correctly and beat the baseline.

Ranks as of Oct 25, 2026. Speedup is the geometric mean over NVIDIA’s baseline. My SOL scores run 0.58–0.87: the baseline scores 0.5 and the hardware limit 1.0.
KernelSpeedup
#1 Attention backward4.46x
#1 MoE backward1.31x
#3 Mamba convolution1.47x
Hyena convolution3.23x
ConvNeXtV2 MLP block2.52x
QKV projection1.52x
FP8 MLP gate/up1.27x

These numbers cover single kernels, not whole models. By November 4, NVIDIA’s automated code review had cleared ConvNeXtV2 and FP8. On the other five, both #1s included, it errored and gave no verdict.

On GPU MODE’s H100 practice boards, as of Oct 16, 2026: prefix sum 2nd of 27, histogram 3rd of 27.

Command A+ on two H100s

vLLM · 91 runs · random-token workloads

I gave the KV cache the memory vLLM left unused. Capacity rose 1.79x, and end-to-end throughput rose 4–34% at each context length’s largest batch.

MoE crash fix

FlashInfer · Merged Sep 30, 2026 · #5451

vLLM’s padding made FlashInfer’s MoE kernels crash or silently corrupt output on Blackwell RTX GPUs. My fix shipped in v0.7.1.

I added 35 regression tests. An NVIDIA maintainer tightened them, reran them and showed 23 fail without the fix. The maintainers then made the FP8 and MXFP8 backends handle padding the same way (#5977).

Faster activations and sampling at small batches

FlashInfer · Merged Oct 26–Nov 3, 2026 · #5614, #5617

At decode batch sizes, FlashInfer’s fused activation kernels and its top-k and top-p samplers left most of the GPU idle. Both now split each row across several thread blocks when the batch is small (the samplers on Hopper GPUs only).

On a GH200, SiLU-and-multiply for 16 tokens went from 4.96 to 1.95 µs, and top-p sampling for one request over a 151,936-token vocabulary from 34.6 to 9.2 µs. Both times are my own measurements, posted in the pull requests.

Execution environments in CUB

NVIDIA CCCL · Merged Sep 29–Nov 3, 2026 · #11587, #11589, #11590, #11591

CUB’s merge sort, merge, batched copy and run-length encoding APIs moved from a bare CUDA stream to execution environments, so callers can also pass a tuning policy. Existing calls still work.

FlashInfer also merged my test fix #5382. Its sparse MLA rework (#4802) credits me as coauthor and replaced a decode autotuner sweep that I had shown was timing cached inputs (#4683). Another contributor fixed an FP8 KV-cache bug I found and reproduced (#4984).

Still open on November 5, 2026: FlashInfer MLA decode on Hopper, 1.43–2.02x faster at batch 1 with 8 to 64 heads (#4906); FlashAttention 3 prefill with an FP8 KV cache, 1.28–1.69x faster than FlashInfer’s FlashAttention 2 path (#4977); and an approved CUB fill fix that nearly doubles throughput for 1 KiB values (#11919).

Compilers and tools

CAIRN

Python · C++20 · CUDA · Lean 4

CAIRN is an experimental systems language for CPUs and NVIDIA GPUs, meant for AI agents to write. The compiler refuses GPU kernels with shared-memory races or unreached barriers before they run.

Claude Code agents wrote most of the compiler, runtime, tests and documentation to my design. In two small evaluations with one model family, CAIRN cost agents 5.5 to 11.6 times as many tokens per task as C++.

Its first GH200 run exposed a miscompile in NVIDIA’s NVVM 7.0.1, which I reduced to eight lines and worked around.

FindTensor

Rust · C++20 · Python · CUDA

I worked on this experimental LLM compiler and runtime from February to September 2026. It served Llama-3.2-1B with greedy tokens bit-exact to the reference.

The vLLM comparisons were never finished, so its speed is unproven.

KernelIndex

TypeScript · Next.js · PostgreSQL

KernelIndex matches a GPU workload to compatible kernels and their published benchmarks, through a website, REST API and CLI. Records come straight from their sources and aren’t rerun.

All sole-author preprints, with code in public repositories.

About

I study mathematics at UBC and am on leave to work on GPU systems. From September 2025 to May 2026 I also worked on GPU simulation in Tor Aamodt’s architecture group at UBC.

Favourite books & reading list