{
  "schema_version": 1,
  "builder_plan": {
    "scenario": "Your self-hosted model spends too long generating answers token by token.",
    "change": "Check whether a compatible draft model and serving integration exist before renting compute.",
    "baseline": "The same target with speculation off, then your existing drafter if you have one.",
    "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": "Accepted draft length, tokens per second, tail latency, output quality, and total GPU cost.",
    "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": "2610.19792",
  "title": "JetSpec++: Foresight Parallel Drafting with Self Refinements",
  "summary": "Replaces standard draft-verify speculative decoding (e.g., EAGLE-style or DSpark) with a draft model trained for intra-block self-correction, next-block foresight drafting, and pipelined overlap of drafting and verification, while preserving the target model's output distribution. Costs include training the self-refining draft model, integrating a custom pipelined serving path, and additional memory for the draft model alongside the target. It can fail if acceptance rates drop on out-of-domain workloads, negating speedup; if released draft models do not cover the reader's target model, requiring training the reader cannot afford; and because headline numbers were measured on a GB200, gains on a single 24 GB GPU are unvalidated.",
  "rationale": "Speculative decoding directly fits single-request latency on constrained hardware and code and models are released, but the claimed gains depend on a specific draft model, a pipelined serving stack, and GB200-class hardware, so the reader must validate on their own model and GPU before adopting.",
  "technique": "Foresight parallel speculative decoding with self-refinement",
  "family": "decodificacao_especulativa",
  "recommendation": "testar",
  "published": "2026-10-14",
  "as_of": "2026-10-18",
  "editorial_status": "indexed",
  "source_url": "https://arxiv.org/abs/2610.19792",
  "independent_implementations": 0,
  "total_implementations": 1,
  "stars": 122,
  "citations": 0,
  "claims": [
    {
      "claim_id": "claim-01",
      "statement": "Replaces standard draft-verify speculative decoding (e.g., EAGLE-style or DSpark) with a draft model trained for intra-block self-correction, next-block foresight drafting, and pipelined overlap of drafting and verification, while preserving the target model's output distribution. Costs include training the self-refining draft model, integrating a custom pipelined serving path, and additional memory for the draft model alongside the target. It can fail if acceptance rates drop on out-of-domain workloads, negating speedup; if released draft models do not cover the reader's target model, requiring training the reader cannot afford; and because headline numbers were measured on a GB200, gains on a single 24 GB GPU are unvalidated.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.19792",
      "source_page": null,
      "source_excerpt": ""
    },
    {
      "claim_id": "claim-02",
      "statement": "Up to 7.45x wall-clock speedup over autoregressive decoding and 1.54x over DSpark, reaching 1,361 tokens/s for a single request on a GB200, with average acceptance length of 8.94 across seven benchmarks.",
      "basis": "inferred",
      "result": "",
      "baseline": "",
      "conditions": "",
      "source_url": "https://arxiv.org/abs/2610.19792",
      "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": "not_fetched",
  "core_kind": "",
  "equations_fetched_at": "",
  "equations_source_url": "",
  "equations_source_sha256": "",
  "exposures_reviewed_at": "",
  "exposures_source_sha256": ""
}