Skip to main content
VulnerabilityPublished

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

Affects wikSource 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 wik soon.

Data as of 13 Nov 2026, 21:05 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
Homebrewwikpkg:brew/wikOther threatsAffected
  • >=2.0.1
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 Soup Sieve to version 4.0 or later, where the vulnerability is fixed by caching match results to ensure linear-time selector matching. No code changes are required 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 disables the fix and reintroduces the vulnerability.

Description

Soup Sieve versions starting from 2.0.1 are vulnerable to a polynomial-time denial of service (DoS) when processing CSS selectors with descendant combinators on deeply nested HTML or XML documents. The time complexity grows polynomially with the nesting depth and the number of descendant combinators, causing excessive CPU usage. This can be exploited by attackers controlling the input documents to cause significant processing delays. The vulnerability is fixed in version 4.0 by introducing caching to reduce the complexity to linear time.

References

Community reviews

Loading reviews…