Diagram of pages, GQA heads, and a prefix-sharing trie routing memory blocks.

Building a Paged KV Cache with GQA Sharing and Prefix-Reuse Eviction

TL;DR — A paged KV cache with grouped-query attention (GQA) sharing and a prefix-reuse eviction policy is one of the most credible LLM-systems projects you can ship to a CV in a weekend. It mirrors the design choices in vLLM, SGLang, and the RadixAttention paper, demonstrates that you understand memory hierarchies, attention math, and eviction, and produces a runnable artifact you can benchmark on real prompts. Why This Project Stands Out on a CV Hiring managers for inference, ML platform, and applied-LLM roles scan portfolios for evidence that a candidate can translate a paper into a working system. A paged KV cache hits that target harder than almost any other weekend project because the design space is genuinely contested in production: vLLM ships PagedAttention, SGLang ships RadixAttention, TensorRT-LLM ships in-flight batching with custom paged kernels, and HuggingFace TGI ships its own block manager. Building one from scratch proves you have read those systems and understood why they look the way they do. ...

September 5, 2026 · 13 min · 2652 words · martinuke0
Abstract representation of compiler IR flowing into a register grid.

Inside the QBE JIT compiler: register allocation and inline caching in practice

How QBE compiles SSA IR to machine code, with a close look at its linear-scan register allocator and the inline caching techniques production JITs use to recover lost megamorphic performance.

September 3, 2026 · 13 min · 2751 words · martinuke0
Network packets flowing through an eBPF/XDP datapath diagram.

Building an eBPF-Powered Packet Classifier in C: A CV-Worthy Systems Project

Build a production-shaped eBPF/XDP packet classifier from scratch in C. Real code, real architecture, and a clear roadmap to extend it into a senior-level systems project.

September 3, 2026 · 11 min · 2172 words · martinuke0
Layered diagram of a key-value store with WAL, memtable, SSTables, and compaction.

Building a Mini LSM-Tree Key-Value Store in Rust: A CV-Grade Systems Project

Build a runnable LSM-tree key-value store with a write-ahead log in Rust, from WAL append to SSTable flush to compaction. The exact project to make your CV read like a database engineer’s.

September 2, 2026 · 12 min · 2532 words · martinuke0
A stylized illustration of transformer blocks and a KV cache heatmap.

Build Your Own Inference Engine: From Scratch

Demystify how LLM inference works by building a tiny inference engine from scratch. Covers tokenization, the transformer forward pass, KV cache, and decoding.

September 1, 2026 · 10 min · 2116 words · martinuke0
Feedback