Schema.TemplateLiteral compiles each Schema.String span to the lazy wildcard [\s\S]*? and decodes input by running the resulting regular expression against it. When a template has two or more Schema.String spans, for example:
Schema.TemplateLiteral(Schema.String, ":", Schema.String, ":", Schema.String, "X")
the regex contains several ambiguous wildcards. A non-matching input makes the backtracking engine try combinations across all of them, so matching time grows cubically with input length. A 5,000-character string of : characters blocks the event loop for about 15 seconds.
Applications that decode untrusted input with such a schema are affected. That includes Schema.decodeUnknown, Schema.decodeUnknownSync and Schema.is, and anything built on them, such as HttpApi request payloads and @effect/rpc payloads.
Fixed in effect@3.22.1 (#6761). Template literals whose spans are all Schema.String are now matched with a linear left-to-right scan instead of a regular expression.
If you can't upgrade, check the input length before the template literal runs. Adding Schema.maxLength with .pipe doesn't help, because the filter runs after the regex. Put the length check on the input side instead:
Schema.compose(Schema.String.pipe(Schema.maxLength(256)), MyTemplateLiteral)
Rejecting oversized request bodies before they reach the schema also works.
{
"cwe_ids": [
"CWE-1333"
],
"github_reviewed": true,
"github_reviewed_at": "2026-11-19T20:51:01Z",
"nvd_published_at": "2026-11-17T20:17:36Z",
"severity": "HIGH"
}