PT-2026-83631 · Unknown · Ash Graphql

·

CVE-2026-81636

·

Published

2026-08-30

·

Updated

2026-09-01

CVSS v4.0

8.7

High

VectorAV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N
Name of the Vulnerable Software and Affected Versions ash graphql versions 0.16.23 through 1.10.9
Description An unauthenticated client can bypass the configured GraphQL query-complexity limit to force an unbounded database read. This occurs because the query complexity/3 function in AshGraphql.Graphql.Resolver only multiplies child complexity by the requested page size when the argument map contains :limit (used in offset pagination). Relay connections and keyset pagination utilize first and last arguments, which do not match that specific clause and instead trigger a catch-all that returns child complexity + 1. Consequently, a nested relay query can be perceived as low-complexity while causing a full fan-out during materialization, bypassing the max complexity cap in Absinthe.
Recommendations Update ash graphql to version 1.11.0 or later.

Exploit

Fix

DoS

Allocation of Resources Without Limits

Found an issue in the description? Have something to add? Feel free to write us 👾

Weakness Enumeration

Related Identifiers

CVE-2026-81636
GHSA-MWC4-R9FC-H6MG

Affected Products

Ash Graphql