CVE-2026-65623Disclosure

LOWCVSS 8.7 · HIGH

Exploit discussion active in current signal (2 latest mentions)

Immediate actions

  • Patch affected systems immediately
  • Hunt for exploitation attempts and persistence artifacts
  • Increase monitoring for publicly documented tradecraft

Recommended action window: High priority (within 72h)

NVD description

Inefficient Algorithmic Complexity vulnerability in mtrudel bandit allows unauthenticated remote denial of service via CPU exhaustion during WebSocket fragment reassembly. The size guard 'Elixir.Bandit.WebSocket.Connection':oversize_message?/2 called from handle_frame/3 in lib/bandit/websocket/connection.ex appends each non-final continuation frame to a left-nested iolist and then re-measures the entire accumulated buffer with IO.iodata_length/1 on every frame. Because the buffer grows by one element per frame and is fully re-traversed each time, reassembly work is quadratic (O(n^2)) in the number of continuation frames. The max_fragmented_message_size limit (default 8 MB) bounds total bytes but not frame count, and each frame can carry as little as one payload byte, so an attacker can send millions of tiny continuation frames using modest bandwidth to pin a CPU core for minutes to hours. Many concurrent connections can starve the whole server of CPU, denying service to legitimate users. The WebSocket read timeout does not help, because it is an idle timeout evaluated between reads and cannot preempt the synchronous reassembly work spent inside a single callback. This issue affects bandit: from 1.11.0 before 1.12.1.

2.0/ 10 priority

Sources & remediation

Weakness type (CWE)
CWE-407

Priority

LOW

Exploitation

NONE

PoC

YES

Patch

AVAILABLE

Momentum

NONE

Threat summary

  • Public PoC is present in monitored signal
  • Patch or workaround signal is available
  • 2 mentions across 1 observed day

What's happening

  • PoC mentioned or linked in 1 signal
  • Patch or workaround mentioned in 1 signal
  • Technical details provided in 2 signals
  • Disclosure: 1 classified signal
  • 2 total mentions across 1 day

Deep dive

Activity timeline2 mentions / 1d
01122Mentions · 2026-07-24: 2PoC Mentioned / Linked · 2026-07-24: 1Patch / Workaround · 2026-07-24: 1Technical Details · 2026-07-24: 207-24
Signal classification2 categories
Disclosure
150.0%
Patch
150.0%
Referenced assets2 URLs
Full discourse2 posts
  • Upwind Security MDR@UpwindMDR
    Patch

    🚨High - Bandit WebSocket Reassembly Quadratic-Complexity DoS (CVE-2026-65623) Bandit, the pure-Elixir web server used by default in Phoenix, reassembles fragmented WebSocket messages inefficiently. Its oversize_message?/2 guard appends each continuation frame to a left-nested iolist and re-measures the whole buffer with IO.iodata_length/1 on every frame, making reassembly O(n^2) in frame count. The max_fragmented_message_size limit bounds total bytes but not frame count, and each frame can carry a single byte, so an unauthenticated attacker can send millions of tiny continuation frames over modest bandwidth to pin a CPU core for minutes to hours. Many connections starve the whole server; the read timeout can't preempt the work inside one callback. CVSS 8.7, public PoC. 👉Upgrade Bandit to 1.12.1.

    Post summary

    A high‑severity Denial‑of‑Service flaw in Bandit’s WebSocket reassembly is publicly demonstrable; upgrading to version 1.12.1 mitigates the issue.

    0000084
    254 followersView on X
  • Vulmon Vulnerability Feed@VulmonFeeds
    Disclosure

    CVE-2026-65623 Denial of Service via Inefficient Algorithmic Complexity in Bandi... https://vulmon.com/vulnerabilitydetails?qid=CVE-2026-65623 Customizable Vulnerability Alerts: https://alerts.vulmon.com/?utm_source=twitter&utm_medium=social&utm_campaign=2102281&utm_content=4

    Post summary

    A new CVE-2026-65623 is disclosed as a denial‑of‑service vulnerability involving inefficient algorithmic complexity, with basic details available via a Vulmon link.

    00000104
    4.1K followersView on X

Explore more