{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "fu-et-al-lookahead-decoding-jacobi-2024",
    "title": "Lookahead Decoding: Jacobi n-gram generation and verification",
    "summary": "Reused parallel Jacobi-decoding iterates to generate cached n-grams and verified them in a separate branch within a combined target-model pass, with a multi-GPU implementation.",
    "boundary": "Inherits Jacobi decoding and guess-and-verify methods. No auxiliary model does not mean no n-gram cache, added FLOPs or hardware costs. The logarithmic per-step compute tradeoff and reported speedups are conditional/workload specific, not constant-cost universal latency reduction. Distinct from the Lookahead optimizer.",
    "area": "Language-model inference acceleration",
    "topic": "Artificial intelligence",
    "year": 2024,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "fu-et-al-lookahead-decoding-jacobi-2024",
    "target": {
      "record_id": "urn:uuid:39006f0c-fa3f-492d-a73f-3f5a1fb73588",
      "version": 1,
      "content_hash": "sha256:6cfc2b3b9c138b946c008c5bb9fa4f80fe070eb09d3129ca62b4f06ec2fb876f"
    },
    "humans": [
      "Yichao Fu",
      "Peter Bailis",
      "Ion Stoica",
      "Hao Zhang"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.",
    "agents": [],
    "related": [],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "cur20261015-arxiv-2402-02057v1",
        "title": "Break the Sequential Dependency of LLM Inference Using Lookahead Decoding",
        "url": "https://arxiv.org/abs/2402.02057v1"
      }
    ],
    "points": "65000",
    "published_grade": {
      "id": "fu-et-al-lookahead-decoding-jacobi-2024",
      "entry_id": "fu-et-al-lookahead-decoding-jacobi-2024",
      "band": "B",
      "modifier": "+",
      "target": {
        "record_id": "urn:uuid:39006f0c-fa3f-492d-a73f-3f5a1fb73588",
        "version": 1,
        "content_hash": "sha256:6cfc2b3b9c138b946c008c5bb9fa4f80fe070eb09d3129ca62b4f06ec2fb876f"
      },
      "what_changed": "Reused parallel Jacobi-decoding iterates to generate cached n-grams and verified them in a separate branch within a combined target-model pass, with a multi-GPU implementation.",
      "scope": "Reused parallel Jacobi-decoding iterates to generate cached n-grams and verified them in a separate branch within a combined target-model pass, with a multi-GPU implementation. Inherits Jacobi decoding and guess-and-verify methods. No auxiliary model does not mean no n-gram cache, added FLOPs or hardware costs. The logarithmic per-step compute tradeoff and reported speedups are conditional/workload specific, not constant-cost universal latency reduction. Distinct from the Lookahead optimizer.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:39006f0c-fa3f-492d-a73f-3f5a1fb73588",
        "version": 1,
        "content_hash": "sha256:6cfc2b3b9c138b946c008c5bb9fa4f80fe070eb09d3129ca62b4f06ec2fb876f"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-16T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Yichao Fu",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Break the Sequential Dependency of LLM Inference Using Lookahead Decoding",
            "url": "https://arxiv.org/abs/2402.02057v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Peter Bailis",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Break the Sequential Dependency of LLM Inference Using Lookahead Decoding",
            "url": "https://arxiv.org/abs/2402.02057v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Ion Stoica",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Break the Sequential Dependency of LLM Inference Using Lookahead Decoding",
            "url": "https://arxiv.org/abs/2402.02057v1"
          }
        },
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Hao Zhang",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Break the Sequential Dependency of LLM Inference Using Lookahead Decoding",
            "url": "https://arxiv.org/abs/2402.02057v1"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Break the Sequential Dependency of LLM Inference Using Lookahead Decoding",
            "url": "https://arxiv.org/abs/2402.02057v1"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "Inherits Jacobi decoding and guess-and-verify methods. No auxiliary model does not mean no n-gram cache, added FLOPs or hardware costs. The logarithmic per-step compute tradeoff and reported speedups are conditional/workload specific, not constant-cost universal latency reduction. Distinct from the Lookahead optimizer.",
        "domain": "Language-model inference acceleration"
      },
      "sources": [
        {
          "citation": "Break the Sequential Dependency of LLM Inference Using Lookahead Decoding",
          "url": "https://arxiv.org/abs/2402.02057v1"
        }
      ],
      "statement": "# Lookahead Decoding: Jacobi n-gram generation and verification\n\nReused parallel Jacobi-decoding iterates to generate cached n-grams and verified them in a separate branch within a combined target-model pass, with a multi-GPU implementation.\n\n## Scientific scope\n\nInherits Jacobi decoding and guess-and-verify methods. No auxiliary model does not mean no n-gram cache, added FLOPs or hardware costs. The logarithmic per-step compute tradeoff and reported speedups are conditional/workload specific, not constant-cost universal latency reduction. Distinct from the Lookahead optimizer.\n\n## Reading status\n\nThis is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.\n\n## People and systems\n\nYichao Fu; Peter Bailis; Ion Stoica; Hao Zhang\n\nSource-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.\n\n\n\n## Original sources\n\n- [Break the Sequential Dependency of LLM Inference Using Lookahead Decoding](https://arxiv.org/abs/2402.02057v1)\n",
      "summary": "Reused parallel Jacobi-decoding iterates to generate cached n-grams and verified them in a separate branch within a combined target-model pass, with a multi-GPU implementation.",
      "title": "Lookahead Decoding: Jacobi n-gram generation and verification"
    },
    "record_id": "urn:uuid:39006f0c-fa3f-492d-a73f-3f5a1fb73588",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:39006f0c-fa3f-492d-a73f-3f5a1fb73588",
      "version": 1,
      "content_hash": "sha256:6cfc2b3b9c138b946c008c5bb9fa4f80fe070eb09d3129ca62b4f06ec2fb876f"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:0b3475ce2662608ede1566c5a97d7aa88fc196e9e6da77abe11dc956981725b2"
  },
  "target": {
    "record_id": "urn:uuid:39006f0c-fa3f-492d-a73f-3f5a1fb73588",
    "version": 1,
    "content_hash": "sha256:6cfc2b3b9c138b946c008c5bb9fa4f80fe070eb09d3129ca62b4f06ec2fb876f"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "fu-et-al-lookahead-decoding-jacobi-2024",
    "entry_id": "fu-et-al-lookahead-decoding-jacobi-2024",
    "revision": 1,
    "title": "Lookahead Decoding: Jacobi n-gram generation and verification",
    "context": "Language-model inference acceleration",
    "track": "Human-designed research method or resource",
    "band": "B",
    "modifier": "+",
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-16",
    "evidence_cutoff": "2026-10-16",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Reused parallel Jacobi-decoding iterates to generate cached n-grams and verified them in a separate branch within a combined target-model pass, with a multi-GPU implementation.",
    "scope": "Reused parallel Jacobi-decoding iterates to generate cached n-grams and verified them in a separate branch within a combined target-model pass, with a multi-GPU implementation. Inherits Jacobi decoding and guess-and-verify methods. No auxiliary model does not mean no n-gram cache, added FLOPs or hardware costs. The logarithmic per-step compute tradeoff and reported speedups are conditional/workload specific, not constant-cost universal latency reduction. Distinct from the Lookahead optimizer.",
    "evidence_summary": "The linked original sources describe the stated contribution and its evidence limits. WRS has not independently rerun the experiments or certified a proof. Inherits Jacobi decoding and guess-and-verify methods. No auxiliary model does not mean no n-gram cache, added FLOPs or hardware costs. The logarithmic per-step compute tradeoff and reported speedups are conditional/workload specific, not constant-cost universal latency reduction. Distinct from the Lookahead optimizer.",
    "references": [
      {
        "title": "Break the Sequential Dependency of LLM Inference Using Lookahead Decoding",
        "url": "https://arxiv.org/abs/2402.02057v1",
        "locator": "Original contribution and stated assumptions, evaluation scope and limitations; source-linked assessment, not independent execution or proof certification."
      }
    ],
    "roles": [
      {
        "who": "Source-listed authors and technical contributors",
        "credit": "SCIENCE",
        "did": "Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities."
      }
    ],
    "target": {
      "record_id": "urn:uuid:39006f0c-fa3f-492d-a73f-3f5a1fb73588",
      "version": 1,
      "content_hash": "sha256:6cfc2b3b9c138b946c008c5bb9fa4f80fe070eb09d3129ca62b4f06ec2fb876f"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "65000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}