Ceptron is a process world model: physics, simulated worlds and your data, in one model.Talk to us →
Domains · NeoClouds

A world model for AI inference.

Run any AI model the fastest, cheapest way, on any hardware. Tell Ceptron the model, the hardware you have or could rent, and what you care about. It tells you the setup to use and the speed and cost to expect — in seconds, for models and hardware it has never seen.

For teams serving open models: AI startups, inference providers and GPU clouds.

  1. Build the world model once. Hardware physics × model blueprints generate millions of possible serving worlds, and Ceptron learns how all of them behave.
  2. Ask it. Your need goes in. It finds which world you're in, tries candidate configs inside the model, and returns the best spec.
Illustrative animation
The problem

Choosing how to serve a model is guesswork. Expensive guesswork.

Every model can run dozens of ways: how many GPUs, which GPUs, what precision, how many users per batch, what to keep in memory. The right answer depends on the model, the hardware and your traffic.

⏳

Weeks of trial and error

Teams benchmark setup after setup. Vendor sizing tools need hours of profiling per GPU type, and cover one vendor.

💸

Costly wrong choices

Sensible-looking setups for the same model can differ by 3× or more in cost per token.

🔄

Answers expire

A new model, GPU or engine version every few weeks makes last month's benchmark obsolete.

What it answers

Pick a question. See it answer.

Try asking
Ceptronpreview

Try it: pick a model, a goal and your hardware.

Choose a model and what you care about, tick the hardware you could use, and see the setups ranked. Click a row to see where the model lives in memory and what limits its speed. Every answer was computed by the Ceptron physics engine from the model's architecture and the hardware's datasheet; nothing is written by hand.

Model
Goal
Minimum speed per user
Context per user
Hardware to consider all · none
Ranked setups
💡

Reading the results

The demo shows the upper limit each setup can reach, from the model's architecture and the hardware's datasheet. Real serving engines reach a fraction of that limit, and the fraction depends on the engine, its version and the machine. That is what Ceptron learns, so its answers reflect your stack, not just the datasheet. Give it a 32 GB laptop and GLM-5.3-Flash and it streams experts from disk; give it H200s and it keeps everything in GPU memory: the same strategies the Colibri engine and the official vLLM recipe use.

Model facts come from each public checkpoint and its model card. Hardware facts come from vendor datasheets; specs marked * are unverified estimates. Prices are rough on-demand rental rates per GPU-hour, and local machines are purchase price spread over 3 years of 24/7 use. All are assumptions, not quotes. Every speed is a physics limit, not a measured result.


Any model, profiled in seconds.

Point Ceptron at a public checkpoint and it maps the architecture without downloading the weights. Here is GLM-5.3-Flash: every number below matches its model card and the official vLLM recipe.

■ 34 KDA linear-attention layers with a fixed recurrent state■ 11 MLA + sparse-indexer layers, the only per-token KV
320.8B
parameters · 17.6B active per token
288 × 42
routed experts × layers · top-8 · 24 MiB each in FP8
22.3 GiB
read per decoded token · 14.4 resident + 7.9 experts
5.5%
of parameters active for each token, the rest waits in memory
How it works

Built once, before you ask. The physics of serving, op by op, learned offline by us.

Click any box for what it is, an example and what it means in plain terms · example numbers are illustrative
BUILD ONCE · OFFLINE 🖥Hardwarevendor datasheets · 1,050 parts 📐Modelread from the weights file 🧩Software stackcapability catalog 🎛Serving configthe knobs to search over 📈Workloadpublic traffic traces Forward modelphysics: computes the outcome, step by step Roofline per op› Memory placement› Communication› Scheduler› Caches› Speculative decoding› Queueing› Economics› step time ≈ Σ max(compute, memory) + communication + host overhead Simulation-based priorforward model + ranges for the unknownsWHAT DIFFERS SETUP TO SETUPhow well the software runs,network, how traffic arriveseach one drawn from a range,so every world is different Worldsmillions, simulatedone draw per setup→ 41 ms per token ⚙️Train oncelearns how everysimulated setupbehavesour GPUs · paid once 🧠World modelfor servingINsetup + goal(+ benchmark)OUTforecast withuncertainty bands,best config,ranked hardware ASK · SECONDS Your setup + goal4× H200 · GLM-5.3-Flashlowest cost at ≥10 tok/s Quick benchmarkoptional · 5 minuteslocates your setup Ceptronone forward pass AnswerTP4 · FP8 · batch 6431 ms/token (± 3) · $0.42/M Actual ≠ planned?Diagnose (TCPFN) findsthe missing mechanism new mechanism into the forward model, never a patched number
Selected

Answer

The forecast, the recommended config, and how sure it is.

Example
TP4 · FP8 · batch 64 → 31 ms per token (± 3) · $0.42 per million tokens
In plain terms
The flight plan, with expected arrival time and fuel.
Selected

Quick benchmark

An optional 5-minute run on your own machine, for tighter answers.

Example
five minutes on your machine → tighter bands
In plain terms
A short test flight before the long one.
Selected

Caches

Work you do not redo: shared prompt prefixes and experts already in fast memory.

Example
60% of each prompt shared → about 2.5× less prefill work
In plain terms
Keeping the most-used tools within arm's reach.
Selected

Communication

The cost of moving data between GPUs for each kind of parallelism, on the actual topology.

Example
MI300X: 64 GB/s per peer link, so TP4 peaks near 189 GB/s, far below the 448 GB/s headline
In plain terms
Radio traffic between crew: the more you split the work, the more you talk.
Selected

Serving config

Everything you can set. It is the search space Recommend explores, and every knob is a mechanism in the forward model, so the world model can reason about it.

Example
TP4 · FP8 weights · FP8 KV · batch 64 · MTP 2 tokens · prefix cache on
In plain terms
The flight settings: altitude, speed, flaps, route.
Selected

Actual ≠ planned → Diagnose

When actual differs from planned, find out why, and fix the world model rather than the number.

Example
planned 31 ms · actual 58 ms → cause: KV-cache thrashing at peak load
In plain terms
The investigator reading the flight recorder.
Selected

Economics

Turns seconds into dollars and joules.

Example
4× H200 at $3 per GPU-hour, 2,000 tokens/s → ≈ $1.67 per million tokens
In plain terms
Fuel cost per passenger-mile.
Selected

Forward model

Given every parameter, it computes the outcome. It steps through a serving engine's life, so batching, caching and queueing come out of it rather than being assumed.

Example
step time ≈ Σ max(compute, memory) + communication + host overhead
In plain terms
The physics engine of a flight simulator.
Selected

Hardware

Every NVIDIA and AMD part from 2016 on, normalized so the physics can use it: compute per number format, memory capacity and bandwidth, caches, interconnect, power.

Example
H100 SXM · 989 BF16 TFLOPS · 3.35 TB/s · NVLink 900 GB/s
In plain terms
The aircraft's spec sheet: engine thrust, fuel capacity, wingspan.
Selected

Memory placement

Decides where every byte lives (GPU memory, host RAM or NVMe) and what that leaves for the KV cache.

Example
laptop: 14.4 GiB resident in RAM, experts streamed from NVMe through an LRU cache
In plain terms
Loading the plane: what goes in the cabin and what goes in the hold.
Selected

Model

The model's architecture, read straight from its checkpoint: which weights exist, their shapes and number formats, and which of them each token uses.

Example
GLM-5.3-Flash · 288 experts × 24 MiB (FP8) · 8 active · 14.4 GiB always resident
In plain terms
The aircraft's blueprint: where every part sits and how much it weighs.
Selected

Simulation-based prior

The forward model plus a range for everything unknown. Each sample is one complete world.

Example
one draw: a complete serving setup → its speed and cost
In plain terms
The simulator set to random weather, aircraft and crews.
Selected

Queueing

Arrivals against service rate: where tail latency comes from.

Example
same average load, bursty vs steady: p99 time to first token several times worse
In plain terms
The line at security: the average wait is fine, rush hour is not.
Selected

Roofline per op

Each operation takes as long as whichever runs out first: compute or memory bandwidth.

Example
GLM-5.3-Flash decode on 4× H200: 22.5 GiB read per token ÷ (4 × 4.8 TB/s) ≈ 1.3 ms floor
In plain terms
Whether the climb is limited by engine power or by fuel flow.
Selected

Scheduler

Turns per-step time into per-request time, the way a serving engine actually batches.

Example
batch 1 → 64: each step a little slower, total tokens per second many times higher
In plain terms
The gate agent boarding passengers in groups.
Selected

Your setup + goal

What you tell it: the model, the hardware you have or could rent, the engine, and what you care about.

Example
4× H200 · GLM-5.3-Flash · lowest cost with every user ≥ 10 tokens/s
In plain terms
Telling the pilot the plane, the route and what matters most.
Selected

Speculative decoding

Drafting several tokens and verifying them in one pass. The output is identical; only speed changes.

Example
MTP with 2 drafts at 70% acceptance → ≈ 2.2 tokens per step
In plain terms
A co-pilot calling out the next moves; the captain confirms several at once.
Selected

Software stack

Which engine, version and kernels run the model. The biggest source of error: the same GPU reaches about half or most of its peak depending on software.

Example
SGLang on H200: FlashMLA ✓ · FP8 KV cache ✓ · DeepEP ✓
In plain terms
Which autopilot software the aircraft runs, and which features that version unlocks.
Selected

Train once

One network learns, across all those worlds, how serving setups behave. Paid once, on our GPUs.

Example
trained once, used for every setup
In plain terms
Thousands of simulator hours, done before the pilot ever flies.
Selected

World model

The trained network. Every question is one forward pass, answered in seconds, for setups it has never seen.

Example
one pass · ≈ 31 ms per token (± 3)
In plain terms
A trained pilot who has flown everything.
Selected

Workload

What you send the server. The same server is fast or slow depending on lengths, burstiness and how much prompts share.

Example
chat · 1.2K tokens in / 300 out (median) · bursty · 60% shared system prompt
In plain terms
The passengers and cargo: how many, how heavy, and when they show up.
Selected

Worlds

Millions of samples from the prior. Each one is a different serving setup and how it performs.

Example
millions of simulated serving setups
In plain terms
Millions of practice flights, every one simulated.
Talk to us

Bring Ceptron to your fleet.

Tell us which models and hardware you serve and we will be in touch.