CVE-2026-77831
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
Summary
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.
Affected Software
| Vendor | Product | Version Range | Status |
|---|---|---|---|
| ash-project | ash_paper_trail | 0.1.1 < 0.7.0 | affected |
| ash-project | ash_paper_trail | 449cd2a93416853066378fa61c715e89f80dc854 < e781f5d8840b07d57db99f9a4728298837d7b3a8 | affected |
Weaknesses
- CWE-407: CWE-407 Inefficient Algorithmic Complexity
References
- https://github.com/ash-project/ash_paper_trail/security/advisories/GHSA-7c66-59m8-723c
- https://cna.erlef.org/cves/CVE-2026-77831.html
- https://osv.dev/vulnerability/EEF-CVE-2026-77831
- https://github.com/ash-project/ash_paper_trail/commit/e781f5d8840b07d57db99f9a4728298837d7b3a8
Feedback
Was this page helpful?
Glad to hear it! Please tell us how we can improve.
Sorry to hear that. Please tell us how we can improve.