<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The Impossibility of Fair LLMs · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2406.03198/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2406.03198/feed.xml" rel="self" type="application/rss+xml" /><item><title>The Impossibility of Fair LLMs — mentioned by wslh</title><link>https://news.ycombinator.com/item?id=42166323</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.03198:42166323</guid><pubDate>Sun, 17 Nov 2024 19:20:55 GMT</pubDate><description>&lt;p&gt;If I recall correctly, there is a proof or conjecture suggesting that it’s impossible to build an “LLM firewall” capable of protecting against all possible prompts—though I may be misremembering, just search for resources like this [1]. [1] https://arxiv.org/abs/2406.03198&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.03198/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CL</category></item></channel></rss>
