<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: Smaug123</title><link>https://news.ycombinator.com/user?id=Smaug123</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Tue, 08 Sep 2026 15:39:10 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=Smaug123" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by Smaug123 in "You Don't Have a Right to Safe Drinking Water, US Court Rules"]]></title><description><![CDATA[
<p>I don’t have skin in this game, being from the increasingly oppressive UK and not the USA, but:<p>> what do you want to defend<p>Accuracy, and in this case people <i>correctly</i> knowing that their rights stem from some source (if they do! I don’t know the legal facts) or knowing the appropriate venue in which to campaign for them, rather than incorrectly believing that they don’t have rights and/or can’t get them.<p>> why do you want to defend it<p>Because words still have meanings, and people pretending they don’t, while screaming in ever more shrill tones at each other, is extremely tiresome, and the Internet is full of it.</p>
]]></description><pubDate>Sun, 06 Sep 2026 17:59:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=49589083</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49589083</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49589083</guid></item><item><title><![CDATA[New comment by Smaug123 in "You Don't Have a Right to Safe Drinking Water, US Court Rules"]]></title><description><![CDATA[
<p>As the article says, the situation in Jackson was deplorable; and it is indeed mind-boggling (to my puny European mind) that the same constitution which grants freedom of speech and the press was also not intended to grant the right to receive only believed-correct information from the government. But the ruling, for example, is not quoted as making any mention of any federal laws? The headline may be true for all I know, but the article provides only evidence for its truth about one particular source of rights.</p>
]]></description><pubDate>Sun, 06 Sep 2026 10:06:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=49584963</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49584963</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49584963</guid></item><item><title><![CDATA[New comment by Smaug123 in "You Don't Have a Right to Safe Drinking Water, US Court Rules"]]></title><description><![CDATA[
<p>Sorry, I think your pull quote is actually contradicting your gloss. Again, the pull quote states that it doesn’t infringe any <i>constitutional</i> right, not that it doesn’t infringe any rights granted for any other reason?</p>
]]></description><pubDate>Sun, 06 Sep 2026 10:01:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=49584928</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49584928</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49584928</guid></item><item><title><![CDATA[New comment by Smaug123 in "You Don't Have a Right to Safe Drinking Water, US Court Rules"]]></title><description><![CDATA[
<p>Does it? I think that conclusion requires observing additionally that all federal law also fails to grant a right to safe drinking water, doesn’t it?</p>
]]></description><pubDate>Sun, 06 Sep 2026 09:58:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=49584914</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49584914</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49584914</guid></item><item><title><![CDATA[New comment by Smaug123 in "You Don't Have a Right to Safe Drinking Water, US Court Rules"]]></title><description><![CDATA[
<p>Misleadingly provocative headline, right? The actual ruling from the article is that <i>the US Constitution</i> does not by itself grant US citizens that right. As the article itself points out, there’s nothing stopping other agreements from granting the right, and indeed several states do so explicitly.</p>
]]></description><pubDate>Sun, 06 Sep 2026 09:50:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=49584859</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49584859</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49584859</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>It’s an aggregated list, not a list of formalisations in Lean - the checkbox is “things formalised in <i>any</i> prover”.</p>
]]></description><pubDate>Sat, 05 Sep 2026 19:20:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=49579748</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49579748</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49579748</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>Because you wrote:<p>> what are exactly rules, which could be separate topic of research, this detail is skipped<p>I am now confident you’re a troll, though, so I am going to bow out.</p>
]]></description><pubDate>Sat, 05 Sep 2026 16:50:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=49578344</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49578344</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49578344</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>As I have said a few times now, you should read any first course in set theory. I’m quoting my third-year notes from Cambridge there, but essentially every intro to set theory will say the same. (I’m sure someone will find a single counterexample that does it somehow differently.)</p>
]]></description><pubDate>Sat, 05 Sep 2026 16:48:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=49578316</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49578316</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49578316</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>You don’t necessarily want concision for that. You want “the right abstractions”, with an API that admits nice general work building on top of it. That might mean doing things in more generality than you wanted to. For example, for a long time (and possibly even now, I’m not up to date) there was very little graph theory in mathlib because there wasn’t consensus about what “the right definition” of a graph was, to permit all the possible consumers to get what they need from the API.</p>
]]></description><pubDate>Sat, 05 Sep 2026 12:34:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=49575927</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49575927</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49575927</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>The LLM is not the thing applying the logical rules. That is instead the deterministic system Lean 4. (Also that Apple paper was garbage even when it was written, assuming you’re referring to The Illusion of Thinking, and LLMs have got much better since.)</p>
]]></description><pubDate>Sat, 05 Sep 2026 12:29:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=49575904</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49575904</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49575904</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>Fortunately FLT is an <i>extremely</i> simple statement. Much easier to satisfy yourself that its statement is what you wanted to say than it would be for most statements of interest!</p>
]]></description><pubDate>Sat, 05 Sep 2026 12:26:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=49575880</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49575880</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49575880</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>Claude’s formalisation, being in Lean, is based on the calculus of inductive constructions, not ZFC. In Lean 3, per Carneiro, any theorem of Lean 3’s theory can be proved in ZFC plus some finite number of inaccessible cardinals (and, IIRC, vice versa). The precise strength of Lean 4 is not quite clear yet, I think (I guess this is partly what Lean4Lean is hoping to address).</p>
]]></description><pubDate>Sat, 05 Sep 2026 08:49:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=49574592</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49574592</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49574592</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>It simply does have functions. According to ZFC, a function is a set whose members are pairs, such that no two different pairs have the same first element.<p>I mean this quite seriously: have you considered reading any first course in set theory?</p>
]]></description><pubDate>Sat, 05 Sep 2026 08:35:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=49574473</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49574473</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49574473</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>Eh? Any first course in set theory will present ZFC as a one-sorted theory with ten axioms (/schemas) in first order logic (inheriting an equality symbol, forall, implies etc) with one binary predicate (namely set membership), or will present a theory that is equiconsistent with a usual ZFC presentation. Honestly I’m not sure how you simultaneously claim to be a PhD in formalisation and also not be aware of the existence of Isabelle/ZF, for example.</p>
]]></description><pubDate>Sat, 05 Sep 2026 08:33:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=49574447</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49574447</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49574447</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>I think this isn’t true? Comparator verifies proofs; it’s not clear to me what it even means to mechanically verify a statement to be valid. The statement is manifestly valid anyway - it’s hard to find much simpler statements of maths, slightly odd facts of mathlib’s natural arithmetic like the saturating behaviour of natural subtraction notwithstanding.</p>
]]></description><pubDate>Sat, 05 Sep 2026 08:26:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=49574394</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49574394</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49574394</guid></item><item><title><![CDATA[New comment by Smaug123 in "Formalizing Fermat's Last Theorem"]]></title><description><![CDATA[
<p>It is possible, although the post notes that the proof was also verified by the Comparator, which means any exploited bug has to <i>also</i> be present in that checker. Which is not unheard of, but is much less likely than merely an exploit in Lean 4.</p>
]]></description><pubDate>Fri, 04 Sep 2026 20:09:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=49569624</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49569624</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49569624</guid></item><item><title><![CDATA[New comment by Smaug123 in "GPT-6 Astra"]]></title><description><![CDATA[
<p>I claim that the percentages add up to more than 100% because the first described case overlaps with the second.</p>
]]></description><pubDate>Fri, 04 Sep 2026 05:50:05 +0000</pubDate><link>https://news.ycombinator.com/item?id=49560981</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49560981</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49560981</guid></item><item><title><![CDATA[New comment by Smaug123 in "Claude Fable 5.1 and Claude Mythos 5.1"]]></title><description><![CDATA[
<p>It doesn't necessarily change the output distribution; it depends exactly how it's implemented, and Anthropic haven't told us that. Google's original SynthID paper describes how you can do this.<p>Toy proof-of-concept: Anthropic owns a secret key which is a coin-flip Bernoulli random variable K with p=1/2. You are paying Anthropic to give you X, a Bernoulli random variable with p=1/2. Anthropic changes from their old strategy, "draw from K, then throw it away and flip a coin, each time you ask for a sample", to their new strategy, "draw from K and send it to you". You cannot observe the difference, but Anthropic knows K and so they know when you are repeating its outputs. (Obviously this is a toy example; in reality the distribution is vastly more complicated than Bernoulli, and Anthropic isn't just storing some model outputs to use as K but instead is computing a correlation with a known pseudorandomness source.)</p>
]]></description><pubDate>Tue, 01 Sep 2026 19:34:18 +0000</pubDate><link>https://news.ycombinator.com/item?id=49526931</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49526931</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49526931</guid></item><item><title><![CDATA[New comment by Smaug123 in "Ask HN: Who is hiring? (September 2026)"]]></title><description><![CDATA[
<p>G-Research | <a href="https://www.gresearch.com" rel="nofollow">https://www.gresearch.com</a> | London UK, on-site | Full-time<p>G-Research is a leading quant finance company. Big compute farm, interesting problems.<p>My team is hiring senior engineers to work on our (actually world class) DAG scheduling infra for distributing research and production workloads across the compute farm. What we do is roughly:<p>* maintain and improve the SDKs for that scheduler in Python, F#, and C#<p>* add interesting new features to the scheduler itself<p>* maintain and improve a web backend and UI for quants and engineers to monitor their jobs, increasingly with high availability requirements<p>* translate bidirectionally at the business level between low-level infra providers and quant/ML researchers<p>Some functional experience preferred, because our core product is in F#. Lots of dealing with very smart researchers and engineers, with the kind of fun problems arising when you run large ML workloads at scale.<p>patrick.stevens@gresearch.co.uk or my personal patrick+hackernews@patrickstevens.co.uk</p>
]]></description><pubDate>Tue, 01 Sep 2026 15:54:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=49523740</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49523740</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49523740</guid></item><item><title><![CDATA[New comment by Smaug123 in "Bhartrhari's Paradox"]]></title><description><![CDATA[
<p>You didn't name the object when you said "let this thing be X"; you actually had <i>already</i> identified that "thing", and that process of identification was the process of naming it. You then defined some syntax ("X") and said that it was a name.<p>But there are things for which you can't even say "let 'this thing' be…". For example, ZF proves that there are uncountably many reals. There are only countably many names, so there must be unnameable reals. You can talk about "generic" reals (you can say "let x be a real" and do all sorts of interesting things with a <i>generic</i> x), but there are specific reals you will never be able to name specifically enough to distinguish them from their uncountably-many brethren. That doesn't make them "vague, undefined or ephemeral"! They're just so numerous that you can't describe the distinctions between them.<p>(Even hardcore constructivists usually accept enough Choice to prove the reals uncountable, although <a href="https://arxiv.org/abs/2404.01256" rel="nofollow">https://arxiv.org/abs/2404.01256</a> made headlines when it was shown not to be necessarily true.)</p>
]]></description><pubDate>Sat, 29 Aug 2026 08:38:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=49488094</link><dc:creator>Smaug123</dc:creator><comments>https://news.ycombinator.com/item?id=49488094</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49488094</guid></item></channel></rss>