Inefficient Algorithmic Complexity in minimatch - #VU165866
Published: November 11, 2026
Vulnerability details
The vulnerability allows a remote attacker to cause a denial of service through excessive CPU consumption during pattern compilation.
The vulnerability exists due to inefficient algorithmic complexity in minimatch's mergeRows() function when compiling uncached patterns, as entire rows are repeatedly copied and joined for each wildcard position. A remote attacker can supply long patterns containing wildcard-only path parts separated by /, optionally preceded by a brace group of distinct words, to trigger quadratic compilation work and block applications that compile these patterns.