Skip to main content
VulnerabilityPublished

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

Affects adr-viewerSource 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 adr-viewer soon.

Data as of 13 Nov 2026, 21:16 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
Homebrewadr-viewerpkg:brew/adr-viewerOther threatsAffected
  • >=1.3.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 issue is fixed by caching intermediate matching results. No code changes are needed beyond upgrading. If upgrading is not possible, reduce the use of descendant combinators in selectors on untrusted input, limit the size and nesting depth of such documents, or run selection with time limits in isolated worker processes. Avoid using the NOCACHE flag as it reverts to the vulnerable matching algorithm.

Description

Soup Sieve versions before 4.0 have a polynomial-time denial of service vulnerability in the descendant combinator selector matching. This occurs because matching selectors with descendant combinators against deeply nested documents causes CPU time to grow polynomially with nesting depth, potentially tying up processing for seconds to minutes. The issue is fixed in version 4.0 by caching intermediate matching results to reduce complexity to linear time.

References

Community reviews

Loading reviews…