CVE-2026-40200
An issue was discovered in musl libc 0.7.10 through 1.2.6. Stack-based memory corruption can occur during qsort of very large arrays, due to incorrectly implemented double-word primitives. The number of elements must exceed about seven million, i.e., the 32nd Leonardo number on 32-bit platforms (or the 64th Leonardo number on 64-bit platforms, which is not practical).
Scoring
- Severity
- HIGH
- CVSS base score
- 8.1
- CVSS vector
- CVSS:3.1/AV:L/AC:H/PR:N/UI:N/S:C/C:H/I:H/A:H
- EPSS probability
- 0.17%
- CWE
- CWE-670
- Published
- 2026-04-10
- Last modified
- 2026-04-14
Affected products
- musl-libc musl
Weakness type
Related vulnerabilities
- CVE-2026-55624 — MintyItanium Lost-Auction takes items like barrier blocks out from search GUI
- CVE-2026-72705 — Rocq Prover before 9.2.0 Guard Checker Accepts Fixpoint Passed as a Higher-Order Argument
- CVE-2026-72704 — Rocq Prover through 9.2.0 Guard Checker Trusts Corrupted Recursive Tree After Transport
- CVE-2026-72703 — Rocq Prover 8.20 before 9.2.0 Guard Checker Accepts Non-Terminating Fixpoint via Unchecked Cross-Calls
- CVE-2026-19487 — Perl versions from 5.9.4 before 5.41.9 produce incorrect regular expression match results when a stale failure flag ends the Aho-Corasick prescan early in S_find_byclass
- CVE-2026-73283 — In sshd in OpenSSH before 10.5, the restrict keyword (in authorized_keys) was supposed to be...
- CVE-2026-20713 — Always-incorrect control flow implementation in some firmware for some Intel(R) Xeon(R) processors...
- CVE-2026-14935 — Gstreamer: gstreamer: webrtcbin accepts remote sdp without a=fingerprint due to inverted presence check