{
  "schema_version": 1,
  "builder_plan": {
    "scenario": "Profiling shows attention computation is a bottleneck in your self-hosted service.",
    "change": "Check the supported GPU, tensor shapes, and precision, then replace only the relevant kernel.",
    "baseline": "The existing kernel inside the same complete serving pipeline.",
    "steps": [
      "Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.",
      "Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.",
      "Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.",
      "Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test."
    ],
    "measure": "Numerical differences, end-to-end latency, throughput, and memory at realistic shapes.",
    "decision": "Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation."
  },
  "builder_review": null,
  "arxiv_id": "2608.19758",
  "title": "FlashPrefill V2: Block-Sparse Prefill Attention for Long-Context LLM Serving",
  "summary": "The method replaces dense FlashAttention during the prefill phase with a block-sparse attention operator that uses instantaneous pattern discovery, max-based dynamic thresholding, and a mean correction term, delivered as an SGLang-compatible backend with paged KV cache and continuous batching support. Adoption costs a custom kernel dependency tuned to FlashAttention-3/4-style implementations, integration effort into a serving framework, and approximation error at extreme sparsity that the mean correction only bounds rather than eliminates. It can fail through accuracy degradation on workloads whose attention patterns do not match the discovered sparsity, through hardware-specific kernel behavior validated primarily on H20 GPUs, and through FP8 quantization interacting poorly with the sparse approximation.",
  "rationale": "The speedups are substantial but demonstrated on H20 datacenter GPUs at 128K context with FP8, a regime the reader's 24 GB setup and typical workloads are unlikely to reach, so tracking SGLang integration maturity is more appropriate than adoption now.",
  "technique": "Block-sparse prefill attention with mean correction",
  "family": "kernels_e_atencao",
  "recommendation": "observar",
  "published": "2026-08-20",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2608.19758",
  "independent_implementations": 0,
  "total_implementations": 1,
  "stars": 31,
  "citations": 0,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "The method replaces dense FlashAttention during the prefill phase with a block-sparse attention operator that uses instantaneous pattern discovery, max-based dynamic thresholding, and a mean correction term, delivered as an SGLang-compatible backend with paged KV cache and continuous batching support. Adoption costs a custom kernel dependency tuned to FlashAttention-3/4-style implementations, integration effort into a serving framework, and approximation error at extreme sparsity that the mean correction only bounds rather than eliminates. It can fail through accuracy degradation on workloads whose attention patterns do not match the discovered sparsity, through hardware-specific kernel behavior validated primarily on H20 GPUs, and through FP8 quantization interacting poorly with the sparse approximation.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2608.19758",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "Up to 47.26x (FP8) and 27.19x (BF16) prefill speedup over FlashAttention-2 at 128K context, and 30.49x over an FA3/4-aligned dense baseline in FP8, measured on NVIDIA H20 GPUs.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2608.19758",
      "source_page": null,
      "source_excerpt": ""
    }
  ],
  "exposure_map": [
    {
      "dimension": "quality",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "compute",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "latency",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "operations",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "compatibility",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "security",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "data_and_training",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "dimension": "reproducibility",
      "basis": "not_evaluated",
      "finding": "",
      "interpretation": "",
      "limitation": "",
      "next_check": "",
      "source_url": "",
      "source_page": null,
      "source_excerpt": ""
    }
  ],
  "risks": [],
  "minimum_test": [],
  "open_questions": [],
  "independent_tests": [],
  "lab_reproductions": [],
  "report_available": false,
  "validation_tier": "unknown",
  "evidence_tier": "unknown",
  "infrastructure_basis": "unknown",
  "equations": [],
  "equations_status": "selector_failed",
  "core_kind": "",
  "equations_fetched_at": "2026-09-18",
  "equations_source_url": "",
  "equations_source_sha256": "",
  "exposures_reviewed_at": "",
  "exposures_source_sha256": ""
}