Mistune EUVD-2026-42338

The prerequisite is concrete: the target application must feed attacker-controlled Markdown into a Mistune parser instance older than 3.3.0, and the malicious document must contain a large number of reference-link definitions (the '[label]: url' construct) - repeated or distinct - to trigger the quadratic path in block_parser.py and ref_links handling. No authentication, user interaction, or special platform is required (PR:N/UI:N), matching AV:N/AC:L. The limiting factor is deployment-dependent: exploitation only matters where Mistune processes untrusted input, and impact is bounded where the operator already enforces input-size limits, parse timeouts, or per-request CPU quotas; impact is confined to availability, with no path to data disclosure or code execution.

The CVSS 3.1 vector (AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H, base 7.5) is internally consistent and credible: network-reachable, no privileges, no user interaction, availability-only impact - a classic algorithmic-complexity DoS. There is no EPSS score, no KEV listing, and no published POC in the provided data, so predicted mass-exploitation probability cannot be quantified; however, the trigger (a text document with many reference-link definitions) is easy to reproduce independently from the public patch commit and advisory, so barrier to exploitation is low. This is a genuine availability priority for any internet-facing service that parses untrusted Markdown, but it carries zero confidentiality or integrity risk - it will not lead to data theft or code execution. Signals are consistent rather than conflicting; the main caveat is that real-world impact depends on deployment (whether Mistune sits behind untrusted input and whether request/CPU limits exist), which raw CVSS cannot capture.

An attacker submits a single Markdown payload - for example a comment, wiki edit, chat message, or API document - that contains thousands of reference-link definitions to a service that renders it with a pre-3.3.0 Mistune. Because parsing scales quadratically, the request consumes disproportionate CPU and stalls the worker; repeating it across connections exhausts the server pool and denies service to legitimate users. Given AV:N/AC:L/PR:N/UI:N, this requires only network access and no credentials, though no public POC is identified at time of analysis.