<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: ashdnazg</title><link>https://news.ycombinator.com/user?id=ashdnazg</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Wed, 08 Apr 2026 01:44:25 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=ashdnazg" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by ashdnazg in "DeiMOS – A Superoptimizer for the MOS 6502"]]></title><description><![CDATA[
<p>I did some manual golfing with nand2tetris assembly and developed similar hacks to the max() implementation, where one appropriates  an arbitrary, conveniently placed, memory address.<p>After reading the article, though, I feel like I definitely need a superoptimiser, to see what could be improved :)</p>
]]></description><pubDate>Tue, 07 Apr 2026 17:08:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=47678368</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=47678368</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47678368</guid></item><item><title><![CDATA[New comment by ashdnazg in "Show HN: A game where you build a GPU"]]></title><description><![CDATA[
<p>I can also thoroughly recommend <a href="https://store.steampowered.com/app/684270/Silicon_Zeroes/" rel="nofollow">https://store.steampowered.com/app/684270/Silicon_Zeroes/</a> which uses smart design to remove having to deal with binary in the circuit design. This reduces complexity by a surprising amount.</p>
]]></description><pubDate>Sun, 05 Apr 2026 06:13:50 +0000</pubDate><link>https://news.ycombinator.com/item?id=47646579</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=47646579</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47646579</guid></item><item><title><![CDATA[New comment by ashdnazg in "Even faster asin() was staring right at me"]]></title><description><![CDATA[
<p>No idea if it's not already optimised, but x2 could also be x*x and not just abs_x * abs_x, shifting the dependencies earlier.</p>
]]></description><pubDate>Mon, 16 Mar 2026 16:14:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=47400981</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=47400981</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47400981</guid></item><item><title><![CDATA[New comment by ashdnazg in "Poor Man's Polaroid"]]></title><description><![CDATA[
<p>If you're using mobile, there's an "English" button in the menu.<p>Note to website owner - it could be nice to have a permalink to the English version.</p>
]]></description><pubDate>Thu, 05 Mar 2026 10:08:35 +0000</pubDate><link>https://news.ycombinator.com/item?id=47259862</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=47259862</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47259862</guid></item><item><title><![CDATA[New comment by ashdnazg in "Reversed engineered game Starflight (1986)"]]></title><description><![CDATA[
<p>> for this game you can throw the usual tools away...<p>> The reason is that Starflight was written in Forth<p>I recently reverse-engineered another game from the 80's, and had a similar issue because it was written with Turbo Pascal.<p>The different tools didn't like quirks such as data stored inline between the instructions or every library function having a different calling convention.<p>Turns out the simplest way to handle this was to write my own decompiler, since Turbo Pascal 3 didn't do any optimisations.</p>
]]></description><pubDate>Sun, 15 Feb 2026 14:27:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=47023948</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=47023948</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47023948</guid></item><item><title><![CDATA[New comment by ashdnazg in "Pre-Steal This Book (2008)"]]></title><description><![CDATA[
<p>In academia, seeing your research being published by someone else sucks, but the consolation prize is that you know you had the right instincts choosing what to research.</p>
]]></description><pubDate>Sun, 01 Feb 2026 11:21:06 +0000</pubDate><link>https://news.ycombinator.com/item?id=46845393</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=46845393</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46845393</guid></item><item><title><![CDATA[New comment by ashdnazg in "Ask HN: Share your personal website"]]></title><description><![CDATA[
<p><a href="https://ashdnazg.github.io" rel="nofollow">https://ashdnazg.github.io</a><p>Mostly silly posts about silly projects.</p>
]]></description><pubDate>Wed, 14 Jan 2026 22:25:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=46624648</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=46624648</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46624648</guid></item><item><title><![CDATA[New comment by ashdnazg in "Advent of Code 2025"]]></title><description><![CDATA[
<p>My wife did one of the years in Matlab. Some of the problems translate very nicely into vectors and matrices.</p>
]]></description><pubDate>Sun, 30 Nov 2025 16:57:39 +0000</pubDate><link>https://news.ycombinator.com/item?id=46098301</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=46098301</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46098301</guid></item><item><title><![CDATA[New comment by ashdnazg in "Why Zig Is Quietly Doing What Rust Couldn't: Staying Simple"]]></title><description><![CDATA[
<p>Seems to be hugged to death: <a href="https://archive.is/UauYs" rel="nofollow">https://archive.is/UauYs</a></p>
]]></description><pubDate>Thu, 20 Nov 2025 09:01:35 +0000</pubDate><link>https://news.ycombinator.com/item?id=45990558</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=45990558</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45990558</guid></item><item><title><![CDATA[New comment by ashdnazg in "A file format uncracked for 20 years"]]></title><description><![CDATA[
<p>The bare basics are working with a hex editor and understanding data types - ints, floats, null-terminated strings, length-prefixed strings etc.<p>I'd recommend taking a well documented binary file format (Doom WAD file?), go over the documentation, and see that you manage to see the individual values in the hex editor.<p>Now, after you have a feel for how things might look in hex, look at your own file. Start by saving an empty project from your program and identifying the header, maybe it's compressed?<p>If it's not, change a tiny thing in the program and save again, compare the files to see what changed. Or alternatively change the file a tiny bit and load it.<p>Write a parser and add things as you learn more. If the file isn't intentionally obfuscated, it should probably be just a matter of persevering until you can parse the entire file.</p>
]]></description><pubDate>Mon, 17 Nov 2025 10:03:45 +0000</pubDate><link>https://news.ycombinator.com/item?id=45952270</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=45952270</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45952270</guid></item><item><title><![CDATA[Abusing the Harvard Architecture in Nand2Tetris Assembly]]></title><description><![CDATA[
<p>Article URL: <a href="https://ashdnazg.github.io/articles/25/Abusing-Harvard-Architecture">https://ashdnazg.github.io/articles/25/Abusing-Harvard-Architecture</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=45858907">https://news.ycombinator.com/item?id=45858907</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 08 Nov 2025 18:44:44 +0000</pubDate><link>https://ashdnazg.github.io/articles/25/Abusing-Harvard-Architecture</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=45858907</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45858907</guid></item><item><title><![CDATA[New comment by ashdnazg in "Ask HN: What are you working on? (October 2025)"]]></title><description><![CDATA[
<p>First of all, really cool initiative!<p>It's interesting that a bunch of the funded products have been funded by a single person.<p>Do you know if it's the producers themselves? Worried rich people?</p>
]]></description><pubDate>Sun, 12 Oct 2025 21:57:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=45562336</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=45562336</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45562336</guid></item><item><title><![CDATA[New comment by ashdnazg in "Ask HN: What are you working on? (October 2025)"]]></title><description><![CDATA[
<p>Porting my binary & decimal palindromes[0] finding code[1] to CUDA, with which I had no experience before starting this project.<p>It's already working, and slightly faster than the CPU version, but that's far from an acceptable result. The occupancy (which is a term I first learned this week) is currently at a disappointing 50%, so there's a clear target for optimisation.<p>Once I'm satisfied with how the code runs on my modest GPU at home, the plan is to use some online GPU renting service to make it go brrrrrrrrrr and see how many new elements I can find in the series.<p>[0] <a href="https://oeis.org/A007632" rel="nofollow">https://oeis.org/A007632</a><p>[1] <a href="https://github.com/ashdnazg/palindromes" rel="nofollow">https://github.com/ashdnazg/palindromes</a></p>
]]></description><pubDate>Sun, 12 Oct 2025 21:51:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=45562282</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=45562282</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45562282</guid></item><item><title><![CDATA[New comment by ashdnazg in "The Weird Concept of Branchless Programming"]]></title><description><![CDATA[
<p>O(n^2) isn't required. One could do an in-place merge-sort, which is also always worst case, but with O(n*log(n)).<p>I suspect everyone turns to Bubblesort since the inputs are small enough that it doesn't matter (evident by the fact that it should fit within microseconds).</p>
]]></description><pubDate>Mon, 29 Sep 2025 08:40:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=45411567</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=45411567</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45411567</guid></item><item><title><![CDATA[New comment by ashdnazg in "How is Ultrassembler so fast?"]]></title><description><![CDATA[
<p>You could copy the instruction to a 16 byte sized buffer and hash the one/two int64s. Looking at the code sample in the article, there wasn't a single instruction longer than 5 characters, and I suspect that in general instructions with short names are more common than those with long names.<p>This last fact might actually support the current model, as it grows linearly-ish in the size of the instruction, instead of being constant like hash.</p>
]]></description><pubDate>Sun, 31 Aug 2025 22:23:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=45087643</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=45087643</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45087643</guid></item><item><title><![CDATA[New comment by ashdnazg in "Emulating aarch64 in software using JIT compilation and Rust"]]></title><description><![CDATA[
<p>Yes, and I would even go as far as saying that even being functional isn't required. Trying to make something cool and failing counts as "hacker spirit".<p>It all boils down to getting your hands dirty, instead of passively consuming the products of others.</p>
]]></description><pubDate>Sat, 30 Aug 2025 11:32:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=45073779</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=45073779</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45073779</guid></item><item><title><![CDATA[16-Bit Fast Inverse Square Root]]></title><description><![CDATA[
<p>Article URL: <a href="https://ashdnazg.github.io/articles/25/16-bit-Fast-Inverse-Square-Root">https://ashdnazg.github.io/articles/25/16-bit-Fast-Inverse-Square-Root</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=44998968">https://news.ycombinator.com/item?id=44998968</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 23 Aug 2025 20:41:20 +0000</pubDate><link>https://ashdnazg.github.io/articles/25/16-bit-Fast-Inverse-Square-Root</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=44998968</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44998968</guid></item><item><title><![CDATA[New comment by ashdnazg in "Twenty Eighth International Obfuscated C Code Contest"]]></title><description><![CDATA[
<p>argv[0]</p>
]]></description><pubDate>Sun, 03 Aug 2025 13:20:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=44776400</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=44776400</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44776400</guid></item><item><title><![CDATA[New comment by ashdnazg in "Phrase origin: Why do we "call" functions?"]]></title><description><![CDATA[
<p>I thought it's like hopping onto a bus. Then it doesn't take a lot for "hop" to change into "jump".</p>
]]></description><pubDate>Wed, 09 Jul 2025 12:13:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=44509074</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=44509074</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44509074</guid></item><item><title><![CDATA[New comment by ashdnazg in "Ask HN: What Are You Working On? (June 2025)"]]></title><description><![CDATA[
<p>A bit of a niche game: <a href="https://www.mobygames.com/game/63804/socher-hayam/" rel="nofollow">https://www.mobygames.com/game/63804/socher-hayam/</a><p>Although it has cult status in Israel for some reason.</p>
]]></description><pubDate>Mon, 30 Jun 2025 07:52:34 +0000</pubDate><link>https://news.ycombinator.com/item?id=44420592</link><dc:creator>ashdnazg</dc:creator><comments>https://news.ycombinator.com/item?id=44420592</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44420592</guid></item></channel></rss>