Home/ Products/ Bud LayerZero/ Product Brief
Bud LayerZero overview
Product Brief · Layer 01 · Kernel Orchestration

Bud LayerZero

The production-grade kernel orchestration framework for LLM inference — one API across every GPU-optimised kernel library, with automatic, explainable, nanosecond-scale selection per operation, per shape, per device. Open source under Apache 2.0.

Product reference v1.0 July 2026 ~10 min read
01At a glance

Kernel fragmentation, solved once.

Kernel libraries multiply faster than anyone can integrate them, and every serving framework rebuilds the same selection logic — picking differently for identical inputs. LayerZero makes that decision once, makes it visible, and makes it cost effectively nothing: call lz.attention() and the fastest available kernel executes.

Selection · cache hit<100ns
Selection · cache miss<500ns
Static dispatch0ns
Unit tests2,000+
design targets for the selection path, not kernel runtime · basis in §06
What it is
A kernel orchestration framework — one API across FlashAttention, FlashInfer, xFormers, Liger, Torch SDPA and more
Decides which kernel runs, per operation, per shape, per device — automatic and hardware-aware
Explainable: lz.explain() returns the candidates, their scores, and what filtered them out
Always overridable — lock a kernel, whitelist a backend, or boost a preference in code or hot-reloading YAML
What it is not
Another kernel library — it orchestrates the ones you already have; every backend is optional
A serving framework — it sits beneath your framework and resolves its operations to the best available kernel
A black box — every decision is traceable; a dispatch table's silent choices become an inspectable report
02Where it fits

Between your model and the metal.

Your framework calls one API. LayerZero resolves it to the best available kernel on the hardware you're actually running — and every layer of the Bud AI OS above runs on that surface.

Calls in — inference pipelines, custom stacks, and training loops calling ordinary PyTorch: lz.attention() and friends. Serving frameworks and custom stacks alike.

Dispatches to — the fastest available kernel for this operation, on this device, at this shape. CUDA, ROCm, Intel XPU, and CPU, through standardised backend adapters.

Policy, cache, filter, score, select — then dispatch. LayerZero is the selection engine between the call and the kernel: it decides, dispatches through a standardised adapter, and records the outcome for future scoring.

03Capabilities, in full

Automatic, explainable, overridable.

Six capability groups — the unified API, the selection engine, the transparency and control on top of it, and the coverage and hardening that make it deployable.

01One API across every backendFlashAttention, FlashInfer, xFormers, Liger, Torch SDPA and more behind one interface · standardised adapters — add a library and every caller benefits, no custom integration · no integration branches, no hand-tuned dispatch tables, no guessingunified dispatch
02Hardware-aware selectionaccounts for the device, dtype, and shape in front of it · degrades gracefully to torch SDPA when nothing better is available — never fails closed · scoring draws on priorities, boosts, and a performance history databaseper op · shape · device
03Explainable decisionslz.explain() returns the candidates, their scores, and what filtered them out · lz.which() shows what would run before it runs · kernel behaviour stops being a black box, debugging stops being archaeologylz.explain() · lz.which()
04Policy without a redeployfour rule types applied in strict priority order, with conditional logic · set in code (lz.lock(), lz.prefer(), lz.disabled()) or YAML that hot-reloads without a restart · A/B a kernel on a live production fleet — no code change, no redeploylock · allow · deny · boost
05The whole inference hot pathattention in every variant — causal, full, sliding window, cross, prefill, decode, paged · normalisation (RMS, Layer, Group), position encoding (RoPE, RoPE interleaved, ALiBi), activations (SwiGLU, GELU, SiLU), sampling (top-k, top-p, greedy), and quantisation (INT8, FP8, GPTQ, AWQ) · tokenizers (HF, SentencePiece, TikToken) and real-time audio via pre-allocated ring buffersbeyond attention
06Production hardeningcircuit breakers trip a failing kernel automatically — checked in under 50ns · CUDA-graph capture safety, readiness checks, and JIT warmup for shape bucketing · Prometheus and OpenTelemetry exporters ship with the frameworkfleet, not notebook
04How it works

Six steps. Sub-microsecond.

Every call runs the same pipeline — and short-circuits the moment it can. A locked kernel skips everything; a warm cache answers in under 100 nanoseconds.

The selection pipeline — every call

01Policy checkA LOCK rule wins outright.short-circuits
02Cache lookupMVCC cache, 256 shards.<100ns on hit
03FilterHardware, dtype, shape.hard constraints
04Apply policyAllow and deny rules.your rules
05ScorePriority, boosts, history.perf database
06SelectBest kernel, then cached.O(1) invalidation

result → flashinfer.decode · next identical call → cache hit

The backend network

Each backend sits behind a standardised adapter. LayerZero routes the operation to whichever one wins — and falls back to torch SDPA whenever none qualifies. All backends are optional; install only the kernel libraries you actually have.

BackendRoleNotes
FlashAttentionIO-aware attentionv2 / v3 / v4 · NVIDIA SM ≥ 80
FlashInferServing-optimised attentionpaged KV-cache · GQA
xFormersMemory-efficient attentionsparse patterns
Liger KernelFused Triton kernelsnorms & beyond — not an attention backend
oneDNN · ZenDNN · IPEXCPU & Intel GPU pathsthe hot path isn't GPU-only
Torch SDPAUniversal fallbackalways present — selection never fails closed

The policy system — four tiers, worked example

Rules apply in strict priority order: Lock, then Allow, then Deny, then Boost. The YAML file is watched and hot-reloaded, so policy changes reach a live fleet with zero downtime.

Lock
Force one kernel. Nothing else is considered.
Highest
Allow
Whitelist the backends you trust.
Then
Deny
Blacklist by condition — a bad shape, a known bug.
Then
Boost
Nudge a preference with a multiplier, not a hard rule.
Finally
# policy.yaml — hot-reloaded
version: "1.0"

# pin the kernel on A100+
locks:
  - operation: "attention.causal"
    backend: "flashinfer"
    condition: "sm >= 80"

# no slow fallbacks in prod
denies:
  - operation: "attention.*"
    backends: ["torch_sdpa"]
    condition: "batch > 32"

# prefer, don't force
boosts:
  - operation: "attention.*"
    backend: "flashinfer"
    boost_factor: 1.5

Same control from code: lz.lock(), lz.prefer(), lz.disabled() — and lz.which() to see what would run before it runs.

05Deployment & compatibility

Zero required dependencies. Four dispatch modes.

Python 3.11+ with every backend optional — bring only the kernel libraries you actually have. Choose how much flexibility you pay for, from frozen build-time selection to live hot-reloaded policy.

Install & run

Python 3.11+Zero required depsDocker

PyTorch native, Apache 2.0. Every backend is optional; graceful degradation to torch SDPA means a minimal install still runs everything.

Hardware

NVIDIA · CUDAAMD · ROCmIntel · XPUCPU

The same call resolves differently on every device — that's the point. FlashAttention on SM ≥ 80, ZenDNN on AMD CPUs, oneDNN and IPEX on Intel.

Observability

PrometheusOpenTelemetryReadiness checks

Telemetry exporters ship with the framework, and pre-deployment validation plus JIT warmup means the first request isn't the slow one.

Dispatch modes — pay only for the flexibility you use

ModeBehaviourCost
StaticSelection resolved at compile time and baked in.0ns overhead
DynamicRuntime selection, cached after the first call.100–500ns
Hot-reloadConfig file is watched; changes apply without a restart.0s downtime
Config-drivenYAML rules with conditional logic for production fleets.no code change

A/B kernels in production. Because policy hot-reloads, you can pin a kernel, roll one back, or compare two on a live fleet — with no restart and no redeploy.

06Proof & methodology

Every headline number, with its basis.

A selection layer is only worth having if it costs nothing to ask. These are the framework's design targets for the selection path, and the engineering that backs them.

0ns
Static dispatch
What backs itIn static mode, selection is resolved at compile time and baked in — at runtime there is no selection code on the path at all. The flexibility of the other modes is opt-in, not a tax.
<100ns
Selection · cache hit
What backs itAn MVCC sharded cache — 256 shards with O(1) invalidation — answers repeat selections. After the first call for a given operation, shape, and device, every identical call is a cache hit.
<500ns
Selection · cache miss
What backs itThe full six-step pipeline — policy, cache, filter, policy rules, score, select — is designed to complete in under half a microsecond, with a SQLite performance database informing future scoring. The result is then cached.
2,000+
Tests behind the framework
What backs it2,000+ unit tests alongside property-based, fuzz, stress, and correctness suites, plus circuit breakers (checked in <50ns) and CUDA-graph capture validation — kernel selection treated as production infrastructure.

The latency figures are design targets for LayerZero's own overhead — the cost of deciding which kernel runs, not the kernel's execution time.

07Why Bud Optional

Three things a dispatch table can't give you.

The alternative to LayerZero is what every framework does today: a hand-rolled, hard-coded kernel dispatch table. Here is what changes.

CapabilityHand-rolled dispatchBud LayerZero
Adding a new kernel libraryCustom integration per framework✓ One adapter — every caller benefits
Consistency across stacksEach stack picks differently✓ One answer for identical inputs
Explaining a selectionRead the source, guess✓ Candidates, scores, filter reasons
Changing kernels in productionCode change + redeploy✓ Hot-reloaded YAML policy
Failure handlingAd hoc✓ Circuit breakers + graceful fallback
Selection overheadFixed at whatever was written✓ 0ns static · <500ns dynamic
Hardware awarenessPer-device branches, hand-maintained✓ Device, dtype, shape — automatic
Explainable selection Policy without a redeploy Orchestration at zero cost One API, every backend Apache 2.0 open source
08Who it's for Optional

Anywhere kernel choice moves the needle.

If you serve tokens, the kernel decision is on your hot path — whether you've automated it or not. Six places LayerZero earns its keep.

Serving

Serving framework builders

Replace your in-house selection logic with one engine — and stop re-integrating every new kernel library by hand.

Custom stacks

Custom inference stacks

Get FlashAttention-class performance without owning dispatch code — call ordinary PyTorch and let selection happen underneath.

Operations

Production fleet operators

Pin, roll back, or A/B kernels across a live fleet through hot-reloaded YAML — with circuit breakers catching failures before they become outages.

Performance

Kernel & performance engineers

lz.explain() turns every selection into an inspectable report — candidates, scores, and filter reasons instead of archaeology.

Heterogeneous

Mixed-hardware estates

The same call resolves correctly on CUDA, ROCm, Intel XPU, and CPU — including oneDNN, ZenDNN, and IPEX paths off the GPU.

Beyond text

Real-time & quantised workloads

Sampling, quantisation (INT8, FP8, GPTQ, AWQ), tokenizers, and real-time audio via pre-allocated ring buffers — the whole hot path, orchestrated.

09Go deeper & next steps

Open source, ready to run.

LayerZero is open source under Apache 2.0 — the fastest way to evaluate it is to run it. Or return to the product overview for the story at a glance.

Get started with Bud

Put your data on it.

The fastest way to see what an integrated AI operating system does for your enterprise is a proof-of-concept on your infrastructure, with your data.

01 Identify a use case where complexity, cost, or governance is a known pain point.
02 Joint discovery — Bud maps your AI pain points to platform capabilities.
03 POC in days, on your hardware, with your data.