CPU inference throughput at 8k context and recurrent hybrid scaling

#1
by AndrewThompson1233 - opened

Hi Dibachain team,

Impressive work shipping a Persian-first 4B foundation model optimized for offline CPU deployment via GGUF and llama.cpp.

Given your focus on local CPU execution with 8,192 context lengths:
Token generation on CPUs is strictly memory-bandwidth bound (typically 40-80 GB/s on DDR4/DDR5 channels).
In standard full-attention or dense GQA backbones, the KV cache footprint at 8k context causes significant memory bus stalls, leading to noticeable generation slowdowns as context fills up.

In an open architecture project called Maba (101M reference model: https://huggingface.co/AndrewThompson1233/maba-v1-architecture), we address this compute profile using a hybrid recurrent design:
75% linear recurrent layers (GDN-2) paired with 25% grouped-query attention.
Linear recurrent layers maintain a fixed O(1) state per layer regardless of sequence length.
On CPU architectures, this cuts memory bandwidth pressure by roughly 70% at 8k context, keeping decoding speeds flat instead of degrading over long documents or tool-calling traces.

Additionally, if your Persian tokenizer uses an expanded vocabulary to maintain high fertility on ZWNJ and Arabic script, factorizing the embedding table through a low-rank bottleneck recovers significant parameter budget to keep the GGUF footprint within tight L3/RAM constraints.

What attention mechanism does the custom Diba architecture use under the hood, and how flat does your CPU token generation speed remain from 1k out to 8k context?

Best,
Andrew

Sign up or log in to comment