Skip to main content

Inefficient Algorithmic Complexity


Severity High
Score 7.5/10


cmark-gfm is GitHub's fork of cmark, a CommonMark parsing and rendering library and program in C. cmark-gfm versions prior to 0.29.0.gfm.7 and cmark versions prior to 0.30.3 contain a Polynomial Time Complexity issue that may lead to Unbounded Resource Exhaustion and subsequent Denial of Service.

  • LOW
  • NONE
  • NONE
  • NONE
  • NONE
  • HIGH

CWE-407 - Inefficient Algorithmic Complexity

An algorithm in a product has an inefficient worst-case computational complexity that may be detrimental to system performance and can be triggered by an attacker, typically using crafted manipulations that ensure that the worst case is being reached.

Advisory Timeline

  • Published