From Prompt to Response: A Step-by-Step Walkthrough of LLM Inference
A cleaner mental model for LLM inference: prompt templating, tokenization, scheduling, prefill, KV cache, decode, and the split between the inference engine and the model.
The notebook / 64 articles
Notes on LLMs, machine learning, data engineering, and the systems that make them work.
Showing 1–10 of 64 posts
A cleaner mental model for LLM inference: prompt templating, tokenization, scheduling, prefill, KV cache, decode, and the split between the inference engine and the model.
Carry authorization through retrieval, context, caches, and citations. Define trust boundaries, revocation behavior, and operational controls.
Separate retrieval coverage, context quality, and answer support. Calculate ranking metrics and design reproducible regression gates.
Separate schema validity, citation identity, and factual support; design bounded repair, honest abstention, and streaming behavior around those distinct guarantees.
Translate questions into bounded retrieval plans, preserve metadata constraints, and verify SQL result semantics with a worked incident-table example.
Work through reciprocal rank fusion, distinguish full-text search from BM25, and evaluate reranking and corrective retrieval without treating scores as confidence.
Turn retrieved candidates into useful context by preserving qualifiers, tracking expansion provenance, budgeting tokens, and separating image retrieval from visual answering.
Understand vector geometry, pin the full encoding contract, and evaluate approximate search under real filters before migrating an embedding index.
Design document ingestion around immutable representations, idempotent jobs, and atomic publication so failed updates cannot silently replace searchable evidence.
Compare chunk boundaries on the same source, preserve qualifiers and table structure, and evaluate retrieval against stable evidence rather than arbitrary chunk IDs.