Description
league/commonmark versions before 2.6.0 contain polynomial time complexity vulnerabilities in Markdown parsing that allow attackers to cause denial of service. Attackers can submit carefully crafted Markdown inputs designed to trigger worst-case performance, and sending multiple requests in parallel exhausts CPU resources and PHP-FPM processes.
Published: 2026-09-09
Score: 8.7 High
EPSS: n/a
KEV: No
Impact: n/a
Action: n/a
AI Analysis

Impact

This vulnerability in league/commonmark allows attackers to trigger extremely expensive parsing algorithms by submitting specially crafted Markdown. The worst‑case quadratic complexity can exhaust CPU and process resources, resulting in a service outage. The weakness is a classic quadratic time attack, CWE‑407.

Affected Systems

All versions of thephpleague:commonmark earlier than 2.6.0 are affected. The library is used in PHP applications that render Markdown. Any deployment that relies on this component without an updated version or mitigation is at risk.

Risk and Exploitability

The CVSS base score of 8.7 classifies it as high severity. EPSS is not available, so the exploitation likelihood is uncertain; however, the lack of a notification in KEV suggests no widespread exploitation yet. Attackers can abuse the flaw by sending potentially adversarial Markdown documents, and a multi‑request strategy can saturate a PHP‑FPM pool, causing denial of service. The vulnerability requires only the ability to process Markdown through the library, making it relatively easy to trigger from a compromised application or by unauthenticated input if the parser accepts external content.

Generated by OpenCVE AI on September 9, 2026 at 14:38 UTC.

Remediation

No vendor fix or workaround currently provided.

OpenCVE Recommended Actions

  • Upgrade to commonmark version 2.6.0 or later to eliminate the quadratic parsing complexity.
  • If an upgrade is not immediately possible, enforce a maximum size or complexity limit on Markdown inputs, rejecting requests that exceed a safe threshold.
  • Configure PHP‑FPM or the web server to cap the number of concurrent worker processes and apply rate limiting or queuing to requests that trigger Markdown parsing.
  • Optionally, set a processing timeout for the Markdown parser so that exceptionally long or complex inputs are aborted after a defined window.

Generated by OpenCVE AI on September 9, 2026 at 14:38 UTC.

Tracking

Sign in to view the affected projects.

Advisories

No advisories yet.

History

Wed, 09 Sep 2026 15:30:00 +0000

Type Values Removed Values Added
Metrics ssvc

{'options': {'Automatable': 'yes', 'Exploitation': 'none', 'Technical Impact': 'partial'}, 'version': '2.0.3'}


Wed, 09 Sep 2026 13:45:00 +0000

Type Values Removed Values Added
Description league/commonmark versions before 2.6.0 contain polynomial time complexity vulnerabilities in Markdown parsing that allow attackers to cause denial of service. Attackers can submit carefully crafted Markdown inputs designed to trigger worst-case performance, and sending multiple requests in parallel exhausts CPU resources and PHP-FPM processes.
Title league/commonmark before 2.6.0 Denial of Service via Quadratic Complexity
First Time appeared Thephpleague
Thephpleague commonmark
Weaknesses CWE-407
CPEs cpe:2.3:a:thephpleague:commonmark:*:*:*:*:*:*:*:*
Vendors & Products Thephpleague
Thephpleague commonmark
References
Metrics cvssV3_1

{'score': 7.5, 'vector': 'CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H'}

cvssV4_0

{'score': 8.7, 'vector': 'CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N'}


Subscriptions

Thephpleague Commonmark
cve-icon MITRE

Status: PUBLISHED

Assigner: VulnCheck

Published:

Updated: 2026-09-09T14:54:53.318Z

Reserved: 2026-08-16T13:02:14.691Z

Link: CVE-2024-58382

cve-icon Vulnrichment

Updated: 2026-09-09T14:54:42.643Z

cve-icon NVD

Status : Received

Published: 2026-09-09T14:17:10.327

Modified: 2026-09-09T15:17:05.760

Link: CVE-2024-58382

cve-icon Redhat

No data.

cve-icon OpenCVE Enrichment

Updated: 2026-09-09T14:45:05Z

Weaknesses
  • CWE-407

    Inefficient Algorithmic Complexity