<?xml version='1.0' encoding='UTF-8'?>
<?xml-stylesheet href="/static/style.xsl" type="text/xsl"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/" version="2.0">
  <channel>
    <title>Most recent entries from all</title>
    <link>https://cve.radiocsirt.org</link>
    <description>Contains only the most 10 recent entries.</description>
    <docs>http://www.rssboard.org/rss-specification</docs>
    <generator>python-feedgen</generator>
    <language>en</language>
    <lastBuildDate>Sat, 10 Oct 2026 09:19:03 +0000</lastBuildDate>
    <item>
      <title>EUVD-2026-227656</title>
      <link>https://cve.radiocsirt.org/vuln/euvd-2026-227656</link>
      <description>EUVD-2026-227656</description>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/euvd-2026-227656</guid>
    </item>
    <item>
      <title>fkie_cve-2025-32031</title>
      <link>https://cve.radiocsirt.org/vuln/fkie_cve-2025-32031</link>
      <description>&lt;p&gt;Apollo Gateway provides utilities for combining multiple GraphQL microservices into a single GraphQL endpoint. Prior to 2.10.1, a vulnerability in Apollo Gateway allowed queries with deeply nested and reused named fragments to be prohibitively expensive to query plan, specifically due to internal optimizations being frequently bypassed. 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 render gateway inoperable. This could lead to excessive resource consumption and denial of service. This has been remediated in @apollo/gateway version 2.10.1.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;Apollo Gateway provides utilities for combining multiple GraphQL microservices into a single GraphQL endpoint. Prior to 2.10.1, a vulnerability in Apollo Gateway allowed queries with deeply nested and reused named fragments to be prohibitively expensive to query plan, specifically due to internal optimizations being frequently bypassed. 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 render gateway inoperable. This could lead to excessive resource consumption and denial of service. This has been remediated in @apollo/gateway version 2.10.1.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/fkie_cve-2025-32031</guid>
    </item>
    <item>
      <title>GHSA-p2q6-pwh5-m6jr — Apollo Gateway Query Planner Vulnerable to Excessive Resource Consumption via Optimization Bypass</title>
      <link>https://cve.radiocsirt.org/vuln/ghsa-p2q6-pwh5-m6jr</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; npm: @apollo/gateway&lt;/p&gt;
&lt;p&gt;# Impact&lt;/p&gt;
&lt;p&gt;## Summary&lt;/p&gt;
&lt;p&gt;A vulnerability in Apollo Gateway 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.&lt;/p&gt;
&lt;p&gt;## Details&lt;/p&gt;
&lt;p&gt;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 render gateway inoperable.&lt;/p&gt;
&lt;p&gt;## Fix/Mitigation&lt;/p&gt;
&lt;p&gt;- 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.&lt;/p&gt;
&lt;p&gt;Given the complexity of query planning optimizations, we will continue refining these solutions based on real-world performance and accuracy tests.&lt;/p&gt;
&lt;p&gt;# Patches&lt;/p&gt;
&lt;p&gt;This has been remediated in `@apollo/gateway` version 2.10.1.&lt;/p&gt;
&lt;p&gt;# Workarounds&lt;/p&gt;
&lt;p&gt;No known direct workarounds exist.&lt;/p&gt;
&lt;p&gt;# References&lt;/p&gt;
&lt;p&gt;[Query Planning Documentation](https://www.apollographql.com/docs/graphos/reference/federation/query-plans)&lt;/p&gt;
&lt;p&gt;## Acknowledgements&lt;/p&gt;
&lt;p&gt;We appreciate the efforts of the security community in identifying and improving the p…&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; npm: @apollo/gateway&lt;/p&gt;
&lt;p&gt;# Impact&lt;/p&gt;
&lt;p&gt;## Summary&lt;/p&gt;
&lt;p&gt;A vulnerability in Apollo Gateway 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.&lt;/p&gt;
&lt;p&gt;## Details&lt;/p&gt;
&lt;p&gt;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 render gateway inoperable.&lt;/p&gt;
&lt;p&gt;## Fix/Mitigation&lt;/p&gt;
&lt;p&gt;- 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.&lt;/p&gt;
&lt;p&gt;Given the complexity of query planning optimizations, we will continue refining these solutions based on real-world performance and accuracy tests.&lt;/p&gt;
&lt;p&gt;# Patches&lt;/p&gt;
&lt;p&gt;This has been remediated in `@apollo/gateway` version 2.10.1.&lt;/p&gt;
&lt;p&gt;# Workarounds&lt;/p&gt;
&lt;p&gt;No known direct workarounds exist.&lt;/p&gt;
&lt;p&gt;# References&lt;/p&gt;
&lt;p&gt;[Query Planning Documentation](https://www.apollographql.com/docs/graphos/reference/federation/query-plans)&lt;/p&gt;
&lt;p&gt;## Acknowledgements&lt;/p&gt;
&lt;p&gt;We appreciate the efforts of the security community in identifying and improving the p…&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/ghsa-p2q6-pwh5-m6jr</guid>
    </item>
  </channel>
</rss>
