<path>/home/infatoshi/cuda/KernelBench-Hard/problems/03_paged_attention</path>
<type>directory</type>
<entries>
benchmark.py
check.py
problem.yaml
PROMPT.txt
reference.py
shapes.py
sota.py

(7 entries)
</entries>

<path>/home/infatoshi/cuda/KernelBench-Hard/problems/03_paged_attention/reference.py</path>
<type>file</type>
<content>
1: """Naive PyTorch paged-attention decode reference (correctness oracle, not SOTA).
2: 
3: Single-query decode: each batch element has a query of shape (num_heads, head_dim)
4: and attends over a KV cache of `seq_len[b]` tokens stored as fixed-size pages in
5: a global pool. Pages for batch element b are listed in `block_table[b]`.
6: 
7: The reference performs the slow path:
8:   1. Gather pages -> contiguous (seq_len, num_kv_heads, head_dim) per batch element.
9:   2. Repeat KV heads for grouped-query (broadcast num_kv_heads -> num_heads).
10:   3. Manual softmax(QK^T / sqrt(d)) @ V in fp32, cast back to bf16.
11: 
12: This avoids torch.nn.functional.scaled_dot_product_attention (which is on the
13: forbidden list) so the agent cannot dispatch through SDPA either.
14: """
15: import math
16: 
17: import torch
18: import torch.nn as nn
19: 
20: OP_TYPE = "attention"
21: SUPPORTED_PRECISIONS = ["bf16"]
22: HARDWARE_REQUIRED = ["RTX_PRO_6000", "H100", "B200"]
23: 
24: 
25: # --- Shape knobs (overridden by check.py / benchmark.py from shapes.py) ----
26: BATCH = 8
27: NUM_HEADS = 32
28: NUM_KV_HEADS = 8
29: HEAD_DIM = 128
30: SEQ_LEN = 1024
31: PAGE_SIZE = 16
32: 
33: 
34: class Model(nn.Module):
35:     """Single-query paged attention decode.
36: 
37:     Forward inputs (all on device):
38:       query:       (batch, num_heads, head_dim)               bf16
3

... (4426 more chars)

<path>/home/infatoshi/cuda/KernelBench-Hard/problems/03_paged_attention/check.py</path>
<type>file</type>
<content>
1: """Correctness runner for paged-attention decode.
2: 
3: Runs solution.Model vs reference.Model across all shapes in shapes.py, 3 seeds
4: each, with per-dtype atol/rtol. Also rejects forbidden ops by grep.
5: """
6: import re
7: import sys
8: from pathlib import Path
9: 
10: import torch
11: import yaml
12: 
13: REPO_ROOT = Path(__file__).resolve().parents[2]
14: sys.path.insert(0, str(REPO_ROOT))
15: 
16: from src.eval.correctness import check_correctness  # noqa: E402
17: 
18: 
19: def _apply_shape(reference, shape: dict) -> None:
20:     reference.BATCH = shape["batch"]
21:     reference.NUM_HEADS = shape["num_heads"]
22:     reference.NUM_KV_HEADS = shape["num_kv_heads"]
23:     reference.HEAD_DIM = shape["head_dim"]
24:     reference.SEQ_LEN = shape["seq_len"]
25:     reference.PAGE_SIZE = shape["page_size"]
26: 
27: 
28: def main():
29:     try:
30:         import reference
31:         import shapes
32:         import solution
33:     except Exception as e:
34:         print(f"FAIL: import error: {e}")
35:         sys.exit(1)
36: 
37:     problem_yaml = Path("problem.yaml")
38:     meta = yaml.safe_load(problem_yaml.read_text()) if problem_yaml.exists() else {}
39: 
40:     sol_src = Path("solution.py").read_text() if Path("solution.py").exists() else ""
41:     for forbidden in meta.get("forbidden", []):
42:         pat = re.escape(forbidden)
43:     

... (2537 more chars)

<path>/home/infatoshi/cuda/KernelBench-Hard/problems/03_paged_attention/benchmark.py</path>
<type>file</type>
<content>
1: """Roofline benchmark for paged-attention decode.
2: 
3: For each shape: times eager reference, compiled reference, SOTA (if available),
4: and the agent's solution. Reports achieved TFLOPS, GB/s, and peak_fraction.
5: 
6: Decode is memory-bound, so peak_fraction is computed from achieved GB/s vs
7: the GPU's peak DRAM bandwidth.
8: """
9: import sys
10: from math import exp, log
11: from pathlib import Path
12: 
13: import torch
14: import yaml
15: 
16: REPO_ROOT = Path(__file__).resolve().parents[2]
17: sys.path.insert(0, str(REPO_ROOT))
18: 
19: from src.eval.roofline import compute_gbps, compute_tflops, peak_fraction  # noqa: E402
20: from src.eval.timing import time_fn  # noqa: E402
21: from src.hardware import get as get_hw  # noqa: E402
22: 
23: 
24: def _eval_formula(expr: str, vars: dict) -> float:
25:     return float(eval(expr, {"__builtins__": {}}, vars))
26: 
27: 
28: def _apply_shape(reference, shape: dict) -> None:
29:     reference.BATCH = shape["batch"]
30:     reference.NUM_HEADS = shape["num_heads"]
31:     reference.NUM_KV_HEADS = shape["num_kv_heads"]
32:     reference.HEAD_DIM = shape["head_dim"]
33:     reference.SEQ_LEN = shape["seq_len"]
34:     reference.PAGE_SIZE = shape["page_size"]
35: 
36: 
37: def main():
38:     import reference
39:     import shapes
40:     import solution
41: 
42:     meta = yaml.safe_load(Path("problem.y

... (3563 more chars)

<path>/home/infatoshi/cuda/KernelBench-Hard/problems/03_paged_attention/shapes.py</path>
<type>file</type>
<content>
1: """Shape sweep for paged attention decode.
2: 
3: Mix targets:
4:   - small batch / long context (Llama-3 8B-style decode)
5:   - large batch / medium context (server batched decode)
6:   - GQA wide ratio (Llama-3 70B: 64 heads / 8 kv-heads)
7:   - non-power-of-2 seq_len (forces predicated tail handling)
8:   - head_dim=64 small-head case
9: """
10: 
11: SHAPES = [
12:     # (B, H, Hkv, D, L, P)
13:     {"batch": 8,  "num_heads": 32, "num_kv_heads": 8,  "head_dim": 128, "seq_len": 1024, "page_size": 16},
14:     {"batch": 32, "num_heads": 32, "num_kv_heads": 8,  "head_dim": 128, "seq_len": 2048, "page_size": 16},
15:     {"batch": 4,  "num_heads": 64, "num_kv_heads": 8,  "head_dim": 128, "seq_len": 4096, "page_size": 16},
16:     {"batch": 16, "num_heads": 32, "num_kv_heads": 8,  "head_dim": 128, "seq_len": 1535, "page_size": 16},  # non-pow2
17:     {"batch": 8,  "num_heads": 16, "num_kv_heads": 4,  "head_dim": 64,  "seq_len": 2000, "page_size": 16},  # small-D, non-pow2
18: ]

(End of file - total 18 lines)
</content>

<path>/home/infatoshi/cuda/KernelBench-Hard/problems/03_paged_attention/problem.yaml</path>
<type>file</type>
<content>
1: name: 03_paged_attention
2: display_name: "Paged Attention Decode"
3: precision: bf16
4: regime: memory  # decode is bandwidth-bound (KV cache streamed once per token)
5: 
6: # Effective FLOPs per call: QK^T + softmax*V across all batches/heads/seq.
7: # Sum-formula evaluated per-shape; the benchmark substitutes batch/num_heads/etc.
8: # 2 * B * H * L * D for QK^T plus 2 * B * H * L * D for AV  =>  4 * B * H * L * D
9: flops_formula: "4 * batch * num_heads * seq_len * head_dim"
10: 
11: # Bytes moved (the real bottleneck): the KV cache must be streamed end-to-end.
12: #   K and V each:  batch * seq_len * num_kv_heads * head_dim * 2 bytes (bf16)
13: #   Q: batch * num_heads * head_dim * 2  (negligible vs KV)
14: #   Out: same as Q
15: # So total ~ 2 * (B * L * Hkv * D * 2) + small.
16: bytes_formula: "2 * batch * seq_len * num_kv_heads * head_dim * 2 + batch * num_heads * head_dim * 2 * 2"
17: 
18: hardware: [RTX_PRO_6000]
19: peak_tflops_key: bf16          # informational; regime=memory uses bandwidth
20: peak_bandwidth_key: dram        # 1.8 TB/s GDDR7 on RTX PRO 6000 Blackwell
21: 
22: tolerance:
23:   bfloat16: 0.02
24:   float16: 0.02
25: 
26: # Forbidden ops -- using any of these in solution.py fails correctness post-hoc.
27: # vllm.attention / flashinfer.batch_decode_with_paged_kv_cache: dispatching to
28: # the SOTA library is the trivial cheat. SD

... (875 more chars)

<path>/home/infatoshi/cuda/KernelBench-Hard/problems/03_paged_attention/sota.py</path>
<type>file</type>
<content>
1: """SOTA reference for paged-attention decode.
2: 
3: Tries, in order:
4:   1. FlashInfer's BatchDecodeWithPagedKVCacheWrapper (preferred -- portable,
5:      supports SM120, GQA, arbitrary head_dim).
6:   2. vLLM's paged_attention_v2 CUDA op (requires its KV-cache layout, more
7:      finicky; we adapt the layout on the fly when possible).
8: 
9: If neither is importable, is_available() returns False and the benchmark just
10: reports eager + compiled + solution.
11: 
12: Agents are FORBIDDEN from importing these in solution.py (see problem.yaml).
13: This file is only for the benchmark's reference line.
14: """
15: from __future__ import annotations
16: 
17: import torch
18: 
19: 
20: def _try_flashinfer(
21:     query: torch.Tensor,
22:     kv_cache: torch.Tensor,
23:     block_table: torch.Tensor,
24:     seq_lens: torch.Tensor,
25:     num_kv_heads: int,
26:     head_dim: int,
27:     page_size: int,
28: ) -> torch.Tensor | None:
29:     try:
30:         import flashinfer  # noqa: F401
31:         from flashinfer.decode import BatchDecodeWithPagedKVCacheWrapper
32:     except Exception:
33:         return None
34: 
35:     B, H, D = query.shape
36:     # FlashInfer expects K and V as separate (num_blocks, page_size, num_kv_heads, head_dim) tensors.
37:     # Our reference packs [K|V] on the last dim -- split here.
38:     k_cache = kv_cache[..., :D].contig

... (1803 more chars)