CVEvulnerability
CVE-2026-58226
8.7 HIGH
Official page ↗
- Status
- Deferred
- Published
- 2026-07-06
- Last modified
- 2026-10-25
- Assigner
- 6b3ad84c-e1a6-4bf7-a703-f496b71e49db
- CVSS 4.0 (6b3ad84c-e1a6-4bf7-a703-f496b71e49db)
- 8.7 HIGH — 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/E:X/CR:X/IR:X/AR:X/MAV:X/MAC:X/MAT:X/MPR:X/MUI:X/MVC:X/MVI:X/MVA:X/MSC:X/MSI:X/MSA:X/S:X/AU:X/R:X/V:X/RE:X/U:X
- Weaknesses
- CWE-407
Description
Inefficient Algorithmic Complexity vulnerability in elixir-mint hpax allows unauthenticated denial-of-service via unbounded HPACK integer decoding.
hpax decodes HPACK variable-length integers with no upper bound on the decoded value or the number of continuation octets. 'Elixir.HPAX.Types':decode_remaining_integer/3 accumulates the integer as int + (value <<< m), shifting by 7 more bits for each continuation octet and stopping only on a terminating octet or truncated input, never because the integer grew too large. Because BEAM integers are arbitrary precision, a run of N continuation octets builds an O(N)-bit bignum and re-adds into an ever-larger bignum on each step, so the total decoding cost is superlinear (about O(N^2)). An unauthenticated attacker who can send an HTTP/2 header block to a server using this decoder (reached through the 'Elixir.HPAX':decode/2 entry point) can supply a small header block that forces a large, attacker-controlled amount of CPU (and transient memory), a denial-of-service amplification.
This issue affects hpax from 0.1.1 before 1.0.4.
Related
Weakness · CWE (1)
- CWE-407 Inefficient Algorithmic Complexity weakness
References
- https://cna.erlef.org/cves/CVE-2026-58226.html cna.erlef.org
- https://github.com/elixir-mint/hpax/commit/1ba4bb2dc91e80089cf89c73970ac3ded76f17eb github.com
- https://github.com/elixir-mint/hpax/security/advisories/GHSA-jj2p-32j7-whj2 github.com
- https://osv.dev/vulnerability/EEF-CVE-2026-58226 osv.dev
- https://github.com/elixir-mint/hpax/security/advisories/GHSA-jj2p-32j7-whj2 github.com