Expr is an expression language and expression evaluation for Go. Prior to version 1.17.0, if the Expr expression parser is given an unbounded input string, it will attempt to compile the entire string and generate an Abstract Syntax Tree (AST) node for each part of the expression. In scenarios where input size isn’t limited, a malicious or inadvertent extremely large expression can consume excessive memory as the parser builds a huge AST. This can ultimately lead to*excessive memory usage and an Out-Of-Memory (OOM) crash of the process. This issue is relatively uncommon and will only manifest when there are no restrictions on the input size, i.e. the expression length is allowed to grow arbitrarily large. In typical use cases where inputs are bounded or validated, this problem would not occur. The problem has been patched in the latest versions of the Expr library. The fix introduces compile-time limits on the number of AST nodes and memory usage during parsing, preventing any single expression from exhausting resources. Users should upgrade to Expr version 1.17.0 or later, as this release includes the new node budget and memory limit safeguards. Upgrading to v1.17.0 ensures that extremely deep or large expressions are detected and safely aborted during compilation, avoiding the OOM condition. For users who cannot immediately upgrade, the recommended workaround is to impose an input size restriction before parsing. In practice, this means validating or limiting the length of expression strings that your application will accept. For example, set a maximum allowable number of characters (or nodes) for any expression and reject or truncate inputs that exceed this limit. By ensuring no unbounded-length expression is ever fed into the parser, one can prevent the parser from constructing a pathologically large AST and avoid potential memory exhaustion. In short, pre-validate and cap input size as a safeguard in the absence of the patch.

redhat RHSA-2025:7479: RHSA-2025:7479: opentelemetry-collector security update (Important)

It is, therefore, affected by multiple vulnerabilities as referenced in the ALAS2023-2025-968 advisory.

    The net/http package accepted data in the chunked transfer encoding containing an invalid chunk-size line     terminated by a bare LF. When used in conjunction with a server or proxy which incorrectly interprets a     bare LF in a chunk extension as part of the extension, this could permit request smuggling.
    (CVE-2025-22871)

    Expr is an expression language and expression evaluation for Go. Prior to version 1.17.0, if the Expr     expression parser is given an unbounded input string, it will attempt to compile the entire string and     generate an Abstract Syntax Tree (AST) node for each part of the expression. In scenarios where input size     isn't limited, a malicious or inadvertent extremely large expression can consume excessive memory as the     parser builds a huge AST. This can ultimately lead to*excessive memory usage and an Out-Of-Memory (OOM)     crash of the process. This issue is relatively uncommon and will only manifest when there are no     restrictions on the input size, i.e. the expression length is allowed to grow arbitrarily large. In     typical use cases where inputs are bounded or validated, this problem would not occur. The problem has     been patched in the latest versions of the Expr library. The fix introduces compile-time limits on the     number of AST nodes and memory usage during parsing, preventing any single expression from exhausting     resources. Users should upgrade to Expr version 1.17.0 or later, as this release includes the new node     budget and memory limit safeguards. Upgrading to v1.17.0 ensures that extremely deep or large expressions     are detected and safely aborted during compilation, avoiding the OOM condition. For users who cannot     immediately upgrade, the recommended workaround is to impose an input size restriction before parsing. In     practice, this means validating or limiting the length of expression strings that your application will     accept. For example, set a maximum allowable number of characters (or nodes) for any expression and reject     or truncate inputs that exceed this limit. By ensuring no unbounded-length expression is ever fed into the     parser, one can prevent the parser from constructing a pathologically large AST and avoid potential memory     exhaustion. In short, pre-validate and cap input size as a safeguard in the absence of the patch.
    (CVE-2025-29786)

    golang-jwt is a Go implementation of JSON Web Tokens. Prior to5.2.2 and 4.5.2, the function     parse.ParseUnverified splits (via a call to strings.Split) its argument (which is untrusted data) on     periods. As a result, in the face of a malicious request whose Authorization header consists of Bearer     followed by many period characters, a call to that function incurs allocations to the tune of O(n) bytes     (where n stands for the length of the function's argument), with a constant factor of about 16. This issue     is fixed in 5.2.2 and 4.5.2. (CVE-2025-30204)

Tenable has extracted the preceding description block directly from the tested product security advisory.

Note that Nessus has not tested for these issues but has instead relied only on the application's self-reported version number.

The version of amazon-cloudwatch-agent installed on the remote host is prior to 1.300054.1-2. It is, therefore, affected by multiple vulnerabilities as referenced in the ALAS2-2025-2851 advisory.

    The net/http package accepted data in the chunked transfer encoding containing an invalid chunk-size line     terminated by a bare LF. When used in conjunction with a server or proxy which incorrectly interprets a     bare LF in a chunk extension as part of the extension, this could permit request smuggling.
    (CVE-2025-22871)

    Expr is an expression language and expression evaluation for Go. Prior to version 1.17.0, if the Expr     expression parser is given an unbounded input string, it will attempt to compile the entire string and     generate an Abstract Syntax Tree (AST) node for each part of the expression. In scenarios where input size     isn't limited, a malicious or inadvertent extremely large expression can consume excessive memory as the     parser builds a huge AST. This can ultimately lead to*excessive memory usage and an Out-Of-Memory (OOM)     crash of the process. This issue is relatively uncommon and will only manifest when there are no     restrictions on the input size, i.e. the expression length is allowed to grow arbitrarily large. In     typical use cases where inputs are bounded or validated, this problem would not occur. The problem has     been patched in the latest versions of the Expr library. The fix introduces compile-time limits on the     number of AST nodes and memory usage during parsing, preventing any single expression from exhausting     resources. Users should upgrade to Expr version 1.17.0 or later, as this release includes the new node     budget and memory limit safeguards. Upgrading to v1.17.0 ensures that extremely deep or large expressions     are detected and safely aborted during compilation, avoiding the OOM condition. For users who cannot     immediately upgrade, the recommended workaround is to impose an input size restriction before parsing. In     practice, this means validating or limiting the length of expression strings that your application will     accept. For example, set a maximum allowable number of characters (or nodes) for any expression and reject     or truncate inputs that exceed this limit. By ensuring no unbounded-length expression is ever fed into the     parser, one can prevent the parser from constructing a pathologically large AST and avoid potential memory     exhaustion. In short, pre-validate and cap input size as a safeguard in the absence of the patch.
    (CVE-2025-29786)

    golang-jwt is a Go implementation of JSON Web Tokens. Prior to5.2.2 and 4.5.2, the function     parse.ParseUnverified splits (via a call to strings.Split) its argument (which is untrusted data) on     periods. As a result, in the face of a malicious request whose Authorization header consists of Bearer     followed by many period characters, a call to that function incurs allocations to the tune of O(n) bytes     (where n stands for the length of the function's argument), with a constant factor of about 16. This issue     is fixed in 5.2.2 and 4.5.2. (CVE-2025-30204)

Tenable has extracted the preceding description block directly from the tested product security advisory.

Note that Nessus has not tested for these issues but has instead relied only on the application's self-reported version number.

The remote Redhat Enterprise Linux 9 host has a package installed that is affected by multiple vulnerabilities as referenced in the RHSA-2025:7407 advisory.

    Collector with the supported components for a Red Hat build of OpenTelemetry

    Security Fix(es):

    * go-jose: Go JOSE's Parsing Vulnerable to Denial of Service (CVE-2025-27144)

    * golang.org/x/oauth2/jws: Unexpected memory consumption during token parsing in golang.org/x/oauth2/jws     (CVE-2025-22868)

    * github.com/expr-lang/expr: Memory Exhaustion in Expr Parser with Unrestricted Input (CVE-2025-29786)

    * golang-jwt/jwt: jwt-go allows excessive memory allocation during header parsing (CVE-2025-30204)

    For more details about the security issue(s), including the impact, a CVSS score, acknowledgments, and     other related information, refer to the CVE page(s) listed in the References section.

Tenable has extracted the preceding description block directly from the Red Hat Enterprise Linux security advisory.

Note that Nessus has not tested for these issues but has instead relied only on the application's self-reported version number.

The version of coredns / ig / keda installed on the remote CBL Mariner 2.0 host is prior to tested version. It is, therefore, affected by a vulnerability as referenced in the CVE-2025-29786 advisory.

  - Expr is an expression language and expression evaluation for Go. Prior to version 1.17.0, if the Expr     expression parser is given an unbounded input string, it will attempt to compile the entire string and     generate an Abstract Syntax Tree (AST) node for each part of the expression. In scenarios where input size     isn't limited, a malicious or inadvertent extremely large expression can consume excessive memory as the     parser builds a huge AST. This can ultimately lead to*excessive memory usage and an Out-Of-Memory (OOM)     crash of the process. This issue is relatively uncommon and will only manifest when there are no     restrictions on the input size, i.e. the expression length is allowed to grow arbitrarily large. In     typical use cases where inputs are bounded or validated, this problem would not occur. The problem has     been patched in the latest versions of the Expr library. The fix introduces compile-time limits on the     number of AST nodes and memory usage during parsing, preventing any single expression from exhausting     resources. Users should upgrade to Expr version 1.17.0 or later, as this release includes the new node     budget and memory limit safeguards. Upgrading to v1.17.0 ensures that extremely deep or large expressions     are detected and safely aborted during compilation, avoiding the OOM condition. For users who cannot     immediately upgrade, the recommended workaround is to impose an input size restriction before parsing. In     practice, this means validating or limiting the length of expression strings that your application will     accept. For example, set a maximum allowable number of characters (or nodes) for any expression and reject     or truncate inputs that exceed this limit. By ensuring no unbounded-length expression is ever fed into the     parser, one can prevent the parser from constructing a pathologically large AST and avoid potential memory     exhaustion. In short, pre-validate and cap input size as a safeguard in the absence of the patch.
    (CVE-2025-29786)

Note that Nessus has not tested for this issue but has instead relied only on the application's self-reported version number.

The version of coredns / ig / keda installed on the remote Azure Linux 3.0 host is prior to tested version. It is, therefore, affected by a vulnerability as referenced in the CVE-2025-29786 advisory.

  - Expr is an expression language and expression evaluation for Go. Prior to version 1.17.0, if the Expr     expression parser is given an unbounded input string, it will attempt to compile the entire string and     generate an Abstract Syntax Tree (AST) node for each part of the expression. In scenarios where input size     isn't limited, a malicious or inadvertent extremely large expression can consume excessive memory as the     parser builds a huge AST. This can ultimately lead to*excessive memory usage and an Out-Of-Memory (OOM)     crash of the process. This issue is relatively uncommon and will only manifest when there are no     restrictions on the input size, i.e. the expression length is allowed to grow arbitrarily large. In     typical use cases where inputs are bounded or validated, this problem would not occur. The problem has     been patched in the latest versions of the Expr library. The fix introduces compile-time limits on the     number of AST nodes and memory usage during parsing, preventing any single expression from exhausting     resources. Users should upgrade to Expr version 1.17.0 or later, as this release includes the new node     budget and memory limit safeguards. Upgrading to v1.17.0 ensures that extremely deep or large expressions     are detected and safely aborted during compilation, avoiding the OOM condition. For users who cannot     immediately upgrade, the recommended workaround is to impose an input size restriction before parsing. In     practice, this means validating or limiting the length of expression strings that your application will     accept. For example, set a maximum allowable number of characters (or nodes) for any expression and reject     or truncate inputs that exceed this limit. By ensuring no unbounded-length expression is ever fed into the     parser, one can prevent the parser from constructing a pathologically large AST and avoid potential memory     exhaustion. In short, pre-validate and cap input size as a safeguard in the absence of the patch.
    (CVE-2025-29786)

Note that Nessus has not tested for this issue but has instead relied only on the application's self-reported version number.

The remote Redhat Enterprise Linux 9 host has a package installed that is affected by multiple vulnerabilities as referenced in the RHSA-2025:3593 advisory.

    Collector with the supported components for a Red Hat build of OpenTelemetry

    Security Fix(es):

    * golang: net/http: net/http: sensitive headers incorrectly sent after cross-domain redirect     (CVE-2024-45336)

    * go-jose: Go JOSE's Parsing Vulnerable to Denial of Service (CVE-2025-27144)

    * golang.org/x/oauth2/jws: Unexpected memory consumption during token parsing in golang.org/x/oauth2/jws     (CVE-2025-22868)

    * github.com/expr-lang/expr: Memory Exhaustion in Expr Parser with Unrestricted Input (CVE-2025-29786)

    For more details about the security issue(s), including the impact, a CVSS score, acknowledgments, and     other related information, refer to the CVE page(s) listed in the References section.

Tenable has extracted the preceding description block directly from the Red Hat Enterprise Linux security advisory.

Note that Nessus has not tested for these issues but has instead relied only on the application's self-reported version number.

The remote Redhat Enterprise Linux 9 host has a package installed that is affected by multiple vulnerabilities as referenced in the RHSA-2025:3335 advisory.

    Collector with the supported components for a Red Hat build of OpenTelemetry

    Security Fix(es):

    * golang: net/http: net/http: sensitive headers incorrectly sent after cross-domain redirect     (CVE-2024-45336)

    * go-jose: Go JOSE's Parsing Vulnerable to Denial of Service (CVE-2025-27144)

    * golang.org/x/oauth2/jws: Unexpected memory consumption during token parsing in golang.org/x/oauth2/jws     (CVE-2025-22868)

    * github.com/expr-lang/expr: Memory Exhaustion in Expr Parser with Unrestricted Input (CVE-2025-29786)

    For more details about the security issue(s), including the impact, a CVSS score, acknowledgments, and     other related information, refer to the CVE page(s) listed in the References section.

Tenable has extracted the preceding description block directly from the Red Hat Enterprise Linux security advisory.

Note that Nessus has not tested for these issues but has instead relied only on the application's self-reported version number.

ID	Name	Product	Family	Severity
235902	Amazon Linux 2023 : amazon-cloudwatch-agent (ALAS2023-2025-968)	Nessus	Amazon Linux Local Security Checks	high
235886	Amazon Linux 2 : amazon-cloudwatch-agent (ALAS-2025-2851)	Nessus	Amazon Linux Local Security Checks	high
235835	RHEL 9 : opentelemetry-collector (RHSA-2025:7407)	Nessus	Red Hat Local Security Checks	high
234065	CBL Mariner 2.0 Security Update: coredns / ig / keda (CVE-2025-29786)	Nessus	MarinerOS Local Security Checks	high
234061	Azure Linux 3.0 Security Update: coredns / ig / keda (CVE-2025-29786)	Nessus	Azure Linux Local Security Checks	high
233934	RHEL 9 : opentelemetry-collector (RHSA-2025:3593)	Nessus	Red Hat Local Security Checks	high
233522	RHEL 9 : opentelemetry-collector (RHSA-2025:3335)	Nessus	Red Hat Local Security Checks	high

Detections

Analytics

CVE-2025-29786

high

Tenable Plugins

Coming Soon

high

high

high

high

high

high

high