Warp is a weight-aware runtime and paging engine (WARP) implemented in C with no third-party runtime dependencies. It is built to run massive mixture-of-experts models by keeping the shared trunk in RAM, streaming the selected experts from disk, and using remaining memory as a bounded expert cache. The project claims full, unpruned runs of frontier models: Kimi K3 (2.78T parameters, converted container ~982 GB) opens with about 29.19 GB resident and delivers 0.45-0.62 tok/s on a 64 GB MacBook Pro; DeepSeek-V4.1-Flash (552B, 299 GB) runs at ~3.77 tok/s with a 4.86 GB minimum RAM; GLM-5.3-Flash (313B, 112 GB) runs ~3.3-3.86 tok/s with ~5.14 GB minimum. The repository notes that much of the code was generated by LLMs to iterate rapidly on algorithms.
Key design specifics: experts are read on aligned disk reads with a lookahead router to prefetch candidates, experts use 3-bit residual vector quantization while shared weights remain at 4-8 bits, and K3’s linear attention plus compressed latent KV cache dramatically reduce KV memory. Performance is sensitive to cache sizing - too large a resident working set relative to process memory can induce page faults and collapse throughput - and to the number of experts per token (configurable). Storage speed is the main bottleneck (internal NVMe recommended), sharded bank layouts are supported, and numerical results are verified against PyTorch references.
Summary generated by AI from the linked article. hn.today is not affiliated with Hacker News or Y Combinator.