CVE-2026-77831
Inefficient Algorithmic Complexity vulnerability in ash-project …
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.
What to do now
- Check your exposureFind out whether the affected software runs anywhere in your environment, including systems of suppliers.
- UpdateInstall the version in which the vendor fixed the vulnerability. The references lead to the advisory.
- Set the orderSystems that can be reached from the internet come first, then the rest.
References
- cna.erlef.org/cves/CVE-2026-77831.html
- github.com/ash-project/ash_paper_trail/commit/e781f5d8840b07d57db99f9a4728298837d7b3a8
- github.com/ash-project/ash_paper_trail/security/advisories/GHSA-7c66-59m8-723c
- osv.dev/vulnerability/EEF-CVE-2026-77831
- github.com/ash-project/ash_paper_trail/commit/449cd2a93416853066378fa61c715e89f80dc854
- nvd.nist.gov/vuln/detail/CVE-2026-77831
- cve.org/CVERecord?id=CVE-2026-77831
Data: CVE list and the NVD. This product uses data from the NVD API but is not endorsed or certified by the NVD.