{
  "title": "A block table maps a logical KV position",
  "caption": "In this example, P=4 and B_r=[5,2,8]. Position p=6 maps to logical block 1, physical block 2 and offset 2. Lookup does not change the separate free pool. Allocation and reclamation of unreferenced blocks are different operations. The author made this explanatory diagram.",
  "alt": "PagedAttention flow: with P=4 and Bᵣ=[5,2,8], lookup p=6 gives logical block L1, physical KV block 2 and offset 2.",
  "sources": [
    {
      "path": "content/blog/2026-06-11_life-of-a-request-vllm/post.md",
      "sha256": "158aa77041646bca8aba059344c4b6b0a6b451329b4a423e9c8027db8ba0304a",
      "description": "Current article explanation, equations, assumptions and retained citations."
    },
    {
      "path": "research/dynamic-mechanisms-2026-10-21/before/content/blog/2026-06-11_life-of-a-request-vllm/illustrations/03-paged-kv-algorithm.svg",
      "sha256": "9ddb96f441b67cc36551e37c61de89a56f8ade20fefeebbad979a5db172cc40d",
      "description": "Frozen prior illustration; exact pre-migration bytes retained."
    },
    {
      "path": "content/blog/2026-06-11_life-of-a-request-vllm/illustrations/source-notes.json",
      "description": "Existing article illustration provenance, retained unchanged."
    }
  ],
  "limitations": [
    "The execution is an example. Playback duration is not measured runtime."
  ]
}