<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: delamon</title><link>https://news.ycombinator.com/user?id=delamon</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Wed, 22 Apr 2026 20:12:52 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=delamon" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by delamon in "Framework Laptop 13 Pro"]]></title><description><![CDATA[
<p>Not really. PgUp, PgDown are missing. It is possible to configure software combination that would emulate them. But emulation is emulation.</p>
]]></description><pubDate>Wed, 22 Apr 2026 10:48:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=47861678</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=47861678</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47861678</guid></item><item><title><![CDATA[New comment by delamon in "How does GPS work?"]]></title><description><![CDATA[
<p>This blog post is also worth noting: <a href="https://ciechanow.ski/gps/" rel="nofollow">https://ciechanow.ski/gps/</a></p>
]]></description><pubDate>Wed, 22 Apr 2026 10:31:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=47861535</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=47861535</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47861535</guid></item><item><title><![CDATA[New comment by delamon in "Claude Code's source code has been leaked via a map file in their NPM registry"]]></title><description><![CDATA[
<p>What is wrong with peeking at process.env? It is a global map, after all. I assume, of course, that they don't mutate it.</p>
]]></description><pubDate>Tue, 31 Mar 2026 10:06:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=47585061</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=47585061</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47585061</guid></item><item><title><![CDATA[New comment by delamon in "CVE-2026-3888: Important Snap Flaw Enables Local Privilege Escalation to Root"]]></title><description><![CDATA[
<p>Rust cannot help you if race condition crosses API boundary. No matter what language you use, you have to think about system as a whole. Failure to do that results in bugs like this</p>
]]></description><pubDate>Wed, 18 Mar 2026 18:15:25 +0000</pubDate><link>https://news.ycombinator.com/item?id=47429277</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=47429277</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47429277</guid></item><item><title><![CDATA[New comment by delamon in "Modernizing swapping: virtual swap spaces"]]></title><description><![CDATA[
<p>You can bump /proc/$firefox_pid/oom_score_adj to make it likely target. The easiest way is to make wrapper script that bumps the score and then starts firefox. All children will inherit the score.</p>
]]></description><pubDate>Sat, 07 Mar 2026 09:32:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=47286020</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=47286020</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47286020</guid></item><item><title><![CDATA[New comment by delamon in "The biggest CRT ever made: Sony's PVM-4300"]]></title><description><![CDATA[
<p>IBM was producing in Japan T221 monitor staring from 2001. It had 3840x2160 LCD screen.</p>
]]></description><pubDate>Tue, 23 Dec 2025 07:37:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=46363255</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=46363255</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46363255</guid></item><item><title><![CDATA[New comment by delamon in "Rust in the kernel is no longer experimental"]]></title><description><![CDATA[
<p>I've been trying to convert to Rust an in-memory database and failed. It is strictly single-threaded and full of intrusive lists. I tried hard to please borrow-checker, but one have little choice when internal structures are full of cycles. The result was ugly mess of Rc all over the place. I guess it is just an example of a problem that doesn't fit Rust well.<p>This makes me wonder: what performance cost Rust code pay due to inability represent cyclic structures efficiently? It seems people tend to design their data in way to please Rust and not in way that would be otherwise more performance efficient.</p>
]]></description><pubDate>Thu, 11 Dec 2025 10:51:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=46229845</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=46229845</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46229845</guid></item><item><title><![CDATA[New comment by delamon in "Rust in the kernel is no longer experimental"]]></title><description><![CDATA[
<p>Right. So it is not that double-linked lists are inherently unsafe, it is (just) Rust ownership model cannot represent them (any other cyclic structures).</p>
]]></description><pubDate>Thu, 11 Dec 2025 08:24:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=46228928</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=46228928</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46228928</guid></item><item><title><![CDATA[New comment by delamon in "Rust in the kernel is no longer experimental"]]></title><description><![CDATA[
<p>> if your compiler unboxes the contained item into your nodes<p>Is there known compilers that can do that?</p>
]]></description><pubDate>Wed, 10 Dec 2025 14:39:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=46218204</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=46218204</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46218204</guid></item><item><title><![CDATA[New comment by delamon in "Rust in the kernel is no longer experimental"]]></title><description><![CDATA[
<p>Can you elaborate, what key assumptions about memory safety linked lists break? Sure, double linked lists may have non-trivial ownership, but that doesn't compromise safety.</p>
]]></description><pubDate>Wed, 10 Dec 2025 14:37:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=46218190</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=46218190</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46218190</guid></item><item><title><![CDATA[New comment by delamon in "Rust in the kernel is no longer experimental"]]></title><description><![CDATA[
<p>> Storing the data in nodes doesn't work if the given structure may need to be in multiple linked lists<p>That is why kernel mostly (always?) uses intrusive linked lists. They have no such problem.</p>
]]></description><pubDate>Wed, 10 Dec 2025 14:35:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=46218154</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=46218154</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46218154</guid></item><item><title><![CDATA[New comment by delamon in "Date bug in Rust-based coreutils affects Ubuntu 25.10 automatic updates"]]></title><description><![CDATA[
<p>Correct. Any language with builtin bounds checking would work.</p>
]]></description><pubDate>Sat, 25 Oct 2025 13:38:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=45703799</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=45703799</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45703799</guid></item><item><title><![CDATA[New comment by delamon in "Date bug in Rust-based coreutils affects Ubuntu 25.10 automatic updates"]]></title><description><![CDATA[
<p>It is worth noting, that all three CVEs could be prevented by simple bounds checking at runtime. Preventing them does not require borrow checker or any other Rust fancy features.</p>
]]></description><pubDate>Fri, 24 Oct 2025 09:31:41 +0000</pubDate><link>https://news.ycombinator.com/item?id=45692670</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=45692670</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45692670</guid></item><item><title><![CDATA[New comment by delamon in "Dumb to managed switch conversion (2010)"]]></title><description><![CDATA[
<p>Sometimes managed switch is the only way to find out faulty cable. I'm speaking about a bit bad cable, which corrupts some data, not all of it. Just by looking on interface error counters you can easily tell if something is off. Without it you either need somehow come up with very expensive cable tester or just pretend that slow network speed is due to some other popular blame destination (e.g. it's just bad macos update) ;)</p>
]]></description><pubDate>Wed, 13 Aug 2025 08:17:56 +0000</pubDate><link>https://news.ycombinator.com/item?id=44885846</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=44885846</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44885846</guid></item><item><title><![CDATA[New comment by delamon in "Pkgbase Removes FreeBSD Base System Feature"]]></title><description><![CDATA[
<p>"immutable" top-level folders won't cut it. In order to recursively delete a folder, rm has to delete leaves first. So, you will endup with empty top-level folders, which is no better.</p>
]]></description><pubDate>Wed, 30 Jul 2025 09:18:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=44732274</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=44732274</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44732274</guid></item><item><title><![CDATA[New comment by delamon in "Zig's New Async I/O"]]></title><description><![CDATA[
<p>> Doing that is an instant performance hit. Not to mention annoying to do.<p>The cost of virtual dispatch on IO path is almost always negligible. It is literally one conditional vs syscall. I doubt it you can even measure the difference.</p>
]]></description><pubDate>Sun, 13 Jul 2025 08:37:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=44548603</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=44548603</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44548603</guid></item><item><title><![CDATA[New comment by delamon in "Writing into Uninitialized Buffers in Rust"]]></title><description><![CDATA[
<p>c) SIMD won't be as helpful when you are zeroing small buffers of non-round sizes</p>
]]></description><pubDate>Wed, 21 May 2025 07:40:06 +0000</pubDate><link>https://news.ycombinator.com/item?id=44049221</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=44049221</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44049221</guid></item><item><title><![CDATA[New comment by delamon in "Building my own solar power system"]]></title><description><![CDATA[
<p>Pump it to the storage. Building something like <a href="https://www.energyvault.com/products/g-vault-gravity-energy-storage" rel="nofollow">https://www.energyvault.com/products/g-vault-gravity-energy-...</a> is impossible for a home owner. But the country scale energy provider can build such thing.</p>
]]></description><pubDate>Wed, 21 May 2025 07:29:36 +0000</pubDate><link>https://news.ycombinator.com/item?id=44049167</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=44049167</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=44049167</guid></item><item><title><![CDATA[New comment by delamon in "Zig's new LinkedList API (it's time to learn fieldParentPtr)"]]></title><description><![CDATA[
<p>Dynamic arrays often use doubling as a resize strategy. This means that on average about 25% of capacity is "wasted". Depending on element size and element count it may lead to larger memory usage compared to linked list.</p>
]]></description><pubDate>Wed, 16 Apr 2025 12:48:33 +0000</pubDate><link>https://news.ycombinator.com/item?id=43704790</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=43704790</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43704790</guid></item><item><title><![CDATA[New comment by delamon in "If you get the chance, always run more extra network fiber cabling"]]></title><description><![CDATA[
<p>It is well known that copper 10G runs hot. Use DAC or fiber if you want run cool</p>
]]></description><pubDate>Thu, 27 Mar 2025 13:46:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=43493608</link><dc:creator>delamon</dc:creator><comments>https://news.ycombinator.com/item?id=43493608</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=43493608</guid></item></channel></rss>