<?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://vulnerability.circl.lu</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>Mon, 05 Oct 2026 23:22:19 +0000</lastBuildDate>
    <item>
      <title>CVE-2026-31413 — bpf: Fix unsound scalar forking in maybe_fork_scalars() for BPF_OR</title>
      <link>https://vulnerability.circl.lu/vuln/cve-2026-31413</link>
      <description>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Linux&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;bpf: Fix unsound scalar forking in maybe_fork_scalars() for BPF_OR&lt;/p&gt;
&lt;p&gt;maybe_fork_scalars() is called for both BPF_AND and BPF_OR when the
source operand is a constant.  When dst has signed range [-1, 0], it
forks the verifier state: the pushed path gets dst = 0, the current
path gets dst = -1.&lt;/p&gt;
&lt;p&gt;For BPF_AND this is correct: 0 &amp;amp; K == 0.
For BPF_OR this is wrong:    0 | K == K, not 0.&lt;/p&gt;
&lt;p&gt;The pushed path therefore tracks dst as 0 when the runtime value is K,
producing an exploitable verifier/runtime divergence that allows
out-of-bounds map access.&lt;/p&gt;
&lt;p&gt;Fix this by passing env-&amp;gt;insn_idx (instead of env-&amp;gt;insn_idx + 1) to
push_stack(), so the pushed path re-executes the ALU instruction with
dst = 0 and naturally computes the correct result for any opcode.&lt;/p&gt;</description>
      <content:encoded>&lt;p&gt;&lt;strong&gt;Affected:&lt;/strong&gt; Linux&lt;/p&gt;
&lt;p&gt;In the Linux kernel, the following vulnerability has been resolved:&lt;/p&gt;
&lt;p&gt;bpf: Fix unsound scalar forking in maybe_fork_scalars() for BPF_OR&lt;/p&gt;
&lt;p&gt;maybe_fork_scalars() is called for both BPF_AND and BPF_OR when the
source operand is a constant.  When dst has signed range [-1, 0], it
forks the verifier state: the pushed path gets dst = 0, the current
path gets dst = -1.&lt;/p&gt;
&lt;p&gt;For BPF_AND this is correct: 0 &amp;amp; K == 0.
For BPF_OR this is wrong:    0 | K == K, not 0.&lt;/p&gt;
&lt;p&gt;The pushed path therefore tracks dst as 0 when the runtime value is K,
producing an exploitable verifier/runtime divergence that allows
out-of-bounds map access.&lt;/p&gt;
&lt;p&gt;Fix this by passing env-&amp;gt;insn_idx (instead of env-&amp;gt;insn_idx + 1) to
push_stack(), so the pushed path re-executes the ALU instruction with
dst = 0 and naturally computes the correct result for any opcode.&lt;/p&gt;</content:encoded>
      <guid isPermaLink="false">https://vulnerability.circl.lu/vuln/cve-2026-31413</guid>
    </item>
  </channel>
</rss>
