Skip to main content
VulnerabilityPublished

CVE-2026-126190: Soup Sieve · Polynomial-time denial of service in the descendant combinator

Affects subliminalSource GCVE Database

0
Compare
Authoritative record:CVE-2026-126190· High 7.5

Not known to be exploited · CVSS 7.5 High · fixed in 4.0 : patch subliminal soon.

Data as of 13 Nov 2026, 21:33 UTC

CVSS 3.1 base score
7.5High
How severe the flaw is on the 0–10 CVSS scale.

Thin evidence

One scorer or none
CVSS scores by source
CNA (GitHub_M)CVSS 3.17.5
Patch
Available – fixed in 4.0
CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H

Exploitation evidence

  1. Disclosed: evidence found.

    CVE published 12 Nov 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 13 Nov 2026.

What to do

Affected software

ProductAffectedFixed in
Homebrewsubliminalpkg:brew/subliminalOther threatsAffected
  • >=2.1.0
Fixed in–

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

AI-suggested

Upgrade to Soup Sieve version 4.0 or later, where the vulnerability is fixed by caching match results to ensure linear-time matching. No code changes are needed beyond upgrading. If upgrading is not possible, reduce the number of descendant combinators in selectors used on untrusted input, limit the size and nesting depth of untrusted documents, or run selector operations with time limits in isolated worker processes. Avoid using the NOCACHE flag as it reverts to vulnerable behavior.

Description

Soup Sieve versions from 2.1.0 onward have a polynomial-time denial of service vulnerability in the descendant combinator selector matching. This flaw causes selector matching time to grow polynomially with document nesting depth, allowing an attacker controlling input HTML or XML to cause high CPU usage by submitting deeply nested documents. The issue is fixed in version 4.0 by caching intermediate results, reducing complexity to linear time. Applications running descendant combinator selectors on untrusted input are affected; those processing only trusted documents are not.

References

Community reviews

Loading reviews…