Skip to main content

CVE-2026-99786Linux vulnerability

Low priorityNot scoredEPSS not scored yet

CVE-2026-99786 is a vulnerability in Linux, not yet scored.

Why this priority: Not scored yet, and no exploitation signal.

Published · Updated · NVD status: Received

What it is

The record does not classify the weakness yet; the description below says what the reporter found.

How it is reached

The record does not say yet how the flaw is reached; the description below is the best guide until it is scored.

What an attacker gains

Its impact has not been scored yet.

Is it being exploited?

There is no public report of exploitation yet.

What to do

  1. Upgrade Linux to a fixed version for your release line (6.12.118, 6.18.64, 7.3.5).

Description from NVD

In the Linux kernel, the following vulnerability has been resolved:

xfrm: retry inexact policy lookup after node reinsertion

An inexact policy lookup first records pointers to candidate hlist heads and then traverses the lists. A concurrent policy insertion can merge inexact tree nodes between those operations:

lookup policy insertion ------ ---------------- find inexact candidates save obsolete hlist head write_seqcount_begin(&bin->count) merge inexact tree nodes hlist_del_rcu(&policy->bydst) reinsert policy->bydst in survivor write_seqcount_end(&bin->count) evaluate saved candidate list miss the moved policy

The merge immediately reinserts the same hlist node into the surviving tree node. RCU keeps the policy alive, but it does not provide a consistent view while its list node is moved. A lookup that selected the obsolete list can observe it empty. A lookup already traversing a moved policy can instead follow the next pointer rewritten by the reinsertion. Either case can return an incorrect IPsec policy result.

The per-bin sequence counter already brackets calls to xfrm_policy_inexact_insert_node(), including node merges. The read side, however, currently validates the counter only while searching an individual rb-tree. A successful search returns without validation, and the later candidate-list traversal is outside that read-side section.

Snapshot the per-bin sequence before discovering candidate heads and validate it after evaluating all candidate lists. Retry the lookup if the inexact policy tree changes while it is being searched.

What this means for your architecture.

A CVE names a product. Whether it matters depends on where that product sits in your systems: what reaches it, which trust boundary it guards and what it can reach once compromised. Veriom maps your components, their relationships and your trust boundaries from your code, cloud and delivery evidence, so you can see where a component like this sits. The radar itself does not look at your systems.

Components it touches

  • Linux. Start from where it runs and what it is connected to.

Trust boundaries in play

    Questions to answer about your own systems

    • Where does Linux run in your systems, and at which version?
    • Which of those instances are reachable by people you do not trust?
    • What can it reach once compromised: which data stores, secrets and services?

    14-day free trial

    Understand how your systems connect.

    See your services, dependencies and trust boundaries in one place, with evidence from your connected environment.

    Sources

    • CVE records and CVSS scores from the NVD CVE API. This product uses the NVD API but is not endorsed or certified by the NVD.
    • Exploitation status from CISA’s Known Exploited Vulnerabilities catalog.
    • Exploit likelihood from FIRST’s Exploit Prediction Scoring System (EPSS), refreshed daily.
    • Explanations are written by Veriom from fixed templates over each record’s data, not by a person reviewing each CVE. Descriptions are quoted from the records as published.