<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: maxmcd</title><link>https://news.ycombinator.com/user?id=maxmcd</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sun, 12 Apr 2026 10:05:49 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=maxmcd" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[New comment by maxmcd in "RX – a new random-access JSON alternative"]]></title><description><![CDATA[
<p>Those care about quickly sending compact messages over the network, but most of them do not create a sparse in-memory representation that you can read on the fly. Especially in javascript.<p>This lib keeps the compact representation at runtime and lets you read it without putting all the entities on the heap.<p>Cool!</p>
]]></description><pubDate>Thu, 19 Mar 2026 07:00:43 +0000</pubDate><link>https://news.ycombinator.com/item?id=47435861</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=47435861</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=47435861</guid></item><item><title><![CDATA[New comment by maxmcd in "Deep dive into Turso, the “SQLite rewrite in Rust”"]]></title><description><![CDATA[
<p>They're implementing MVCC</p>
]]></description><pubDate>Thu, 29 Jan 2026 16:50:28 +0000</pubDate><link>https://news.ycombinator.com/item?id=46812722</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=46812722</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46812722</guid></item><item><title><![CDATA[New comment by maxmcd in "JuiceFS is a distributed POSIX file system built on top of Redis and S3"]]></title><description><![CDATA[
<p>does having to maintain the slatedb as a consistent singleton (even with write fencing) make this as operationally tricky as a third party db?</p>
]]></description><pubDate>Thu, 15 Jan 2026 20:50:18 +0000</pubDate><link>https://news.ycombinator.com/item?id=46639103</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=46639103</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46639103</guid></item><item><title><![CDATA[New comment by maxmcd in "X-Clacks-Overhead"]]></title><description><![CDATA[
<p>Is this possibly an intentional reference to GNU Linux, or unrelated?</p>
]]></description><pubDate>Sat, 03 Jan 2026 18:50:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=46480130</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=46480130</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46480130</guid></item><item><title><![CDATA[New comment by maxmcd in "A super fast website using Cloudflare workers"]]></title><description><![CDATA[
<p>TCP performance gets quite poor over long distances. CDNs are very helpful if you're trying to make your site work well far away from your servers.</p>
]]></description><pubDate>Wed, 31 Dec 2025 15:52:14 +0000</pubDate><link>https://news.ycombinator.com/item?id=46445189</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=46445189</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46445189</guid></item><item><title><![CDATA[New comment by maxmcd in "Netflix Open Content"]]></title><description><![CDATA[
<p>Quite surprising. It does seem like you can get an https download with<p><pre><code>    aws s3 cp --no-sign-request s3://download.opencontent.netflix.com/sparks/creative-commons-attribution-4-intl-public-license.txt .
</code></pre>
Which is hitting the bucket path route at: <a href="https://s3.amazonaws.com/download.opencontent.netflix.com/sparks/creative-commons-attribution-4-intl-public-license.txt" rel="nofollow">https://s3.amazonaws.com/download.opencontent.netflix.com/sp...</a><p>"aws s3 ls" similarly requests: <a href="https://s3.amazonaws.com/download.opencontent.netflix.com?list-type=2&prefix=sparks%2F&delimiter=%2F&encoding-type=url" rel="nofollow">https://s3.amazonaws.com/download.opencontent.netflix.com?li...</a></p>
]]></description><pubDate>Tue, 30 Dec 2025 15:45:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=46434453</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=46434453</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46434453</guid></item><item><title><![CDATA[New comment by maxmcd in "Biscuit is a specialized PostgreSQL index for fast pattern matching LIKE queries"]]></title><description><![CDATA[
<p>I found some more info here: <a href="https://biscuit.readthedocs.io/en/latest/benchmark_roaring.html" rel="nofollow">https://biscuit.readthedocs.io/en/latest/benchmark_roaring.h...</a></p>
]]></description><pubDate>Sat, 20 Dec 2025 20:36:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=46339422</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=46339422</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46339422</guid></item><item><title><![CDATA[New comment by maxmcd in "How to think about durable execution"]]></title><description><![CDATA[
<p>I think a lot of the original temporal/cadence authors were motivated by working on event-driven systems with retries. They exhibited complex failure scenarios that they could not reasonably account for without slapping on more supervisor systems. Durable executions allow you to have a consistent viewpoint to think about failures.<p>I agree determinism/idempotency and the complexities of these systems are a tough pill to swallow. Certainly need to be suited to the task.</p>
]]></description><pubDate>Fri, 19 Dec 2025 15:24:11 +0000</pubDate><link>https://news.ycombinator.com/item?id=46326806</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=46326806</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46326806</guid></item><item><title><![CDATA[New comment by maxmcd in "How to think about durable execution"]]></title><description><![CDATA[
<p>Great article for demystifying durable execution: <a href="https://lucumr.pocoo.org/2025/11/3/absurd-workflows/" rel="nofollow">https://lucumr.pocoo.org/2025/11/3/absurd-workflows/</a></p>
]]></description><pubDate>Fri, 19 Dec 2025 15:15:13 +0000</pubDate><link>https://news.ycombinator.com/item?id=46326732</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=46326732</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46326732</guid></item><item><title><![CDATA[New comment by maxmcd in "GotaTun – Mullvad's WireGuard Implementation in Rust"]]></title><description><![CDATA[
<p>I believe you are making use of gVisor’s userspace TCP implementation. I’m not sure if there is something similar in Rust that would be so easy to set up like this.</p>
]]></description><pubDate>Fri, 19 Dec 2025 12:49:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=46325236</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=46325236</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46325236</guid></item><item><title><![CDATA[New comment by maxmcd in "Show HN: Gemini Pro 3 imagines the HN front page 10 years from now"]]></title><description><![CDATA[
<p>"Reply in the tone of Wikipedia" has worked pretty well for me</p>
]]></description><pubDate>Tue, 09 Dec 2025 18:30:54 +0000</pubDate><link>https://news.ycombinator.com/item?id=46208616</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=46208616</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46208616</guid></item><item><title><![CDATA[New comment by maxmcd in "Jepsen: NATS 2.12.1"]]></title><description><![CDATA[
<p>> > You can force an fsync after each messsage [sic] with always, this will slow down the throughput to a few hundred msg/s.<p>Is the performance warning in the NATS  possible to improve on? Couldn't you still run fsync on an interval and queue up a certain number of writes to be flushed at once? I could imagine latency suffering, but batches throughput could be preserved to some extent?</p>
]]></description><pubDate>Mon, 08 Dec 2025 20:20:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=46197117</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=46197117</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46197117</guid></item><item><title><![CDATA[New comment by maxmcd in "Flow: Actor-based language for C++, used by FoundationDB"]]></title><description><![CDATA[
<p>Maybe this? <a href="https://forums.foundationdb.org/t/swift-or-c-20-coroutine-which-is-the-future-of-fdb/4592/2" rel="nofollow">https://forums.foundationdb.org/t/swift-or-c-20-coroutine-wh...</a></p>
]]></description><pubDate>Mon, 08 Dec 2025 18:16:27 +0000</pubDate><link>https://news.ycombinator.com/item?id=46195700</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=46195700</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46195700</guid></item><item><title><![CDATA[New comment by maxmcd in "100k TPS over a billion rows: the unreasonable effectiveness of SQLite"]]></title><description><![CDATA[
<p>Oh nice, yes I think your threads should be able to perform reads concurrently when the write lock is not held. Would make sure you are in WAL mode as well, since I think that will improve your concurrency.</p>
]]></description><pubDate>Thu, 04 Dec 2025 12:31:40 +0000</pubDate><link>https://news.ycombinator.com/item?id=46146919</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=46146919</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46146919</guid></item><item><title><![CDATA[New comment by maxmcd in "100k TPS over a billion rows: the unreasonable effectiveness of SQLite"]]></title><description><![CDATA[
<p>This will block threads while waiting for other threads to write. That might work great for your threading model but I usually end up putting the writer in one thread and then other threads send writes to the writer thread.</p>
]]></description><pubDate>Tue, 02 Dec 2025 19:25:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=46125491</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=46125491</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46125491</guid></item><item><title><![CDATA[New comment by maxmcd in "How/why to sweep async tasks under a Postgres table"]]></title><description><![CDATA[
<p>Just that row should be locked since it's: "for update skip locked".<p>I agree the concurrency limitation is kind of rough, but it's kind of elegant because you don't have to implement some kind of timeout/retry thing. You're certainly still exposed to the possibility of double-sending, so yes, probably much nicer to update the row to "processing" and re-process those rows on a timeout.</p>
]]></description><pubDate>Fri, 21 Nov 2025 20:09:44 +0000</pubDate><link>https://news.ycombinator.com/item?id=46008406</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=46008406</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=46008406</guid></item><item><title><![CDATA[New comment by maxmcd in "This week in 1988, Robert Morris unleashed his eponymous worm"]]></title><description><![CDATA[
<p>I went here next: <a href="https://www.youtube.com/@CMUDatabaseGroup" rel="nofollow">https://www.youtube.com/@CMUDatabaseGroup</a></p>
]]></description><pubDate>Tue, 04 Nov 2025 21:22:07 +0000</pubDate><link>https://news.ycombinator.com/item?id=45816037</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=45816037</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45816037</guid></item><item><title><![CDATA[New comment by maxmcd in "A sharded DuckDB on 63 nodes runs 1T row aggregation challenge in 5 sec"]]></title><description><![CDATA[
<p>Are there any open sourced sharded query planners like this? Something that can aggregate queries across many duckdb/sqlite dbs?</p>
]]></description><pubDate>Fri, 24 Oct 2025 13:42:58 +0000</pubDate><link>https://news.ycombinator.com/item?id=45694547</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=45694547</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45694547</guid></item><item><title><![CDATA[New comment by maxmcd in "Linus Learns Analog Circuits"]]></title><description><![CDATA[
<p>There are a few different styles: <a href="https://github.com/orgs/community/discussions/16925" rel="nofollow">https://github.com/orgs/community/discussions/16925</a></p>
]]></description><pubDate>Sun, 28 Sep 2025 23:32:47 +0000</pubDate><link>https://news.ycombinator.com/item?id=45408996</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=45408996</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45408996</guid></item><item><title><![CDATA[New comment by maxmcd in "Spiral"]]></title><description><![CDATA[
<p>Do they mention transactions anywhere? Maybe it will be OLAP?</p>
]]></description><pubDate>Thu, 11 Sep 2025 17:06:21 +0000</pubDate><link>https://news.ycombinator.com/item?id=45213830</link><dc:creator>maxmcd</dc:creator><comments>https://news.ycombinator.com/item?id=45213830</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=45213830</guid></item></channel></rss>