<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: Spoof7726</title><link>https://news.ycombinator.com/user?id=Spoof7726</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Fri, 23 Oct 2026 09:02:36 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=Spoof7726" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by Spoof7726 in "Fish 4.0: The Fish of Theseus"]]></title><description><![CDATA[
<p>> Fish also uses threads for its award-winning (note to editor: find an actual award) autosuggestions and syntax highlighting, and one long-term project is to add concurrency to the language.<p>(note to editor: find an actual award)</p>
]]></description><pubDate>Sat, 28 Dec 2024 23:39:16 +0000</pubDate><link>https://news.ycombinator.com/item?id=42535898</link><dc:creator>Spoof7726</dc:creator><comments>https://news.ycombinator.com/item?id=42535898</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42535898</guid></item><item><title><![CDATA[New comment by Spoof7726 in "How to pack ternary numbers in 8-bit bytes"]]></title><description><![CDATA[
<p>I completely agree. I don’t think the paper is practical either; I shared it only to show that random access is possible in theory.</p>
]]></description><pubDate>Thu, 05 Dec 2024 20:35:18 +0000</pubDate><link>https://news.ycombinator.com/item?id=42332470</link><dc:creator>Spoof7726</dc:creator><comments>https://news.ycombinator.com/item?id=42332470</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42332470</guid></item><item><title><![CDATA[New comment by Spoof7726 in "How to pack ternary numbers in 8-bit bytes"]]></title><description><![CDATA[
<p>Because division is not trivial. Even computing x mod 3 for an n-bit integer x is O(n), if x is represented in the binary form.</p>
]]></description><pubDate>Thu, 05 Dec 2024 20:28:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=42332395</link><dc:creator>Spoof7726</dc:creator><comments>https://news.ycombinator.com/item?id=42332395</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42332395</guid></item><item><title><![CDATA[New comment by Spoof7726 in "How to pack ternary numbers in 8-bit bytes"]]></title><description><![CDATA[
<p>This is exactly a Succinct Data Structure. The solution proposed by the author doesn't allow random access; that is, you can't access a specific A[i] unless you unpack all of them. There is some research (e.g., [1]) allowing random access within reasonable time with slightly more storage, although it is almost entirely of theoretical interest.<p>[1]: Mihai Patrascu, Succincter, FOCS 2008 best student paper.</p>
]]></description><pubDate>Thu, 05 Dec 2024 19:19:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=42331595</link><dc:creator>Spoof7726</dc:creator><comments>https://news.ycombinator.com/item?id=42331595</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42331595</guid></item></channel></rss>