CVE-2026-126190: Soup Sieve · Polynomial-time denial of service in the descendant combinator
Affects dnsrobocertSource GCVE Database
Not known to be exploited · CVSS 7.5 High : upgrade to 3.24.1_1 soon.
Data as of 13 Nov 2026, 21:55 UTC
Thin evidence
One scorer or none| CNA (GitHub_M) | CVSS 3.1 | 7.5 |
|---|
- Patch
- Available – fixed in 3.24.1_1
CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:HExploitation evidence
Disclosed: evidence found.
CVE published 12 Nov 2026
Detectable: no evidence on record.
No public nuclei template indexed
Weaponized: no evidence on record.
No public exploit code indexed in Metasploit or Exploit-DB
Exploited in the wildExploited: no evidence on record.
Not in CISA KEV and no source reports exploitation
Observed by OffSeq MirageSeen by 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
Upgrade dnsrobocert to 3.24.1_1.
Affected software
| Product | Affected | Fixed in |
|---|---|---|
Homebrewdnsrobocertpkg:brew/dnsrobocertOther threats | Affected
| Fixed in
|
Check your own hosts for these packages with threat-finder (opens in a new tab), our free open-source scanner.
AI-suggested
A fix is available in Soup Sieve version 3.24.1_1 and later. Users should upgrade to this version or newer to mitigate the vulnerability. The fix enables caching of matching results by default, eliminating the polynomial-time complexity. If upgrading is not possible, users should minimize the use of descendant combinators in selectors on untrusted input, limit the size and nesting depth of such documents, or run selection operations with time limits in isolated worker processes. Avoid using the NOCACHE flag as it disables caching and reintroduces the vulnerability.
Description
CVE-2026-126190 is a denial of service vulnerability in Soup Sieve's handling of CSS selectors with descendant combinators. Matching selectors with multiple descendant combinators causes polynomial-time complexity relative to 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 Soup Sieve version 3.24.1_1 by caching intermediate matching results to reduce complexity to linear time. Applications processing untrusted markup with descendant combinators in selectors are affected. Upgrading to the fixed version mitigates the issue.
References
- github.com/facelessuser/soupsieve/security/advisories/GHSA-mmhr-3c5m-f64f (opens in a new tab)
- nvd.nist.gov/vuln/detail/CVE-2026-126190 (opens in a new tab)
- github.com/facelessuser/soupsieve/pull/351 (opens in a new tab)
- github.com/facelessuser/soupsieve/commit/ff1a5ce7e5addc31626d7b6053511fecdb4f6320 (opens in a new tab)
- github.com/facelessuser/soupsieve (opens in a new tab)
- github.com/facelessuser/soupsieve/releases/tag/4.0 (opens in a new tab)