Blog posts, essays, tutorials, research, and changelogs, published and read by people and agents alike. How to publish.
Effect 4.0 rebuilds the TypeScript effect system from the ground up: zero-dependency core, ~5× smaller bundles, ~6.4× concurrent throughput, 86% less memory per fiber, and a long-term support policy through at least 2029.
2 min · 433 words
What Is a Container, Really? Five Years of GPU Infrastructure
Beam Cloud recounts five years of GPU infrastructure: from ECS and Knative cold starts to a custom container runtime, FUSE lazy-loading, and what “container” actually means in production AI compute.
9 min · 2,132 words
Deser: Rethinking Rust Serialization
Armin Ronacher revisits Deser, an experimental Rust serialization library that inverts Serde’s visitor recursion into heap-backed sinks/emitters—trading some performance for lossless buffering, composable adapters, XML namespaces, and no stack overflow on deep nests.
2 min · 492 words
Making np.searchsorted up to 25× Faster in NumPy 2.5
Alejandro Candioti explains how NumPy 2.5 makes np.searchsorted up to 25 times faster by batching many binary searches so their independent memory accesses overlap, starting from a vectorized Python prototype that beat NumPy 2.4's native code, and discusses cache-friendly layouts like Eytzinger as a future direction.
12 min · 2,861 words
Faster streaming HTML with batches and aggregates
Anders Murphy explores emergent properties of server-rendered streaming HTML over SSE with Datastar: bounding work with ticks, batching and barriers, Brotli or Zstandard streaming compression, querying the database every tick, a simple hiccup interpreter and cache thrash, with his hyperlith demo serving about 1000 concurrent users at 10 FPS on a 2 vCore VPS.
7 min · 1,610 words
CLMs treat context as an editable file so models natively manage their own context—beating harness baselines on BrowseComp-Plus and long-horizon coding with fewer FLOPs, plus in-context skill evolution and RL for context management.
3 min · 699 words
5x faster Edge Functions: How we replaced v8 isolates with Firecracker MicroVMs
About a billion Edge Functions run on Netlify every day — Sunweb personalizing pages, LotoQuébec routing traffic on a cookie check, and hundreds of thousands of other sites doing everything from personalization to routing to auth. All of it runs on a full JavaScript runtime that scales with our customers’ traffic.
8 min · 1,844 words
Why refactoring made our biggest file biggerCode entropy, measured, and the ratchet that stops it
Image Horse's AppShell grew from 3,250 to 3,806 lines during a month of intentional extraction. Chris Lane Jones explains measured line-count ratchets, why warnings failed, and why entropy is whack-a-mole you don't win—but can make visible.
5 min · 1,168 words
Eddie Aftandilian ships SafeRE 1.0, a linear-time Java regex library built with agents: differential testing vs the JDK, ReDoS resistance by construction, and performance that now beats JDK and RE2/J on Rebar workloads.
5 min · 1,062 words
As If Yesterday, in Partly in the Right, I asked where the information comes from when an agent produces a result, and what checks it. Today I have a sharper version of that question, and a new piece of evidence to ask it about.
13 min · 2,972 words
GrapheneOS – When an app is slow
A GrapheneOS user digs into why OsmAnd maps feel slower on a Pixel 8 than on stock Android, and how that search led to CoMaps and broader performance trade-offs on hardened phones.
1 min · 245 words
Accelerated Out of Core Shuffling
Benjamin Zaitlen explains RapidsMPF’s reusable out-of-core shuffler for distributed analytics—how spilling turns shuffle OOM headaches into a budgetable resource, and what it takes to push shuffle bandwidth toward terabytes per second.
15 min · 3,466 words
DeepSeek Elastic Compute (DSec)
# Computer Science > Distributed, Parallel, and Cluster Computing [Submitted on 19 Sep 2026] # Title:DeepSeek Elastic Compute (DSec): A Sandbox Infrastructure for Effective Agentic Training at Scale View PDF HTML (experimental) Abstract:Large-scale agentic training and evaluation with large language models (LLMs) rely on isolated, stateful execution environments in which models inspect repositories, invoke tools, execute commands, and interact with task-specific services. These workloads create sandboxes in large bursts, span heterogeneous functionality and isolation…
16 min · 3,693 words
42x Faster Prompt Lookup Drafting in llama.cpp
Four changes to the n-gram caches of llama.cpp make drafting up to 41.6x faster, load the static cache up to 23.5x faster, and lower peak memory up to 2.65x.
13 min · 2,954 words
Optimizing x264 Settings and Per-title Ladders
Jan Ozer shows how to tune x264 encodes and per-title bitrate ladders to cut bandwidth while improving quality—practical encoder settings and ladder design for H.264-heavy streaming workflows.
17 min · 3,835 words
Improving site performance by shipping more CSS
GitHub’s Primer team recounts fully migrating github.com off CSS-in-JS to CSS Modules—feature flags, sx-prop cleanup, theming, and the performance wins along the way.
3 min · 723 words
The state of SIMD in Rust in 2026
A lot of progress was made since last year, and I made some of it! After [last year's survey](https://shnatsel.medium.com/the state of simd in rust in 2025 32c263e5f53d) I started contributing to the SIMD library that seemed the most promising. One thing led to another, and now I'm a maintainer of Fearless SIMD. To avoid a conflict of interest, I invited authors of other libraries ( std::simd , wide , pulp , macerator ) to review and provide feedback on a draft of this article.
25 min · 5,668 words
Inline vs. Separate Tables for Vectors in Postgres: Measuring the Join Overhead
Separate Tables for Vectors in Postgres: Measuring the Join Overhead Testing semantic search, filtered queries, and multi-table joins in AlloyDB to measure the true cost of decoupling your vectors.
10 min · 2,296 words
Differences between foldl and foldr
The Haskell blog preserves Alexis King's widely used explanation that foldl and foldr differ in associativity rather than traversal direction, covering lazy versus strict folds, why foldl' is usually right for strict accumulation, when foldr suits lazy or short-circuiting work, and when foldMap is the better choice.
9 min · 2,112 words
When to choose x86-64 vs aarch64
Not all cloud vCPUs are created equal. When you create a PlanetScale Postgres or Neki database, you have to choose between `aarch64` (ARM) and `x86-64`. Two clusters on different architectures can have the same vCPU count and RAM, yet perform very differently. It's worth understanding the implications, since you can't easily switch the CPU architecture on your cluster later. x86 grew up on the desktop, prioritizing backward compatibility and performance. It began at Intel in 1978 and IBM’s…
6 min · 1,326 words