Each of these is a workload companies already run on CPUs. Kwker replaces the slow part and leaves the rest of
your stack as it is. Every card links to the measurements behind its numbers; the documentation shows
how to run each one.
Language models on CPU servers
Chat, extraction, summarization and classification with small and mid-size models, without GPUs. KwkDecoder runs
the whole model in one native call with int4 or int8 weights.
2.1× faster generation and 3.3× faster prompt reading than llama.cpp with 4-bit weights and 2,048 tokens of context (geometric means, models up to 1.7B parameters); 3.7× generating after 8,192 tokens (SmolLM2-135M); 2.1–2.4× its throughput serving 8 requests at once
Language models
Embeddings and semantic search
Encode documents and queries with BERT-family models, then rank the matches with top-k and search kernels built
for the same processors.
1.5× faster encoding than OpenVINO in bf16, 1.9× in int8 (geometric means, BERT-base and MiniLM)
Embeddings and search
Image models
Classify, tag and filter images with int8 weights calibrated on your own data. KwkCNN uses AMX tiles where the
processor has them, and VNNI where it does not.
1.6× faster than OpenVINO, both in int8 (geometric mean of eight standard classifiers)
Image models
Any PyTorch model with torch.compile
Training and inference for models no Kwker runner covers: pass backend="kwker" to
torch.compile. Kwker moves the graph onto its own kernels and keeps Inductor's version only where that is faster.
2.0× faster than stock Inductor (geometric mean of 34 training and inference workloads); the first call returns 9.0× sooner
torch.compile
Data and database workloads
Group-by, sorting, top-k, ORDER BY … LIMIT, percentiles and ranks over millions of rows in pandas, Polars,
pyarrow and DuckDB, from Python or straight from your service code. Each library's own null and NaN rules carry
over, so results match what you get today.
Group-by 7.6× faster than Polars 2.0 and 7.1× faster than pandas; table sorts 5.7× faster than pandas (geometric means); ORDER BY … LIMIT on 1M rows 1.8× (k = 10) to 3.5× (k = 1000) vs DuckDB
Data and databases
Inside the services you already run
Native calls from Java, JavaScript, Go, C#, Rust, C++ and 14 more languages, plus files larger than memory, every
core and a hard cap on extra memory.
3.1× faster than Java 25's Arrays.sort and 14× faster than JavaScript's TypedArray sort (geometric means, 1M keys)
Languages