<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: ArchAndStarch</title><link>https://news.ycombinator.com/user?id=ArchAndStarch</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Fri, 10 Apr 2026 04:44:08 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=ArchAndStarch" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by ArchAndStarch in "Native Instant Space Switching on macOS"]]></title><description><![CDATA[
<p>Actually, that was just recently merged into InstantSpaceSwitcher!</p>
]]></description><pubDate>Fri, 10 Apr 2026 01:50:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=47712630</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=47712630</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47712630</guid></item><item><title><![CDATA[New comment by ArchAndStarch in "Native Instant Space Switching on macOS"]]></title><description><![CDATA[
<p>Check out <a href="https://github.com/joshuarli/iss" rel="nofollow">https://github.com/joshuarli/iss</a> !</p>
]]></description><pubDate>Thu, 09 Apr 2026 22:25:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=47711063</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=47711063</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47711063</guid></item><item><title><![CDATA[New comment by ArchAndStarch in "Native Instant Space Switching on macOS"]]></title><description><![CDATA[
<p>Hey, author here, and cool project! I spent some time comparing Yabai's scripting addition to InstantSpaces' scripting addition. They seem to be doing the exact same thing, but Yabai works while InstantSpaces doesn't, and I eventually gave up trying to figure out why.<p>Regardless, I still prefer InstantSpaceSwitcher because its implementation is simpler and it doesn't require disabling SIP. If you can get it working, however, I can edit my blog post to say so!</p>
]]></description><pubDate>Thu, 09 Apr 2026 22:20:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=47711007</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=47711007</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47711007</guid></item><item><title><![CDATA[How many iconic computing numbers can you recognize?]]></title><description><![CDATA[
<p>Article URL: <a href="https://numbers.arhan.sh/">https://numbers.arhan.sh/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46842165">https://news.ycombinator.com/item?id=46842165</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 31 Jan 2026 23:58:36 +0000</pubDate><link>https://numbers.arhan.sh/</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=46842165</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46842165</guid></item><item><title><![CDATA[New comment by ArchAndStarch in "Memory-Corrupting Pong"]]></title><description><![CDATA[
<p>Allocating heap memory on the screen</p>
]]></description><pubDate>Mon, 17 Nov 2025 18:54:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=45956686</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=45956686</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45956686</guid></item><item><title><![CDATA[Memory-Corrupting Pong]]></title><description><![CDATA[
<p>Article URL: <a href="https://arhan.sh/blog/memory-corrupting-pong/">https://arhan.sh/blog/memory-corrupting-pong/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45956685">https://news.ycombinator.com/item?id=45956685</a></p>
<p>Points: 3</p>
<p># Comments: 1</p>
]]></description><pubDate>Mon, 17 Nov 2025 18:54:10 +0000</pubDate><link>https://arhan.sh/blog/memory-corrupting-pong/</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=45956685</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45956685</guid></item><item><title><![CDATA[The Generativity Pattern in Rust]]></title><description><![CDATA[
<p>Article URL: <a href="https://arhan.sh/blog/the-generativity-pattern-in-rust/">https://arhan.sh/blog/the-generativity-pattern-in-rust/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=44803469">https://news.ycombinator.com/item?id=44803469</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 05 Aug 2025 19:59:34 +0000</pubDate><link>https://arhan.sh/blog/the-generativity-pattern-in-rust/</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=44803469</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44803469</guid></item><item><title><![CDATA[How many iconic computing numbers can you recognize? (V2)]]></title><description><![CDATA[
<p>Article URL: <a href="https://numbers.arhan.sh/">https://numbers.arhan.sh/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=42801140">https://news.ycombinator.com/item?id=42801140</a></p>
<p>Points: 3</p>
<p># Comments: 1</p>
]]></description><pubDate>Thu, 23 Jan 2025 06:00:20 +0000</pubDate><link>https://numbers.arhan.sh/</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=42801140</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42801140</guid></item><item><title><![CDATA[New comment by ArchAndStarch in "Keymashed: Motivate your internet by mashing your keyboard"]]></title><description><![CDATA[
<p>Ya know, how sometimes your computer's internet is slow?<p>What if... you could motivate it. Make the internet itself flow a lil' quicker.<p>Since making the internet faster is a hard research problem, keymashed instead worsens the internet and then eases up proportional to how fast you mash the keyboard. It features:<p>- an overengineered network protocol
- a from-scratch video codec based on JPEG
- humor</p>
]]></description><pubDate>Mon, 06 Jan 2025 17:41:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=42612854</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=42612854</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42612854</guid></item><item><title><![CDATA[Keymashed: Motivate your internet by mashing your keyboard]]></title><description><![CDATA[
<p>Article URL: <a href="https://github.com/kartva/keymashed">https://github.com/kartva/keymashed</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=42612853">https://news.ycombinator.com/item?id=42612853</a></p>
<p>Points: 13</p>
<p># Comments: 2</p>
]]></description><pubDate>Mon, 06 Jan 2025 17:41:10 +0000</pubDate><link>https://github.com/kartva/keymashed</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=42612853</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42612853</guid></item><item><title><![CDATA[New comment by ArchAndStarch in "How many iconic computing numbers can you recognize?"]]></title><description><![CDATA[
<p>I wanted to stay consistent with the 3-6 digits per number rule to make the challenge easier to figure out in general. There are only two numbers that are actually truncated, so hopefully it isn't that big of a problem.</p>
]]></description><pubDate>Fri, 23 Aug 2024 18:14:20 +0000</pubDate><link>https://news.ycombinator.com/item?id=41331505</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=41331505</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41331505</guid></item><item><title><![CDATA[New comment by ArchAndStarch in "How many iconic computing numbers can you recognize?"]]></title><description><![CDATA[
<p>I'm a huge fan of both computer science and secret messages. If that's your cup of tea, I challenge you to decipher this secret message in under 30 guesses and test your general knowledge of computing.</p>
]]></description><pubDate>Fri, 23 Aug 2024 14:14:05 +0000</pubDate><link>https://news.ycombinator.com/item?id=41329202</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=41329202</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41329202</guid></item><item><title><![CDATA[How many iconic computing numbers can you recognize?]]></title><description><![CDATA[
<p>Article URL: <a href="https://arhan.sh/blog/how-many-iconic-computing-numbers-can-you-recognize/">https://arhan.sh/blog/how-many-iconic-computing-numbers-can-you-recognize/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=41329201">https://news.ycombinator.com/item?id=41329201</a></p>
<p>Points: 4</p>
<p># Comments: 5</p>
]]></description><pubDate>Fri, 23 Aug 2024 14:14:05 +0000</pubDate><link>https://arhan.sh/blog/how-many-iconic-computing-numbers-can-you-recognize/</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=41329201</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41329201</guid></item><item><title><![CDATA[Implementing strict equality in JavaScript from scratch]]></title><description><![CDATA[
<p>Article URL: <a href="https://arhan.sh/blog/implementing-strict-equality-in-javascript-from-scratch/">https://arhan.sh/blog/implementing-strict-equality-in-javascript-from-scratch/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=41278140">https://news.ycombinator.com/item?id=41278140</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 17 Aug 2024 21:30:40 +0000</pubDate><link>https://arhan.sh/blog/implementing-strict-equality-in-javascript-from-scratch/</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=41278140</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=41278140</guid></item><item><title><![CDATA[My GitHub repository has 100k contributors]]></title><description><![CDATA[
<p>Article URL: <a href="https://arhan.sh/blog/my-github-repository-has-100000-contributors/">https://arhan.sh/blog/my-github-repository-has-100000-contributors/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=40846095">https://news.ycombinator.com/item?id=40846095</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 01 Jul 2024 14:22:11 +0000</pubDate><link>https://arhan.sh/blog/my-github-repository-has-100000-contributors/</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=40846095</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40846095</guid></item><item><title><![CDATA[New comment by ArchAndStarch in "Show HN: I made a programmable computer from NAND gates"]]></title><description><![CDATA[
<p>Oh wow, I didn't actually know that. Thanks for the interesting trivia</p>
]]></description><pubDate>Fri, 26 Apr 2024 03:53:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=40165814</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=40165814</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40165814</guid></item><item><title><![CDATA[New comment by ArchAndStarch in "Show HN: I made a programmable computer from NAND gates"]]></title><description><![CDATA[
<p>One curious idea my friends have entertained is to go one level even deeper and emulate the very transistors that make up the NAND gates on the web, too. It would certainly spell disaster for performance, but it's without-a-doubt interesting.</p>
]]></description><pubDate>Fri, 26 Apr 2024 01:26:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=40164977</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=40164977</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40164977</guid></item><item><title><![CDATA[New comment by ArchAndStarch in "Show HN: I made a programmable computer from NAND gates"]]></title><description><![CDATA[
<p>I primarily used the physical book to learn about the nand2tetris platform. I highly recommend it, it's an enthralling read</p>
]]></description><pubDate>Thu, 25 Apr 2024 21:51:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=40163520</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=40163520</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40163520</guid></item><item><title><![CDATA[New comment by ArchAndStarch in "Show HN: I made a programmable computer from NAND gates"]]></title><description><![CDATA[
<p>I've inspected my code closely. Every clock cycle, the NAND gate is used 3,234 times :)</p>
]]></description><pubDate>Thu, 25 Apr 2024 20:25:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=40162554</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=40162554</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40162554</guid></item><item><title><![CDATA[New comment by ArchAndStarch in "Show HN: I made a programmable computer from NAND gates"]]></title><description><![CDATA[
<p>A few nand2tetris fanatics have actually done this! And by a few, I mean quite a lot of people. Here's one such hardware project of nand2tetris: <a href="https://gitlab.com/x653/nand2tetris-fpga/" rel="nofollow">https://gitlab.com/x653/nand2tetris-fpga/</a><p>But you can Google "nand2tetris fpga" for more.</p>
]]></description><pubDate>Thu, 25 Apr 2024 19:52:49 +0000</pubDate><link>https://news.ycombinator.com/item?id=40162205</link><dc:creator>ArchAndStarch</dc:creator><comments>https://news.ycombinator.com/item?id=40162205</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=40162205</guid></item></channel></rss>