Inefficient Algorithmic Complexity Affecting graphql-core package, versions [3.0.0,3.2.12)[3.3.0a1,3.3.0rc1)
Threat Intelligence
Snyk has a proof-of-concept or detailed explanation of how to exploit this vulnerability.
The probability is the direct output of the EPSS model, and conveys an overall sense of the threat of exploitation in the wild. The percentile measures the EPSS probability relative to all known EPSS scores. Note: This data is updated daily, relying on the latest available EPSS model version. Check out the EPSS documentation for more details.
Do your applications use this vulnerable package?
In a few clicks we can analyze your entire application and see what components are vulnerable in your application, and suggest you quick fixes.
Test your applications- Snyk IDSNYK-PYTHON-GRAPHQLCORE-21433568
- published22 Oct 2026
- disclosed22 Oct 2026
- creditBZHunt, bcmyguest
Introduced: 22 Oct 2026
NewCVE-2026-75507 (opens in a new tab)How to fix?
Upgrade graphql-core to version 3.2.12, 3.3.0rc1 or higher.
Overview
graphql-core is a GraphQL implementation for Python, a port of GraphQL.js, the JavaScript reference implementation for GraphQL.
Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity via the OverlappingFieldsCanBeMergedRule validation rule in overlapping_fields_can_be_merged.py. The rule compares every pair of fields sharing a response name and recurses into their sub-selections, producing O(n^2) complexity that worsens when inline fragments repeat the same response name at multiple nesting levels. An attacker can send a query that drives validation into minutes of CPU consumption on a single request, exhausting server resources.