Inefficient Algorithmic Complexity Affecting com.tdunning:t-digest package, versions [3.1,]
Threat Intelligence
The probability is the direct output of the EPSS model, and conveys an overall sense of the threat of exploitation in the wild. The percentile measures the EPSS probability relative to all known EPSS scores. Note: This data is updated daily, relying on the latest available EPSS model version. Check out the EPSS documentation for more details.
Do your applications use this vulnerable package?
In a few clicks we can analyze your entire application and see what components are vulnerable in your application, and suggest you quick fixes.
Test your applications- Snyk IDSNYK-JAVA-COMTDUNNING-19659413
- published10 Sept 2026
- disclosed9 Sept 2026
- creditYu Bao
Introduced: 9 Sep 2026
NewCVE-2026-87822 (opens in a new tab)How to fix?
There is no fixed version for com.tdunning:t-digest.
Overview
Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity through MergingDigest.fromBytes in core/src/main/java/com/tdunning/math/stats/MergingDigest.java. An attacker can trigger severe processing delays by supplying a crafted serialized digest containing NaN centroid means during deserialization. The invalid centroid values bypass validation and cause merge-related sorting to degrade from O(n log n) to O(n^2), slowing or stalling applications that ingest untrusted t-digest data.