YOUR NEXT GOOD READ

For you

A small selection. A few familiar subjects. A little room to explore.

11ARTICLES
IN YOUR BATCH
Chosen for depth, curiosity, and variety.

Quake Shareware, a CD-ROM just a little too full

A retrospective on id Software's 1996 Quake shareware CD-ROM, which bundled encrypted full versions of id games that buyers could unlock via a phone order system built by TestDrive Corp. The scheme relied on security by obscurity: the on-disc unlock program generated serial codes locally, so GNOMON cracked it in 39 days, aided by plaintext files and bugs. The experiment failed commercially, leaving id with ~150,000 unsold CDs.

Because you like system design

Saving another 100TB of RAM with math (and Rust)

Cloudflare cut ~100TB of RAM from its Pingora Backend Router by attacking pingora-ketama's consistent-hashing rings on two fronts: packing the per-point struct from 8 bytes to 6 (25% savings, done via a raw byte array because Rust's alignment rules negate simply shrinking the index field), and reducing hashes per server by 90%, justified by a derived formula (CV_k = sqrt((N-1)/(Nk+1))) showing the last 90,000 of ~100,000 hashes bought only ~0.7% error reduction while 32-bit collisions actually made error worse at high hash counts. The tradeoffs are that fewer hashes raises the theoretical load-imbalance error margin, and changing the ring re-routes cacheable requests and would invalidate cached content, so both rings ran side by side per request and the rollout proceeded data-center by data-center to limit cache churn and blast radius.

Because you like system design

When scanners miss the attack: how Cloudflare Client-Side Security protects storefronts

Cloudflare details four malicious JavaScript campaigns found on storefronts—affiliate-commission hijacking, clickless affiliate theft, a remote-code backdoor, and a paid-traffic cloaker—that VirusTotal and URLScan largely missed, arguing behavioral ML analysis beats signature scanning for gated, conditionally executing scripts. The detection pipeline combines a graph neural network, a lightweight LLM on Workers AI, and a weighted frontier-model voting ensemble with human review. It is a vendor post promoting Cloudflare Client-Side Security, so evidence is detailed but conclusions favor the product.

Because you like ai ml

How Tailscale Peer Relays saved my holiday: a 12.5X performance boost from India

An engineer traveling from the US to India found direct Tailscale connections failed due to symmetric CGNAT on Indian ISPs, forcing traffic through shared DERP relays throttled to ~2.2 Mbits/sec. Self-hosted Tailscale Peer Relays (a node with an open UDP port) restored 27-35 Mbits/sec and cut latency ~150ms by removing the Chicago relay hop. The article explains NAT diagnosis tools and relay setup; DERP remains the fallback, and the tradeoff is operating and exposing a relay on your own infrastructure.

Because you like system design

Concurrent Servers: Part 8 - Go

This part of a series on concurrent servers shows how Go handles the problem: launch one cheap, M:N-scheduled goroutine per client, avoiding async/await since the runtime already uses epoll for I/O. It then covers cases where you should still bound concurrency—compute-heavy tasks, limited downstream resources, and malicious clients—via a channel-as-semaphore pattern or a worker pool. Tradeoff noted: goroutines are cheap, but unbounded concurrency can still exhaust CPUs or file descriptors.

Because you like backend

Building Agents that Don't Break Themselves

The article argues that an AI agent's long-lived process (its 'home') and the sandbox where it executes model-generated commands should be separate environments. It presents two Fly.io case studies: SpriteDoc uses a throwaway sandbox per session with per-command credential injection, while Hermes Agent keeps a persistent per-task sandbox. Tradeoffs include lifecycle choice, idle cost (sandboxes go cold), and replacing approval prompts with sandbox isolation plus cheap checkpoint/restore rollback.

Because you like system design

repr(Rust) - The Rustonomicon

This Rustonomicon chapter explains the default repr(Rust) type layout rules: alignment, size, and compiler-inserted padding. It argues that field ordering is deliberately unspecified because generic monomorphizations may need different orderings to avoid wasted space, and enums can use tricks like the null pointer optimization to eliminate tags. The tradeoff is compiler layout flexibility versus the inability to assume a stable memory layout.

Explore programming languages

Marketing ops as code: Automating events from planning to follow-up on GitHub

A GitHub marketing lead automated event operations end-to-end by treating each event as a GitHub Issue: issue forms capture inputs, labels act as triggers, GitHub Actions stage the event, and Copilot 'skills' (Markdown runbooks) handle planning and post-event follow-up. She argues the pattern applies to any repetitive work touching tools with an API or CLI, weighing it against packaged marketing-automation platforms: regional variation favors custom pipelines with PR-based change management, though a silent cron failure shows monitoring is still required.

Because you like developer tools

PivCo-Huffman “merge” operations

The post surveys existing approaches to parallel Huffman decoding—multi-stream, interleaved (e.g. GDeflate), and speculative brute force—and explains why each carries costs like gather-heavy access, magic interleave constants baked into wire formats, or discarding 80%+ of work. PivCo-Huffman sidesteps these by recasting decoding as list merges reducible to prefix sums, scaling to any vector width. The bulk derives merge kernels for AVX-512 VBMI2, SSE4.2/AVX2, and NEON, trading lookup-table size against instruction count; results are mainly on high-end hardware.

Explore performance

Memory ordering in CPUs

The article argues that mainstream CPUs—whether strongly or weakly ordered—do not literally obey their memory models; they optimistically reorder accesses and use a "trust but verify" scheme, rolling back and retrying when contention is detected. The real distinction is that strongly ordered machines track metadata for every in-flight access and retry more often under contention, while weakly ordered ones have more legal orderings. Empirically, large-scale ARM and x86 servers behave similarly, so the author advises contending less rather than contending faster.

Explore performance

A 0-click exploit chain for the Pixel 10: When a Door Closes, a Window Opens

The article documents a zero-click-to-root exploit chain on Pixel 10: an updated Dolby decoder exploit (CVE-2025-54957) paired with a new VPU kernel driver flaw whose mmap handler maps unbounded physical memory, exposing the kernel image. The author credits Android's improved triage (High severity rating, 71-day fix) but argues the same vendor again shipped a shallow, easily found driver bug, so proactive driver security remains weak.

Explore security
That’s your batch. Mark articles read or dislike them to make room for more.

More articles will appear as your library grows. Source and topic limits keep this selection varied.