Skip to main content
VulnerabilityPublished

CVE-2026-43967: absinthe · Inefficient Algorithmic Complexity

Affects absintheSource CVE Database V5

0
Compare

Not known to be exploited · CVSS 8.7 High : upgrade to 1.10.2 soon.

Data as of 30 Oct 2026, 11:52 UTC

CVSS 4.0 base score
8.7High
How severe the flaw is on the 0–10 CVSS scale.
EPSS
0.6% chance of exploitation in 30 days – higher than 49% of CVEsExploit Prediction Scoring System: the likelihood attackers will use this flaw soon.
Patch
Available – fixed in 1.10.2, 223600c520493dcaf95080af552c413099f92c9d
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

Exploitation evidence

  1. Disclosed: evidence found.

    CVE published 8 May 2026

  2. Detectable: no evidence on record.

    No public nuclei template indexed

  3. Weaponized: no evidence on record.

    No public exploit code indexed in Metasploit or Exploit-DB

  4. Exploited in the wild: no evidence on record.

    Not in CISA KEV and no source reports exploitation

  5. Observed by OffSeq Mirage: no evidence on record.

    No attack traffic recorded by OffSeq Mirage sensors

A missing step is not evidence of safety. Sources: cve.org (opens in a new tab), the Metasploit, Exploit-DB and nuclei-templates index as of 30 Oct 2026.

What to do

Upgrade absinthe to 1.10.2; absinthe to 223600c520493dcaf95080af552c413099f92c9d.

Affected software

ProductAffectedFixed in
absinthe-graphqlabsintheAffected
  • >=1.2.0 <1.10.2
Fixed in
  • 1.10.2
absinthe-graphqlabsintheAffected
  • ≥ 0b46e3bcc06c0d3797bacd64761b908a84646c1d, < 223600c520493dcaf95080af552c413099f92c9d
Fixed in
  • 223600c520493dcaf95080af552c413099f92c9d
Hexabsinthepkg:hex/absintheOther threatsAffected
  • >=1.2.0 <1.10.2
Fixed in
  • 1.10.2

CPE configurations (1)

  • cpe:2.3:a:absinthe-graphql:absinthe:*:*:*:*:*:*:*:*

Check your own hosts for these packages with threat-finder (opens in a new tab), our free open-source scanner.

AI-suggested

If you cannot patch yet, consider limiting the size and complexity of incoming GraphQL queries to mitigate potential denial of service.

Description

Inefficient Algorithmic Complexity vulnerability in absinthe-graphql absinthe allows unauthenticated denial of service via quadratic fragment-name uniqueness validation. 'Elixir.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.

References

Community reviews

Loading reviews…