<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: grep_it</title><link>https://news.ycombinator.com/user?id=grep_it</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Wed, 28 Oct 2026 11:28:49 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=grep_it" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by grep_it in "Python's experimental JIT to be removed"]]></title><description><![CDATA[
<p>I've had good success with just using mypyc (<a href="https://mypyc.readthedocs.io/en/latest/introduction.html" rel="nofollow">https://mypyc.readthedocs.io/en/latest/introduction.html</a>) on typed python code.</p>
]]></description><pubDate>Tue, 27 Oct 2026 23:04:17 +0000</pubDate><link>https://news.ycombinator.com/item?id=50267127</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=50267127</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=50267127</guid></item><item><title><![CDATA[Delta: Highly available, strongly consistent storage using chain replication (2022)]]></title><description><![CDATA[
<p>Article URL: <a href="https://engineering.fb.com/2022/05/04/data-infrastructure/delta/">https://engineering.fb.com/2022/05/04/data-infrastructure/delta/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=49794844">https://news.ycombinator.com/item?id=49794844</a></p>
<p>Points: 31</p>
<p># Comments: 3</p>
]]></description><pubDate>Mon, 21 Sep 2026 23:29:42 +0000</pubDate><link>https://engineering.fb.com/2022/05/04/data-infrastructure/delta/</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=49794844</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49794844</guid></item><item><title><![CDATA[New comment by grep_it in "Distributed Systems Classics (2017)"]]></title><description><![CDATA[
<p>Lamport lists his collected works on his site[0] along with some commentary for each one, and directly mentions, The Maintenance of Duplicate Databases, as the origin for logical clock paper. Many of the notes have interesting commentary.<p>> Many computer scientists claim to have read it.  But I have rarely encountered anyone who was aware that the paper said anything about state machines.  People seem to think that it is about either the causality relation on events in a distributed system, or the distributed mutual exclusion problem.  People have insisted that there is nothing about state machines in the paper.  I've even had to go back and reread it to convince myself that I really did remember what I had written.[1]<p>0: <a href="https://lamport.azurewebsites.net" rel="nofollow">https://lamport.azurewebsites.net</a>
1: <a href="https://lamport.azurewebsites.net/pubs/pubs.html#time-clocks" rel="nofollow">https://lamport.azurewebsites.net/pubs/pubs.html#time-clocks</a></p>
]]></description><pubDate>Mon, 14 Sep 2026 18:18:00 +0000</pubDate><link>https://news.ycombinator.com/item?id=49701462</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=49701462</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49701462</guid></item><item><title><![CDATA[Distributed Systems Classics (2017)]]></title><description><![CDATA[
<p>Article URL: <a href="https://nvartolomei.com/dist-sys-classics/">https://nvartolomei.com/dist-sys-classics/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=49699158">https://news.ycombinator.com/item?id=49699158</a></p>
<p>Points: 351</p>
<p># Comments: 75</p>
]]></description><pubDate>Mon, 14 Sep 2026 16:02:01 +0000</pubDate><link>https://nvartolomei.com/dist-sys-classics/</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=49699158</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49699158</guid></item><item><title><![CDATA[New comment by grep_it in "Creepy Crawlies"]]></title><description><![CDATA[
<p>Did you read the article?<p>“[…]because we can generate 1.2 METRIC BAJILLION valid URLs just for a single fork of linux.git.”</p>
]]></description><pubDate>Sun, 30 Aug 2026 16:46:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=49500300</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=49500300</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49500300</guid></item><item><title><![CDATA[New comment by grep_it in "Saving 100 terabytes of memory by optimizing 1.1.1.1's DNS cache"]]></title><description><![CDATA[
<p>Sibling comment touched on it, and I guess rust does offer just that, but void casting and doing explicit offset checks for a field is one reason. You can kind of think of it like a tuple in that way and a db engine might use a similar technique.</p>
]]></description><pubDate>Fri, 28 Aug 2026 16:45:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=49481187</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=49481187</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49481187</guid></item><item><title><![CDATA[New comment by grep_it in "Don't use musl if you care about performance"]]></title><description><![CDATA[
<p>I think the size of linked binaries and simplicity were always the main features?</p>
]]></description><pubDate>Fri, 28 Aug 2026 16:23:29 +0000</pubDate><link>https://news.ycombinator.com/item?id=49480809</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=49480809</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49480809</guid></item><item><title><![CDATA[New comment by grep_it in "Saving 100 terabytes of memory by optimizing 1.1.1.1's DNS cache"]]></title><description><![CDATA[
<p>This reminds me how you can save a bunch of bytes just by making sure your structs are aligned. In go for example:<p><pre><code>  type Wasteful struct {
    a int16
    b int
    c byte
  }

  type Aligned struct {
    b int
    a int16
    c byte
  }

</code></pre>
Will have sizes of 24bytes and 16bytes (on a 64bit system). Same data 8bytes more. If you are storing millions of those objects, then it adds up.</p>
]]></description><pubDate>Fri, 28 Aug 2026 04:21:37 +0000</pubDate><link>https://news.ycombinator.com/item?id=49474335</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=49474335</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49474335</guid></item><item><title><![CDATA[New comment by grep_it in "Elevators"]]></title><description><![CDATA[
<p>I always come back to this game whenever I'm at a hotel for a conference waiting for the elevator.</p>
]]></description><pubDate>Fri, 31 Jul 2026 16:10:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=49124958</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=49124958</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=49124958</guid></item><item><title><![CDATA[Paxos Made Simple (2001) [pdf]]]></title><description><![CDATA[
<p>Article URL: <a href="https://lamport.azurewebsites.net/pubs/paxos-simple.pdf">https://lamport.azurewebsites.net/pubs/paxos-simple.pdf</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48850688">https://news.ycombinator.com/item?id=48850688</a></p>
<p>Points: 65</p>
<p># Comments: 7</p>
]]></description><pubDate>Thu, 09 Jul 2026 18:51:22 +0000</pubDate><link>https://lamport.azurewebsites.net/pubs/paxos-simple.pdf</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=48850688</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48850688</guid></item><item><title><![CDATA[New comment by grep_it in "Open Source Low Tech"]]></title><description><![CDATA[
<p>Awesome resource, thanks for sharing!</p>
]]></description><pubDate>Tue, 30 Jun 2026 19:49:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=48738287</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=48738287</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48738287</guid></item><item><title><![CDATA[Open Source Low Tech]]></title><description><![CDATA[
<p>Article URL: <a href="https://opensourcelowtech.org/">https://opensourcelowtech.org/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48683098">https://news.ycombinator.com/item?id=48683098</a></p>
<p>Points: 675</p>
<p># Comments: 140</p>
]]></description><pubDate>Fri, 26 Jun 2026 06:35:17 +0000</pubDate><link>https://opensourcelowtech.org/</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=48683098</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48683098</guid></item><item><title><![CDATA[New comment by grep_it in "Do you even need a database?"]]></title><description><![CDATA[
<p>Except that eventually you'll find you lose a write when things go down because the page cache is write behind. So you start issuing fsync calls. Then one day you'll find yourself with a WAL and buffer pool wondering why you didn't just start with sqlite instead.</p>
]]></description><pubDate>Wed, 15 Apr 2026 14:43:05 +0000</pubDate><link>https://news.ycombinator.com/item?id=47779714</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=47779714</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47779714</guid></item><item><title><![CDATA[The Architecture of Open Source Applications (Volume 1) Berkeley DB]]></title><description><![CDATA[
<p>Article URL: <a href="https://aosabook.org/en/v1/bdb.html">https://aosabook.org/en/v1/bdb.html</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46861158">https://news.ycombinator.com/item?id=46861158</a></p>
<p>Points: 89</p>
<p># Comments: 12</p>
]]></description><pubDate>Mon, 02 Feb 2026 20:37:41 +0000</pubDate><link>https://aosabook.org/en/v1/bdb.html</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=46861158</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46861158</guid></item><item><title><![CDATA[New comment by grep_it in "Who are the companies that still use Perl in their back end?"]]></title><description><![CDATA[
<p>Last I heard, DuckDuckGo backend was Perl.</p>
]]></description><pubDate>Fri, 09 Jan 2026 03:23:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=46549711</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=46549711</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46549711</guid></item><item><title><![CDATA[Load Balancing (2023)]]></title><description><![CDATA[
<p>Article URL: <a href="https://samwho.dev/load-balancing">https://samwho.dev/load-balancing</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46540850">https://news.ycombinator.com/item?id=46540850</a></p>
<p>Points: 5</p>
<p># Comments: 0</p>
]]></description><pubDate>Thu, 08 Jan 2026 13:42:28 +0000</pubDate><link>https://samwho.dev/load-balancing</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=46540850</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46540850</guid></item><item><title><![CDATA[Clock synchronization is a nightmare]]></title><description><![CDATA[
<p>Article URL: <a href="https://arpitbhayani.me/blogs/clock-sync-nightmare/">https://arpitbhayani.me/blogs/clock-sync-nightmare/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46368177">https://news.ycombinator.com/item?id=46368177</a></p>
<p>Points: 232</p>
<p># Comments: 159</p>
]]></description><pubDate>Tue, 23 Dec 2025 18:59:45 +0000</pubDate><link>https://arpitbhayani.me/blogs/clock-sync-nightmare/</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=46368177</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46368177</guid></item><item><title><![CDATA[New comment by grep_it in "Ask HN: Scheduling stateful nodes when MMAP makes memory accounting a lie"]]></title><description><![CDATA[
<p>Relevant: <a href="https://db.cs.cmu.edu/papers/2022/cidr2022-p13-crotty.pdf" rel="nofollow">https://db.cs.cmu.edu/papers/2022/cidr2022-p13-crotty.pdf</a></p>
]]></description><pubDate>Tue, 25 Nov 2025 04:29:26 +0000</pubDate><link>https://news.ycombinator.com/item?id=46042340</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=46042340</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46042340</guid></item><item><title><![CDATA[SO-YOU-DONT-HAVE-TO INCORPORATED'); DROP TABLE companies; --]]></title><description><![CDATA[
<p>Article URL: <a href="https://sydht.ai/">https://sydht.ai/</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=46019031">https://news.ycombinator.com/item?id=46019031</a></p>
<p>Points: 3</p>
<p># Comments: 0</p>
]]></description><pubDate>Sat, 22 Nov 2025 22:48:17 +0000</pubDate><link>https://sydht.ai/</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=46019031</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46019031</guid></item><item><title><![CDATA[New comment by grep_it in "Why do we need dithering?"]]></title><description><![CDATA[
<p>I love the authors style!</p>
]]></description><pubDate>Fri, 14 Nov 2025 02:09:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=45923072</link><dc:creator>grep_it</dc:creator><comments>https://news.ycombinator.com/item?id=45923072</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45923072</guid></item></channel></rss>