# Chatter Attack: Resource Consumption Attack for Large Language Models

DevFeed: [Chatter Attack: Resource Consumption Attack for Large Language Models](<https://devfeed.tech/articles/chatter-attack-resource-consumption-attack-for-large-language-models-125349.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.11261>)

Author: Yibo Miao, Yichuan Cao, Xiao-Shan Gao, Yinpeng Dong

Published: 2026-11-10T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>), [arXiv: Cryptography and Security](<https://devfeed.tech/sources/arxiv-cryptography-and-security.md>), [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [LLM security](<https://devfeed.tech/topics/llm-security.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [LLM Techniques](<https://devfeed.tech/topics/llm-techniques.md>), [Hyperparameter optimization](<https://devfeed.tech/topics/hyperparameter-optimization.md>)

Tags: [adversarial](<https://devfeed.tech/tags/adversarial.md>), [attack](<https://devfeed.tech/tags/attack.md>), [autoregressive](<https://devfeed.tech/tags/autoregressive.md>), [bayesian](<https://devfeed.tech/tags/bayesian.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cr](<https://devfeed.tech/tags/cs-cr.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [entropy](<https://devfeed.tech/tags/entropy.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [kernel](<https://devfeed.tech/tags/kernel.md>), [large-language-models](<https://devfeed.tech/tags/large-language-models.md>), [latency](<https://devfeed.tech/tags/latency.md>), [llm](<https://devfeed.tech/tags/llm.md>), [llm-inference](<https://devfeed.tech/tags/llm-inference.md>), [llms](<https://devfeed.tech/tags/llms.md>), [malicious](<https://devfeed.tech/tags/malicious.md>), [math-oc](<https://devfeed.tech/tags/math-oc.md>), [optimize](<https://devfeed.tech/tags/optimize.md>), [practical](<https://devfeed.tech/tags/practical.md>), [prompt](<https://devfeed.tech/tags/prompt.md>), [prompt-optimization](<https://devfeed.tech/tags/prompt-optimization.md>), [resource](<https://devfeed.tech/tags/resource.md>), [responses](<https://devfeed.tech/tags/responses.md>), [search](<https://devfeed.tech/tags/search.md>)

## AI overview

Chatter Attack aims to increase LLM inference cost by making models generate unusually long responses. Instead of optimizing for long outputs directly, it prompts models toward short doubt-inducing phrases, then uses inference attention loss and global entropy loss to sustain self-doubt during generation. For black-box settings, the authors propose Bayesian Prompt Optimization, which uses a discrete token kernel and prior information to explore the prompt search space. They report outperforming baselines across multiple models and datasets, with response lengths increasing by up to 31.5x. The supplied abstract describes these results but does not provide experimental details.

## Source excerpt

arXiv:2611.11261v1 Announce Type: new Abstract: LLMs are powerful but incur substantial inference cost, which can be exploited by malicious users to induce overly long outputs, increasing latency and operational expense. Prior resource consumption attacks either coerce repetition or suppress the end-of-sequence token by lowering its logit value. However, with autoregressive, sampling-based generation, the search space grows exponentially with length and small deviations or unstable trajectories can derail optimization, limiting attack effectiveness and stability. To address this issue, we introduce Chatter Attack, a novel class of resource consumption attacks that optimize adversarial prompts to induce predefined short target phrases, thereby avoiding search-space explosion while still eliciting long responses. Specifically, Chatter Attack triggers self-doubt using short doubt-inducing phrases as the target, and sustains this state throughout generation via inference attention loss and global entropy loss. To extend to black-box settings, we further propose a novel Bayesian Prompt Optimization (BPO) method, which models the objective function globally by constructing a discrete token kernel, efficiently exploring the entire search space using prior information. Extensive experiments across multiple models and datasets show that our method outperforms baselines, with maximum response length increases to 31.5$\times$, and revealing practical resource-depletion risks for real-world LLM inference services.