EEF-CVE-2026-77831
- Source
- https://cna.erlef.org/osv/EEF-CVE-2026-77831.html
- Import Source
- https://cna.erlef.org/osv/EEF-CVE-2026-77831.json
- JSON Data
- https://api.osv.dev/v1/vulns/EEF-CVE-2026-77831
- Aliases
-
- CVE-2026-77831
- GHSA-7c66-59m8-723c
- Published
- 2026-08-30T00:18:38Z
- Modified
- 2026-09-08T01:45:03Z
- Severity
-
- 2.1 (Low) CVSS_V4 - 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 CVSS Calculator
- Summary
- Algorithmic-complexity denial of service in AshPaperTrail full-diff list tracking
- Details
-
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.ListChangepairs each prior array element against the new list by rebuilding the remaining-elements accumulator withacc ++ [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.
Configurations
The resource must use full-diff change tracking (
change_tracking_mode :full_diff) and accept an array attribute with no effective maximum length, reached through a create or update action exposed to the input. - Database specific
{ "capec_ids": [ "CAPEC-130" ], "cpe_ids": [ "cpe:2.3:a:ash-project:ash_paper_trail:*:*:*:*:*:*:*:*" ], "cwe_ids": [ "CWE-407" ] }- References
- Credits
-
-
- Peter Ullrich - FINDER
-
- Peter Ullrich - REPORTER
-
- Zach Daniel / Ash Project - REMEDIATION_DEVELOPER
-
- Jonatan Männchen / EEF - COORDINATOR
-
Affected packages
Hex / ash_paper_trail
Package
- Name
- ash_paper_trail
- Purl
- pkg:hex/ash_paper_trail