CVE Explore

Vulnerability in Absinthe-Graphql Absinthe

CVE-2026-43967

CVSS v3
7.5 High
Public exploits
None known
EPSS
0.006 · 50.7th percentile
Published
2026-05-08

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.

Published · last modified .

CVSS v3 metric

CVSS v3 base score 7.5 (High). Vector: CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H.

Attack Vector
Network AV:N
Attack Complexity
Low AC:L
Privileges Required
None PR:N
User Interaction
None UI:N
Scope
Unchanged S:U
Confidentiality
None C:N
Integrity
None I:N
Availability
High A:H

EPSS exploit prediction

EPSS 0.006, 50.7th percentile (last changed ); unchanged over 30 days. About EPSS.

Affected products

Weakness classification (CWE)

References