<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: SonOfLilit</title><link>https://news.ycombinator.com/user?id=SonOfLilit</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Thu, 10 Sep 2026 06:10:16 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=SonOfLilit" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by SonOfLilit in "OpenAI and Hugging Face address security incident during model evaluation"]]></title><description><![CDATA[
<p>Huh? The wiktionary link I included links to (Failspy's message in) this 2024 discussion about how and when and why it was coined (by failspy): <a href="https://huggingface.co/posts/mlabonne/866788930457283#67196fde9585fc00069440c2" rel="nofollow">https://huggingface.co/posts/mlabonne/866788930457283#67196f...</a>, as well as another one.<p>To your question, I am not a bot, my LinkedIn is in my profile if you want to know who I am.<p>I'm persisting because, I guess, I'm really confused by your own insistence, and feel curious to get to the bottom of the weird misunderstanding we must be having (maybe you're trying to argue something different than "user chmod775 intended to refer to 'ablation' and was mistaken to write 'Just put "uncensored", "abliterated", or "heretic" into search on huggingface/ollama/etc and pick any them' instead of 'Just put "uncensored", "ablated", or "heretic" into search on huggingface/ollama/etc and pick any them'?). And I have a lot of free time on a climbing vacation where my brain is too mushy to do anything more productive than talk to people on the interblags.</p>
]]></description><pubDate>Sun, 26 Jul 2026 15:32:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=49059165</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=49059165</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49059165</guid></item><item><title><![CDATA[New comment by SonOfLilit in "OpenAI and Hugging Face address security incident during model evaluation"]]></title><description><![CDATA[
<p>Is there any evidence that would change your mind?<p>The wiki "ablation" article you yourself linked dedicates a section to explain "abliteration".<p>Googling <i>abliteration arxiv</i> yields at least one page of papers that mention it in the abstract (all but one in the title too). I counted 9 unique papers.<p>If it was shown that all of these were posted after this discussion started, or by people related to the person you tried to correct, I would be convinced that abliteration is not a real word. But evidence keeps pointing otherwise, nnd you keep arguing with evidence that proves "ablate" is a word (to which we all agree), not evedence that proves "abliterate" isn't.<p>You did show evidence that it's a pretty new word (of course it is! it's a pretty new technique in a field that didn't exist before the first open source RLHF'd models were released in '23!), and indeed, this (different) wiktionary page contains its origin story from '24: <a href="https://en.wiktionary.org/wiki/abliterate#English" rel="nofollow">https://en.wiktionary.org/wiki/abliterate#English</a></p>
]]></description><pubDate>Sat, 25 Jul 2026 18:23:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=49050182</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=49050182</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49050182</guid></item><item><title><![CDATA[New comment by SonOfLilit in "OpenAI and Hugging Face address security incident during model evaluation"]]></title><description><![CDATA[
<p>I wnt and read your other comments.<p>Except for the initial comment, they were aggressive and sometimes disrespectful claims that "the word is spelled ablation, here are some papers that use it" in response to people saying "yes, we know what ablation means, but GP is intentionally using a separate word 'abliteration' that is the accepted word for the kind of ablation he's talking about, see links to respectable sources using or defining it". I downvoted them because I feel the discussion would be more valuable and feel nicer to read without them, and you could just read any of the offered links before responding and save the trouble.</p>
]]></description><pubDate>Sat, 25 Jul 2026 08:10:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=49045554</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=49045554</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49045554</guid></item><item><title><![CDATA[New comment by SonOfLilit in "OpenAI and Hugging Face address security incident during model evaluation"]]></title><description><![CDATA[
<p><a href="https://github.com/NousResearch/llm-abliteration" rel="nofollow">https://github.com/NousResearch/llm-abliteration</a></p>
]]></description><pubDate>Wed, 22 Jul 2026 14:13:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=49007183</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=49007183</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49007183</guid></item><item><title><![CDATA[New comment by SonOfLilit in "Show HN: How to Get a Fable CoT for the Jacobian Conjecture Refutation"]]></title><description><![CDATA[
<p>I understand basic multivariate calculus (almost every STEM degree teaches it, and I paid attention), which is enough to understand the problem if not every detail about the solution, so I can partially follow what Fable is doing and guess whether it gets too sidetracked.<p>But the main loop was to show Fable the solution, ask it for a prompt that would get a clean context Fable to find a solution, run it, if it works ask the first Fable to remove details, if it doesn't quote a status report and ask it where the clean Fable went askew and to edit the prompt to prevent that.</p>
]]></description><pubDate>Tue, 21 Jul 2026 16:18:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=48994382</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=48994382</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48994382</guid></item><item><title><![CDATA[New comment by SonOfLilit in "Human mathematicians are being outcounterexampled"]]></title><description><![CDATA[
<p>The counterexample in the news cycle today helps better understand how the math works. I can't think of one that doesn't.</p>
]]></description><pubDate>Tue, 21 Jul 2026 09:52:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=48990140</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=48990140</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48990140</guid></item><item><title><![CDATA[Show HN: How to Get a Fable CoT for the Jacobian Conjecture Refutation]]></title><description><![CDATA[
<p>Since the publication of the Jacobian Conjecture refutation, many people have asked for a Chain of Thought to be published so they can better understand the mathematical intuition that leads to the counterexample.<p>Since none was published, I tried to "clean room reverse engineer" it: give one Claude Fable the result and ask it to generate a writeup of how to arrive at it without any spoilers, then ask a second Fable to follow the write up, if it's too easy remove details, if it's too hard add hints. I could have simplified further, I stopped because it's time to sleep, and I'm sharing because it gave me some intuition for what's going on.<p>This is what a successful run looks like (sadly Anthropic hide Chains of Thought):<p><a href="https://claude.ai/share/80526d56-1c23-407d-8f5c-59a704221454" rel="nofollow">https://claude.ai/share/80526d56-1c23-407d-8f5c-59a704221454</a><p>## Intuition<p>This is my understanding of the interesting ideas (probably too summarized for Fable to consistently get it without a good harness; take with a grain of salt, I'm not a mathematician; later there is a full prompt that was tested and contains everything needed):<p>* No Bass–Connell–Wright or Drużkowski normal forms (those are reparametrizations that feel natural in this search but they turn low-complexity examples into high-complexity by trading off degree vs dimension, and the counterexample is low complexity)<p>* Look in C^3, not C^2, C^2 is probably not interesting enough<p>* Look for a 3:1 cover, not 2:1, there's some result due to Euler (as always) that shows 2:1 will not work<p>* Look for a composition of two functions (a ratio of polynomials and a shear) that have Jacobian determinants `x` and `c/x` everywhere, except at `x=0` (do the standard trick for not defining at a hole and shoving all the problems into that one hole, that's where the `1 + xy` comes from)<p>## Prompt for reproducing CoT<p>Here: <a href="https://gist.github.com/SonOfLilit/8882a145048ba260b160568ba6f48093#prompt-for-reproducing-cot" rel="nofollow">https://gist.github.com/SonOfLilit/8882a145048ba260b160568ba...</a></p>
<hr>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48986943">https://news.ycombinator.com/item?id=48986943</a></p>
<p>Points: 7</p>
<p># Comments: 2</p>
]]></description><pubDate>Tue, 21 Jul 2026 01:10:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=48986943</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=48986943</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48986943</guid></item><item><title><![CDATA[New comment by SonOfLilit in "Self-Powered Trailers Promise Leaner Freight Runs"]]></title><description><![CDATA[
<p>I think many long-haul truckers work in pairs for this reason?</p>
]]></description><pubDate>Mon, 20 Jul 2026 11:41:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=48977391</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=48977391</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48977391</guid></item><item><title><![CDATA[New comment by SonOfLilit in "Claude Fable produced a counterexample to the Jacobian Conjecture"]]></title><description><![CDATA[
<p>By the CoT content, this is a screenshot of someone giving Fable the result and asking if it's true, not the CoT of discovery.<p>e.g. "maybe the user's example is DESIGNED to be "correct in the stated facts" &c"</p>
]]></description><pubDate>Mon, 20 Jul 2026 08:46:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=48975965</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=48975965</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48975965</guid></item><item><title><![CDATA[New comment by SonOfLilit in "Regressive JPEGs"]]></title><description><![CDATA[
<p>Yes. You could say this is the sound of silence.</p>
]]></description><pubDate>Sun, 19 Jul 2026 05:52:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=48965347</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=48965347</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48965347</guid></item><item><title><![CDATA[New comment by SonOfLilit in "Regressive JPEGs"]]></title><description><![CDATA[
<p>Apparently "onomatope" is a much less popular name for the same thing (e.g. Wikipedia uses my version).<p>I mean that the "remove a word" 'symbol' is a 'word' that represents the verb he was trying to invoke, by sounding like it.<p>Birds chirp, bees buzz, moderators, toilets flush.</p>
]]></description><pubDate>Sat, 18 Jul 2026 21:40:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=48962717</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=48962717</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48962717</guid></item><item><title><![CDATA[New comment by SonOfLilit in "Regressive JPEGs"]]></title><description><![CDATA[
<p>It's an onomatopoeia</p>
]]></description><pubDate>Sat, 18 Jul 2026 17:19:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=48960066</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=48960066</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48960066</guid></item><item><title><![CDATA[New comment by SonOfLilit in "AI Meets Cryptography 2: What AI Found in OpenVM's ZkVM"]]></title><description><![CDATA[
<p>But to be fair, ZK proofs have strong "Cryptography 2: the Dark Tower" (2cryp2graphy?) vibes.<p>The amount and level of power use of cryptography primitives and their minutiae is insane. A cryptographic algorithm can usually be described on a post it note. A non-interactive zk commitment scheme would take a 200 page book.<p>(Though to be seriousit's Cryptography 3: Return of the String, because Cryptography 2 is Public Key Cryptography)</p>
]]></description><pubDate>Sat, 18 Jul 2026 17:08:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=48959958</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=48959958</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48959958</guid></item><item><title><![CDATA[New comment by SonOfLilit in "AI Meets Cryptography 2: What AI Found in OpenVM's ZkVM"]]></title><description><![CDATA[
<p>I didn't dive into the technical details of how pairing works, and in fact leared everything I know about it from TFA, which went into quite some detail.</p>
]]></description><pubDate>Sat, 18 Jul 2026 17:00:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=48959865</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=48959865</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48959865</guid></item><item><title><![CDATA[New comment by SonOfLilit in "AI Meets Cryptography 2: What AI Found in OpenVM's ZkVM"]]></title><description><![CDATA[
<p>TL;DR imagine a signature verification library that verifies a signature indeed signs the given hash, but not that the signed data hashes to that hash. Woopsie.<p>I guess nobody's commenting on this because it's very dense math without any context. Lucky for me I spent an hour or two yesterday learning how practical non-interactive zero knowledge proofs work.<p>In SNARKs (and other commitment schemes based on polynomials in elliptic curve groups, hope I got the terminology right), you verify the commitment (unneeded technical details: polynomial on EC at secret point nobody knows including the committer so he has to make the polynomial match at most points, and polynomials that match at most points match at all points) by multiplying two things you calculated from the circuit and commitment (which is just a couple of group elements) and verifying that it comes out as 1. The multiplication and comparison under encryption is done with a homomorphic encryption primitive-type thing called a "pairing" (normally with elliptic curve encryption only addition can be done on secret group elements that you don't know the value of).<p>They found a way to tell a specific library that implements this operation "believe me, this pairing is ok" that doesn't depend on any of those technical things. Just "these are not the droids you're looking for". Because it was not validating that some precomputed thing needed for the pairing verification actually matches this specific situation, and there are trivial parameters that would always yield 1 (but not be valid in the situation).</p>
]]></description><pubDate>Fri, 17 Jul 2026 22:30:06 +0000</pubDate><link>https://news.ycombinator.com/item?id=48952900</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=48952900</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48952900</guid></item><item><title><![CDATA[New comment by SonOfLilit in "AI Meets Cryptography 2: What AI Found in OpenVM's ZkVM"]]></title><description><![CDATA[
<p>It's a "this transaction is valid even though the signatures, amounts, potentially everything is wrong about it" vuln.<p>Every node that uses this library to validate would lose synchronization with every other node (if we take them at their word that it's not a monoculture), the bigger half would be considered "correct" according to how blockchains work, if it's the non-exploitable half - just lots of wasted resources and longer settlement times, if it's the exploitable half - illegal transactions would need to be reverted by agreement of the community, which is some sort of reset.</p>
]]></description><pubDate>Fri, 17 Jul 2026 22:05:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=48952728</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=48952728</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48952728</guid></item><item><title><![CDATA[New comment by SonOfLilit in "Unicode's transliteration rules are Turing-complete"]]></title><description><![CDATA[
<p>This is not interesting in the way that "DNS parsing is turing complete" is interesting. Nobody can send you a unicode file and make you run an infinite loop or whatever.<p>Within Unicode is defined a DSL used internally by the library implementers to define some business logic, like most DSLs it is turing complete. Anyone with the ability to make you run their rules file already has the ability to make you run arbitrary code (it's a software vendor for software you use).<p>It's still always fun to find Weird Machines, but as they go, this one is not very weird (it's one of the known families of programming languages, the Mathematica language being the most well known example. The person who specified this most likely was aware that this is turing complete and it's the rules author's responsibility not to write infinite loops).</p>
]]></description><pubDate>Thu, 09 Jul 2026 03:45:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=48840738</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=48840738</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48840738</guid></item><item><title><![CDATA[New comment by SonOfLilit in "Fable 5 On Vending-Bench: Misbehaving, With Plausible Deniability"]]></title><description><![CDATA[
<p>I hesitated to recommend the CEV paper, because it's written in Yudkowsky's very personal tone, which some enjoy and others find quite abrasive... but then it occurred to me that you asked about <i>philosophy</i>, and I have a book about Lacan nearby (not a book <i>by</i> Lacan, nobody can read that!), and I've peeked at the Tractatus once... Surely, even if you don't like him, Yudkowsky reads like Pratchett in comparison.<p>So... of course these questions are addressed in the 38 page essay that introduced the idea.<p>Specifically, it's not "calling it coherent", it's "assigning more importance to the parts that cohere than the parts that diverge" as one of the core principles (it's one philosopher's opinion, others disagree), with a lot of specific guidelines about how to prefer consensus or kicking decisions down the road and how to deal with complications like "what about dolphins" or "what about our great-great-grandchildren who will be as insane in our eyes as we are in the eyes of 17th century westerners, do their 'votes' count too?".<p>Of course, like any work of <i>philosophy</i>, it presupposes some pretty incredible things (like a Godlike intelligence that can be made to care deeply about following the spirit of this framework). But you could write a worse first draft for "what would we want AI to be aligned to, if we could define to our heart's content?"<p><a href="https://intelligence.org/files/CEV.pdf" rel="nofollow">https://intelligence.org/files/CEV.pdf</a></p>
]]></description><pubDate>Wed, 08 Jul 2026 00:55:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=48826096</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=48826096</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48826096</guid></item><item><title><![CDATA[New comment by SonOfLilit in "Fable 5 On Vending-Bench: Misbehaving, With Plausible Deniability"]]></title><description><![CDATA[
<p>The "OG" alignment research that MIRI were publishing long before LLMs burst into the scene spent most of it's time on that question.<p>"How can we even define what an aligned AI should do, if human's are not aligned with each other?" as well as "What does being aligned mean when you're a wizard box who's main influence on the world is to create stronger wizard boxes?" and other deep philosophical questions.<p>They came up with a framework called Coherent Extrapolated Volition to address this specific question. <a href="https://en.wikipedia.org/wiki/Coherent_extrapolated_volition" rel="nofollow">https://en.wikipedia.org/wiki/Coherent_extrapolated_volition</a></p>
]]></description><pubDate>Mon, 06 Jul 2026 17:27:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=48807810</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=48807810</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48807810</guid></item><item><title><![CDATA[New comment by SonOfLilit in "Crypto in 2026: Oh, This Is the Bad Place"]]></title><description><![CDATA[
<p>But it <i>is</i> full of "not x, but y", just not above the fold...<p>Probably many noticed and nobody wanted to spam with the complaint, I decided the spam is worth it for the author to get some feedback.</p>
]]></description><pubDate>Wed, 24 Jun 2026 23:11:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=48666698</link><dc:creator>SonOfLilit</dc:creator><comments>https://news.ycombinator.com/item?id=48666698</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48666698</guid></item></channel></rss>