{"resultsPerPage":1,"startIndex":0,"totalResults":1,"format":"NVD_CVE","version":"2.0","timestamp":"2026-05-13T08:22:43.563","vulnerabilities":[{"cve":{"id":"CVE-2026-40200","sourceIdentifier":"cve@mitre.org","published":"2026-04-10T17:17:14.107","lastModified":"2026-04-27T19:18:46.690","vulnStatus":"Deferred","cveTags":[],"descriptions":[{"lang":"en","value":"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)."}],"metrics":{"cvssMetricV31":[{"source":"cve@mitre.org","type":"Secondary","cvssData":{"version":"3.1","vectorString":"CVSS:3.1/AV:L/AC:H/PR:N/UI:N/S:C/C:H/I:H/A:H","baseScore":8.1,"baseSeverity":"HIGH","attackVector":"LOCAL","attackComplexity":"HIGH","privilegesRequired":"NONE","userInteraction":"NONE","scope":"CHANGED","confidentialityImpact":"HIGH","integrityImpact":"HIGH","availabilityImpact":"HIGH"},"exploitabilityScore":1.4,"impactScore":6.0}]},"weaknesses":[{"source":"cve@mitre.org","type":"Secondary","description":[{"lang":"en","value":"CWE-670"}]}],"references":[{"url":"https://musl.libc.org/releases.html","source":"cve@mitre.org"},{"url":"https://www.openwall.com/lists/oss-security/2026/04/10/13","source":"cve@mitre.org"},{"url":"http://www.openwall.com/lists/oss-security/2026/04/10/13","source":"af854a3a-2127-422b-91ae-364da2661108"}]}}]}