cd /news/artificial-intelligence/a-conditional-no-hair-theorem-for-tr… · home › topics › artificial-intelligence › article
[ARTICLE · art-153572] src=aiflash.com ↗ pub= topic=artificial-intelligence verified=true sentiment=· neutral

A Conditional No-Hair Theorem for Transformers: How Language Models Forget Their Prompt

A new theoretical paper asks how much an autoregressive transformer retains of its prompt after generating t tokens, and reports a conditional no-hair theorem: when two different prompts are followed by the same continuation text, the distance d between their hidden states shrinks as generation proceeds. The work frames prompt influence as decaying with the number of generated tokens, so that differences attributable to the prompt alone diminish over the course of a continuation.

read1 min views1 publishedOct 20, 2026

We ask how much an autoregressive transformer retains of its prompt after generating t tokens. Consider two different prompts followed by the same continuation text, so that any difference in their hidden states comes from the prompt alone, and we find that the distance between their hidden states d

── more in #artificial-intelligence 4 stories · sorted by recency
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
→ Live at https://your-agent.zahid.host ✓
Get free account → Pricing
from €0/mo · no card required
LIVE [news/a-conditional-no-hai…] indexed:0 read:1min 2026-10-20 · —