CVE-2026-81636 (GCVE-0-2026-81636)
Vulnerability from cvelistv5 – Published: 2026-08-30 18:25 – Updated: 2026-08-30 18:25
VLAI
EPSS
VEX
Title
Query-complexity limit bypass via first/last pagination arguments in AshGraphql enables denial of service
Summary
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.
Severity
CWE
- CWE-770 - Allocation of Resources Without Limits or Throttling
Assigner
References
4 references
| URL | Tags |
|---|---|
| https://github.com/ash-project/ash_graphql/securi… | vendor-advisoryrelated |
| https://cna.erlef.org/cves/CVE-2026-81636.html | related |
| https://osv.dev/vulnerability/EEF-CVE-2026-81636 | related |
| https://github.com/ash-project/ash_graphql/commit… | patch |
Impacted products
2 products
| Vendor | Product | Version | CPE status | |
|---|---|---|---|---|
| ash-project | ash_graphql |
Affected:
0.16.23 , < 1.11.0
(semver)
cpe:2.3:a:ash-project:ash_graphql:*:*:*:*:*:*:*:* |
||
| ash-project | ash_graphql |
Affected:
d8a3e1b15587180ad9cb3ceeb398863d086c163b , < c3229f6a65cbabb32fd7ffcac881922d1b3b30ad
(git)
cpe:2.3:a:ash-project:ash_graphql:*:*:*:*:*:*:*:* |
{
"containers": {
"cna": {
"affected": [
{
"collectionURL": "https://repo.hex.pm",
"cpes": [
"cpe:2.3:a:ash-project:ash_graphql:*:*:*:*:*:*:*:*"
],
"defaultStatus": "unaffected",
"modules": [
"\u0027Elixir.AshGraphql.Graphql.Resolver\u0027"
],
"packageName": "ash_graphql",
"packageURL": "pkg:hex/ash_graphql",
"product": "ash_graphql",
"programFiles": [
"lib/graphql/resolver.ex"
],
"programRoutines": [
{
"name": "\u0027Elixir.AshGraphql.Graphql.Resolver\u0027:query_complexity/3"
}
],
"repo": "https://github.com/ash-project/ash_graphql",
"vendor": "ash-project",
"versions": [
{
"lessThan": "1.11.0",
"status": "affected",
"version": "0.16.23",
"versionType": "semver"
}
]
},
{
"collectionURL": "https://github.com",
"cpes": [
"cpe:2.3:a:ash-project:ash_graphql:*:*:*:*:*:*:*:*"
],
"defaultStatus": "unaffected",
"modules": [
"\u0027Elixir.AshGraphql.Graphql.Resolver\u0027"
],
"packageName": "ash-project/ash_graphql",
"packageURL": "pkg:github/ash-project/ash_graphql",
"product": "ash_graphql",
"programFiles": [
"lib/graphql/resolver.ex"
],
"programRoutines": [
{
"name": "\u0027Elixir.AshGraphql.Graphql.Resolver\u0027:query_complexity/3"
}
],
"repo": "https://github.com/ash-project/ash_graphql",
"vendor": "ash-project",
"versions": [
{
"lessThan": "c3229f6a65cbabb32fd7ffcac881922d1b3b30ad",
"status": "affected",
"version": "d8a3e1b15587180ad9cb3ceeb398863d086c163b",
"versionType": "git"
}
]
}
],
"cpeApplicability": [
{
"nodes": [
{
"cpeMatch": [
{
"criteria": "cpe:2.3:a:ash-project:ash_graphql:*:*:*:*:*:*:*:*",
"versionEndExcluding": "1.11.0",
"versionStartIncluding": "0.16.23",
"vulnerable": true
}
],
"negate": false,
"operator": "OR"
}
],
"operator": "AND"
}
],
"credits": [
{
"lang": "en",
"type": "finder",
"value": "Peter Ullrich"
},
{
"lang": "en",
"type": "reporter",
"value": "Peter Ullrich"
},
{
"lang": "en",
"type": "remediation developer",
"value": "Zach Daniel / Ash Project"
},
{
"lang": "en",
"type": "coordinator",
"value": "Jonatan M\u00e4nnchen / EEF"
}
],
"descriptions": [
{
"lang": "en",
"supportingMedia": [
{
"base64": false,
"type": "text/html",
"value": "\u003cp\u003eAllocation 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.\u003c/p\u003e\n\u003cp\u003e\u003ccode\u003eAshGraphql.Graphql.Resolver.query_complexity/3\u003c/code\u003e multiplies child complexity by the requested page size only when the argument map contains \u003ccode\u003e:limit\u003c/code\u003e (offset pagination). Relay connections and keyset pagination use \u003ccode\u003efirst\u003c/code\u003e and \u003ccode\u003elast\u003c/code\u003e, which never match that clause and fall through to the catch-all that returns \u003ccode\u003echild_complexity + 1\u003c/code\u003e. A nested relay query such as \u003ccode\u003eposts(first: 500) { edges { node { comments(first: 500) { ... } } } }\u003c/code\u003e therefore scores as trivially cheap while materializing the full fan-out, passing an Absinthe \u003ccode\u003emax_complexity\u003c/code\u003e cap that rejects the equivalent \u003ccode\u003elimit\u003c/code\u003e-based query. The fix adds \u003ccode\u003efirst\u003c/code\u003e and \u003ccode\u003elast\u003c/code\u003e clauses clamped to the action\u0027s page size.\u003c/p\u003e\n\u003cp\u003eThis issue affects ash_graphql: from 0.16.23 before 1.11.0.\u003c/p\u003e"
},
{
"base64": false,
"type": "text/markdown",
"value": "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.\n\n`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\u0027s page size.\n\nThis issue affects ash_graphql: from 0.16.23 before 1.11.0."
}
],
"value": "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.\n\nAshGraphql.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\u0027s page size.\n\nThis issue affects ash_graphql: from 0.16.23 before 1.11.0."
}
],
"impacts": [
{
"capecId": "CAPEC-130",
"descriptions": [
{
"lang": "en",
"value": "CAPEC-130 Excessive Allocation"
}
]
}
],
"metrics": [
{
"cvssV4_0": {
"Automatable": "NOT_DEFINED",
"Recovery": "NOT_DEFINED",
"Safety": "NOT_DEFINED",
"attackComplexity": "LOW",
"attackRequirements": "NONE",
"attackVector": "NETWORK",
"baseScore": 8.7,
"baseSeverity": "HIGH",
"privilegesRequired": "NONE",
"providerUrgency": "NOT_DEFINED",
"subAvailabilityImpact": "NONE",
"subConfidentialityImpact": "NONE",
"subIntegrityImpact": "NONE",
"userInteraction": "NONE",
"valueDensity": "NOT_DEFINED",
"vectorString": "CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N",
"version": "4.0",
"vulnAvailabilityImpact": "HIGH",
"vulnConfidentialityImpact": "NONE",
"vulnIntegrityImpact": "NONE",
"vulnerabilityResponseEffort": "NOT_DEFINED"
},
"format": "CVSS",
"scenarios": [
{
"lang": "en",
"value": "GENERAL"
}
]
}
],
"problemTypes": [
{
"descriptions": [
{
"cweId": "CWE-770",
"description": "CWE-770 Allocation of Resources Without Limits or Throttling",
"lang": "en",
"type": "CWE"
}
]
}
],
"providerMetadata": {
"dateUpdated": "2026-08-30T18:25:29.776Z",
"orgId": "6b3ad84c-e1a6-4bf7-a703-f496b71e49db",
"shortName": "EEF"
},
"references": [
{
"tags": [
"vendor-advisory",
"related"
],
"url": "https://github.com/ash-project/ash_graphql/security/advisories/GHSA-mwc4-r9fc-h6mg"
},
{
"tags": [
"related"
],
"url": "https://cna.erlef.org/cves/CVE-2026-81636.html"
},
{
"tags": [
"related"
],
"url": "https://osv.dev/vulnerability/EEF-CVE-2026-81636"
},
{
"tags": [
"patch"
],
"url": "https://github.com/ash-project/ash_graphql/commit/c3229f6a65cbabb32fd7ffcac881922d1b3b30ad"
}
],
"source": {
"discovery": "EXTERNAL"
},
"title": "Query-complexity limit bypass via first/last pagination arguments in AshGraphql enables denial of service"
}
},
"cveMetadata": {
"assignerOrgId": "6b3ad84c-e1a6-4bf7-a703-f496b71e49db",
"assignerShortName": "EEF",
"cveId": "CVE-2026-81636",
"datePublished": "2026-08-30T18:25:29.776Z",
"dateReserved": "2026-08-30T02:00:02.143Z",
"dateUpdated": "2026-08-30T18:25:29.776Z",
"state": "PUBLISHED"
},
"dataType": "CVE_RECORD",
"dataVersion": "5.2",
"vulnerability-lookup:meta": {
"nvd": "{\"cve\":{\"id\":\"CVE-2026-81636\",\"sourceIdentifier\":\"6b3ad84c-e1a6-4bf7-a703-f496b71e49db\",\"published\":\"2026-08-30T19:17:29.543\",\"lastModified\":\"2026-08-30T19:17:29.543\",\"vulnStatus\":\"Received\",\"cveTags\":[],\"descriptions\":[{\"lang\":\"en\",\"value\":\"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.\\n\\nAshGraphql.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\u0027s page size.\\n\\nThis issue affects ash_graphql: from 0.16.23 before 1.11.0.\"}],\"affected\":[{\"source\":\"6b3ad84c-e1a6-4bf7-a703-f496b71e49db\",\"affectedData\":[{\"vendor\":\"ash-project\",\"product\":\"ash_graphql\",\"defaultStatus\":\"unaffected\",\"collectionURL\":\"https://repo.hex.pm\",\"packageName\":\"ash_graphql\",\"cpes\":[\"cpe:2.3:a:ash-project:ash_graphql:*:*:*:*:*:*:*:*\"],\"modules\":[\"\u0027Elixir.AshGraphql.Graphql.Resolver\u0027\"],\"programFiles\":[\"lib/graphql/resolver.ex\"],\"programRoutines\":[{\"name\":\"\u0027Elixir.AshGraphql.Graphql.Resolver\u0027:query_complexity/3\"}],\"repo\":\"https://github.com/ash-project/ash_graphql\",\"packageURL\":\"pkg:hex/ash_graphql\",\"versions\":[{\"version\":\"0.16.23\",\"lessThan\":\"1.11.0\",\"versionType\":\"semver\",\"status\":\"affected\"}]},{\"vendor\":\"ash-project\",\"product\":\"ash_graphql\",\"defaultStatus\":\"unaffected\",\"collectionURL\":\"https://github.com\",\"packageName\":\"ash-project/ash_graphql\",\"cpes\":[\"cpe:2.3:a:ash-project:ash_graphql:*:*:*:*:*:*:*:*\"],\"modules\":[\"\u0027Elixir.AshGraphql.Graphql.Resolver\u0027\"],\"programFiles\":[\"lib/graphql/resolver.ex\"],\"programRoutines\":[{\"name\":\"\u0027Elixir.AshGraphql.Graphql.Resolver\u0027:query_complexity/3\"}],\"repo\":\"https://github.com/ash-project/ash_graphql\",\"packageURL\":\"pkg:github/ash-project/ash_graphql\",\"versions\":[{\"version\":\"d8a3e1b15587180ad9cb3ceeb398863d086c163b\",\"lessThan\":\"c3229f6a65cbabb32fd7ffcac881922d1b3b30ad\",\"versionType\":\"git\",\"status\":\"affected\"}]}]}],\"metrics\":{\"cvssMetricV40\":[{\"source\":\"6b3ad84c-e1a6-4bf7-a703-f496b71e49db\",\"type\":\"Secondary\",\"cvssData\":{\"version\":\"4.0\",\"vectorString\":\"CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N/E:X/CR:X/IR:X/AR:X/MAV:X/MAC:X/MAT:X/MPR:X/MUI:X/MVC:X/MVI:X/MVA:X/MSC:X/MSI:X/MSA:X/S:X/AU:X/R:X/V:X/RE:X/U:X\",\"baseScore\":8.7,\"baseSeverity\":\"HIGH\",\"attackVector\":\"NETWORK\",\"attackComplexity\":\"LOW\",\"attackRequirements\":\"NONE\",\"privilegesRequired\":\"NONE\",\"userInteraction\":\"NONE\",\"vulnConfidentialityImpact\":\"NONE\",\"vulnIntegrityImpact\":\"NONE\",\"vulnAvailabilityImpact\":\"HIGH\",\"subConfidentialityImpact\":\"NONE\",\"subIntegrityImpact\":\"NONE\",\"subAvailabilityImpact\":\"NONE\",\"exploitMaturity\":\"NOT_DEFINED\",\"confidentialityRequirement\":\"NOT_DEFINED\",\"integrityRequirement\":\"NOT_DEFINED\",\"availabilityRequirement\":\"NOT_DEFINED\",\"modifiedAttackVector\":\"NOT_DEFINED\",\"modifiedAttackComplexity\":\"NOT_DEFINED\",\"modifiedAttackRequirements\":\"NOT_DEFINED\",\"modifiedPrivilegesRequired\":\"NOT_DEFINED\",\"modifiedUserInteraction\":\"NOT_DEFINED\",\"modifiedVulnConfidentialityImpact\":\"NOT_DEFINED\",\"modifiedVulnIntegrityImpact\":\"NOT_DEFINED\",\"modifiedVulnAvailabilityImpact\":\"NOT_DEFINED\",\"modifiedSubConfidentialityImpact\":\"NOT_DEFINED\",\"modifiedSubIntegrityImpact\":\"NOT_DEFINED\",\"modifiedSubAvailabilityImpact\":\"NOT_DEFINED\",\"Safety\":\"NOT_DEFINED\",\"Automatable\":\"NOT_DEFINED\",\"Recovery\":\"NOT_DEFINED\",\"valueDensity\":\"NOT_DEFINED\",\"vulnerabilityResponseEffort\":\"NOT_DEFINED\",\"providerUrgency\":\"NOT_DEFINED\"}}]},\"weaknesses\":[{\"source\":\"6b3ad84c-e1a6-4bf7-a703-f496b71e49db\",\"type\":\"Secondary\",\"description\":[{\"lang\":\"en\",\"value\":\"CWE-770\"}]}],\"references\":[{\"url\":\"https://cna.erlef.org/cves/CVE-2026-81636.html\",\"source\":\"6b3ad84c-e1a6-4bf7-a703-f496b71e49db\"},{\"url\":\"https://github.com/ash-project/ash_graphql/commit/c3229f6a65cbabb32fd7ffcac881922d1b3b30ad\",\"source\":\"6b3ad84c-e1a6-4bf7-a703-f496b71e49db\"},{\"url\":\"https://github.com/ash-project/ash_graphql/security/advisories/GHSA-mwc4-r9fc-h6mg\",\"source\":\"6b3ad84c-e1a6-4bf7-a703-f496b71e49db\"},{\"url\":\"https://osv.dev/vulnerability/EEF-CVE-2026-81636\",\"source\":\"6b3ad84c-e1a6-4bf7-a703-f496b71e49db\"}]}}"
}
}
Loading…
Loading…
Experimental. This forecast is provided for visualization only and may change without notice. Do not use it for operational decisions.
Forecast uses a logistic model when the trend is rising, or an exponential decay model when the trend is falling. Fitted via linearized least squares.
Sightings
| Author | Source | Type | Date | Other |
|---|
Nomenclature
- Seen: The vulnerability was mentioned, discussed, or observed by the user.
- Confirmed: The vulnerability has been validated from an analyst's perspective.
- Published Proof of Concept: A public proof of concept is available for this vulnerability.
- Exploited: The vulnerability was observed as exploited by the user who reported the sighting.
- Patched: The vulnerability was observed as successfully patched by the user who reported the sighting.
- Not exploited: The vulnerability was not observed as exploited by the user who reported the sighting.
- Not confirmed: The user expressed doubt about the validity of the vulnerability.
- Not patched: The vulnerability was not observed as successfully patched by the user who reported the sighting.
Loading…
The MITRE ATT&CK techniques below are AI-generated suggestions, inferred from the description of the
vulnerability by the CIRCL/vulnerability-attack-technique-classification-roberta-base
model, served locally by ML-Gateway.
They have not been verified by an analyst and are provided for guidance only.
The approach is described in our paper Mapping CVEs to MITRE ATT&CK Techniques: A Curated Gold-Set Classifier and the Limits of LLM-Assisted Label Expansion.
The approach is described in our paper Mapping CVEs to MITRE ATT&CK Techniques: A Curated Gold-Set Classifier and the Limits of LLM-Assisted Label Expansion.
Loading…
Loading…