Skip to main content
VulnerabilityPublished

CVE-2026-133422: pydantic · Inefficient Algorithmic Complexity

Affects pydanticSource CVE Database V5

0
Compare

Not known to be exploited · CVSS 6.9 Medium · fixed in 2.14.2 : update pydantic when convenient.

Data as of 20 Nov 2026, 08:04 UTC

CVSS 4.0 base score
6.9Medium
How severe the flaw is on the 0–10 CVSS scale.

Thin evidence

One scorer or none
CVSS scores by source
CNA (Pydantic)CVSS 4.06.9
Patch
Available – fixed in 2.14.2
CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:L/SC:N/SI:N/SA:N

Exploitation evidence

  1. Disclosed: evidence found.

    CVE published 20 Nov 2026

  2. Detectable: no evidence on record.

    No public nuclei template indexed

  3. Weaponized: no evidence on record.

    No public exploit code indexed in Metasploit or Exploit-DB

  4. Exploited in the wild: no evidence on record.

    Not in CISA KEV and no source reports exploitation

  5. Observed by OffSeq Mirage: no evidence on record.

    No attack traffic recorded by OffSeq Mirage sensors

A missing step is not evidence of safety. Sources: cve.org (opens in a new tab), the Metasploit, Exploit-DB and nuclei-templates index as of 19 Nov 2026.

What to do

Affected software

ProductAffectedFixed in
pydanticpydanticAffected
  • >=1.9.0 <=1.10.26
Fixed in–
PyPIpydanticpkg:pypi/pydanticOther threatsAffected
  • >=1.9.0 <=1.10.26
Fixed in–

Check your own hosts for these packages with threat-finder (opens in a new tab), our free open-source scanner.

AI-suggested

Users should upgrade to Pydantic version 2.14.2 or later where the fix is implemented. For lists containing non-hashable types (e.g., models or dictionaries), it is recommended to use the max_items constraint to limit list size and mitigate performance degradation. No other specific mitigations are indicated.

Description

CVE-2026-133422 is a vulnerability in Pydantic V1 where validating untrusted lists with the unique_items=True constraint results in quadratic time complexity. This inefficiency can cause denial of service due to slow validation of large inputs. The issue affects versions from 1.9.0 up to and including 1.10.26. The problem was fixed in Pydantic V1 namespace in version 2.14.2 and later. The fix optimizes duplicate detection for lists of builtin scalar types but not for complex types like models or dictionaries, which remain quadratic in time complexity unless size is constrained. Pydantic V2 models are not affected.

References

Community reviews

Loading reviews…