Topic
Everything filed under Performance, newest first.
RSS · JSON · All topics
What changes when your search index lives on S3?
Infino explains how putting a full-text search index on object storage changes the cost and latency model: every random read is a billed GET taking tens of milliseconds, and how superfiles, manifests and careful layout keep agent queries fast without packing the working set on local disks.
9 min · 2,019 words
JPEG XL vs AVIF for web use-cases
Jake Archibald compares JPEG XL and AVIF for web delivery after JPEG XL landed in major browsers: compression efficiency, decode/encode cost, progressive rendering, animation, HDR, and when each format wins for typical site images.
47 min · 10,731 words
Better HTTP/1 connection reuse
The Go team explains why HTTP/1 connections often fail to be reused when response bodies are closed without being drained, how costly that is, the tricky manual workarounds developers have used, and how Go 1.27's net/http Transport now drains unread bodies automatically so closing the body is enough.
6 min · 1,453 words
Making COUNTs and the Rest of Search Really Fast (Part II)
How ctid-aware segment partitioning, an inverted DocId map, and bitmap postings accelerated ParadeDB's Wikipedia COUNT queries, followed by a look at the rest of the text-search benchmark against PlanetScale's TIN.
13 min · 2,929 words
Announcing the Waylith Engine and Update 1.7
Ludeon Studios moves RimWorld from Unity to its in-house Waylith engine in update 1.7, reporting roughly 2–4× performance gains, save and mod compatibility with 1.6, an unstable Steam beta for testing, and a tease that RimWorld will not be the only Waylith game.
2 min · 548 words
Dan Luu argues that as it becomes easier to make real performance gains, it also becomes easier to game benchmarks with fake ones, surveying how reward-hacking shows up across regex, web servers, terminals, and other systems, and what to watch for when reading performance claims.
17 min · 3,940 words
A slightly faster slimmer curl
Daniel Stenberg describes recent curl and libcurl work that trims binary size and improves performance: removing unused code paths, tighter defaults, and build-time options that make curl slightly faster and leaner without changing its familiar CLI behavior.
3 min · 707 words
Indra OCR: a 1M-parameter OCR model that reads 49 pages per second on CPU
Datalab releases Indra OCR, an open OCR package built around a 1M-parameter recognition model that reads 49 pages per second on 32 CPU cores, 11-17x faster than Tesseract and PP-OCR, while returning full layout with line and block boxes, labels, reading order and clean markdown or JSON output.
7 min · 1,500 words
C vs C#: racing VLC's Gaussian blur
Martin Finkel ports a real VLC video filter, the Gaussian blur, line by line to C# with .NET Native AOT and races it against the original C inside VLC 4 on the same frames with byte-identical output, then optimizes both sides and compares again.
9 min · 2,060 words
Chasing a -O2 pessimization in antcc
The author of the antcc C compiler investigates why a Lua benchmark ran slower at -O1 and -O2 than unoptimized, digging into the interpreter dispatch loop, register allocation, SSA phi handling and stack slots to find and fix the optimization that made the code worse.
12 min · 2,750 words
purplesyringa investigates vfmaddrnd231pd, an FMA instruction with per-instruction rounding control documented in Intel's 2024 Software Development Manual that the GNU assembler doesn't recognize, whose documented intrinsics are missing from Clang and ICC, and that has vanished from the 2026 SDM.
2 min · 415 words
Parsing JSON at tens of gigabytes per second… in Python
Daniel Lemire benchmarks JSON parsing on free-threaded Python 3.14 using eight hours of GH Archive events (7.6 GB), comparing the standard json module, orjson, msgspec and his fastsimdjson library across up to 64 threads, and shows Python can reach tens of gigabytes per second.
3 min · 789 words
Speeding up the Unreal editor by… not using unnecessarily secure hash methods
A profiling write-up finding that Unreal Engine's editor launch hashes full shader source files with cryptographically secure SHA-1, and how switching to the engine's existing xxHash implementation sped this up, plus notes on preparing the change as a pull request.
4 min · 986 words
PGO or not PGO this is the dilemma. Step 2Step 2: How it works
The second of Marco Tusa's three-part Percona series on profile-guided optimization explains how PGO works as a two-pass build: instrumented binaries record per-edge control-flow counters during a training workload, and the compiler then uses those counts for inlining, branch layout, hot/cold splitting and code ordering, which is why MySQL's MTR test suite transfers well as training data.
5 min · 1,174 words
Purplesyringa shows how to compute count-leading-zeros and count-trailing-zeros with floating-point bit tricks instead of native instructions, yielding a vectorizable polyfill in Rust, and explains why the exponent manipulation works.
4 min · 891 words
Frank Denis shows that LLVM compiles a plain 128-bit addition into conditional branches on 32-bit RISC-V, explains why that breaks constant-time assumptions in cryptographic code, compares GCC and the Zicond extension, and discusses how hard portable side-channel-safe code really is.
5 min · 1,208 words
HIP and ROCm as first-class citizens
Ludovic Courtès reports that Guix developers migrated the whole AMD HIP/ROCm stack from the Guix-HPC channels into Guix proper starting with 7.1.1: more than 40 packages covering the toolchain, linear algebra libraries, rocHPL, a ROCm Open MPI and profiling tools, plus HIP variants of scientific software.
6 min · 1,485 words
Push Ifs Up and Fors Down: The Idiom, Its Algebra, and Its Limits
Debasish Ghosh examines the 'push ifs up and fors down' heuristic from TigerBeetle's Tiger Style and matklad: what it actually says, how it mirrors predicate pushdown and batching in query optimization, how algebraic laws of functional programs such as filter/map fusion decide which rewrites are legal, and where the analogy stops paying off.
7 min · 1,570 words
WSL2 vs WSL3 Benchmarks: Performance, Memory, and Syscall Scaling
Tony Metzidis benchmarks WSL 2.6.3.0 (Linux 6.6) against WSL 3.0.2.0 (Linux 6.18) across kernel microbenchmarks, memory bandwidth and an end-to-end GoReleaser build, finding WSL3 roughly 5-60% faster depending on workload and explaining where the gains come from.
3 min · 757 words
The author of the rat compiler backend explains replacing a 1,392-line linear scan register allocator with a 584-line priority bin-packing allocator that produces better x86-64 code. The post walks through live ranges, fixed registers, coalescing, register picking and spilling, then measures what each feature was worth, finding that cheap techniques like coalescing and hints matter most.
11 min · 2,427 words