---
id: "CVE-2026-113811"
kind: "vulnerability"
aliases: ["CVE-2026-113811"]
title: "Perl Algorithm::UrataniTakeda: search cache grows without limit, exhausting memory"
severity: "low"
cvss: null
epss: 0.00229
exploited: false
status: "open"
category: "package"
products: []
ecosystems: []
tags: ["cpan", "package", "perl", "self-hosted"]
not_affected_if: ["fixed-version", "not-using-module", "short-lived-process"]
published_at: "2026-10-21T21:17:55+00:00"
first_seen_at: "2026-10-23T21:57:29+00:00"
updated_at: "2026-10-25T05:02:04+00:00"
sources: [{"source": "nvd", "url": "https://nvd.nist.gov/vuln/detail/CVE-2026-113811", "first_seen_at": "2026-10-23T21:57:29+00:00"}, {"source": "epss", "url": "https://api.first.org/data/v1/epss?cve=CVE-2026-113811", "first_seen_at": "2026-10-24T13:15:54+00:00"}]
---

# Perl Algorithm::UrataniTakeda: search cache grows without limit, exhausting memory

Algorithm::UrataniTakeda versions 0.1.5 before 0.1.7 keep a failure-shift cache in the matcher object that is never cleared. An attacker who submits text with many distinct characters to a long-lived matcher can make its memory grow with each search until it is exhausted.

_Summary, check and fix written by a model from the sources; labelled as such._

## How to check

- Run `cpanm --info Algorithm::UrataniTakeda` or `perl -MAlgorithm::UrataniTakeda -e 'print $Algorithm::UrataniTakeda::VERSION'` to read the installed version
- Search dependency manifests and lockfiles for `Algorithm::UrataniTakeda` to see whether it is pinned below `0.1.7`

## Fix

- Upgrade Algorithm::UrataniTakeda to `0.1.7` or later
- Where a matcher is long-lived, recreate it per request or restart the worker process periodically

## Timeline

- 2026-10-23T21:57:29+00:00 nvd https://nvd.nist.gov/vuln/detail/CVE-2026-113811
- 2026-10-24T13:15:54+00:00 epss https://api.first.org/data/v1/epss?cve=CVE-2026-113811

## From the sources

Algorithm::UrataniTakeda versions from 0.1.5 before 0.1.7 for Perl allow memory exhaustion via a never-cleared failure shift cache in search.

The failure shift is cached for each pair of trie state and text character in a field of the matcher object, and nothing clears it. A character not seen before at a given state adds an entry that lasts for the life of the matcher.

An attacker who can submit text with many distinct characters to a long-lived matcher can grow its memory with each search.

---

_Free to read at a human pace. An API with keys and an MCP server are in preparation; early access: hello@infrastack.ai_