CVE-2024-9277 is a medium-severity inefficient regular expression (ReDoS) vulnerability in langflow (pip), affecting versions <= 1.0.18. No fixed version is listed yet.
A vulnerability classified as problematic was found in Langflow up to 1.0.18. Affected by this vulnerability is an unknown functionality of the file \src\backend\base\langflow\interface\utils.py of the component HTTP POST Request Handler. The manipulation of the argument remaining_text leads to inefficient regular expression complexity. The exploit has been disclosed to the public and may be used. The vendor was contacted early about this disclosure but did not respond in any way.
A regular expression with worst-case exponential or polynomial matching time is applied to untrusted input, causing excessive CPU use. Typical impact: denial of service when input is crafted to trigger backtracking.
CVE-2024-9277 has a CVSS score of 3.5 (Medium). The vector is reachable from an adjacent network, low privileges required, and no user interaction. A CVSS score reflects the worst-case severity of the vulnerability, not your specific exposure. Whether this affects your application depends on whether the vulnerable code is present and reachable in your environment.
No fixed version is listed yet, so configuration controls and monitoring matter more in the interim.
pip
langflow (<= 1.0.18)Severity tells you how bad this could be in the worst case. It does not tell you whether you are exposed. Exploitability and impact are functions of runtime truth: whether the vulnerable code is present, reachable, and actually executes in your application. A vulnerable package can sit in your dependency tree and never run.
Kodem, an Intelligent Application Security platform, uses runtime intelligence to reveal which vulnerabilities actually execute in production, so teams prioritize the ones that genuinely matter instead of chasing every advisory.
Kodem's runtime-powered SCA identifies whether CVE-2024-9277 is reachable in your applications. Explore open-source security for your team.
See if CVE-2024-9277 is reachable in your applications. Get a demo
No fixed version is listed for CVE-2024-9277 yet.
In the interim: Rewrite the regular expression to avoid ambiguous repetition, or use a linear-time regex engine.
Kodem Kai can prioritize this vulnerability in your dependency tree and generate a fix recommendation.
CVE-2024-9277 is a medium-severity inefficient regular expression (ReDoS) vulnerability in langflow (pip), affecting versions <= 1.0.18. No fixed version is listed yet. A regular expression with worst-case exponential or polynomial matching time is applied to untrusted input, causing excessive CPU use.
CVE-2024-9277 has a CVSS score of 3.5 (Medium). This score reflects the worst-case severity of the vulnerability, not your specific exposure. Whether it represents real risk in your environment depends on whether the vulnerable code is present and reachable.
langflow (pip) versions <= 1.0.18 is affected.
No fixed version is listed for CVE-2024-9277 yet. Monitor the advisory for updates and apply mitigations in the interim.
Whether CVE-2024-9277 is exploitable in your environment depends on whether the vulnerable code is present and reachable. A CVSS score is a worst-case rating; it does not account for your specific deployment, configuration, or usage patterns. Kodem, an Intelligent Application Security platform, uses runtime intelligence to show which vulnerabilities actually execute in production, so you can focus on the ones that represent real risk. Get a demo
Exploitability and impact are not fixed properties of a CVE. They depend on runtime truth: whether the vulnerable code is present, reachable, and actually executes in your application. A high CVSS score on a dependency that never runs is not the same as real risk. Kodem, an Intelligent Application Security platform, uses runtime intelligence to reveal which vulnerabilities actually execute in production, so teams prioritize the ones that genuinely matter.
No fixed version is listed yet. In the interim: Rewrite the regular expression to avoid ambiguous repetition, or use a linear-time regex engine.