An issue was discovered in musl libc 0.7.10 through 1.2.6.

Code

The project this record applies to. Exploit listings stay in References.

No public source repository is identified for this product.

Timeline

Detection, updates, and resolution for this record.

1. Apr 10, 2026 · NIST NVD

   Detected

   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).

2. Jun 17, 2026 · NIST NVD

   Updated

   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).

Sources

• CVE.orgVulnerability recordCVE-2026-40200

  Official CVE identifier

  cve.org
• NIST NVDVulnerability recordCVE-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 3

  nvd.nist.gov

References

• Reference · openwall.com
• Reference · musl.libc.org
• Reference · openwall.com