Skip to main content
VulnerabilityPublished

CVE-2026-55574: vllm · ReDoS

Affects vllmSource CVE Database V5

0
Compare

Not known to be exploited · CVSS 8.7 High : upgrade to 0.24.0 soon.

Data as of 17 Nov 2026, 20:25 UTC

CVSS 4.0 base score
8.7High
How severe the flaw is on the 0–10 CVSS scale.
EPSS
0.5% chance of exploitation in 30 days – higher than 48% of CVEsExploit Prediction Scoring System: the likelihood attackers will use this flaw soon.
Patch
Available – fixed in 0.24.0
CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N

Exploitation evidence

  1. Disclosed: evidence found.

    CVE published 6 Jul 2026

  2. Detectable: no evidence on record.

    No public nuclei template indexed

  3. Weaponized: no evidence on record.

    No public exploit code indexed in Metasploit or Exploit-DB

  4. Exploited in the wild: no evidence on record.

    Not in CISA KEV and no source reports exploitation

  5. Observed by OffSeq Mirage: no evidence on record.

    No attack traffic recorded by OffSeq Mirage sensors

A missing step is not evidence of safety. Sources: cve.org (opens in a new tab), the Metasploit, Exploit-DB and nuclei-templates index as of 17 Nov 2026.

What to do

Upgrade vllm and vllm-project/vllm to 0.24.0.

Affected software

ProductAffectedFixed in
vllm-projectvllmAffected
  • <0.24.0
Fixed in
  • 0.24.0
GitHubvllm-project/vllmpkg:github/vllm-project/vllmOther threatsAffected
  • <0.24.0
Fixed in
  • 0.24.0

Check your own hosts for these packages with threat-finder (opens in a new tab), our free open-source scanner.

AI-suggested

Upgrade vLLM to version 0.24.0 or later, where this vulnerability is fixed by adding appropriate compilation timeouts and complexity checks on user-supplied regular expressions. No other mitigation is documented. Patch status is confirmed fixed in 0.24.0.

Description

vLLM is a high-throughput and memory-efficient inference and serving engine for LLMs. Prior to 0.24.0, the structured_outputs.regex API parameter passes a user-supplied regular expression string directly to the grammar compiler backends with no compilation timeout; in the xgrammar backend the string reaches the regex compiler with no guard, and in the outlines backend the validation step blocks structural issues such as lookarounds and backreferences but performs no complexity analysis, so a pattern with nested quantifiers passes all checks and causes exponential state-space expansion, allowing a single request containing an adversarial regex to hang an inference worker indefinitely and deny service. This issue is fixed in version 0.24.0.

References

Community reviews

Loading reviews…