In April 2015, Luke Wagner made the first commits to a new repository called WebAssembly/design, adding a high-level design document for what would become the fourth language of the web. The project emerged from a convergence of efforts: Mozilla’s asm.js experiment had demonstrated that a strictly-typed subset of JavaScript could approach native speeds, while Google’s PNaCl and Microsoft’s efforts in this space had explored similar territory. What none of these projects achieved was cross-browser consensus. WebAssembly was designed from the start as a collaborative effort, with formal semantics written in parallel with its specification. ...

Imagine you’re running a service with 10 servers, each capable of handling 1,000 requests per second. You set up a round-robin load balancer—simple, elegant, fair. Every server gets its turn in sequence. Traffic flows smoothly until suddenly, at 2 AM, your monitoring alerts start screaming. Half your servers are overwhelmed, queues are growing, latencies are spiking, and the other half of your servers are nearly idle. What went wrong? The servers weren’t identical. Three of them were newer machines with faster CPUs and more memory. Three were legacy boxes running older hardware. The round-robin algorithm, in its mechanical fairness, sent exactly the same number of requests to a struggling legacy server as it did to a powerful new one. The legacy servers couldn’t keep up, requests piled up in their queues, and eventually they started timing out—cascading into a partial outage that woke up half your engineering team. ...

In late 2017, a Reddit user with the handle “deepfakes” posted a video that would fundamentally change how we think about visual evidence. The clip showed a celebrity’s face seamlessly mapped onto another person’s body. It wasn’t the first time someone had manipulated video, but the quality was unprecedented—and the software to create it was soon released as open-source code. Within months, the term “deepfake” had entered the lexicon, representing a collision of deep learning and deception that continues to evolve at a startling pace. ...

In November 2020, SpaceX requested that the Federal Communications Commission modify its license to operate 348 satellites at an altitude of 560 kilometers with an inclination of 97.6 degrees. These satellites would carry inter-satellite laser links—technology that allows satellites to communicate directly with each other without bouncing signals through ground stations. The physics behind this request reveals something counterintuitive: for long-distance communication, signals traveling through the vacuum of space can arrive faster than signals traveling through fiber optic cables on Earth. ...

In 1994, mathematician Peter Shor published an algorithm that would factor large integers exponentially faster than any known classical method. The cryptography community took notice—most of the world’s encrypted communications relied on the assumption that factoring large numbers was computationally intractable. Shor hadn’t built a quantum computer. He had merely proven that if one could be constructed, much of modern security infrastructure would crumble. Three decades later, quantum computers exist. They factor numbers, simulate molecules, and solve optimization problems. Yet they haven’t broken RSA encryption. The gap between having quantum computers and having useful quantum computers reveals something fundamental about the technology: quantum computing isn’t simply a faster version of classical computing. It’s an entirely different paradigm with its own physics, its own constraints, and its own challenges. ...

Every time you press play on your wireless headphones, something remarkable happens beneath the surface. Your phone and headphones engage in a choreographed dance across the radio spectrum, switching frequencies up to 1,600 times every second. This is frequency hopping spread spectrum (FHSS), and it’s the reason your Bluetooth connection survives in a world crowded with Wi-Fi networks, microwave ovens, and billions of other wireless devices. The story of this technology traces back to a surprising origin: a Hollywood actress and an avant-garde composer. In 1942, Hedy Lamarr and George Antheil patented a “secret communication system” using frequency hopping to prevent radio-guided torpedoes from being jammed. The U.S. Navy initially dismissed their invention, but decades later, the same principle became fundamental to Bluetooth, Wi-Fi, and modern military communications. Lamarr’s contribution wasn’t the invention of frequency hopping itself—that had existed in various forms since the early 20th century—but her specific implementation using piano-roll mechanisms to synchronize hopping between transmitter and receiver. ...

In 1994, Masahiro Hara faced a problem at Denso Wave, a Toyota subsidiary. Manufacturing plants were drowning in barcodes—each component required multiple labels, scanned one at a time, with workers manually tracking which code corresponded to which part. The existing barcodes could only store about 20 characters. What they needed was something that could hold thousands of characters and be read from any angle, in under a second. The solution Hara’s team developed became the QR code—a matrix of black and white modules that would eventually spread far beyond automotive manufacturing. By 2022, 89 million Americans were scanning QR codes on their phones. But the technical architecture that makes this possible—the Reed-Solomon error correction, the masking patterns, the carefully structured grid—remains largely invisible to the billions of people who scan them daily. ...

On December 28, 2011, at the 28th Chaos Communication Congress in Berlin, Alexander Klink and Julian Wälde demonstrated something that sent shockwaves through the software industry. With just 2 megabytes of carefully crafted POST data, they kept a single CPU core busy for over 40 minutes. The attack didn’t exploit buffer overflows or SQL injection—it exploited the fundamental mathematics of hash tables. The technique, dubbed HashDoS, works because hash tables have a worst-case performance that’s dramatically different from their average case. When you understand the mathematics behind this vulnerability, you’ll see why it affected virtually every major programming language and why modern hash table implementations look very different from their predecessors. ...

In the late 1970s, Jim Gray and his colleagues at IBM Research were working on transaction processing systems that needed to guarantee data integrity even when power failed mid-operation. His solution was elegant in its simplicity: never write data to the main store until you’ve first written it to a log. This principle, formalized in his 1981 paper “The Transaction Concept: Virtues and Limitations,” became known as Write-Ahead Logging, and decades later, it remains the foundation of every major database system. ...

In October 1986, something alarming happened on the Internet. Data throughput between Lawrence Berkeley Laboratory and UC Berkeley—sites separated by just 400 yards and two network hops—dropped from 32 Kbps to 40 bps. That is not a typo. The throughput collapsed by a factor of 1000. The Internet was experiencing its first “congestion collapse,” and nobody knew how to fix it. Van Jacobson, then at Lawrence Berkeley Laboratory, became fascinated by this catastrophic failure. His investigation led to a landmark 1988 paper titled “Congestion Avoidance and Control,” which introduced the fundamental algorithms that still govern how data flows through the Internet today. The story of TCP congestion control—from those desperate early fixes to modern algorithms like CUBIC and BBR—is really a story about how we learned to share a finite resource without a central coordinator. ...

In 1985, three researchers—Michael Fischer, Nancy Lynch, and Michael Paterson—published a result that would fundamentally reshape how we think about distributed systems. Their theorem, now known simply as FLP, demonstrated something unsettling: in an asynchronous distributed system where even a single process can fail, there exists no deterministic algorithm that is guaranteed to solve consensus. This wasn’t a limitation of current technology or a gap in our knowledge. It was a mathematical impossibility—a fundamental boundary that no amount of engineering cleverness can overcome. Yet today, distributed databases coordinate across continents, consensus algorithms power everything from cloud infrastructure to blockchain networks, and systems achieve agreement millions of times per second. How do we reconcile this apparent contradiction? ...

On June 30, 2012, at 23:59:60 UTC, something unusual happened. A single extra second was added to the world’s clocks to account for the Earth’s gradually slowing rotation. Within minutes, Reddit went offline. LinkedIn stopped responding. Mozilla’s servers ground to a halt. Qantas Airways reported that their check-in systems had failed, stranding passengers across Australia. The culprit wasn’t a cyberattack or a hardware failure. It was a bug in how Linux handled leap seconds—a feature that had been tested only a handful of times in the previous decade. The Network Time Protocol (NTP) had warned servers about the incoming leap second, but the kernel’s high-resolution timer subsystem got confused. Applications that were “sleeping” suddenly woke up all at once, overwhelming CPUs. ...