Intelligence
Latest Articles
Latest intelligence on infrastructure operators, policy decisions, market moves, and digital power shifts.
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…
History
The Counter Passed One Receiver’s Window. It Did Not Name the Sender: RFC 2085
RFC 2085 placed a 64-bit replay counter inside one HMAC-MD5 Authentication Header transform, but only when the Security Association selected it. A receiver could admit unseen packets within its own reordering window and reject a repeated value. That was useful freshness evidence…
History
Jean E. Sammet Made Algebra Executable; FORMAC Did Not Prove the Mathematics
FORMAC let a computer differentiate, expand and rearrange an algebraic expression before handing generated code to an ordinary FORTRAN chain. Its achievement becomes clearer, not smaller, when each handoff is kept within its own evidentiary boundary.
History
The Fourth Letter Decided What the Editor Could Keep: RFC 2083
An editor can change every pixel in a PNG and still face a question that no preview answers: what should happen to a chunk it does not understand? RFC 2083 put part of that decision into the capitalization of four bytes. The last letter governed copying after edits, while the…
Story
RIPE NCC Kept the Lameness Checks and Stopped the Emails
In 2009, RIPE NCC separated two activities that are often mistaken for one: it continued periodic checks of broken DNS delegations and ended the bulk email alerts generated from them. The decision is a useful historical operating case in what an infrastructure measurement can…
History
The Directory Stored Two Links. It Could Not Tell You What Either Meant: RFC 2079
A directory entry could carry two impeccable-looking links: one labelled “official record,” another “current service.” RFC 2079 made both values easy to store and split into URI and label. It did not tell a client whether the links described two resources, two locations for one…
History
LAP6 Made Code Editable; It Did Not Make It Correct
Mary Allen Wilkes gave a 2,048-word LINC a visible, responsive path from manuscript to tape file to binary program. The value of LAP6 lies as much in the boundaries between those stages as in their extraordinary integration.
History
The Header Existed. Its Jurisdiction Did Not Follow: RFC 2076
A mail parser could prove that a line named `Apparently-To` was present. It could not prove that the field was a standard Internet-mail instruction, that it was safe to expose, or that any receiver should act on it. RFC 2076 made that gap visible by cataloguing familiar message…
History
One Master Picture, Many Instances: Sketchpad’s Shared Definition Boundary
Ivan Sutherland’s 1963 system made a complex drawing reusable without pretending that every appearance was a new entity. Its master-picture mechanism remains a precise lesson in dependency: change can propagate through a hierarchy, while placement, scale, physical realization and…
History
Lynn Conway’s Lambda Rules Made Layout Portable, Not Certain
Replacing micrometres with a single unit called λ changed who could design chips and how a fabrication process could receive their work. It did not turn a clean layout into a working chip. Lynn Conway’s scalable rules matter because they created a powerful interface—and because…
History
Dorothy Denning and What the Lattice Actually Permits
A security lattice can prove that a modeled dependency obeys a chosen flow policy. It cannot prove that the policy deserves trust. Dorothy E. Denning’s early work remains valuable precisely because it makes both the assurance and its boundary unusually clear.
History
Nancy Lynch and the Execution That Never Has to Decide
The FLP result does not say that distributed systems cannot agree. It identifies the exact place where a deterministic protocol loses a universal progress guarantee: a fully asynchronous model, reliable but unbounded message delay, and permission for one process to crash.
Story
LACNIC’s WHOIS Shows the Origin ASNs but Not Their Authorization Boundary
LACNIC’s WHOIS Shows the Origin ASNs but Not Their Authorization Boundary intelligence summary explains the development, the public evidence available to readers, the organisations involved, the regional context, market exposure, and the infrastructure consequences that may…
IETF
RFC 9806 Corrects the Label, Not the Deployment
The standards record now has a clear name for SIPREC recording metadata: `application/rs-metadata+xml`. That clarity joins an original metadata RFC, a contradictory protocol RFC, an erratum, a later update and an IANA entry. It still leaves operators to prove whether the…
History
Leslie Lamport and the Order a Timestamp Cannot Prove
A Lamport timestamp can preserve a known causal path through processes and messages. It cannot turn every lower number into a cause, every incomparable event into physical simultaneity, or one convenient total order into the history that really happened.
Story
ARIN’s Legal RPSL Still Produced a Partial Mirror Answer
A recursive query returned seven ASNs. The reference described in ARIN’s public suggestion contained far more. Nothing in that contrast required the routing policy to be invalid: the failure could sit in the journey from a logical set, through one very long physical line, into a…
IETF
The Card Passed Two Profiles. The Protocol Still Had a Question: RFC 10050
A profile can prove that a JSContact card belongs to a named, versioned subset. It cannot prove that a protocol should accept the card, or even tell a receiver which profile the sender intended. RFC 10050 makes that boundary explicit and turns profile identity, recursive property…