I designed a CPU-native LLM architecture that hits 100+ tok/s on a 10B parameter model (the quality is the problem)
Summary
The author designed a CPU-native LLM architecture that achieves over 100 tokens per second on a 10B parameter model, but highlights quality issues; they share a GitHub repo with code and research on adapting existing models.
Similar Articles
The idea: on a CPU the decode speed depends on the active params per token, not the total. My objective is trying to run a 10B at 100tok/s on a mid level PC (No GPU).
Presents the insight that CPU decode speed depends on active parameters per token, not total parameters, and proposes a 10B-parameter model using ternary weights and granular MoE to achieve high token rates on mid-level PCs. Reports sandbox measurements showing a speedup from 176 to 848 tok/s on an 8.3M model with minimal quality loss.
I developed my own quantized LLM from scratch, trained on 30B tokens, deploys in 60 MB [R]
A developer created a 250M parameter quantized LLM from scratch, trained on 30B tokens, deployable in 60 MB on CPU with a novel disk-based long context system supporting up to 100M tokens.
I trained a 75M parameter LLM from scratch on 18B tokens and it beats a model almost double its size
Trained a 75M parameter LLM called KeyLM from scratch on 18B tokens, achieving competitive instruction-following scores against larger models while using fewer parameters and less data.
@ClementDelangue: Kog open-sourced on @huggingface the 2B model that they used to show a model running at 3,000+ tokens per second. Very …
Kog has open-sourced the Laneformer 2B model, a 2.3B parameter instruction-tuned coding model designed for high-speed decoding, achieving over 3,000 tokens per second by prioritizing latency from the architecture stage.
@jinyuhou0: On popular benchmarks, our 30B model matches systems 20-30x its size (gpt-5.4-xhigh, DeepSeek-V3.2, Kimi-K2.5), while u…
A new 30B model matches systems 20-30x its size on popular benchmarks while using up to 95% fewer reasoning tokens than comparable agentic LLMs, achieved through a learned configurator that decides when and how to reason. Model and code are openly available.