<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: duskwuff</title><link>https://news.ycombinator.com/user?id=duskwuff</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Mon, 17 Aug 2026 04:39:42 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=duskwuff" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by duskwuff in "Research papers using "kidney disappointment" instead of "kidney failure""]]></title><description><![CDATA[
<p><a href="https://arxiv.org/abs/2107.06751" rel="nofollow">https://arxiv.org/abs/2107.06751</a> found that a lot of the outputs were characteristic of an online tool called SpinBot. (The tool no longer seems to work the same way that it did at the time.)</p>
]]></description><pubDate>Sun, 16 Aug 2026 19:53:51 +0000</pubDate><link>https://news.ycombinator.com/item?id=49323075</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49323075</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49323075</guid></item><item><title><![CDATA[New comment by duskwuff in "Show HN: A public AI whose memory is shared across all users"]]></title><description><![CDATA[
<p>> I'd love to see this concept but instead of remembering what people said, the chatbot is "convinced" of things by others.<p>I'm not sure this is feasible, given how LLMs work. Context is finite, and it doesn't replace training data.</p>
]]></description><pubDate>Sun, 16 Aug 2026 19:45:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=49323019</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49323019</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49323019</guid></item><item><title><![CDATA[New comment by duskwuff in "Research papers using "kidney disappointment" instead of "kidney failure""]]></title><description><![CDATA[
<p>The phenomenon of tortured phrases in published papers has been going on since at least 2020 - long before LLMs were a significant factor, and certainly before watermarking their output was a consideration.<p>The general working theory is that these phrases are the result of a "text spinner" tool being applied to a manuscript and blindly replacing random words or phrases using a preset list of synonyms (which are often imprecise and/or inappropriate). <a href="https://arxiv.org/abs/2107.06751" rel="nofollow">https://arxiv.org/abs/2107.06751</a> found that many of the commonly observed phrases were characteristic of an online text-spinning tool.</p>
]]></description><pubDate>Sun, 16 Aug 2026 19:41:01 +0000</pubDate><link>https://news.ycombinator.com/item?id=49322977</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49322977</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49322977</guid></item><item><title><![CDATA[New comment by duskwuff in "Research papers using "kidney disappointment" instead of "kidney failure""]]></title><description><![CDATA[
<p>Some more examples of these tortured phrases: <a href="https://arxiv.org/abs/2107.06751" rel="nofollow">https://arxiv.org/abs/2107.06751</a><p>A few of my favorites are "counterfeit consciousness" (artificial intelligence), "discourse acknowledgement" (voice recognition), and "arbitrary get right of passage to memory" (random access memory).</p>
]]></description><pubDate>Sun, 16 Aug 2026 19:37:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=49322956</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49322956</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49322956</guid></item><item><title><![CDATA[New comment by duskwuff in "RISC-V: They Should Have Known Better"]]></title><description><![CDATA[
<p>The ARM ISAs are not free to implement. ARM holds patents relevant to the ISA.</p>
]]></description><pubDate>Sat, 15 Aug 2026 00:01:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=49306090</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49306090</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49306090</guid></item><item><title><![CDATA[New comment by duskwuff in "Idol Mahjong Final Romance: A Slideshow Disguised as a Video Game"]]></title><description><![CDATA[
<p>Given that they're on the audio board, they're almost certainly volume controls.</p>
]]></description><pubDate>Thu, 13 Aug 2026 22:56:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=49292777</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49292777</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49292777</guid></item><item><title><![CDATA[New comment by duskwuff in "Compression is prediction"]]></title><description><![CDATA[
<p>A common design in compressors is to use LZ as a first step, but to then represent the constant data and/or offset-length pairs from LZ using an entropy coder.<p>Deflate (as used in gzip) uses a Huffman coder. LZMA (as used by xz) uses a predictive range coder. Zstandard can use either Huffman or FSE. Some high-speed compressors like LZ4 skip the entropy coding stage entirely at the expense of compression ratio.<p>Bzip2 is an interesting aversion of this pattern - it uses the Burrows-Wheeler transform as a first pass instead of LZ. Unfortunately, this is one of the major reasons why it's so slow.</p>
]]></description><pubDate>Tue, 11 Aug 2026 20:46:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=49264240</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49264240</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49264240</guid></item><item><title><![CDATA[New comment by duskwuff in "Andrew Wiles on proving Fermat’s Last Theorem (1995) [video]"]]></title><description><![CDATA[
<p>I have to agree. Even if it hadn't been designated as Fermat's Last Theorem, the problem would likely have ended up in some comparable list of interesting conjectures (e.g. Hilbert's problems, the Erdős problems, the Millennium Prize problems, etc).</p>
]]></description><pubDate>Mon, 10 Aug 2026 06:23:05 +0000</pubDate><link>https://news.ycombinator.com/item?id=49239917</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49239917</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49239917</guid></item><item><title><![CDATA[New comment by duskwuff in "I've yet to see any"My AI went rogue and caused us to recognise a workers union"]]></title><description><![CDATA[
<p>A news story from a couple of years ago comes to mind - "Air Canada ordered to pay customer who was misled by airline’s chatbot". <a href="https://www.theguardian.com/world/2024/feb/16/air-canada-chatbot-lawsuit" rel="nofollow">https://www.theguardian.com/world/2024/feb/16/air-canada-cha...</a></p>
]]></description><pubDate>Sun, 09 Aug 2026 21:32:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=49236192</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49236192</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49236192</guid></item><item><title><![CDATA[New comment by duskwuff in "When Compilers Disagree About UTF‑8"]]></title><description><![CDATA[
<p>> So if you detect usage of 3-byte encodings, chances are you'll continue encountering only 3-byte encodings, with the odd ASCII or emoji codepoints.<p>Depends on what kind of text you're processing. Many languages use the ASCII range for spaces/newlines, digits, and punctuation.</p>
]]></description><pubDate>Sun, 09 Aug 2026 20:54:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=49235767</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49235767</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49235767</guid></item><item><title><![CDATA[New comment by duskwuff in "A year of fighting scrapers on my 1.5 million-page website"]]></title><description><![CDATA[
<p>Technically true, but the list is mostly nonfunctional - cryptominers are basically extinct in the wild, and most of the domains on the list have expired or no longer serve mining scripts.</p>
]]></description><pubDate>Fri, 07 Aug 2026 20:55:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=49216141</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49216141</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49216141</guid></item><item><title><![CDATA[New comment by duskwuff in "A year of fighting scrapers on my 1.5 million-page website"]]></title><description><![CDATA[
<p>Per personal communication, this is <i>precisely</i> why the developer did that.</p>
]]></description><pubDate>Fri, 07 Aug 2026 20:52:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=49216111</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49216111</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49216111</guid></item><item><title><![CDATA[New comment by duskwuff in "Can you reverse engineer an ASIC?"]]></title><description><![CDATA[
<p>> Theoretically Yes, as an ion-beam-mill and electron-microscope combination machine can slice up semiconductors layer-by-layer.<p>You may not even need anything as fancy as that - many microchips can be delayered by a skilled operator using mechanical polishing processes.</p>
]]></description><pubDate>Fri, 07 Aug 2026 19:38:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=49215291</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49215291</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49215291</guid></item><item><title><![CDATA[New comment by duskwuff in "Can you reverse engineer an ASIC?"]]></title><description><![CDATA[
<p>The original NMOS 6502 also used a lot of rather weird dynamic logic which can't easily be represented as standard digital logic elements. Some details here:<p><a href="http://www.aholme.co.uk/6502/Main.htm" rel="nofollow">http://www.aholme.co.uk/6502/Main.htm</a></p>
]]></description><pubDate>Fri, 07 Aug 2026 19:30:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=49215221</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49215221</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49215221</guid></item><item><title><![CDATA[New comment by duskwuff in "Launch HN: ProvenMetal (YC S26) delivers circuit boards in days instead of weeks"]]></title><description><![CDATA[
<p>No, that's misleading. "Immediately available" means parts <i>you</i> already have in stock and can start populating without waiting for another supplier - it doesn't mean things that you could order.</p>
]]></description><pubDate>Fri, 07 Aug 2026 19:01:18 +0000</pubDate><link>https://news.ycombinator.com/item?id=49214887</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49214887</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49214887</guid></item><item><title><![CDATA[New comment by duskwuff in "There Will Come Soft Rains (1950) [pdf]"]]></title><description><![CDATA[
<p>> But aside from the fact there was no Mars linkage probably my favorite Bradbury short.<p>This story happens to describe events on Earth, but it's part of the same chronology as the rest of the <i>Martian Chronicles</i> stories. The story <i>The Million-Year Picnic</i> describes the same war from the perspective of a family who escaped to Mars.<p>As an aside, later editions of the book advanced all the dates by 31 years; those editions put this story in August 2057 instead.</p>
]]></description><pubDate>Tue, 04 Aug 2026 05:35:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=49164658</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49164658</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49164658</guid></item><item><title><![CDATA[New comment by duskwuff in "Celebrating 45 Years of Kermit with the First New C-Kermit Release in 15 Years"]]></title><description><![CDATA[
<p>The site is a personal blog. There's no expectation, explicit or implicit, that it be "professional".</p>
]]></description><pubDate>Tue, 04 Aug 2026 03:05:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=49163977</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49163977</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49163977</guid></item><item><title><![CDATA[New comment by duskwuff in "How the words we teach English language learners changed"]]></title><description><![CDATA[
<p>It's still used in a couple of specific senses - it's used in the nearly fixed phrases "keen edge" or "keen mind" as a synonym for "sharp", and as "to be keen to -" to mean "eager". But, in my experience, it's rarely used to mean grieving ("to keen over -"), and almost never as a generic term of approval ("that's real keen").</p>
]]></description><pubDate>Mon, 03 Aug 2026 22:34:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=49162336</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49162336</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49162336</guid></item><item><title><![CDATA[New comment by duskwuff in "Cyberscript"]]></title><description><![CDATA[
<p>And cryptosporidium (a type of bacteria which causes diarrhea) is also often abbreviated as "crypto". Not that there's much risk of confusion in CVs, but it does lead to some amusing lines like "preventing and controlling crypto", "symptoms of crypto", etc (e.g. at <a href="https://www.cdc.gov/cryptosporidium/prevention/preventing-and-controlling-crypto-childcare-facilities.html" rel="nofollow">https://www.cdc.gov/cryptosporidium/prevention/preventing-an...</a>).</p>
]]></description><pubDate>Sun, 02 Aug 2026 17:00:31 +0000</pubDate><link>https://news.ycombinator.com/item?id=49146212</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49146212</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49146212</guid></item><item><title><![CDATA[New comment by duskwuff in "RTX 2080 Ti Memory Upgrade to 22 GB"]]></title><description><![CDATA[
<p>Definitely not. DOS had <i>disk</i> compression utilities, but not RAM - there was no reasonable way to accomplish that at the time.<p>You may be thinking of "memory manager" utilities like QEMM and EMM386 which tried to maximize the amount of <i>conventional</i> memory available to programs (i.e. below the 640KB boundary). These programs worked primarily by causing drivers and TSRs to run in upper memory - they didn't actually provide more memory.</p>
]]></description><pubDate>Tue, 28 Jul 2026 05:19:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=49079685</link><dc:creator>duskwuff</dc:creator><comments>https://news.ycombinator.com/item?id=49079685</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49079685</guid></item></channel></rss>