Answer in brief
CVE-2026-81636 records a Unknown severity vulnerability in Query-complexity limit bypass via first/last pagination arguments in AshGraphql enables denial of service. The current sources do not mark it as known exploited. The current feed maps ash-project/ash_graphql (generic), ash-project/ash_graphql (generic). Check affected ranges and fixed versions before updating.
Analysis pending evidence review
HOL Guard separates source facts from reviewed analysis. See the methodology.
A CVSS score is not reported in the current record. The current sources do not mark it as known exploited. Treat this as a source-backed prioritization signal, not a statement about your environment.
Analysis status
Analysis pending evidence review
Factual feed record only; HOL analysis is not approved for indexing. Read the methodology.
The current feed maps ash-project/ash_graphql (generic), ash-project/ash_graphql (generic). Check affected ranges and fixed versions before updating.
| Package | Affected range | Fixed version |
|---|---|---|
| ash-project/ash_graphqlgeneric | >=0.16.23 <1.11.0 | 1.11.0 |
| ash-project/ash_graphqlgeneric | >=d8a3e1b15587180ad9cb3ceeb398863d086c163b <c3229f6a65cbabb32fd7ffcac881922d1b3b30ad | c3229f6a65cbabb32fd7ffcac881922d1b3b30ad |
Published upstream
Aug 30, 2026
Evidence: source:cvelist:source_dates:source-dates:recordSource modified
Aug 30, 2026
Evidence: source:cvelist:source_dates:source-dates:recordFirst seen by HOL
Aug 30, 2026
Allocation of Resources Without Limits or Throttling vulnerability in ash-project ash_graphql allows an unauthenticated client to bypass the configured GraphQL query-complexity limit and force an unbounded database read. AshGraphql.Graphql.Resolver.query_complexity/3 multiplies child complexity by the requested page size only when the argument map contains :limit (offset pagination). Relay connections and keyset pagination use first and last, which never match that clause and fall through to the catch-all that returns child_complexity + 1. A nested relay query such as posts(first: 500) { edges { node { comments(first: 500) { ... } } } } therefore scores as trivially cheap while materializing the full fan-out, passing an Absinthe max_complexity cap that rejects the equivalent limit-based query. The fix adds first and last clauses clamped to the action's page size. This issue affects ash_graphql: from 0.16.23 before 1.11.0.
Quoted source text, attributed separately from HOL analysis.