Skip to content

Apollo Router Query Planner Vulnerable to Excessive Resource Consumption via Optimization Bypass

High severity GitHub Reviewed Published Apr 7, 2025 in apollographql/router • Updated Apr 8, 2025

Package

cargo apollo-router (Rust)

Affected versions

< 1.61.2
>= 2.0.0-alpha.0, < 2.1.1

Patched versions

1.61.2
2.1.1

Description

Impact

Summary

A vulnerability in Apollo Router allowed queries with deeply nested and reused named fragments to be prohibitively expensive to query plan, specifically due to internal optimizations being frequently bypassed. This could lead to excessive resource consumption and denial of service.

Details

The query planner includes an optimization that significantly speeds up planning for applicable GraphQL selections. However, queries with deeply nested and reused named fragments can generate many selections where this optimization does not apply, leading to significantly longer planning times. Because the query planner does not enforce a timeout, a small number of such queries can exhaust router's thread pool, rendering it inoperable.

Fix/Mitigation

  • A new Query Optimization Limit metric has been added:
    • This metric approximates the number of selections that cannot be skipped by the existing optimization.
    • The metric is checked against a limit to prevent excessive computation.

Given the complexity of query planning optimizations, we will continue refining these solutions based on real-world performance and accuracy tests.

Patches

This has been remediated in apollo-router versions 1.61.2 and 2.1.1.

Workarounds

The only known workaround is "Safelisting" or "Safelisting with IDs only" per Safelisting with Persisted Queries - Apollo GraphQL Docs.

References

Query Planning Documentation

Acknowledgements

We appreciate the efforts of the security community in identifying and improving the performance and security of query planning mechanisms.

References

@jasonbarnett667 jasonbarnett667 published to apollographql/router Apr 7, 2025
Published to the GitHub Advisory Database Apr 7, 2025
Reviewed Apr 7, 2025
Published by the National Vulnerability Database Apr 7, 2025
Last updated Apr 8, 2025

Severity

High

CVSS overall score

This score calculates overall vulnerability severity from 0 to 10 and is based on the Common Vulnerability Scoring System (CVSS).
/ 10

CVSS v3 base metrics

Attack vector
Network
Attack complexity
Low
Privileges required
None
User interaction
None
Scope
Unchanged
Confidentiality
None
Integrity
None
Availability
High

CVSS v3 base metrics

Attack vector: More severe the more the remote (logically and physically) an attacker can be in order to exploit the vulnerability.
Attack complexity: More severe for the least complex attacks.
Privileges required: More severe if no privileges are required.
User interaction: More severe when no user interaction is required.
Scope: More severe when a scope change occurs, e.g. one vulnerable component impacts resources in components beyond its security scope.
Confidentiality: More severe when loss of data confidentiality is highest, measuring the level of data access available to an unauthorized user.
Integrity: More severe when loss of data integrity is the highest, measuring the consequence of data modification possible by an unauthorized user.
Availability: More severe when the loss of impacted component availability is highest.
CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H

EPSS score

Weaknesses

CVE ID

CVE-2025-32032

GHSA ID

GHSA-94hh-jmq8-2fgp

Source code

Loading Checking history
See something to contribute? Suggest improvements for this vulnerability.