Nwellnhof

**Name of the Vulnerable Software and Affected Versions** cmark-gfm versions prior to 0.29.0.gfm.10 **Description** A polynomial time complexity issue in cmark-gfm may lead to unbounded resource exhaustion and subsequent denial of service. This issue is related to quadratic complexity when parsing text that leads with either large numbers of `>` or `-` characters. **Recommendations** For versions prior to 0.29.0.gfm.10, upgrade to version 0.29.0.gfm.10 or later to address the issue. For users unable to upgrade, validate that their input comes from trusted sources to minimize the risk of exploitation.