151
Does anyone run Postgres without PgBouncer?
Almost every notable managed Postgres provider bundles a connection pooler, giving us a strong hint that connection management is a product problem rather than a user problem.
New
The latest blog posts to take off on Hacker News. 6,942 posts.
152
Breaking the WAL
I did this from a lawn chair on the Sunshine Coast.
153
The Road to MS-DOS 2.0
One little step toward UNIX
154
Rust SIMD on the GPU
At VectorWare , we are building the first GPU-native software company . Today, we are excited to announce that we can successfully use Rust's portable SIMD ( core::simd ) on the GPU. This milestone marks a significant step towards our vision of enabling developers to write complex, high-performance applications that…
155
Asynchronous I/O in DuckDB: Work, Thread, Work
Starting with v2.0, scheduled for fall 2026, DuckDB will support asynchronous reads of Parquet and CSV files. This can significantly speed up queries when synchronous I/O does not saturate the available bandwidth, as is typical in EC2/S3 compute-storage setups.
156
My server is a phone now
rooting a CMF Phone 1 to run my personal infrastructure at home.
157
We replaced Redis with MySQL for inventory reservations and it scaled
How we used SKIP LOCKED, composite primary keys, and connection visibility to hit our scale targets.
158
Triton: DirectX 11 Driver for QEMU
In the prequel, we introduced Neptune, a Direct3D protocol forwarding layer for VirtIO. Neptune allowed us to serialize Direct3D API calls across the hypervisor boundary and this allowed us to run Wine games on a Linux guest with a Linux host faster than with DXVK directly in the guest. Admittedly, the payoff there…
159
Making Postgres 300x faster for analytics: batching, operator fusion, and SIMD
Last week we released version 0.2 of pgrust. This release was all about performance. It’s 10x faster than the previous version of pgrust. On OLTP benchmarks, pgrust is 30% faster than Postgres, and on Clickbench, Clickhouse’s benchmark for analytical databases, pgrust is 300x faster than Postgres. It’s even ahead of…
160
Inside vLLM: Anatomy of a High-Throughput LLM Inference System (2025)
From paged attention, continuous batching, prefix caching, specdec, etc. to multi-GPU, multi-node dynamic serving at scale.
161
Faster floating point math with Rust's new API
Compilers have a hard time optimizing floating point math. Rust has a new API to fix this.
162
Pi's Minimalism Is Its Advantage
How Pi's minimal harness improves coding-agent cost and performance, with examples from Databricks and Shopify's pi-autoresearch extension.
163
Windows XP 2002 for the Itanium: Unbridled rage
This is exciting news, there is a fork of Qemu that has workable Itanium Merced emulation, and it’s good enough to run Windows XP/2003! Enter Malte Kuhlmann ‘s Qemu fork of syunnPC ‘s AI Itanium infused Qemu fork .
164
Smaller, faster, safer: running Kimi and GLM at scale
Serving frontier models like Kimi and GLM means fighting for GPU memory. Here's how we quantize KV caches, compress model weights, and add integrity checks to serve them faster, cheaper, and safely.
165
Branchless Rust: Making a Filter 4x Faster by Removing an If
Why a filter is slowest when it keeps half of random input, and what a branchless rewrite gains there and loses at 1%.
166
167
MkLinux and the pimped-out Apple Workgroup Server 9150
As is typical here in the Floodgap lab, it all started so innocently: rebuilding a flaky Apple Workgroup Server 9150, the odd duck of the Wo...
168
But can your calculator run Linux?
Published: 01-08-2026 20:08 | Author: Remy van Elst | Text only version of this article
169
NetBSD 11.0
The NetBSD project is pleased to (finally) announce the NetBSD 11.0 release ! See the release announcement for details.
170
Algorithms on billion-scale graph using 10GB RAM: I love DataFusion
In a previous post, I was sceptical about using Apache DataFusion for graph analytics. However, after some thought and experimentation, I changed my mind. I have reconsidered my approach and now have a working implementation of basic graph algorithms, such as WCC, PageRank and MSSP. For example, I can identify weakly…
171
A big win for Android interoperability
Google gatekept key Android features, and the European Commission asked what we thought about it. Now Alphabet must open 11 Android features to all.
172
The session you cannot take with you
Inference APIs are filling sessions with encrypted reasoning, hidden search results, opaque compaction, and encrypted subagent messages. A growing form of lock-in.
173
Making Postgres queues scale
Lessons learned from scaling Postgres-backed durable queues for users running tens of billions of workflows per month.
174
SQLite in Production: Optimizing WAL Mode, Concurrency, and VFS Layers
Transitioning SQLite from a local development tool to a production-grade database requires a deep understanding of its internal mechanics. This article explores how to tune WAL mode, manage busy handlers, and leverage custom Virtual File System (VFS) layers to achieve ultra-low latency.
175
State of multi-player Wayland
I've been fascinated by the idea of attaching multiple mice to one computer, and then having multiple mouse cursors inside of one desktop environment!
176
How Do I Profile eBPF Code?
If we are running any eBPF workload or writing eBPF code, we want to measure its performance impact, and in this post we will demonstrate an example of how to do it. In this example, our goal is to measure the performance of file open operations, one of the most critical functions in the OS. Our code used file open…
177
PGSimCity - How PostgreSQL Works
An independent, non-commercial educational visualization of PostgreSQL internals. Not affiliated with Electronic Arts.
178
Watching Go's new garbage collector move through the heap
Go 1.26 made Green Tea the default GC. We observe its cache-friendliness with perf, visualize the heap to see how Go allocates, and poke at a sparse-page problem a non-moving collector like Go's struggles with.
179
Postgres LISTEN/NOTIFY actually scales
How we optimized Postgres LISTEN/NOTIFY-backed data streams to 60K writes per second on a single Postgres server, with millisecond-scale latency.
180
SIMD for Collision
In a previous post SIMD Matters I discussed the big wins I got from graph coloring to make the contact solver faster. That same approach exists in Box3D. I like to call this approach “wide SIMD”. The idea is to process multiple work units at the same time. In the contact solver this means solving four contact points…