<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: _flux</title><link>https://news.ycombinator.com/user?id=_flux</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 26 Oct 2026 18:03:33 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=_flux" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by _flux in "Meta Ignores Brazilian Court Order to End Bolsonaro Favoritism"]]></title><description><![CDATA[
<p>Why should it?<p>I believe though it is an old phenomenom that if (given the default context) you ask a random number, it will more often than not give numbers from a very small set.<p>I just used a "Temporary chat" with ChatGPT twice to "Give a random number" and it gave 42 both times (this shuold be rather understandable why it ended up with this). Then I asked "Give a random number in 1-10" twice and it responded with 7 for both (and this too is an old "magic number").</p>
]]></description><pubDate>Sun, 25 Oct 2026 11:12:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=50230403</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=50230403</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50230403</guid></item><item><title><![CDATA[New comment by _flux in "Broccoli2Shell: Brotli decoder RCE in Node.js, Python and more"]]></title><description><![CDATA[
<p>Rust-Brotli (by Dropbox) is actually a drop-in replacement for the Brotli C lib: <a href="https://github.com/dropbox/rust-brotli#:~:text=rust-brotli%20is%20a%20drop-in%20replacement%20for%20the%20official" rel="nofollow">https://github.com/dropbox/rust-brotli#:~:text=rust-brotli%2...</a><p>Dropbox switched to it a decade ago, so it's probably quite product-ready.</p>
]]></description><pubDate>Sat, 24 Oct 2026 16:58:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=50223075</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=50223075</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50223075</guid></item><item><title><![CDATA[New comment by _flux in "Node2Shell evolves to HTTP2Shell, blast radius affects many HTTP libs and apps"]]></title><description><![CDATA[
<p>I can understand why people used a C library for these apps, as when HTTP2 was specified, the C lib was the only game in down.<p>However, why not switch to the Rust lib when it was available? I suppose people at Dropbox are now pretty happy they did in <i>2016</i>: <a href="https://dropbox.tech/infrastructure/lossless-compression-with-brotli" rel="nofollow">https://dropbox.tech/infrastructure/lossless-compression-wit...</a><p>It's slower, though. Too high a price to pay for safety it seems.</p>
]]></description><pubDate>Sat, 24 Oct 2026 16:55:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=50223052</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=50223052</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50223052</guid></item><item><title><![CDATA[New comment by _flux in "macOS 15.8.2 Breaks OpenGL"]]></title><description><![CDATA[
<p>Why is it a bad analogy? I don't have experience on either of the libraries, so I may be missing something.</p>
]]></description><pubDate>Sun, 18 Oct 2026 17:19:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=50143123</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=50143123</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50143123</guid></item><item><title><![CDATA[New comment by _flux in "11 year old unsoundness bugs found in Rust borrow checker"]]></title><description><![CDATA[
<p>I would say as stated there were two ways to read the claim:<p>- either that the claims are paired as you say (the second one implying that the program cannot be fixed),<p>- or that the claims are completely distinct, that simply state the desirable state of things.<p>Using the second interpretation, the corollaries would be:<p>- there is (typically) no reasonable fix for the C++ compiler that would address the UB. Therefore to fix the UB all C++ programs exhibiting the same need to be fixed, which is hard, as the compiler will keep accepting them.<p>- once the Rust compiler is fixed, then all safe Rust programs exploiting the bug must now be fixed, or the compiler will reject them.<p>What I would sign under would be the second interpretation, not the first one. But I intentionally also selected the particular ambiguous form due to the cutesy, albeit misleading, symmetry of the statements.</p>
]]></description><pubDate>Wed, 14 Oct 2026 19:45:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=50093938</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=50093938</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50093938</guid></item><item><title><![CDATA[New comment by _flux in "AI is mass decompiling games. That's both awesome and scary"]]></title><description><![CDATA[
<p>Maybe we should start with something easy and clone Nethack by just playing it through..<p>Astra Max can do 12%: <a href="https://balrogai.com/" rel="nofollow">https://balrogai.com/</a><p>Though after improving the harness it can fare better, but still no completion: <a href="https://roger-creus.github.io/blog/astra-craftax-nethack/" rel="nofollow">https://roger-creus.github.io/blog/astra-craftax-nethack/</a></p>
]]></description><pubDate>Wed, 14 Oct 2026 16:42:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=50090620</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=50090620</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50090620</guid></item><item><title><![CDATA[New comment by _flux in "11 year old unsoundness bugs found in Rust borrow checker"]]></title><description><![CDATA[
<p>I suggest you point the exact statement where I claimed the corresponding safe Rust program is impossible to fix to avoid unsound behavior.<p>I hold the argument that if the Rust compiler produces unsound behavior for safe Rust, then the compiler <i>needs</i> to be fixed.</p>
]]></description><pubDate>Wed, 14 Oct 2026 11:51:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=50086213</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=50086213</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50086213</guid></item><item><title><![CDATA[New comment by _flux in "11 year old unsoundness bugs found in Rust borrow checker"]]></title><description><![CDATA[
<p>I don't find that anyone made a claim that the program could not be fixed. Why are you suggesting to find a proof of this?<p>The point of course was not that what you <i>can</i> do, but what you <i>should</i> do. All cases of safe Rust compiler producing unsound code <i>should</i> be fixed, but the same argument is more difficult to make for C++.<p>Sometimes <i>should</i> might be different of what you <i>must</i>. For example, if your program exhibits unsound behavior in safe Rust (or C++) code, it's probably a lot more practical to just change the program so that it doesn't, instead of updating the compiler, unless you happen to be a Rust compiler developer. But, at the same time, you <i>should</i> file an issue about it.<p>You can of course find C++ compiler bugs as well, although I expect that to be quite rare nowadays. But the typical case is that if a C++ program exhibits unsound behavior, there is no reasonable compiler fix for it.<p>Then there's of course Fil-C! This improves the situation greatly by converting most interesting cases of unsound behavior into runtime errors. It seems not everyone is happy with the runtime costs of making this happen, though. And you must compile everything with Fil-C. It doesn't work with Windows or MacOS either.</p>
]]></description><pubDate>Wed, 14 Oct 2026 07:18:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=50083652</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=50083652</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50083652</guid></item><item><title><![CDATA[New comment by _flux in "11 year old unsoundness bugs found in Rust borrow checker"]]></title><description><![CDATA[
<p>Sure, usually the program can be changed to avoid the issue, but the key here is that the Rust compiler is wrong and needs to be fixed. Once fixed, the actual program fix also falls in place, as it cannot be compiled anymore.</p>
]]></description><pubDate>Tue, 13 Oct 2026 13:13:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=50071190</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=50071190</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50071190</guid></item><item><title><![CDATA[New comment by _flux in "11 year old unsoundness bugs found in Rust borrow checker"]]></title><description><![CDATA[
<p>I think the difference is here:<p>- If a compiled C++ program has unsound behavior, the program needs to be fixed<p>- If a compiled safe Rust program has unsound behavior, the compiler needs to be fixed</p>
]]></description><pubDate>Tue, 13 Oct 2026 12:55:06 +0000</pubDate><link>https://news.ycombinator.com/item?id=50070927</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=50070927</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50070927</guid></item><item><title><![CDATA[New comment by _flux in "Codex CLI installs a persistent, self-updating background daemon by default"]]></title><description><![CDATA[
<p>I don't use Claude, but it appears it is permitted to use Claude as a stdin/stdout -communicated tool using JSON, or use Claude SDK, with the monthly plans. Monthly Max/Team plans also include credits that could be used directly via the API: <a href="https://support.claude.com/en/articles/17154008-monthly-api-credits-for-max-and-team-plans" rel="nofollow">https://support.claude.com/en/articles/17154008-monthly-api-...</a> .<p>E.g. OpenCode can be used with all three methods. Looks like it needs a plugin for the two Claude methods, though.</p>
]]></description><pubDate>Tue, 13 Oct 2026 03:49:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=50066411</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=50066411</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50066411</guid></item><item><title><![CDATA[New comment by _flux in "Microsoft-Decision-1, our model for fast decision-making"]]></title><description><![CDATA[
<p>Hmm, so actually I thought it would say that it's not permitted to benchmark or compare to other products, but I can't find such claim?<p>It does say "develop (or to facilitate the development of) a similar or competing product or service", but I think it would be a long stretch to say that's the case if they would just publish benchmarks. Microsoft legal department might disagree.</p>
]]></description><pubDate>Fri, 09 Oct 2026 21:51:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=50027026</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=50027026</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50027026</guid></item><item><title><![CDATA[New comment by _flux in "Navier–Stokes Lost in Translation"]]></title><description><![CDATA[
<p>Actually, as an earlier commenter noticed, it seems that the proof was done in natural language, and only then translated to Lean, as <a href="https://openai.com/index/navier-stokes-solution/" rel="nofollow">https://openai.com/index/navier-stokes-solution/</a> says:<p>> The agents arrived at their resolution on Saturday, September 5, about 88 hours after the first agents were launched. Lean formalization and verification took an additional 17 hours via GPT‑6 Astra.<p>So it suggests that the formalization/verification step may have fixed some issues in the natural language proof, and either such differences were never noticed or the corrections weren't ported back to the NLP.</p>
]]></description><pubDate>Wed, 07 Oct 2026 17:26:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=49995957</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=49995957</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49995957</guid></item><item><title><![CDATA[New comment by _flux in "SynthID Detector"]]></title><description><![CDATA[
<p>Is it possible to implement a very good mechanism?</p>
]]></description><pubDate>Wed, 07 Oct 2026 15:32:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=49994274</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=49994274</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49994274</guid></item><item><title><![CDATA[New comment by _flux in "SynthID Detector"]]></title><description><![CDATA[
<p>In similar fashion in the Android Play Store they moved the search off from the top bar. For some time they educated users that "oo the search is no longer here, you need to click there -> to get to the page with search!". That has stopped (for me?), but they still haven't found any other use for same place in the first view.<p>I suppose it was too convenient.</p>
]]></description><pubDate>Wed, 07 Oct 2026 15:29:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=49994225</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=49994225</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49994225</guid></item><item><title><![CDATA[New comment by _flux in "EDG C++ front-end goes public"]]></title><description><![CDATA[
<p>You mean the article in general is 100% LLM, or the arrangement of these four words is 100% LLM?<p>I find it extremely unlikely LLMs would have the monopoly on this particular word arrangement—and indeed they would have learned it from training material produced by people in the first place.</p>
]]></description><pubDate>Thu, 01 Oct 2026 07:32:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=49918802</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=49918802</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49918802</guid></item><item><title><![CDATA[New comment by _flux in "The internet discovers TLA+. Now what?"]]></title><description><![CDATA[
<p>I used TLA+ in a (hobby) web app by asking it to model the endpoints and the data user can get from them, and then what kind of access that data can grant in the system, and then implement some properties over that kind of data. I suppose basically like "you can't get access to another user's shopping basket", although mine was maybe a bit more convoluted.</p>
]]></description><pubDate>Wed, 30 Sep 2026 18:30:23 +0000</pubDate><link>https://news.ycombinator.com/item?id=49912576</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=49912576</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49912576</guid></item><item><title><![CDATA[New comment by _flux in "What TLA+ can and can't check"]]></title><description><![CDATA[
<p>These probabilistic guessing machines are pretty great for creating these formal models, e.g. TLA+, and then guessing if the implementation aligns with the spec.. In fact, it's my go-to tool for constructing soft guardrails for the model, so the design it's going to implement is logically sound. Same as for people: it's easier to make something working when you have a spec that is working.<p>Of course, it still allows the risk that you don't actually get to understand it.</p>
]]></description><pubDate>Wed, 30 Sep 2026 18:28:03 +0000</pubDate><link>https://news.ycombinator.com/item?id=49912541</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=49912541</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49912541</guid></item><item><title><![CDATA[New comment by _flux in "Needed 1+1, built a functional programming language"]]></title><description><![CDATA[
<p>Let's say we have removed all elements from the hash. Then all following contains -calls will need to be O(n), if I understood correctly? They need to check every slot in the array to confirm inexistence, rather than just one bucket.</p>
]]></description><pubDate>Wed, 30 Sep 2026 16:18:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=49910890</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=49910890</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49910890</guid></item><item><title><![CDATA[New comment by _flux in "Needed 1+1, built a functional programming language"]]></title><description><![CDATA[
<p>The standard hash table has buckets, though, not just a single array that is probed through in case there's no space for a value in the slot determined by the hash function?</p>
]]></description><pubDate>Wed, 30 Sep 2026 14:24:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=49909454</link><dc:creator>_flux</dc:creator><comments>https://news.ycombinator.com/item?id=49909454</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49909454</guid></item></channel></rss>