Inefficient Algorithmic Complexity in brace-expansion - #VU166141
Published: November 12, 2026
Vulnerability details
The vulnerability allows a remote attacker to cause a denial of service by exhausting CPU resources and blocking an application's event loop for minutes.
The vulnerability exists due to inefficient algorithmic complexity in brace-expansion's expand() function when processing untrusted patterns, including repeated scans, excessive intermediate expansion, quadratic regular expression backtracking, and unbounded visits to discarded results. A remote attacker can supply crafted brace patterns directly or through minimatch or glob to trigger excessive processing despite existing expansion limits and stall the application.