{"id":1050,"date":"2026-07-07T09:59:04","date_gmt":"2026-07-07T09:59:04","guid":{"rendered":"https:\/\/learnerbox.net\/blog\/?p=1050"},"modified":"2026-07-07T10:04:17","modified_gmt":"2026-07-07T10:04:17","slug":"how-large-language-models-work-part-5-inference-sampling-emergent-behaviour-and-open-frontiers","status":"publish","type":"post","link":"https:\/\/learnerbox.net\/blog\/ai-theory\/how-large-language-models-work-part-5-inference-sampling-emergent-behaviour-and-open-frontiers\/","title":{"rendered":"How Large Language Models Work \u2014 Part 5: Inference, Sampling, Emergent Behaviour, and Open Frontiers"},"content":{"rendered":"\n
This is the final part of a five-part series on the internal mechanics of large language models. Parts 1\u20134 covered tokenization, embeddings, attention, the transformer block, and the training and alignment pipeline. Part 5 addresses inference: how a trained model generates text, the mathematics of sampling, context window management, emergent capabilities, and the open research frontiers shaping the next generation of LLMs.<\/mark><\/h6>\n\n\n\n

From Trained Weights to Generated Text<\/h4>\n\n\n\n

A trained, aligned LLM is a fixed mathematical function: given a sequence of input tokens, it produces a probability distribution over the next token. Inference is the process of repeatedly applying this function to generate text, while the engineering decisions made at inference time have a surprisingly large impact on the quality, diversity, safety, and cost of model outputs.<\/p>\n\n\n\n

At each generation step t<\/mi><\/mrow>t<\/annotation><\/semantics><\/math>, the model computes:P<\/mi>(<\/mo>t<\/mi>n<\/mi>+<\/mo>1<\/mn><\/mrow><\/msub>\u2223<\/mo>t<\/mi>1<\/mn><\/msub>,<\/mo>t<\/mi>2<\/mn><\/msub>,<\/mo>\u2026<\/mo>,<\/mo>t<\/mi>n<\/mi><\/msub>;<\/mo>\u2009<\/mtext>\u03b8<\/mi>)<\/mo>=<\/mo>softmax<\/mtext>(<\/mo>W<\/mi>U<\/mi><\/msub>\u22c5<\/mo>h<\/mi>n<\/mi>(<\/mo>N<\/mi>)<\/mo><\/mrow><\/msubsup>)<\/mo><\/mrow>P(t_{n+1} \\mid t_1, t_2, \\ldots, t_n;\\, \\theta) = \\text{softmax}(W_U \\cdot \\mathbf{h}_n^{(N)})<\/annotation><\/semantics><\/math><\/p>\n\n\n\n

where h<\/mi>n<\/mi>(<\/mo>N<\/mi>)<\/mo><\/mrow><\/msubsup>\u2208<\/mo>R<\/mi>d<\/mi><\/msup><\/mrow>\\mathbf{h}_n^{(N)} \\in \\mathbb{R}^d<\/annotation><\/semantics><\/math> is the final-layer hidden state at position n<\/mi><\/mrow>n<\/annotation><\/semantics><\/math>n, W<\/mi>U<\/mi><\/msub>\u2208<\/mo>R<\/mi>\u2223<\/mi>V<\/mi>\u2223<\/mi>\u00d7<\/mo>d<\/mi><\/mrow><\/msup><\/mrow>W_U \\in \\mathbb{R}^{|V| \\times d}<\/annotation><\/semantics><\/math> is the unembedding matrix (often tied to the transpose of the input embedding matrix W<\/mi>E<\/mi><\/msub><\/mrow>W_E<\/annotation><\/semantics><\/math>WE\u200b), and the resulting vector of logits over \u2223<\/mi>V<\/mi>\u2223<\/mi><\/mrow>|V|<\/annotation><\/semantics><\/math> vocabulary entries is passed through softmax to produce a probability distribution. A token is then drawn from this distribution (called the sampling step) appended to the context, and the process repeats.<\/p>\n\n\n\n

The Mathematics of Sampling<\/h4>\n\n\n\n

How a token is selected from the output distribution is not trivial. Naive greedy decoding that always selects the highest-probability token tends to produce repetitive, degenerate outputs. Real systems use one or more of the following strategies.<\/p>\n\n\n\n

Temperature scaling.<\/strong> Before applying softmax, the logits are divided by a temperature parameter T<\/mi>><\/mo>0<\/mn><\/mrow>T > 0<\/annotation><\/semantics><\/math>T>0:P<\/mi>T<\/mi><\/msub>(<\/mo>t<\/mi>n<\/mi>+<\/mo>1<\/mn><\/mrow><\/msub>=<\/mo>k<\/mi>)<\/mo>=<\/mo>exp<\/mi>\u2061<\/mo>(<\/mo>z<\/mi>k<\/mi><\/msub>\/<\/mi>T<\/mi>)<\/mo><\/mrow>\u2211<\/mo>j<\/mi><\/munder>exp<\/mi>\u2061<\/mo>(<\/mo>z<\/mi>j<\/mi><\/msub>\/<\/mi>T<\/mi>)<\/mo><\/mrow><\/mfrac><\/mrow>P_T(t_{n+1} = k) = \\frac{\\exp(z_k \/ T)}{\\sum_j \\exp(z_j \/ T)}<\/annotation><\/semantics><\/math><\/p>\n\n\n\n

As T<\/mi>\u2192<\/mo>0<\/mn><\/mrow>T \\to 0<\/annotation><\/semantics><\/math>, the distribution concentrates on the single highest-logit token, equivalent to greedy decoding. As T<\/mi>\u2192<\/mo>\u221e<\/mi><\/mrow>T \\to \\infty<\/annotation><\/semantics><\/math>, the distribution approaches uniformity with maximum entropy, maximum randomness. Values of T<\/mi>\u2208<\/mo>[<\/mo>0.6<\/mn>,<\/mo>1.0<\/mn>]<\/mo><\/mrow>T \\in [0.6, 1.0]<\/annotation><\/semantics><\/math> are typical for creative generation; T<\/mi>\u2208<\/mo>[<\/mo>0.0<\/mn>,<\/mo>0.3<\/mn>]<\/mo><\/mrow>T \\in [0.0, 0.3]<\/annotation><\/semantics><\/math> for precise factual or code generation tasks. Temperature does not change which token is most probable; instead, it changes how peaked or flat the distribution is.<\/p>\n\n\n\n

Top-k sampling.<\/strong> The distribution is truncated to only the k<\/mi><\/mrow>k<\/annotation><\/semantics><\/math> highest-probability tokens, which are then renormalised and sampled from. A typical value is k<\/mi>=<\/mo>40<\/mn><\/mrow>k = 40<\/annotation><\/semantics><\/math>. Top-k<\/mi><\/mrow>k<\/annotation><\/semantics><\/math> prevents the model from sampling tokens with negligible probability, but it is sensitive to the shape of the distribution. In a uniform distribution, k<\/mi>=<\/mo>40<\/mn><\/mrow>k = 40<\/annotation><\/semantics><\/math> keeps 40 of many reasonable options; in a very peaked distribution, k<\/mi>=<\/mo>40<\/mn><\/mrow>k = 40<\/annotation><\/semantics><\/math> may retain tokens with near-zero probability.<\/p>\n\n\n\n

**Nucleus (top-p<\/mi><\/mrow>p<\/annotation><\/semantics><\/math>) sampling.** Rather than fixing the number of tokens, nucleus sampling fixes the cumulative probability mass: the smallest set of tokens V<\/mi>p<\/mi><\/msub><\/mrow>\\mathcal{V}_p<\/annotation><\/semantics><\/math>\u200b such that \u2211<\/mo>k<\/mi>\u2208<\/mo>V<\/mi>p<\/mi><\/msub><\/mrow><\/msub>P<\/mi>(<\/mo>t<\/mi>k<\/mi><\/msub>)<\/mo>\u2265<\/mo>p<\/mi><\/mrow>\\sum_{k \\in \\mathcal{V}_p} P(t_k) \\geq p<\/annotation><\/semantics><\/math> is retained and renormalised. A typical value is p<\/mi>=<\/mo>0.9<\/mn><\/mrow>p = 0.9<\/annotation><\/semantics><\/math> or p<\/mi>=<\/mo>0.95<\/mn><\/mrow>p = 0.95<\/annotation><\/semantics><\/math>. Nucleus sampling adapts naturally to the distribution’s shape. A peaked distribution retains few tokens, a flat one retains many – this is now the dominant strategy in production systems.<\/p>\n\n\n\n

Min-p sampling.<\/strong> A newer variant, increasingly adopted in open-source inference stacks, sets a dynamic minimum probability threshold relative to the top token: any token with P<\/mi>(<\/mo>t<\/mi>k<\/mi><\/msub>)<\/mo><<\/mo>p<\/mi>min<\/mi>\u2061<\/mo><\/msub>\u00d7<\/mo>P<\/mi>(<\/mo>t<\/mi>max<\/mi>\u2061<\/mo><\/msub>)<\/mo><\/mrow>P(t_k) < p_{\\min} \\times P(t_{\\max})<\/annotation><\/semantics><\/math> is discarded. This keeps tokens that are meaningfully competitive with the best option while discarding genuinely improbable ones, and empirically reduces repetition more effectively than top-p<\/mi><\/mrow>p<\/annotation><\/semantics><\/math>p at matched quality.<\/p>\n\n\n\n

In practice, production inference systems combine multiple strategies: temperature scaling applied first to reshape the distribution, followed by top-p<\/mi><\/mrow>p<\/annotation><\/semantics><\/math> or min-p<\/mi><\/mrow>p<\/annotation><\/semantics><\/math> truncation, followed by top-k<\/mi><\/mrow>k<\/annotation><\/semantics><\/math> as a hard ceiling. The specific combination and hyperparameters are treated as tunable properties of a deployment configuration, not fixed properties of the model itself.<\/p>\n\n\n\n

Context Windows and Memory Management<\/h4>\n\n\n\n

Every inference call operates within a context window<\/strong>, which is the maximum sequence length the model can process in a single forward pass. For GPT-4, the context window is 128K tokens; for Gemini 1.5 Pro, it extended to 1 million tokens; Llama 3.1 supports 128K. Context window length is not a free parameter, rather, it is constrained by the quadratic O<\/mi>(<\/mo>n<\/mi>2<\/mn><\/msup>)<\/mo><\/mrow>O(n^2)<\/annotation><\/semantics><\/math> attention cost and, critically, by KV cache memory.<\/p>\n\n\n\n

As established in Part 2<\/a>, the KV cache stores the key and value tensors for every previous token at every layer, avoiding redundant recomputation during autoregressive generation. The memory footprint is:KV cache memory<\/mtext>=<\/mo>2<\/mn>\u00d7<\/mo>n<\/mi>\u00d7<\/mo>N<\/mi>layers<\/mtext><\/msub>\u00d7<\/mo>n<\/mi>heads<\/mtext><\/msub>\u00d7<\/mo>d<\/mi>k<\/mi><\/msub>\u00d7<\/mo>bytes per element<\/mtext><\/mrow>\\text{KV cache memory} = 2 \\times n \\times N_{\\text{layers}} \\times n_{\\text{heads}} \\times d_k \\times \\text{bytes per element}<\/annotation><\/semantics><\/math><\/p>\n\n\n\n

For a model with 96 layers, 96 heads, d<\/mi>k<\/mi><\/msub>=<\/mo>128<\/mn><\/mrow>d_k = 128<\/annotation><\/semantics><\/math>, processing a 128K-token context in FP16: 2<\/mn>\u00d7<\/mo>128000<\/mn>\u00d7<\/mo>96<\/mn>\u00d7<\/mo>96<\/mn>\u00d7<\/mo>128<\/mn>\u00d7<\/mo>2<\/mn>\u2248<\/mo>601<\/mn><\/mrow>2 \\times 128000 \\times 96 \\times 96 \\times 128 \\times 2 \\approx 601<\/annotation><\/semantics><\/math> GB. This exceeds the VRAM of any single current GPU by a factor of roughly 10, which is why long-context inference requires either model parallelism across multiple devices, quantisation of KV cache entries to lower precision (INT8 or INT4), or approximate attention methods that reduce what must be stored.<\/p>\n\n\n\n

Several efficient attention variants address this scaling problem. Flash Attention (Dao et al., 2022)<\/a> reorders the attention computation to avoid materialising the full n<\/mi>\u00d7<\/mo>n<\/mi><\/mrow>n \\times n<\/annotation><\/semantics><\/math> attention matrix in high-bandwidth memory, reducing memory complexity from O<\/mi>(<\/mo>n<\/mi>2<\/mn><\/msup>)<\/mo><\/mrow>O(n^2)<\/annotation><\/semantics><\/math> to O<\/mi>(<\/mo>n<\/mi>)<\/mo><\/mrow>O(n)<\/annotation><\/semantics><\/math> while maintaining identical numerical output. Grouped-query attention (GQA), used in Llama 2 and 3, shares key and value heads across multiple query heads, reducing KV cache size by a factor of g<\/mi><\/mrow>g<\/annotation><\/semantics><\/math> (the group size) without significant quality degradation. Sliding window attention, used in Mistral, restricts each token to attend only within a fixed window of recent tokens, allowing arbitrarily long sequences at the cost of cross-window recall.<\/p>\n\n\n\n

Emergent Capabilities and Phase Transitions<\/h4>\n\n\n\n

One of the most scientifically consequential, and practically important, observations in LLM scaling is the phenomenon of emergent capabilities<\/strong>: abilities that are essentially absent in smaller models and appear abruptly as scale crosses some threshold, without being explicitly trained for.<\/p>\n\n\n\n

Wei et al. (2022) documented dozens of such capabilities: few-shot chain-of-thought reasoning, multi-step arithmetic, word unscrambling, and logical deduction all exhibit sharp phase transitions: near-zero performance at sub-threshold scales, near-human performance above it. The sharpness of these transitions distinguishes emergence from smooth capability growth and has profound implications for predicting what a model trained at a given scale will be able to do.<\/p>\n\n\n\n

The mechanism underlying emergence is debated. One influential account (the “grokking” hypothesis, from Power et al. at Anthropic<\/a>) suggests that models first memorise training examples, then undergo a phase transition in which they discover a compressed algorithmic solution that generalises to held-out data. Another account, from Anthropic’s interpretability research, suggests that emergent capabilities correspond to the model assembling multi-step circuits, consisting of sequences of attention heads and FFN layers that compose to implement a non-trivial algorithm, and that these circuits can only form once the model has sufficient depth and width to represent all required intermediate computations simultaneously.<\/p>\n\n\n\n

From an engineering standpoint, emergence creates a prediction problem. The GPT-3 scaling curve gave no warning that a GPT-4-scale model would exhibit chain-of-thought reasoning, code execution, or structured tool use. This motivates careful capability elicitation and evaluation at each new model generation \u2014(the practice of red-teaming<\/strong><\/a>) as a safety and capability discovery discipline.<\/p>\n\n\n\n

Chain-of-Thought and Reasoning Models<\/h4>\n\n\n\n

The most practically significant emergent capability is multi-step reasoning \u2014 and the discovery that it can be dramatically improved by prompting or training the model to externalise its intermediate steps.<\/p>\n\n\n\n

Chain-of-thought prompting<\/em><\/strong> (Wei et al., 2022) established that providing examples of step-by-step reasoning in the prompt elicits dramatically better performance on multi-step arithmetic, commonsense reasoning, and symbolic manipulation tasks without any additional training. The effect is robust and scales with model size: smaller models gain little from chain-of-thought, but models above approximately 100B parameters show large, consistent improvements.<\/p>\n\n\n\n

Reasoning models<\/em><\/strong> \u2014 exemplified by OpenAI’s o1 and o3, and Anthropic’s Claude’s extended thinking mode \u2014 take this further by training models to produce extended internal reasoning traces before generating a final answer. The training procedure uses reinforcement learning on verifiable outcomes: the model is rewarded for producing correct final answers to problems where correctness can be checked algorithmically (mathematics, code execution, formal logic), and the RL signal drives the model to develop longer, more structured reasoning traces that are instrumentally useful for producing correct outputs.<\/p>\n\n\n\n

The result is a qualitatively different inference regime. A standard GPT-style model generates tokens in a single forward pass per token, with effective reasoning depth bounded by model depth. A reasoning model generates a long internal monologue, often thousands of tokens of scratchpad, before committing to an answer, effectively trading inference-time compute for reasoning quality. This represents a fundamental shift in the compute profile of AI: capability is no longer a fixed function of model size, but can be increased at inference time by allocating more tokens to reasoning.<\/p>\n\n\n\n

Open Frontiers: Mechanistic Interpretability, Multimodality, and Agents<\/h4>\n\n\n\n

Three research frontiers are most likely to define the next phase of LLM development.<\/p>\n\n\n\n

Mechanistic interpretability<\/strong> is the program of reverse-engineering what computations specific model components implement. The goal is to go beyond behavioural evaluation \u2014 what the model does \u2014 to structural understanding \u2014 what algorithm it uses to do it. Anthropic’s superposition hypothesis (Elhage et al., 2022) established that neural networks represent more features than they have dimensions by encoding features as directions in a high-dimensional space and tolerating controlled interference between them. The subsequent Sparse Autoencoder (SAE) program \u2014 also led at Anthropic \u2014 has made it possible to decompose model activations into sparse, interpretable features: human-understandable concepts that each activate for a specific, semantically coherent set of inputs. SAE-based interpretability tools are now being applied to frontier models at production scale, with the goal of identifying circuits responsible for deception, sycophancy, and unsafe behaviours before deployment.<\/p>\n\n\n\n

Multimodality<\/strong> extends the transformer architecture beyond text. Vision-language models (GPT-4V, Gemini, Claude 3) process images by encoding them through a vision encoder \u2014 typically a Vision Transformer (ViT) \u2014 into a sequence of patch embeddings that are projected into the LLM’s token embedding space and concatenated with text tokens before the first transformer layer. Audio-language models (GPT-4o’s audio mode) follow an analogous pattern with a spectrogram encoder. The frontier is native multimodality \u2014 a single model trained end-to-end on text, image, audio, and video tokens simultaneously, rather than modality-specific encoders bolted onto a text backbone.<\/p>\n\n\n\n

Agentic systems<\/strong> extend the inference loop beyond token generation to include tool use, memory retrieval, and sequential decision-making. An agent wraps an LLM in a loop: the model generates text that includes structured tool calls (web search, code execution, database queries); the tool results are appended to the context; the model continues generating, possibly issuing further tool calls, until it produces a final response. Multi-agent systems extend this further: multiple LLM instances, each with different system prompts and tool access, communicate with each other through structured message passing. The engineering challenges are significant \u2014 context management, tool reliability, error recovery, and safety alignment in agentic settings are all active areas of research \u2014 but the capability ceiling of agentic LLMs is substantially higher than single-turn generation.<\/p>\n\n\n\n

A Map of the Whole<\/h4>\n\n\n\n

Across this five-part series, we have traced the complete path from raw string to generated output:<\/p>\n\n\n\n

    \n
  1. Tokenization<\/strong> \u2014 BPE or SentencePiece converts text into integer token IDs from a vocabulary of 32K\u2013256K entries.<\/li>\n\n\n\n
  2. Embedding<\/strong> \u2014 each token ID is projected into a d<\/mi><\/mrow>d<\/annotation><\/semantics><\/math>d-dimensional vector; positional information is added via learned embeddings, sinusoidal encoding, or RoPE.<\/li>\n\n\n\n
  3. Attention<\/strong> \u2014 N<\/mi><\/mrow>N<\/annotation><\/semantics><\/math>N transformer blocks each apply multi-head self-attention: Q, K, V projections; scaled dot products; causal masking; softmax; value aggregation.<\/li>\n\n\n\n
  4. Feed-forward network<\/strong> \u2014 each block applies a position-wise two-layer MLP with SwiGLU activation, implementing key-value memory over learned factual associations.<\/li>\n\n\n\n
  5. Training<\/strong> \u2014 next-token prediction loss over trillions of tokens; AdamW with cosine decay; Chinchilla-optimal compute allocation; distributed parallelism at scale.<\/li>\n\n\n\n
  6. Alignment<\/strong> \u2014 SFT on human demonstrations, reward model training on preference rankings, RLHF with PPO or DPO to concentrate capability toward preferred outputs.<\/li>\n\n\n\n
  7. Inference<\/strong> \u2014 temperature scaling, nucleus or min-p<\/mi><\/mrow>p<\/annotation><\/semantics><\/math>p sampling, KV cache management, and extended chain-of-thought reasoning to generate high-quality outputs efficiently.<\/li>\n<\/ol>\n\n\n\n

    The transformer is a simple, composable architectural primitive. What it does, when trained at sufficient scale on sufficient data, and aligned to human preferences, is not simple at all.<\/p>\n\n\n\n

    This concludes the five-part series on how large language models work. If you have found this series useful, the natural next steps are the mechanistic interpretability literature (Anthropic’s Transformer Circuits thread), the Chinchilla and scaling laws papers, and Neel Nanda’s open-source interpretability tooling at TransformerLens.<\/mark><\/em><\/h6>\n\n\n\n

    <\/p>\n","protected":false},"excerpt":{"rendered":"

    This is the final part of a five-part series on the internal mechanics of large language models. Parts 1\u20134 covered tokenization, embeddings, attention, the transformer block, and the training and alignment pipeline. Part 5 addresses inference: how a trained model generates text, the mathematics of sampling, context window management, emergent capabilities, and the open research frontiers shaping the next generation of LLMs. From Trained Weights to Generated Text A trained, aligned LLM is a fixed mathematical function: given a sequence of input tokens, it produces a probability distribution over the next token. Inference is the process of repeatedly applying this function to generate text, while the engineering decisions made at inference time have a surprisingly large impact on the quality, diversity, safety, and cost of model outputs. At each generation step tt, the model computes:P(tn+1\u2223t1,t2,\u2026,tn;\u2009\u03b8)=softmax(WU\u22c5hn(N))P(t_{n+1} \\mid t_1, t_2, \\ldots, t_n;\\, \\theta) = \\text{softmax}(W_U \\cdot \\mathbf{h}_n^{(N)}) where hn(N)\u2208Rd\\mathbf{h}_n^{(N)} \\in \\mathbb{R}^d is the final-layer hidden state at position nnn, WU\u2208R\u2223V\u2223\u00d7dW_U \\in \\mathbb{R}^{|V| \\times d} is the unembedding matrix (often tied to the transpose of the input embedding matrix WEW_EWE\u200b), and the resulting vector of logits over \u2223V\u2223|V| vocabulary entries is passed through softmax to produce a probability distribution. A token is then drawn from this distribution (called the sampling step) appended to the context, and the process repeats. The Mathematics of Sampling How a token is selected from the output distribution is not trivial. Naive greedy decoding that always selects the highest-probability token tends to produce repetitive, degenerate outputs. Real systems use one or more of the following strategies. Temperature scaling. Before applying softmax, the logits are divided by a temperature parameter T>0T > 0T>0:PT(tn+1=k)=exp\u2061(zk\/T)\u2211jexp\u2061(zj\/T)P_T(t_{n+1} = k) = \\frac{\\exp(z_k \/ T)}{\\sum_j \\exp(z_j \/ T)} As T\u21920T \\to 0, the distribution concentrates on the single highest-logit token, equivalent to greedy decoding. As T\u2192\u221eT \\to \\infty, the distribution approaches uniformity with maximum entropy, maximum randomness. Values of T\u2208[0.6,1.0]T \\in [0.6, 1.0] are typical for creative generation; T\u2208[0.0,0.3]T \\in [0.0, 0.3] for precise factual or code generation tasks. Temperature does not change which token is most probable; instead, it changes how peaked or flat the distribution is. Top-k sampling. The distribution is truncated to only the kk highest-probability tokens, which are then renormalised and sampled from. A typical value is k=40k = 40. Top-kk prevents the model from sampling tokens with negligible probability, but it is sensitive to the shape of the distribution. In a uniform distribution, k=40k = 40 keeps 40 of many reasonable options; in a very peaked distribution, k=40k = 40 may retain tokens with near-zero probability. **Nucleus (top-pp) sampling.** Rather than fixing the number of tokens, nucleus sampling fixes the cumulative probability mass: the smallest set of tokens Vp\\mathcal{V}_p\u200b such that \u2211k\u2208VpP(tk)\u2265p\\sum_{k \\in \\mathcal{V}_p} P(t_k) \\geq p is retained and renormalised. A typical value is p=0.9p = 0.9 or p=0.95p = 0.95. Nucleus sampling adapts naturally to the distribution’s shape. A peaked distribution retains few tokens, a flat one retains many – this is now the dominant strategy in production systems. Min-p sampling. A newer variant, increasingly adopted in open-source inference stacks, sets a dynamic minimum probability threshold relative to the top token: any token with P(tk)<pmin\u2061\u00d7P(tmax\u2061)P(t_k) < p_{\\min} \\times P(t_{\\max}) is discarded. This keeps tokens that are meaningfully competitive with the best option while discarding genuinely improbable ones, and empirically reduces repetition more effectively than top-ppp at matched quality. In practice, production inference systems combine multiple strategies: temperature scaling applied first to reshape the distribution, followed by top-pp or min-pp truncation, followed by top-kk as a hard ceiling. The specific combination and hyperparameters are treated as tunable properties of a deployment configuration, not fixed properties of the model itself. Context Windows and Memory Management Every inference call operates within a context window, which is the maximum sequence length the model can process in a single forward pass. For GPT-4, the context window is 128K tokens; for Gemini 1.5 Pro, it extended to 1 million tokens; Llama 3.1 supports 128K. Context window length is not a free parameter, rather, it is constrained by the quadratic O(n2)O(n^2) attention cost and, critically, by KV cache memory. As established in Part 2, the KV cache stores the key and value tensors for every previous token at every layer, avoiding redundant recomputation during autoregressive generation. The memory footprint is:KV cache memory=2\u00d7n\u00d7Nlayers\u00d7nheads\u00d7dk\u00d7bytes per element\\text{KV cache memory} = 2 \\times n \\times N_{\\text{layers}} \\times n_{\\text{heads}} \\times d_k \\times \\text{bytes per element} For a model with 96 layers, 96 heads, dk=128d_k = 128, processing a 128K-token context in FP16: 2\u00d7128000\u00d796\u00d796\u00d7128\u00d72\u22486012 \\times 128000 \\times 96 \\times 96 \\times 128 \\times 2 \\approx 601 GB. This exceeds the VRAM of any single current GPU by a factor of roughly 10, which is why long-context inference requires either model parallelism across multiple devices, quantisation of KV cache entries to lower precision (INT8 or INT4), or approximate attention methods that reduce what must be stored. Several efficient attention variants address this scaling problem. Flash Attention (Dao et al., 2022) reorders the attention computation to avoid materialising the full n\u00d7nn \\times n attention matrix in high-bandwidth memory, reducing memory complexity from O(n2)O(n^2) to O(n)O(n) while maintaining identical numerical output. Grouped-query attention (GQA), used in Llama 2 and 3, shares key and value heads across multiple query heads, reducing KV cache size by a factor of gg (the group size) without significant quality degradation. Sliding window attention, used in Mistral, restricts each token to attend only within a fixed window of recent tokens, allowing arbitrarily long sequences at the cost of cross-window recall. Emergent Capabilities and Phase Transitions One of the most scientifically consequential, and practically important, observations in LLM scaling is the phenomenon of emergent capabilities: abilities that are essentially absent in smaller models and appear abruptly as scale crosses some threshold, without being explicitly trained for. Wei et al. (2022) documented dozens of such capabilities: few-shot chain-of-thought reasoning, multi-step arithmetic, word unscrambling, and logical deduction all exhibit sharp phase transitions: near-zero performance at sub-threshold scales, near-human performance above it. The sharpness of these transitions distinguishes emergence from smooth capability growth and has profound implications for predicting what a model trained at a given scale will be able to do. The mechanism underlying emergence is debated. One influential account (the “grokking” hypothesis, from Power et al. at Anthropic) suggests that models first memorise training examples, then undergo a phase transition in which they discover a compressed algorithmic solution that generalises to held-out data. Another account, from Anthropic’s interpretability research, suggests that emergent capabilities correspond to the model assembling multi-step circuits, consisting of sequences of attention heads and FFN layers that compose to implement a non-trivial algorithm, and that these circuits can only form once the model has sufficient depth and width to represent all required intermediate computations simultaneously. From an engineering standpoint, emergence creates a prediction problem. The GPT-3 scaling curve gave no warning that a GPT-4-scale model would exhibit chain-of-thought reasoning, code execution, or structured tool use. This motivates careful capability elicitation and evaluation at each new model generation \u2014(the practice of red-teaming) as a safety and capability discovery discipline. Chain-of-Thought and Reasoning Models The most practically significant emergent capability is multi-step reasoning \u2014 and the discovery that it can be dramatically improved by prompting or training the model to externalise its intermediate steps. Chain-of-thought prompting (Wei et al., 2022) established that providing examples of step-by-step reasoning in the prompt elicits dramatically better performance on multi-step arithmetic, commonsense reasoning, and symbolic manipulation tasks without any additional training. The effect is robust and scales with model size: smaller models gain little from chain-of-thought, but models above approximately 100B parameters show large, consistent improvements. Reasoning models \u2014 exemplified by OpenAI’s o1 and o3, and Anthropic’s Claude’s extended thinking mode \u2014 take this further by training models to produce extended internal reasoning traces before generating a final answer. The training procedure uses reinforcement learning on verifiable outcomes: the model is rewarded for producing correct final answers to problems where correctness can be checked algorithmically (mathematics, code execution, formal logic), and the RL signal drives the model to develop longer, more structured reasoning traces that are instrumentally useful for producing correct outputs. The result is a qualitatively different inference regime. A standard GPT-style model generates tokens in a single forward pass per token, with effective reasoning depth bounded by model depth. A reasoning model generates a long internal monologue, often thousands of tokens of scratchpad, before committing to an answer, effectively trading inference-time compute for reasoning quality. This represents a fundamental shift in the compute profile of AI: capability is no longer a fixed function of model size, but can be increased at inference time by allocating more tokens to reasoning. Open Frontiers: Mechanistic Interpretability, Multimodality, and Agents Three research frontiers are most likely to define the next phase of LLM development. Mechanistic interpretability is the program of reverse-engineering what computations specific model components implement. The goal is to go beyond behavioural evaluation \u2014 what the model does \u2014 to structural understanding \u2014 what algorithm it uses to do it. Anthropic’s superposition hypothesis (Elhage et al., 2022) established that neural networks represent more features than they have dimensions by encoding features as directions in a high-dimensional space and tolerating controlled interference between them. The subsequent Sparse Autoencoder (SAE) program \u2014 also led at Anthropic \u2014 has made it possible to decompose model activations into sparse, interpretable features: human-understandable concepts that each activate for a specific, semantically coherent set of inputs. SAE-based interpretability tools are now being applied to frontier models at production scale, with the goal of identifying circuits responsible for deception, sycophancy, and unsafe behaviours before deployment. Multimodality extends the transformer architecture beyond text. Vision-language models (GPT-4V, Gemini, Claude 3) process images by encoding them through a vision encoder \u2014 typically a Vision Transformer (ViT) \u2014 into a sequence of patch embeddings that are projected into the LLM’s token embedding space and concatenated with text tokens before the first transformer layer. Audio-language models (GPT-4o’s audio mode) follow an analogous pattern with a spectrogram encoder. The frontier is native multimodality \u2014 a single model trained end-to-end on text, image, audio, and video tokens simultaneously, rather than modality-specific encoders bolted onto a text backbone. Agentic systems extend the inference loop beyond token generation to include tool use, memory retrieval, and sequential decision-making. An agent wraps an LLM in a loop: the model generates text that includes structured tool calls (web search, code execution, database queries); the tool results are appended to the context; the model continues generating, possibly issuing further tool calls, until it produces a final response. Multi-agent systems extend this further: multiple LLM instances, each with different system prompts and tool access, communicate with each other through structured message passing. The engineering challenges are significant \u2014 context management, tool reliability, error recovery, and safety alignment in agentic settings are all active areas of research \u2014 but the capability ceiling of agentic LLMs is substantially higher than single-turn generation. A Map of the Whole Across this five-part series, we have traced the complete path from raw string to generated output: The transformer is a simple, composable architectural primitive. What it does, when trained at sufficient scale on sufficient data, and aligned to human preferences, is not simple at all. This concludes the five-part series on how large language models work. If you have found this series useful, the natural next steps are the mechanistic interpretability literature (Anthropic’s Transformer Circuits thread), the Chinchilla and scaling laws papers, and Neel Nanda’s open-source interpretability tooling at TransformerLens.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[38],"tags":[],"class_list":["post-1050","post","type-post","status-publish","format-standard","hentry","category-ai-theory"],"_links":{"self":[{"href":"https:\/\/learnerbox.net\/blog\/wp-json\/wp\/v2\/posts\/1050","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/learnerbox.net\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/learnerbox.net\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/learnerbox.net\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/learnerbox.net\/blog\/wp-json\/wp\/v2\/comments?post=1050"}],"version-history":[{"count":1,"href":"https:\/\/learnerbox.net\/blog\/wp-json\/wp\/v2\/posts\/1050\/revisions"}],"predecessor-version":[{"id":1051,"href":"https:\/\/learnerbox.net\/blog\/wp-json\/wp\/v2\/posts\/1050\/revisions\/1051"}],"wp:attachment":[{"href":"https:\/\/learnerbox.net\/blog\/wp-json\/wp\/v2\/media?parent=1050"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/learnerbox.net\/blog\/wp-json\/wp\/v2\/categories?post=1050"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/learnerbox.net\/blog\/wp-json\/wp\/v2\/tags?post=1050"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}