<?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>Thu, 08 Oct 2026 11:57:12 +0000</lastBuildDate>
    <item>
      <title>EUVD-2026-362339</title>
      <link>https://cve.radiocsirt.org/vuln/euvd-2026-362339</link>
      <description>EUVD-2026-362339</description>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/euvd-2026-362339</guid>
    </item>
    <item>
      <title>fkie_cve-2026-82742</title>
      <link>https://cve.radiocsirt.org/vuln/fkie_cve-2026-82742</link>
      <description>&lt;p&gt;Uncontrolled Resource Consumption vulnerability in ash-project ash lets an attacker exhaust node memory by matching a filter that spans multiple to-many relationships in memory.&lt;/p&gt;
&lt;p&gt;Ash.Filter.Runtime matches a filter against an in-memory record by first expanding the record into combinations of its related rows. flatten_relationships/2 (lib/ash/filter/runtime.ex) eagerly built the full Cartesian product across the filter&amp;#39;s to-many relationship paths, so a record with K to-many relationships of M rows each materialized on the order of M^K scenarios before any predicate was checked. A filter or dataset that reaches several sizeable to-many relationships therefore allocates memory combinatorially and can exhaust the node. The fix streams the expansion lazily and short-circuits on the first matching scenario, bounding the work.&lt;/p&gt;
&lt;p&gt;This issue affects ash: from 1.29.0-rc0 before 3.32.2.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;Uncontrolled Resource Consumption vulnerability in ash-project ash lets an attacker exhaust node memory by matching a filter that spans multiple to-many relationships in memory.&lt;/p&gt;
&lt;p&gt;Ash.Filter.Runtime matches a filter against an in-memory record by first expanding the record into combinations of its related rows. flatten_relationships/2 (lib/ash/filter/runtime.ex) eagerly built the full Cartesian product across the filter&amp;#39;s to-many relationship paths, so a record with K to-many relationships of M rows each materialized on the order of M^K scenarios before any predicate was checked. A filter or dataset that reaches several sizeable to-many relationships therefore allocates memory combinatorially and can exhaust the node. The fix streams the expansion lazily and short-circuits on the first matching scenario, bounding the work.&lt;/p&gt;
&lt;p&gt;This issue affects ash: from 1.29.0-rc0 before 3.32.2.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://cve.radiocsirt.org/vuln/fkie_cve-2026-82742</guid>
    </item>
  </channel>
</rss>
