golang.org/x/net/html: Inefficient Algorithmic Complexity
CVE-2026-78661 is a high-severity inefficient algorithmic complexity vulnerability in golang.org/x/net/html from Golang.org/x/net, with a CVSS 3.1 base score of 7.5 out of 10. It can be exploited remotely over the network by an unauthenticated attacker, without any action from a user. The record lists version 0.62.0 as the first without the flaw, so updating golang.org/x/net/html to that release or later removes the exposure. There is no confirmed exploitation so far. EPSS estimates a 0.41% chance of exploitation within 30 days, which is low compared with other CVEs.
High severity with no evidence of exploitation so far.
What to do
- Update golang.org/x/net/html to 0.62.0 or a later version.
- Until you can update, restrict network access to the affected service so it is not reachable from untrusted networks.
Affected products and versions
| Vendor | Product | Affected versions | Fixed in |
|---|---|---|---|
| Golang.org/x/net | golang.org/x/net/html | before 0.62.0 | 0.62.0 |
Version data comes from the organisation that assigned the CVE. Confirm against the vendor advisory before deciding you are unaffected.
How the severity score breaks down
- Attack vector
- NetworkCan be exploited remotely over a network, including the internet.
- Attack complexity
- LowNo special conditions are needed; the attack works reliably.
- Privileges required
- NoneNo account or login is needed.
- User interaction
- NoneNo action by a victim is required.
- Scope
- UnchangedImpact stays within the vulnerable component.
- Confidentiality
- HighAll data handled by the component can be read.
- Integrity
- NoneNothing can be modified.
- Availability
- NoneAvailability is not affected.
Vector: CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:H/I:N/A:N. Scored by CISA (ADP).
Official description
When coalescing adjacent text nodes in addText and fosterParent, appending to an existing TextNode's Data via string concatenation (n.Data += text) reallocated and copied the accumulated string on every token. Inputs containing many short text runs separated by ignored end tags (such as "a</x>") caused O(n^2) allocations and byte copies. Accumulate coalesced text in per-node byte slices during parsing and materialize Data strings once at the end of parse.
Source: the CVE record as published by its numbering authority, via NVD and CVE.org.
The underlying weakness: Inefficient Algorithmic Complexity
An algorithm in a product has an inefficient worst-case computational complexity that may be detrimental to system performance and can be triggered by an attacker, typically using crafted manipulations that ensure that the worst case is being reached.
More Inefficient Algorithmic Complexity vulnerabilities (CWE-407)
Timeline
- CVE record published.
- CISA published its SSVC assessment (exploitation: none, automatable: yes, technical impact: partial).
- Record last changed materially (score, affected products, status or references).
References
Other references
Recent Inefficient Algorithmic Complexity vulnerabilities
- 7.5 High severity
- 7.5 High severity
- 7.5 High severity
- 8.7 High severity
- 8.7 High severity
- 8.7 High severity
Spotted an error? Tell us.