The Seqlock Shootout, Part 3: A Tour of Modern Implementations

Published: March 15, 2026 | Members only | Concurrency & Lock-Free

Hans Boehm showed us how to build a correct seqlock in C++11. But “correct” and “optimal” are different beasts. In the decade since his paper, a dozen implementations have emerged, each making different trade-offs. Some prioritize raw speed. Others focus on multi-writer safety. Some waste memory on padding; others pack tight.

This is the implementation landscape — who built what, why they made the choices they did, and what we can learn from the diversity.

The rest of this article is for members

Members read every article and course in full from the moment it is published, run their code on the certified C++ and Rust challenges, and earn verifiable credentials. Subscriptions are what keep this site independent.

Subscribe Log in

Already a paid Substack subscriber? Your access carries over — register with the same email address.

Browse other articles