Analysis
Common Weaknesses
The most common CWE weakness classes across Erlang ecosystem CVEs
The chart below shows the most common weaknesses found in vulnerabilities across the Erlang ecosystem. Understanding which weakness types recur most often helps library authors and application developers focus their security efforts where they matter most.
Each CVE is mapped to its CWE (Common Weakness Enumeration) using the MITRE CWE hierarchy. A slice's count includes every CVE reachable anywhere below it in the hierarchy, not just CVEs assigned that exact CWE — click a slice or legend row to drill into its direct children and see the same breakdown one level down.
Inefficient Algorithmic Complexity CWE-407 CWE-407 at MITRE
An algorithm in a product has an inefficient worst-case computational complexity that may be detrimental to system performance and can be triggered by an attacker, typically using crafted manipulations that ensure that the worst case is being reached.
CVEs
CVEs for Inefficient Algorithmic Complexity CWE-407
| Summary | Publication | CVE ID | Published |
|---|---|---|---|
| Quadratic CPU blow-up reassembling fragmented WebSocket messages in Bandit | CVE-2026-65623 | 2026-07-24 | |
| Unauthenticated denial-of-service via unbounded HPACK integer decoding in hpax | CVE-2026-58226 | 2026-07-06 | |
| Plug: quadratic-time decoding of nested query/body parameters enables denial of service | CVE-2026-54892 | 2026-06-23 | |
| Quadratic fragment-name uniqueness check causes denial of service in absinthe | CVE-2026-43967 | 2026-05-08 |