CVE-2026-77831
Algorithmic-complexity denial of service in AshPaperTrail full-diff list tracking
- State
- Published
- Severity
- 2.1 Low
- Published
- Aug 30, 2026
- Updated
- Aug 31, 2026
- Reserved
- Aug 27, 2026
Description
Inefficient Algorithmic Complexity vulnerability in ash-project ash_paper_trail allows a user who can submit a large array attribute to a paper-trailed create or update action to cause a denial of service through excessive CPU and memory use.
With full-diff change tracking, AshPaperTrail.ChangeBuilders.FullDiff.ListChange pairs each prior array element against the new list by rebuilding the remaining-elements accumulator with acc ++ [tuple] on every step, copying the growing list each time, so the pairing scales cubically in the array length. Nothing bounds the length and the value comes straight from action input, so one request carrying a large accepted {:array, _} attribute forces tens of seconds of CPU and multi-gigabyte allocations.
This issue affects ash_paper_trail: from 0.1.1 before 0.7.0.
Scores
| CVSS | Score | Vector | Source |
|---|---|---|---|
| 4.0 | 2.1 Low | CVSS:4.0/AV:L/AC:L/AT:P/PR:N/UI:N/VC:N/VI:N/VA:L/SC:N/SI:N/SA:N | EEF |
Weaknesses
- CWE-407 Inefficient Algorithmic Complexity
Affected Products
| Product | Versions |
|---|---|
ash_paper_trailash-project |
|
ash_paper_trailash-project |
|
References
- https://github.com/ash-project/ash_paper_trail/security/advisories/GHSA-7c66-59m8-723cvendor-advisoryrelated
- https://cna.erlef.org/cves/CVE-2026-77831.htmlrelated
- https://osv.dev/vulnerability/EEF-CVE-2026-77831related
- https://github.com/ash-project/ash_paper_trail/commit/e781f5d8840b07d57db99f9a4728298837d7b3a8patch
Every record here comes from the CVE Program’s CVE List. © 1999–2026 The MITRE Corporation. CVE is a registered trademark of The MITRE Corporation. The records are reproduced under the CVE Program terms of use.