<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: omoikane</title><link>https://news.ycombinator.com/user?id=omoikane</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Wed, 21 Oct 2026 12:36:00 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=omoikane" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by omoikane in "Muse exposes users' personal and business secrets when they share conversations"]]></title><description><![CDATA[
<p>Lesson here is that the subdomain names can be queried due to passive DNS records, and putting stuff that is not supposed to be guessable in subdomain names is a bad idea.</p>
]]></description><pubDate>Wed, 21 Oct 2026 05:10:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=50176326</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=50176326</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50176326</guid></item><item><title><![CDATA[New comment by omoikane in "Facebook now charging to post more than 2 links a month"]]></title><description><![CDATA[
<p>Interesting how 9.99 GBP (about 13.36 USD) will allow for "more than 2 links" in 2025, but 14.99 USD now will still only allow for 2 links.  Users will need to pay for "advanced plan" at 49.99 USD per month just for 8 links.<p><a href="https://www.facebook.com/help/1929252614431792/" rel="nofollow">https://www.facebook.com/help/1929252614431792/</a></p>
]]></description><pubDate>Tue, 20 Oct 2026 16:52:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=50169238</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=50169238</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50169238</guid></item><item><title><![CDATA[New comment by omoikane in "I built a drone with only one motor [video]"]]></title><description><![CDATA[
<p>Maybe the pull from a string/leash would affect how the thing flies, kind of like kites.<p>I like how he built a test stand near 7:22, which solves the motor flying off problem and is probably easier to iterate on.  It reminds me of how rockets are tested.</p>
]]></description><pubDate>Mon, 19 Oct 2026 23:53:39 +0000</pubDate><link>https://news.ycombinator.com/item?id=50159563</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=50159563</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50159563</guid></item><item><title><![CDATA[New comment by omoikane in "Furifont, a Japanese font that shows furigana"]]></title><description><![CDATA[
<p>I like how for この先生きのこるには, it has この先生(せんせい) as opposed この先(さき)生(い)きのこる.  Maybe it's learning from memes.<p><a href="https://dic.pixiv.net/a/%E3%81%93%E3%81%AE%E5%85%88%E7%94%9F%E3%81%8D%E3%81%AE%E3%81%93%E3%82%8B%E3%81%AB%E3%81%AF" rel="nofollow">https://dic.pixiv.net/a/%E3%81%93%E3%81%AE%E5%85%88%E7%94%9F...</a></p>
]]></description><pubDate>Sun, 18 Oct 2026 06:31:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=50138436</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=50138436</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50138436</guid></item><item><title><![CDATA[New comment by omoikane in "Show HN: Parin – A 2D game engine between raylib and Godot, written in Dlang"]]></title><description><![CDATA[
<p>I tried D after attending this talk:<p><a href="https://www.youtube.com/watch?v=RlVpPstLPEc" rel="nofollow">https://www.youtube.com/watch?v=RlVpPstLPEc</a><p>My impression was that it strives to be a better C++ by fixing many of the annoyances and providing some well thought out convenience features, and it did a pretty good job.  I thought the multiple version features and being able to write unit tests inline was especially nice.<p>But D came about before C++11 was a thing, and C++11 was a great ergonomic improvement over C++98.  Since C++ got better, I haven't been keeping up with D.</p>
]]></description><pubDate>Sun, 18 Oct 2026 03:03:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=50137513</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=50137513</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50137513</guid></item><item><title><![CDATA[New comment by omoikane in "The Folders Programming Language"]]></title><description><![CDATA[
<p>It says the folders are evaluated in alphabetical order, but actually it's evaluating them in natural sort[1][2].  This makes sense since Windows also displays folders in natural sort order.<p>[1] <a href="https://github.com/rottytooth/Folders/blob/015cf65c15ab681f56d59e912e5ad1b8b7672237/Rottytooth.Esolang.Folders/DirInfoExtensions.cs#L22" rel="nofollow">https://github.com/rottytooth/Folders/blob/015cf65c15ab681f5...</a><p>[2] <a href="https://en.wikipedia.org/wiki/Natural_sort_order" rel="nofollow">https://en.wikipedia.org/wiki/Natural_sort_order</a></p>
]]></description><pubDate>Fri, 16 Oct 2026 15:39:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=50119757</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=50119757</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50119757</guid></item><item><title><![CDATA[New comment by omoikane in "Tweet"]]></title><description><![CDATA[
<p>Going for paid membership is a bold move.  It's also not obvious who is handling payment information, the terms of service only says payment will be processed by a third party.</p>
]]></description><pubDate>Thu, 15 Oct 2026 15:32:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=50105167</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=50105167</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50105167</guid></item><item><title><![CDATA[New comment by omoikane in "Your C is not standard C"]]></title><description><![CDATA[
<p>GCC still not implementing the standard pragmas reminds me of the old GCC pragma easter egg.  This is in cccp.c from gcc 0.9:<p><pre><code>    /*
     * the behavior of the #pragma directive is implementation defined.
     * this implementation defines it as follows.
     */
    do_pragma ()
    {
      close (0);
      if (open ("/dev/tty", O_RDONLY) != 0)
        goto nope;
      close (1);
      if (open ("/dev/tty", O_WRONLY) != 1)
        goto nope;
      execl ("/usr/games/hack", "#pragma", 0);
      execl ("/usr/games/rogue", "#pragma", 0);
      execl ("/usr/new/emacs", "-f", "hanoi", "9", "-kill", 0);
      execl ("/usr/local/emacs", "-f", "hanoi", "9", "-kill", 0);
    nope:
      fatal ("You are in a maze of twisty compiler features, all different");
    }
</code></pre>
It's gone by gcc 1.21:<p><pre><code>    #if 0
    /* This was a fun hack, but #pragma seems to start to be useful.
       By failing to recognize it, we pass it through unchanged to cc1.  */
    ...
    #endif</code></pre></p>
]]></description><pubDate>Thu, 15 Oct 2026 02:31:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=50098442</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=50098442</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50098442</guid></item><item><title><![CDATA[New comment by omoikane in "Recreational Programming"]]></title><description><![CDATA[
<p>The examples seem to lean toward "code as means to an end", e.g. making random tools.  There is also recreational programming where the code itself is the goal.  Examples include IOCCC[1] and a lot of stuff by Yusuke Endoh[2].  I also have a few[3].<p>[1] <a href="https://www.ioccc.org/years.html" rel="nofollow">https://www.ioccc.org/years.html</a><p>[2] <a href="https://news.ycombinator.com/from?site=github.com/mame">https://news.ycombinator.com/from?site=github.com/mame</a><p>[3] <a href="https://uguu.org/sources.html" rel="nofollow">https://uguu.org/sources.html</a></p>
]]></description><pubDate>Wed, 14 Oct 2026 16:33:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=50090449</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=50090449</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50090449</guid></item><item><title><![CDATA[New comment by omoikane in "Firefox Enterprise"]]></title><description><![CDATA[
<p>> people are going to try and install Chrome at all costs<p>Mozilla might have anticipated this when they wrote "Diversify your browser engine" as one of the selling points.<p><a href="https://www.firefox.com/en-US/enterprise/firefox-enterprise/#:~:text=Diversify%20your%20browser%20engine" rel="nofollow">https://www.firefox.com/en-US/enterprise/firefox-enterprise/...</a><p>Diversification is a good idea, personally I use both Chrome and Firefox every day (and sometimes Lynx).</p>
]]></description><pubDate>Tue, 13 Oct 2026 16:39:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=50074582</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=50074582</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50074582</guid></item><item><title><![CDATA[New comment by omoikane in "A look at the math that OpenAI claims computes faster Fourier transforms"]]></title><description><![CDATA[
<p>> This new OpenAI result is thus less a mathematical breakthrough and more an oddity of computer scientists being bad at formalizing their design specifications.<p>Related, another article about proofs that may depend on bad formalizations:<p><a href="https://news.ycombinator.com/item?id=49994145">https://news.ycombinator.com/item?id=49994145</a> - Navier-Stokes Lost in Translation (5 days ago, 237 comments)<p>AI seems to be very good at getting answers, but not always answers to the correct questions.  These remind me of Deep Thought from The Hitchhiker's Guide to the Galaxy, where they got an answer to the ultimate question before actually knowing what the ultimate question is.</p>
]]></description><pubDate>Tue, 13 Oct 2026 04:39:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=50066797</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=50066797</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50066797</guid></item><item><title><![CDATA[New comment by omoikane in "The RAM shortage is bringing back DDR4"]]></title><description><![CDATA[
<p>This article saying DDR4 is making a comeback, and all the comments here saying DDR4 never went away, reminds me of the submarine ("Suits make a corporate comeback").<p><a href="https://paulgraham.com/submarine.html" rel="nofollow">https://paulgraham.com/submarine.html</a></p>
]]></description><pubDate>Sun, 11 Oct 2026 20:41:12 +0000</pubDate><link>https://news.ycombinator.com/item?id=50047611</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=50047611</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50047611</guid></item><item><title><![CDATA[New comment by omoikane in "100+ reactions to 100+ solutions"]]></title><description><![CDATA[
<p>> People still play chess and go and StarCraft<p>Those are activities where repeating the same experience yourself is still enjoyable, kind of like you might eat today even though you already ate yesterday.<p>Finding mathematical proofs is probably more like seeing the ending to a mystery novel.  Once the ending has been spoiled for you, it's really hard for you to enjoy it the same way, and it might be more fun to move on to a different mystery.</p>
]]></description><pubDate>Fri, 09 Oct 2026 16:05:49 +0000</pubDate><link>https://news.ycombinator.com/item?id=50022539</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=50022539</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50022539</guid></item><item><title><![CDATA[New comment by omoikane in "Yes, and"]]></title><description><![CDATA[
<p>> increase in speed of new features<p>But who will maintain those features going forward?<p>> I also see a lot of Devs simply trusting that the code is correct, they are losing touch with the code.<p>My worry is that developers can't outsource their understanding to AI forever.  It's a lot of risk for companies to be accumulating code faster than developers can understand them.</p>
]]></description><pubDate>Thu, 08 Oct 2026 22:20:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=50013212</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=50013212</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50013212</guid></item><item><title><![CDATA[New comment by omoikane in "When random is not actually random enough"]]></title><description><![CDATA[
<p>> rand() Itself has only 32767 possible values<p>For MingW maybe (due to MSVCRT).  I think most libraries such as glibc have RAND_MAX at 2147483647.</p>
]]></description><pubDate>Wed, 07 Oct 2026 03:13:02 +0000</pubDate><link>https://news.ycombinator.com/item?id=49987640</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=49987640</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49987640</guid></item><item><title><![CDATA[New comment by omoikane in "Sharing AI progress in mathematics"]]></title><description><![CDATA[
<p>Did you mean this one?<p><a href="https://github.com/openai/math/tree/main/preprints/The-Quasi-Riemann-Hypothesis-October-5-2026" rel="nofollow">https://github.com/openai/math/tree/main/preprints/The-Quasi...</a><p>I thought it was interesting that it said "This paper was written with human assistance", unlike this other Quasi-Riemann Hypothesis preprint that didn't have the same disclaimer.<p><a href="https://github.com/openai/math/tree/main/preprints/The-Quasi-Riemann-Hypothesis-September-30-2026" rel="nofollow">https://github.com/openai/math/tree/main/preprints/The-Quasi...</a></p>
]]></description><pubDate>Wed, 07 Oct 2026 02:58:15 +0000</pubDate><link>https://news.ycombinator.com/item?id=49987534</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=49987534</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49987534</guid></item><item><title><![CDATA[New comment by omoikane in "Dirty Optimization Secrets (C for Playdate)"]]></title><description><![CDATA[
<p>These optimizations are part of what makes Playdate development fun, since they are more rewarding on the Playdate than on other platforms with higher specs.<p>(If you are the kind of person that finds optimizations fun, of course.  There is a puzzle solving element of optimizing code that I really enjoy.)</p>
]]></description><pubDate>Sun, 04 Oct 2026 16:18:39 +0000</pubDate><link>https://news.ycombinator.com/item?id=49955238</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=49955238</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49955238</guid></item><item><title><![CDATA[New comment by omoikane in ""8-pinski" – EIGHT() bytes intro for MSDOS [video]"]]></title><description><![CDATA[
<p>I believe it works like this:<p><pre><code>    Initial setup:
    0100 c5 30  lds si,[bx+si]   ; Initialize SI
    0102 04 ad  add al,ad
    0104 e6 61  out 61,al
    0106 eb f9  jmp 0101

    After first jump:
    0101 30 04  xor [si],al      ; Modify color part of text buffer.
    0103 ad     lodsw            ; Read [si] into AX and increment SI by 2.
    0104 e6 61  out 61,al
    0106 eb f9  jmp 0101
</code></pre>
So the XOR sort of randomizes memory, LODSW reads that memory back (with wraparound), and then writing to port 61h may or may not play a sound depending on bit 0 of AL.<p>The part I am not sure about is how SI conveniently ends up pointing at video memory.  I thought text memory is at b800:0000, and I am not sure how that's derived from [bx+si]?</p>
]]></description><pubDate>Sun, 04 Oct 2026 00:49:57 +0000</pubDate><link>https://news.ycombinator.com/item?id=49949429</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=49949429</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49949429</guid></item><item><title><![CDATA[New comment by omoikane in "Memory-Safe WebP Decoding"]]></title><description><![CDATA[
<p>I am not sure what's the current status of Wuffs-based WebP decoder, but that would be another implementation worth comparing since it shares the same goals of safety and speed.<p><a href="https://github.com/google/wuffs/tree/main/std/webp" rel="nofollow">https://github.com/google/wuffs/tree/main/std/webp</a></p>
]]></description><pubDate>Sat, 03 Oct 2026 16:21:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=49945568</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=49945568</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49945568</guid></item><item><title><![CDATA[New comment by omoikane in "I could've accessed 17T Microsoft records"]]></title><description><![CDATA[
<p>Every HN post regarding security exploits inevitably results in some comment saying the bounty is too low.  I find it helpful to read previous comments by tptacek regarding bug bounties and market values:<p><a href="https://hn.algolia.com/?dateRange=all&page=0&prefix=true&query=tptacek%20bounty%20market&sort=byDate&type=comment" rel="nofollow">https://hn.algolia.com/?dateRange=all&page=0&prefix=true&que...</a><p>This one probably has the best summary:<p><a href="https://news.ycombinator.com/item?id=43025038">https://news.ycombinator.com/item?id=43025038</a></p>
]]></description><pubDate>Wed, 30 Sep 2026 18:18:35 +0000</pubDate><link>https://news.ycombinator.com/item?id=49912449</link><dc:creator>omoikane</dc:creator><comments>https://news.ycombinator.com/item?id=49912449</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49912449</guid></item></channel></rss>