<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: tjalfi</title><link>https://news.ycombinator.com/user?id=tjalfi</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Wed, 15 Apr 2026 00:59:21 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=tjalfi" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by tjalfi in "Migrating the main Zig repository from GitHub to Codeberg"]]></title><description><![CDATA[
<p>You might try emailing them, they've renamed other accounts before.</p>
]]></description><pubDate>Thu, 27 Nov 2025 16:57:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=46071055</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=46071055</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46071055</guid></item><item><title><![CDATA[New comment by tjalfi in "Pyrefly vs. Ty: Comparing Python's two new Rust-based type checkers"]]></title><description><![CDATA[
<p>Facebook acquired Monoidics in 2013; they were the startup that created Infer[0].<p>[0] <a href="https://en.wikipedia.org/wiki/Infer_Static_Analyzer" rel="nofollow">https://en.wikipedia.org/wiki/Infer_Static_Analyzer</a></p>
]]></description><pubDate>Wed, 28 May 2025 17:04:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=44118161</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=44118161</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44118161</guid></item><item><title><![CDATA[New comment by tjalfi in "Former Supreme Court justice David Souter has died"]]></title><description><![CDATA[
<p>That reminds me of Isaac Asimov's[0] story in <i>Asimov Laughs Again</i> about being confused with Arthur C. Clarke[1]. They had similar writing styles, so it was quite common for Isaac's books to be attributed to Arthur and vice versa. Childhood's End[2] was Arthur's most popular and well-known novel at the time.<p>At a science fiction convention, a woman said to me, "Dr. Asimov, I have just finished your book <i>Childhood's End</i>. I liked it, but I didn't think it was as good as your other books."<p>Maintaining a straight and solemn face (with an enormous effort), I said, "Yes, ma'am. I was frightfully disappointed in that book, which I thought was quite inferior. I therefore insisted it appear under the pseudonym of Arthur C. Clarke, Jr."<p>[0] <a href="https://en.wikipedia.org/wiki/Isaac_Asimov" rel="nofollow">https://en.wikipedia.org/wiki/Isaac_Asimov</a><p>[1] <a href="https://en.wikipedia.org/wiki/Arthur_C._Clarke" rel="nofollow">https://en.wikipedia.org/wiki/Arthur_C._Clarke</a><p>[2] <a href="https://en.wikipedia.org/wiki/Childhood%27s_End" rel="nofollow">https://en.wikipedia.org/wiki/Childhood%27s_End</a></p>
]]></description><pubDate>Fri, 09 May 2025 23:48:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=43942000</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=43942000</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43942000</guid></item><item><title><![CDATA[New comment by tjalfi in "Make Ubuntu packages 90% faster by rebuilding them"]]></title><description><![CDATA[
<p>Kaze Emanuar[0] is the YouTuber you're thinking of.<p>[0] <a href="https://www.youtube.com/@KazeN64" rel="nofollow">https://www.youtube.com/@KazeN64</a></p>
]]></description><pubDate>Wed, 19 Mar 2025 18:54:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=43415959</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=43415959</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43415959</guid></item><item><title><![CDATA[New comment by tjalfi in "1/4 of startups in YC current cohort have almost entirely AI-generated codebases"]]></title><description><![CDATA[
<p>Are you referring to Jevon's Paradox[0]?<p>[0] <a href="https://en.wikipedia.org/wiki/Jevons_paradox" rel="nofollow">https://en.wikipedia.org/wiki/Jevons_paradox</a></p>
]]></description><pubDate>Thu, 06 Mar 2025 18:54:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=43283800</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=43283800</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43283800</guid></item><item><title><![CDATA[New comment by tjalfi in "There Was a Texas Lottery Arbitrage"]]></title><description><![CDATA[
<p>You're thinking of Stefan Mandel's International Lotto Fund[0]. They tried to buy every ticket in the Virginia state lottery in 1992. They won the money, but IIRC there were years of litigation.<p>[0] <a href="http://investpost.org/mutual-funds/group-invests-5-million-to-hedge-bets-in-lottery/" rel="nofollow">http://investpost.org/mutual-funds/group-invests-5-million-t...</a></p>
]]></description><pubDate>Wed, 05 Mar 2025 22:30:22 +0000</pubDate><link>https://news.ycombinator.com/item?id=43273618</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=43273618</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43273618</guid></item><item><title><![CDATA[New comment by tjalfi in "The Lottery Problem: Tracing Stefan Mandel's Combinatorial Condensation"]]></title><description><![CDATA[
<p>(submitter)<p>Here's the abstract.<p>Stefan Mandel is the man who won the lottery 14 times. He never disclosed the recipe he called combinatorial condensation, which enabled him to hit the Romanian lottery jackpot in the early phase of his betting career. Combinatorial condensation is frequently mixed up with another strategy known as buying the pot, which Stefan Mandel was pursuing later on. On occasion, he dropped a few hints on combinatorial condensation. The hints are applied in this work to narrow down and assess his initial recipe. The underlying theory resembles what a weekend mathematician, as he once referred to himself, may have encountered in the 1960s. Calculations indicate that he took residual risks that his method might fail. Residual risks explain why he changed his strategy from combinatorial condensation to buying the pot. The cardinality of the (15, 6, 6, 5)- and (49, 6, 6, 5)-lottery schemes shows that Stefan Mandel probably wasn't aware of lottery designs. First concepts on such topics had been available at that time, but coherent theories on combinatorial designs took off only in later decades, triggered by growing computing power, and eventually triggered by Stefan Mandel's publicity and successes in the field. But, as the comparison with actual covering designs reveals, Stefan Mandel most likely pioneered in constructing a (15, 6, 5)-covering design many years before others published about it, which he applied in the Romanian lottery.</p>
]]></description><pubDate>Wed, 05 Mar 2025 18:45:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=43270547</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=43270547</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43270547</guid></item><item><title><![CDATA[The Lottery Problem: Tracing Stefan Mandel's Combinatorial Condensation]]></title><description><![CDATA[
<p>Article URL: <a href="https://arxiv.org/abs/2408.06857">https://arxiv.org/abs/2408.06857</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=43270529">https://news.ycombinator.com/item?id=43270529</a></p>
<p>Points: 2</p>
<p># Comments: 1</p>
]]></description><pubDate>Wed, 05 Mar 2025 18:43:44 +0000</pubDate><link>https://arxiv.org/abs/2408.06857</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=43270529</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43270529</guid></item><item><title><![CDATA[New comment by tjalfi in "Ask HN: What less-popular systems programming language are you using?"]]></title><description><![CDATA[
<p>These days, we have many better options, but back in the day, Fortran was also used for compilers (e.g., IBM's Fortran H), operating systems (such as PRIMOS[0] and LTSS[1]), symbolic computation (e.g., early Prolog implementations), and real-time control systems[2].<p>[0] <a href="https://en.wikipedia.org/wiki/PRIMOS" rel="nofollow">https://en.wikipedia.org/wiki/PRIMOS</a><p>[1] <a href="https://en.wikipedia.org/wiki/Livermore_Time_Sharing_System" rel="nofollow">https://en.wikipedia.org/wiki/Livermore_Time_Sharing_System</a><p>[2] <a href="https://webhome.weizmann.ac.il/home/fhlevins/RTF/RTF-TOC.html" rel="nofollow">https://webhome.weizmann.ac.il/home/fhlevins/RTF/RTF-TOC.htm...</a></p>
]]></description><pubDate>Tue, 04 Mar 2025 02:49:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=43249708</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=43249708</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43249708</guid></item><item><title><![CDATA[New comment by tjalfi in "Dozens of U.S. academics lose grants from Minerva Research Initiative"]]></title><description><![CDATA[
<p>It's a short story and not a novel, but there's the short story August Heat[0]; it's available at [1].<p>[0] <a href="https://en.wikipedia.org/wiki/August_Heat_(short_story)" rel="nofollow">https://en.wikipedia.org/wiki/August_Heat_(short_story)</a><p>[1] <a href="https://www.scaryforkids.com/august-heat/" rel="nofollow">https://www.scaryforkids.com/august-heat/</a></p>
]]></description><pubDate>Mon, 03 Mar 2025 19:00:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=43245384</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=43245384</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43245384</guid></item><item><title><![CDATA[New comment by tjalfi in "When your last name is Null, nothing works"]]></title><description><![CDATA[
<p>Esperanto is probably the most widely spoken international auxiliary language[0].<p>[0] <a href="https://en.wikipedia.org/wiki/International_auxiliary_language" rel="nofollow">https://en.wikipedia.org/wiki/International_auxiliary_langua...</a></p>
]]></description><pubDate>Fri, 21 Feb 2025 02:00:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=43123206</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=43123206</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43123206</guid></item><item><title><![CDATA[New comment by tjalfi in "Rust Is Eating JavaScript (2023)"]]></title><description><![CDATA[
<p>TypeScript definitely won't add checked exceptions, because Anders Hejlsberg considers them a mistake[0].<p>[0] <a href="https://www.artima.com/articles/the-trouble-with-checked-exceptions" rel="nofollow">https://www.artima.com/articles/the-trouble-with-checked-exc...</a></p>
]]></description><pubDate>Sun, 16 Feb 2025 18:49:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=43070482</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=43070482</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43070482</guid></item><item><title><![CDATA[New comment by tjalfi in "A Libertarian Island Dream in Honduras Is Now an $11B Nightmare"]]></title><description><![CDATA[
<p>> That's why Uncle Sam is nice to have on your side. A libertarian utopia or corporate controlled trading zone doesn't stand a chance without the backing of a sovereign with a military.<p>The Republic of Minerva[0] is a good example of this. Some libertarians built an artificial island on a reef and the neighboring country of Tonga annexed it.<p>[0] <a href="https://en.wikipedia.org/wiki/Republic_of_Minerva" rel="nofollow">https://en.wikipedia.org/wiki/Republic_of_Minerva</a></p>
]]></description><pubDate>Sat, 15 Feb 2025 01:58:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=43055112</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=43055112</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43055112</guid></item><item><title><![CDATA[New comment by tjalfi in "Fun with C++26 reflection: Keyword Arguments"]]></title><description><![CDATA[
<p>C++20 added designated initializers, so they're also an option.<p><pre><code>    my_func({.arg1 = val1, .arg2 = val2});</code></pre></p>
]]></description><pubDate>Tue, 11 Feb 2025 02:43:08 +0000</pubDate><link>https://news.ycombinator.com/item?id=43008346</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=43008346</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43008346</guid></item><item><title><![CDATA[New comment by tjalfi in "Don't "optimize" conditional moves in shaders with mix()+step()"]]></title><description><![CDATA[
<p>clang has the <i>__builtin_unpredictable()</i> intrinsic[0] for this purpose.<p>[0] <a href="https://clang.llvm.org/docs/LanguageExtensions.html#builtin-unpredictable" rel="nofollow">https://clang.llvm.org/docs/LanguageExtensions.html#builtin-...</a></p>
]]></description><pubDate>Sun, 09 Feb 2025 22:23:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=42994687</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=42994687</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42994687</guid></item><item><title><![CDATA[New comment by tjalfi in "Proposed bill to make it a crime to download DeepSeek in the US"]]></title><description><![CDATA[
<p>My guess is it was stored in a document management system[0] and then checked out locally to that path.<p>[0] <a href="https://en.wikipedia.org/wiki/Document_management_system" rel="nofollow">https://en.wikipedia.org/wiki/Document_management_system</a></p>
]]></description><pubDate>Sun, 02 Feb 2025 03:39:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=42905572</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=42905572</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42905572</guid></item><item><title><![CDATA[New comment by tjalfi in "Working with Files Is Hard (2019)"]]></title><description><![CDATA[
<p>Jeremy Allison tracked down why POSIX standardized this behavior[0].<p><i>The reason is historical and reflects a flaw in the POSIX standards process, in my opinion, one that hopefully won't be repeated in the future. I finally tracked down why this insane behavior was standardized by the POSIX committee by talking to long-time BSD hacker and POSIX standards committee member Kirk McKusick (he of the BSD daemon artwork). As he recalls, AT&T brought the current behavior to the standards committee as a proposal for byte-range locking, as this was how their current code implementation worked. The committee asked other ISVs if this was how locking should be done. The ISVs who cared about byte range locking were the large database vendors such as Oracle, Sybase and Informix (at the time). All of these companies did their own byte range locking within their own applications, none of them depended on or needed the underlying operating system to provide locking services for them. So their unanimous answer was "we don't care". In the absence of any strong negative feedback on a proposal, the committee added it "as-is", and took as the desired behavior the specifics of the first implementation, the brain-dead one from AT&T.</i><p>[0] <a href="https://www.samba.org/samba/news/articles/low_point/tale_two_stds_os2.html" rel="nofollow">https://www.samba.org/samba/news/articles/low_point/tale_two...</a></p>
]]></description><pubDate>Fri, 24 Jan 2025 00:53:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=42809546</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=42809546</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42809546</guid></item><item><title><![CDATA[New comment by tjalfi in "Why is hash(-1) == hash(-2) in Python?"]]></title><description><![CDATA[
<p>BCPL[0], BLISS[1], and Forth[2] are all untyped.<p>[0] <a href="https://en.wikipedia.org/wiki/BCPL" rel="nofollow">https://en.wikipedia.org/wiki/BCPL</a><p>[1] <a href="https://en.wikipedia.org/wiki/BLISS" rel="nofollow">https://en.wikipedia.org/wiki/BLISS</a><p>[2] <a href="https://en.wikipedia.org/wiki/Forth_(programming_language)" rel="nofollow">https://en.wikipedia.org/wiki/Forth_(programming_language)</a></p>
]]></description><pubDate>Sat, 11 Jan 2025 02:32:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=42662764</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=42662764</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42662764</guid></item><item><title><![CDATA[New comment by tjalfi in "Some programming language ideas"]]></title><description><![CDATA[
<p>If you're interested in prior art, Ian Currie's <i>NewSpeak</i> was an attempt at a non-Turing complete language for safety critical systems. Most of the search results are for a different language with the same name, but "RSRE currie newspeak" should find relevant links.</p>
]]></description><pubDate>Thu, 09 Jan 2025 03:25:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=42641296</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=42641296</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42641296</guid></item><item><title><![CDATA[New comment by tjalfi in "Size Optimization Tricks (2022)"]]></title><description><![CDATA[
<p>As a concrete example, Carlos Bueno's Mature Optimization Handbook[0] describes  how the HHVM team got substantial performance wins by reducing instruction cache misses in rarely executed code.<p>[0] <a href="https://carlos.bueno.org/optimization/" rel="nofollow">https://carlos.bueno.org/optimization/</a></p>
]]></description><pubDate>Tue, 07 Jan 2025 23:44:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=42629105</link><dc:creator>tjalfi</dc:creator><comments>https://news.ycombinator.com/item?id=42629105</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42629105</guid></item></channel></rss>