Quadratic complexity in node ID cache clearing
Published Dec 3, 2025 · Updated Oct 23, 2026 · Also known as BIT-python-2025-12084, BIT-python-min-2025-12084, PSF-2025-16
Original summary
Normalized public record · Updated Oct 23, 2026
Quadratic complexity in node ID cache clearing
Publisher and source text is retained separately from QFinch interpretation.
QFinch assessment
When building nested elements using xml.dom.minidom methods such as appendChild() that have a dependency on _clear_id_cache() the algorithm is quadratic. Availability can be impacted when building excessively nested documents.
Evidence: public source recordsAffected products
| Affected package, product or range | Fix status |
|---|---|
| Consult the referenced vendor advisory for affected versions. | Consult source advisory |
Matching a version is only one part of assessing exposure. QFinch has not assessed your environment on this public page.
Remediation
Apply the vendor-supported fixed release or mitigation, then verify the affected component is no longer reachable.
- Confirm the affected product and reachable code path exist in your environment.
- Apply the vendor-supported patch or mitigation from the primary advisory.
- Rescan the exact deployed revision and retain verification evidence.
Evidence coverage
- SSVC priority
- LOW
- Confidence
- Not available
- Aliases
- BIT-python-2025-12084, BIT-python-min-2025-12084, PSF-2025-16, BIT-libpython-2025-12084
Scores appear only when corresponding evidence exists. Missing data is never interpreted as zero risk.
Sources and record history
- GitHub advisory ↗
- Source repository ↗
- Patch commit ↗
- Patch commit ↗
- Patch commit ↗
- Patch commit ↗
- Patch commit ↗
- Patch commit ↗
- Patch commit ↗
- Patch commit ↗
- Patch commit ↗
- Patch commit ↗
Record history
Published Dec 3, 2025 · Last refreshed Oct 23, 2026