Intelligence
Latest Articles
Latest intelligence on infrastructure operators, policy decisions, market moves, and digital power shifts.
History
Adele Goldberg and the Contract That Let Smalltalk-80 Travel
The Blue Book turned a live system into a portable agreement: preserve the image, implement the entity memory, bytecodes, contexts and primitives, and let unlike machines run the same Smalltalk-80. The agreement made reimplementation possible; it never promised equal speed…
History
The Join Had No Receipt. The Tree Survived by Refresh: RFC 2117
RFC 2117 did not build a sparse multicast tree as one transaction. A local membership indication created one record; a Join/Prune refreshed records hop by hop; a source initially reached a rendezvous point inside Register messages; a branch could later move to source-specific…
IETF
RFC 9787 and the Moment a Draft Becomes a Message: Encryption, Commitment and Cross-Device Custody
A protected email draft is not merely an early copy of a sent message. RFC 9787 treats it as a different authority state: unfinished text may need confidentiality from the mailbox service while remaining unreadable to intended recipients and unendorsed by the user's ordinary…
History
Evelyn Berezin and the Boundary Between Uptime and Inventory Truth
Teleregister's United Airlines system could lose a processor and keep answering. That was a landmark of online engineering. It was not, however, proof that every answer about an available seat was true.
CASE FILE
Internet Society Approved Its 2026–2027 Election Clock. Now It Needs an Activation Record
On 14 September, Internet Society’s Board completed two acts in one written resolution: it added four people to the committees supervising the next trustee-selection cycle, and it approved that cycle’s timetable “as attached”. The corporate decision is visible. The exact public…
History
The MIB Located the Address. The Repeater Still Had No MAC
A management station could ask which hub port had carried a source address, rank the busiest ports and reconstruct a shared-Ethernet topology. RFC 2108 made those answers comparable without pretending that the repeater itself understood a packet.
History
Kathleen Booth and the Line Between a Symbol and a Machine Order
In 1947, Kathleen Britten and Andrew Booth described a way to move from a mathematical plan to the exact fields their calculator would obey. The abbreviated notation made that crossing legible. It did not make the machine understand what the calculation meant.
CASE FILE
W3C’s LLM Note Assigns Personal Responsibility—but Not an Accountability Process
The W3C Advisory Board’s new note contains a strong sentence: each person remains responsible for work they share, whether or not a large language model helped produce it. The status paragraph contains an equally important limit. The document is an Advisory Board Group Note…
History
The Address Said Home. The Dial-Up Line Said Away: RFC 2107
RFC 2107 let a remote dial-in client borrow the routing appearance of home. The illusion depended on a Foreign Agent, a Home Agent, a shared secret, a Tunnel ID and state that had to be created and destroyed in the right order.
History
Karen Spärck Jones Made Rarity Count; IDF Did Not Make It True
The same word can be commonplace in one document collection and unusual in another. Karen Spärck Jones turned that difference into a useful retrieval signal. Her achievement was not to discover a universal measure of importance, but to show how a collection can disclose which…
History
The Router Gave the Workstation an Address. It Did Not Give It an Identity: RFC 2106
RFC 2106 solved a real scaling problem by placing many remote SNA and NetBIOS workstations behind one DRAP server. The bargain was precise: fewer backbone peers, more state and judgment concentrated at the boundary.
History
The Tag Moved the Packet. It Did Not Prove the Path: RFC 2105
A packet entered a switch carrying a short tag. The machine used that value as an exact index, selected an interface, replaced the tag and sent the packet onward. That was the elegant part of Cisco’s 1997 Tag Switching proposal. The harder truth sat elsewhere: routing protocols…
IETF
When Fast Reroute Must Stop: RFC 9791 and the Responsibility Boundary Behind NFFRR
RFC 9791 gives a deceptively simple answer to a hard failure problem: once fast reroute has already redirected a packet, a downstream node may need to refuse another local repair. The difficult part is not the idea of a marker. It is the authority embedded in that marker—the…
CASE FILE
The Grammar Changed. Your Acceptance Boundary Might Not.
RFC 9682 repairs CDDL’s collected grammar and adds a cleaner hexadecimal escape form, but the important compatibility boundary is not the publication date of the RFC. It is the point at which a particular source model meets a particular parser, becomes a particular validator…
History
Two Hash Passes Made a Reusable MAC. The Tag Did Not Make a Trust Decision: RFC 2104
RFC 2104 gave protocol designers a compact way to turn existing iterative hash functions into a message authentication code: one keyed inner pass, one differently keyed outer pass, and an interface that could survive replacement of the hash beneath it. What endured was the…
History
The Locator Moved. Then the Network Moved: RFC 2103
Nimrod’s mobility paper began with an elegant separation: keep the endpoint’s identity stable and update the locator that says where it can be reached. Then it found the case that broke the elegance—a network could move while the endpoint’s locator stayed the same, leaving the…
IETF
When “Lease” Stops Meaning “Address Assigned”
An operator upgrades a DHCPv6 inventory schema and discovers that one familiar dashboard label—“lease”—now conceals two different origins of authority. In one record, the server selected or delegated the resource. In another, the device selected a SLAAC or static address and…
History
The Tree Was Not Standardized. The Forwarding State Was: RFC 2102
Nimrod declined to choose one multicast tree algorithm. Its narrower bargain was more durable: different methods could coexist if routers agreed on the shape and meaning of the state that actually replicated packets.
History
The Link Was Open. Each Name Still Needed Admission: RFC 2097
PPP could bring a remote machine to the edge of a NetBIOS Frames network, but RFC 2097 did not treat link-up as reachability. Before NBF traffic flowed, NBFCP let the remote side ask a peer to project particular sixteen-octet names, return a result for every name, identify its…
History
Frances E. Allen Taught Compilers to Prove Less—and Mean It
A compiler can prove that a definition may reach an instruction, that a value remains live, or that moving an operation preserves a specified semantics. Frances E. Allen’s work made such reasoning systematic. It did not turn optimisation into a certificate that the program will…