CVE-2026-43967

The record

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.

Affected packages

Related vulnerabilities

• CVE-2026-19630 In a BIND resolver, inbound DNS protocol messages with a particular structure will result… CWE-407
• CVE-2026-112894 Pillow is a Python imaging library. CWE-407
• CVE-2026-112891 Pillow is a Python imaging library. CWE-407
• CVE-2026-112401 Pillow is a Python imaging library. CWE-407
• CVE-2026-111766 markdown-it is a Markdown parser. CWE-407
• CVE-2026-111759 markdown-it is a Markdown parser. CWE-407
• CVE-2026-95838 containerd is an open-source container runtime. CWE-407
• CVE-2026-104844 PostCSS Selector Parser is a CSS selector parser that integrates with PostCSS but does… CWE-407