CVE-2026-99710: Linux kernel · the arbitrary rmap limit
Source GCVE Database
Not known to be exploited · fixed in edf87e07376054eedcd5306e0794a26e3004d97b : update Linux kernel when convenient.
Data as of 20 Nov 2026, 07:34 UTC
Rated by Threat Radar · CVSS not yet scored by NVD
Thin evidence
One scorer or none- Patch
- Available – fixed in edf87e07376054eedcd5306e0794a26e3004d97b, e4558c3d7198ed9a0adc3304681f561f4e4d80e1, e0752f3e543c1b67fc9115251ae6b8f151ba9f04 +4
Exploitation evidence
Disclosed: evidence found.
CVE published 20 Nov 2026
Detectable: no evidence on record.
No public nuclei template indexed
Weaponized: no evidence on record.
No public exploit code indexed in Metasploit or Exploit-DB
Exploited in the wildExploited: no evidence on record.
Not in CISA KEV and no source reports exploitation
Observed by OffSeq MirageSeen by Mirage: no evidence on record.
No attack traffic recorded by OffSeq Mirage sensors
A missing step is not evidence of safety. Sources: cve.org (opens in a new tab), the Metasploit, Exploit-DB and nuclei-templates index as of 19 Nov 2026.
What to do
Upgrade to a fixed release listed under Affected software.
Affected software
| Product | Affected | Fixed in |
|---|---|---|
| LinuxLinux | Affected
| Fixed in
|
Description
In the Linux kernel, the following vulnerability has been resolved: KVM: x86/mmu: Cap number of parent PTEs per SP at 1000 (the arbitrary rmap limit) When potentially reusing a shadow page, zap the shadow page if its number of parent PTEs exceeds KVM's (mostly) arbitrary rmap recycling threshold. Letting the guest create a (mostly) unbounded number of parent PTEs allows the guest to coerce KVM into creating lists containing millions of PTEs, effectively bounded only by the maximum number of shadow pages. Because PTE lists are simple singly linked lists, removal is O(n). Even worse, if a list is constructed just so, teardown can be O(n^2), e.g. if SPTEs are built such that zapping child SPTEs always zaps the last entry in the list. To cap things off, all paths that walk PTE lists do so while holding mmu_lock, without conditionally rescheduling. Using a doubly linked list would not address the issue, as removal would remain O(n) since KVM still wouldn't know where in the list to remove from. Removal could be made O(1) by storing a per-SPTE pointer, but that would largely defeat the purpose of reusing SPs, and would penalize well-behaved guests, especially for nested TDP where aliasing page tables is uncommon. So, cap the maximum number of parent PTEs at the rmap limit. In practice, well-behaved guests will likely never run afoul of the limit. E.g. when running Linux as L1 with TDP, the number of parent PTEs for a single SP tops out at under 200 (though undoubtedly obscure workloads can push it higher). Deliberately use a "greater than or equal" as opposed to rmap's strictly "greater than", as the rmap code checks the threshold immediately *after* inserting into the list, i.e. the limit is 1000 for rmaps, KVM just very briefly blows past it. Apply the check to both indirect and direct SPs, because while a fully direct MMU naturally limits the number of parent PTEs to '1', direct SPs in indirect MMUs have no such constraint. E.g. if the guest maps a huge PTE into many locations in its page tables, and KVM is backing the hugepage with a direct SP, i.e. with a series of smaller pages, then KVM could end up with a direct SP with many parents. Note, shadow_mmu_try_split_huge_pages() always restarts the rmap walk or bails entirely if it gets to the point where it tries to grab a SP, i.e. there is *no* pre-existing bug that would be tripped by zapping a SP and thus rmaps when getting a SP.
References
- nvd.nist.gov/vuln/detail/CVE-2026-99710 (opens in a new tab)
- git.kernel.org/stable/c/72238066aacc400df69cef4b602f083ae4737762 (opens in a new tab)
- git.kernel.org/stable/c/e0752f3e543c1b67fc9115251ae6b8f151ba9f04 (opens in a new tab)
- git.kernel.org/stable/c/e4558c3d7198ed9a0adc3304681f561f4e4d80e1 (opens in a new tab)
- git.kernel.org/stable/c/edf87e07376054eedcd5306e0794a26e3004d97b (opens in a new tab)