Inefficient Algorithmic Complexity Affecting org.webjars.npm:toml package, versions [,5.0.1)
Threat Intelligence
Snyk has a proof-of-concept or detailed explanation of how to exploit this vulnerability.
The probability is the direct output of the EPSS model, and conveys an overall sense of the threat of exploitation in the wild. The percentile measures the EPSS probability relative to all known EPSS scores. Note: This data is updated daily, relying on the latest available EPSS model version. Check out the EPSS documentation for more details.
Do your applications use this vulnerable package?
In a few clicks we can analyze your entire application and see what components are vulnerable in your application, and suggest you quick fixes.
Test your applications- Snyk IDSNYK-JAVA-ORGWEBJARSNPM-21431463
- published24 Oct 2026
- disclosed22 Oct 2026
- creditDr. Pi3ch
Introduced: 22 Oct 2026
NewCVE-2026-114141 (opens in a new tab)How to fix?
Upgrade org.webjars.npm:toml to version 5.0.1 or higher.
Overview
Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity via the compiler in lib/compiler.js, where processing an array-of-tables header causes a full rescan of every path defined so far. An attacker can supply a TOML document with a large number of array-of-tables headers to trigger quadratic time complexity, crashing the process.