minimatch has a ReDoS via repeated wildcards with non-matching literal in pattern
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.
Give all details on the vulnerability. Pointing to the incriminated source code is very helpful for the maintainer.
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.
Any application that passes user-controlled strings to minimatch() as the pattern argument is vulnerable to DoS. This includes:
.gitignore-style filtering with user-defined rulesThanks to @ljharb for back-porting the fix to legacy versions of minimatch.
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
External Link:
View on GitHub
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.
Inefficient Regular Expression Complexity
Abstraction Level:
BaseDescription:
The product uses a regular expression with a worst-case computational complexity that is inefficient and possibly exponential.
Likelihood of Exploit:
HighRelated Weaknesses: