CVE-2026-43967: high-severity vulnerability in absinthe-graphql absinthe
Quadratic fragment-name uniqueness check causes denial of service in absinthe
Published · Updated
E-mail alert when it lands in KEV, gets a public PoC or its score goes up.
21Vexday Risk Score
No sign of exploitation. No public exploitation artifact known so far.
ssvc Trackcvss 8.7epss 0.6%
Inefficient Algorithmic Complexity vulnerability in absinthe-graphql absinthe allows unauthenticated denial of service via quadratic fragment-name uniqueness validation.
Absinthe.Phase.Document.Validation.UniqueFragmentNames.run/2 iterates over all fragments and for each one calls duplicate?/2, which evaluates Enum.count(fragments, &(&1.name == name)) — a full linear scan of the fragment list. The result is O(N²) comparisons per document, where N is the number of fragment definitions supplied by the caller.
Because input.fragments is built directly from the GraphQL query body, N is fully attacker-controlled. A minimum-size fragment definition is roughly 16 bytes, so a ~1 MB document carries ~60,000 fragments and forces ~3.6 × 10⁹ comparisons inside this single validation phase. No authentication, schema knowledge, or special configuration is required.
This issue affects absinthe: from 1.2.0 before 1.10.2.
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
Affected products
absinthe-graphql · absintheRelated CVEs — absinthe-graphql absinthe
In the same product, most dangerous first.
References
https://cna.erlef.org/cves/CVE-2026-43967.htmlhttps://github.com/absinthe-graphql/absinthe/commit/0b46e3bcc06c0d3797bacd64761b908a84646c1dhttps://github.com/absinthe-graphql/absinthe/commit/223600c520493dcaf95080af552c413099f92c9dhttps://github.com/absinthe-graphql/absinthe/security/advisories/GHSA-9mhv-8h52-q7q2https://osv.dev/vulnerability/EEF-CVE-2026-43967