Skip to content
Threat Brief

← All advisories

CVE-2026-77831

Low 2.1No known exploitationFix available

Algorithmic-complexity denial of service in AshPaperTrail full-diff list tracking

Record last updated

CVSS score

2.1

Low on a 0 to 10 scale

EPSS, chance of exploitation in 30 days

0.2%

Higher than 11% of scored CVEs. A prediction, not evidence.

CISA remediation deadline

None

Not in the KEV catalog

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.

Weakness: CWE-407

Patching and mitigation

Patch status
Fix available (source: CVE record (EEF))
Fix documented (source date)
Mitigation
None documented
Vendor guidance
github.com (opens in a new tab)

Affected products

VendorProductAffected versionsFixed inPer
ash-projectash_paper_trailfrom 0.1.1 before 0.7.00.7.0CVE Program
ash-projectash_paper_trailfrom 449cd2a93416853066378fa61c715e89f80dc854 before e781f5d8840b07d57db99f9a4728298837d7b3a8e781f5d8840b07d57db99f9a4728298837d7b3a8CVE Program

Timeline

  1. Disclosure

    CVE record published by EEF

    Source: CVE Program (opens in a new tab)

  2. Patch

    Fix documented by CVE record (EEF)

    Source: CVE record (EEF) (opens in a new tab)

Vendor guidance and references