New:Introducing Socket Scanning for VS Code Marketplace Extensions.Learn more →
Get Started

GHSA-3ppc-4f35-3m26

GHSA: GHSA-3ppc-4f35-3m26

CVE: CVE-2026-26996

Patch Available (93)

Summary

HIGH

minimatch has a ReDoS via repeated wildcards with non-matching literal in pattern

Details

Summary

minimatch is vulnerable to Regular Expression Denial of Service (ReDoS) when a glob pattern contains many consecutive * wildcards followed by a literal character that doesn't appear in the test string. Each * compiles to a separate [^/]*? regex group, and when the match fails, V8's regex engine backtracks exponentially across all possible splits.

The time complexity is O(4^N) where N is the number of * characters. With N=15, a single minimatch() call takes ~2 seconds. With N=34, it hangs effectively forever.

Details

Give all details on the vulnerability. Pointing to the incriminated source code is very helpful for the maintainer.

PoC

When minimatch compiles a glob pattern, each * becomes [^/]*? in the generated regex. For a pattern like ***************X***:

/^(?!\.)[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?[^/]*?X[^/]*?[^/]*?[^/]*?$/

When the test string doesn't contain X, the regex engine must try every possible way to distribute the characters across all the [^/]*? groups before concluding no match exists. With N groups and M characters, this is O(C(N+M, N)) — exponential.

Impact

Any application that passes user-controlled strings to minimatch() as the pattern argument is vulnerable to DoS. This includes:

  • File search/filter UIs that accept glob patterns
  • .gitignore-style filtering with user-defined rules
  • Build tools that accept glob configuration
  • Any API that exposes glob matching to untrusted input

Thanks to @ljharb for back-porting the fix to legacy versions of minimatch.

Metadata

Published:

2/18/2026

Modified:

9/10/2026

CVSS Vector:

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

EPSS - Exploit Prediction Scoring System

Probability that this vulnerability will be exploited in the wild in the next 30 days

Current Exploitation Probability

0.03%

7.4th percentile

Low Risk

As of 5/21/2026

EPSS scores are updated daily and represent the probability (0-100%) that a CVE will be exploited in the next 30 days. Higher scores indicate higher risk.

CWEs (Common Weakness Enumeration)

CWE-1333

Inefficient Regular Expression Complexity

Abstraction Level:

Base

Description:

The product uses a regular expression with a worst-case computational complexity that is inefficient and possibly exponential.

Likelihood of Exploit:

High

Related Weaknesses:

CWE-407CWE-407

Affected Packages (0)