Description
t-digest versions 3.1 through 3.3 fail to validate centroid means during deserialization in MergingDigest.fromBytes, allowing attackers to inject NaN values that bypass validation checks. Attackers can craft malicious serialized digests containing NaN centroids that degrade sorting performance from O(n log n) to O(n squared), causing severe processing delays during merge operations.
Published: 2026-09-09
Score: 8.7 High
EPSS: n/a
KEV: No
Impact: n/a
Action: n/a
AI Analysis

Impact

t-digest version 3.1 through 3.3 includes a flaw in the MergingDigest.fromBytes method, which fails to validate centroid mean values when deserializing. Attackers can inject serialized digests with NaN centroids that bypass validation checks. When the merge operation processes a digest containing these NaN values, the internal sort routine degrades from O(n log n) to O(n^2), resulting in extreme processing delays that can exhaust CPU resources and bring the application to a halt.

Affected Systems

This vulnerability affects all installations of the t-digest library in the 3.1 to 3.3 range. The library is frequently used in Java applications that compute approximate histograms, quantiles, and streaming statistics, so any app that accepts externally supplied t-digest data is at risk. The issue is confined to the library’s deserialization logic; there is no known code execution path.

Risk and Exploitability

The CVSS score of 8.7 indicates high severity, and although an EPSS score is not available, the risk of exploitation remains significant. The attack requires the capability to supply a maliciously crafted serialized digest; in many scenarios this can be achieved remotely if the application exposes an API or file upload that accepts t-digest objects. The denial of service is achieved purely through resource exhaustion, without needing authentication, making it a potent vector for distributed or automated attacks. The vulnerability is not currently listed in CISA’s KEV catalog, but the high impact warrants immediate attention.

Generated by OpenCVE AI on September 9, 2026 at 16:02 UTC.

Remediation

No vendor fix or workaround currently provided.

OpenCVE Recommended Actions

  • Upgrade the t-digest library to the latest stable release where the NaN centroid validation has been added (currently 3.4+).
  • If an upgrade is infeasible, implement explicit validation of centroid mean values during deserialization or reject any payload containing NaN before it is processed.
  • Deploy process or container resource limits; monitor CPU usage during merge operations and trigger a graceful restart or kill the offending process if it exceeds expected thresholds.

Generated by OpenCVE AI on September 9, 2026 at 16:02 UTC.

Tracking

Sign in to view the affected projects.

Advisories

No advisories yet.

History

Wed, 09 Sep 2026 14:45:00 +0000

Type Values Removed Values Added
Description t-digest versions 3.1 through 3.3 fail to validate centroid means during deserialization in MergingDigest.fromBytes, allowing attackers to inject NaN values that bypass validation checks. Attackers can craft malicious serialized digests containing NaN centroids that degrade sorting performance from O(n log n) to O(n squared), causing severe processing delays during merge operations.
Title t-digest 3.1 through 3.3 Denial of Service via NaN Centroid Means in MergingDigest.fromBytes
Weaknesses CWE-407
References
Metrics cvssV3_1

{'score': 7.5, 'vector': 'CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H'}

cvssV4_0

{'score': 8.7, 'vector': 'CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N'}


Subscriptions

No data.

cve-icon MITRE

Status: PUBLISHED

Assigner: VulnCheck

Published:

Updated: 2026-09-09T14:32:42.726Z

Reserved: 2026-09-09T10:32:34.110Z

Link: CVE-2026-87822

cve-icon Vulnrichment

No data.

cve-icon NVD

Status : Received

Published: 2026-09-09T15:17:27.427

Modified: 2026-09-09T15:17:27.427

Link: CVE-2026-87822

cve-icon Redhat

No data.

cve-icon OpenCVE Enrichment

Updated: 2026-09-09T16:15:01Z

Weaknesses
  • CWE-407

    Inefficient Algorithmic Complexity