WAITING FOR YOU

Unread

No deadlines. Just things worth spending time with.

58 articles

Migrating the GitHub Copilot runtime to Rust, using Copilot

GitHub rewrote the Copilot agent runtime from TypeScript/Node.js to 800,000+ lines of Rust, with AI agents writing most of the code across 128 incremental pull requests shipped in place rather than via a big-bang cutover. Reported gains include large reductions in startup time, memory, and CPU, plus an embeddable C-ABI surface for six SDK languages, at the cost of ~$120K in tokens, explicit lifetime management, and some regressions. The author frames it as escaping Node/V8 overhead for embedded runtimes, not a general claim that TypeScript should become Rust.

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.

Should you read the code, is RAG dead, and did Skills kill MCP?

The article pushes back on five common AI hot takes: that you can skip reading AI-generated code, that not using AI hurts hiring, that Skills killed MCP, that RAG is dead, and that needing fine-tuning signals bad code. It argues each is oversimplified—review depth should match actual risk, AI fluency is about judgment, MCP and Skills solve different problems, and RAG still grounds answers. It closes by urging readers to test ideas by building rather than debating.

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.

Your Agent Speaks MCP. Give It a Computer.

Fly.io pitches Sprites—instantly created, near-free-when-idle cloud computers with durable filesystems—as a better agent runtime than stateless sandboxes. The substantive argument: the MCP-vs-CLI debate conflates layers; progressive disclosure is about what enters the context window, while MCP handles transport, auth, and structured results, so plugins can layer skills over a hosted MCP server. It is vendor marketing, but the layering distinction, safety annotations, and guardrail defaults (org scoping, five-Sprite cap) are the meat.

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.

My agent.md to improve LLM-assisted code quality

The author recounts moving from unusable LLM code in 2025 to productive agentic coding in 2026, then shares the agent.md file they built to encode recurring code-review corrections as prompt rules: concise comments, no magic numbers, early returns, private-by-default visibility, layered architecture, commit conventions, and test-first bug fixes. It reduces repetition and frees review time for architecture, but is no magic bullet — hallucination and verification remain, and 'context dilution' degrades adherence, mitigated by short sessions and reloading agent.md.

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.

ryg_rans is not a library

The author explains that ryg_rans is a toy demonstration of rANS—like a hardware-store board displaying fastener options—not a production library, and that its static byte model, alias-table variant, multiple SIMD interleaving variants, and bitstream format are all unfit for real use. He gives concrete recommendations: 32/16 or 64/32-bit state renormalization, two-state implicit interleaving, forward modeling with backward encoding, and adaptive EMA models, preferring tANS when probabilities are static.

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.

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.

How we saved 100 terabytes of memory by optimizing 1.1.1.1’s DNS cache

Cloudflare details five Rust memory-layout changes to its 1.1.1.1 DNS cache — dropping Vec/String capacity fields, merging record lists with u16 offsets, omitting owner names when they match the query key, boxing large enum variants, and storing record data as wire-format bytes — cutting per-entry memory 56% and freeing roughly 100 TB fleet-wide. Performance also improved (inserts +43%, lookups −19%), though each change carries tradeoffs: allocator overhead and poor locality from boxing, sequential-only access for wire-format buffers, and records no longer self-contained.

medium.com

The publisher returned HTTP 403. Open the original or retry later.

Uber’s Real-Time Push Platform

Uber replaced mobile app polling—which reached 80% of gateway traffic—with RAMEN, a server-push platform built on Server-Sent Events plus a custom sequence-number/acknowledgment protocol for at-least-once delivery. Scaling forced a rewrite from Node.js with Ringpop gossip sharding to Netty with ZooKeeper/Helix, reaching 1.5M concurrent connections and 250K messages/sec. A newer gRPC bidirectional streaming version addresses delayed acks, unidirectional transport, and text-only payload limits.

netflixtechblog.com

The publisher returned HTTP 403. Open the original or retry later.

Infrastructure Update: Pushing the edges of our global performance

Dropbox explains how it reduced transfer latency for distant users by deploying Points of Presence and edge proxy servers in multiple regions, absorbing the TCP slow-start and TLS handshake delays that undersea-cable round trips impose. Proxies hold persistent connections to data centers over private backbone links, with TLS 1.2, PFS, and certificate pinning preserving security. Reported gains vary by market (40% to 3x median speedups), and implementation details remain high-level.

blog.x.com

The publisher returned HTTP 403. Open the original or retry later.

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.

blog.hotstar.com

The publisher returned HTTP 403. Open the original or retry later.

medium.com

The publisher returned HTTP 403. Open the original or retry later.

Service-Oriented Architecture: Scaling the Uber Engineering Codebase As We Grow

Uber recounts migrating from a monolithic codebase to a microservices SOA (500+ services) to handle rapid growth, which solved coupling and deployment problems but introduced issues of obviousness, safety, and resilience. They adopted Apache Thrift for strict cross-language service contracts and built client-publishing tooling, drawing on Netflix Hystrix and Twitter Finagle for fault tolerance. Tradeoffs include immature Thrift tooling for Python and Node, and no header support complicating authentication and tracing.

netflixtechblog.com

The publisher returned HTTP 403. Open the original or retry later.

I don't like passkeys

The article argues passkeys are technically strong—phishing-proof and breach-resistant—making them well-suited to enterprises, but a poor fit for individuals whose bigger risks are lockout, account bans, and device loss. It details pain points: hardware keys can't be backed up and have per-key credential limits, platform-synced passkeys tie you to Apple/Google accounts, export/interoperability is immature, and cross-device login is clunky. It recommends passwords in a third-party manager plus a separate TOTP app, except for habitual password reusers.

Laya — 33ms Multilingual System 1 Decision Engine

The author introduces Laya, an open-source family of bidirectional encoder models that answer typed questions (choice, ordinal score, boolean) with calibrated probabilities in roughly 33 ms, arguing generative LLMs are overkill for high-volume triage and routing. Self-reported benchmarks claim speed, calibration, and cost advantages over the proprietary Jev API. Acknowledged tradeoffs: choice questions degrade beyond ~20 options, base checkpoints are near-random zero-shot and require fine-tuning, and temperature calibration is needed.