History of the Internet

One Router Drew the Path. No Router Needed the Whole Map: RFC 1992

Nimrod’s sharpest scaling decision was to abandon the comforting fiction of a single, complete map: knowledge could be partial, private and stale, provided that a chosen path did not depend on every router improvising from a different picture.

Byte That Sent PPP Back to the Beginning: RFC 1973

The Byte That Sent PPP Back to the Beginning: RFC 1973

RFC 1973 did not make Frame Relay trustworthy. It made a point-to-point conversation legible enough for two peers to notice when the conversation had changed shape—and to begin again before silence became a black hole.

Grant Was Automatic. The Boundary Was Not: RFC 1988

The Grant Was Automatic. The Boundary Was Not: RFC 1988

RFC 1988 removed the need to ask Hewlett-Packard for the same narrow permission implementation by implementation. It did not remove the perimeter around that permission—or the switch that could end it.

Packet That Could Not Be Decrypted: RFC 1969’s Cross-Packet Chain

The Packet That Could Not Be Decrypted: RFC 1969’s Cross-Packet Chain

A lost encrypted packet in RFC 1969 did more than remove its own contents. It also took away the input needed to decrypt the next packet—yet the ciphertext of that unreadable successor carried enough state to let the receiver continue after it. This peculiar two-packet shadow reveals both the economy and the evidentiary limits of extending DES-CBC across PPP packet boundaries.

Turnaround Was the Budget: RFC 1986 and ETFTP’s Selective Evidence

The Turnaround Was the Budget: RFC 1986 and ETFTP’s Selective Evidence

On a half-duplex radio path, the expensive event was not merely losing a packet. It was surrendering the channel, synchronizing the other direction, and paying again before useful data could resume. RFC 1986 designed ETFTP around that bill.

Uncompressed Packet That Changed the Dictionary: RFC 1967

The Uncompressed Packet That Changed the Dictionary: RFC 1967

An LZS-DCP packet can arrive with its data plainly uncompressed and still alter the shared state needed to decode the next compressed packet. RFC 1967 made that choice explicit, split state into numbered histories, and carried recovery signals inside later data packets. The result is efficient and local—but every bit proves only its own narrow transition.

Packet Stayed Native, but the Dictionary Moved: RFC 1977's Hidden PPP State

The Packet Stayed Native, but the Dictionary Moved: RFC 1977's Hidden PPP State

A packet capture can show an ordinary PPP datagram while both endpoints quietly rewrite the codebook that will determine the meaning of the next compressed packet. RFC 1977 made that invisible transition a condition of interoperability.

Ticket Arrived. The Receipt Did Not: RFC 1964’s Authentication Boundaries

The Ticket Arrived. The Receipt Did Not: RFC 1964’s Authentication Boundaries

RFC 1964 gave Kerberos V5 a disciplined GSS-API wire vocabulary: a mechanism identifier, typed tokens, a digest for caller-supplied channel bindings, service flags and an optional delegated credential. The design is valuable precisely because each item stops at a boundary. A request is not a mutual receipt, a capability flag is not an outcome, and a forwarded ticket is not an authorization decision.

Header Came Last: How RFC 1963 Reassembled Serial Frames over PPP

The Header Came Last: How RFC 1963 Reassembled Serial Frames over PPP

RFC 1963 made an unusual bargain with time: send the serial data first, postpone the adaptation header until the packet's end, and let the transmitter decide on segmentation only after compression had revealed the size. What reached the receiver was a grammar for reconstruction, not a certificate that reconstruction had succeeded.

One Direction Lost the Dictionary. The Other Kept Moving: RFC 1962

A PPP link in 1996 could agree to compress traffic without pretending that its two directions were identical. RFC 1962 let each receiver say what it could decompress, let the reverse path make a different choice, and gave a damaged direction a reset exchange of its own. That modest separation is also a warning: an acknowledgement, a compressed-frame marker and a reset receipt each prove less than operators often ask them to prove.

No Memo Could Command the Network: RFC 1958 and the Right to Change

The most durable sentence in a document about architectural principles may be its warning that the principles will not endure. RFC 1958 treated the Internet less as a monument to be defended than as a city whose streets had to remain open while each block was rebuilt.

URL Carried a Query, Not Its Authority: RFC 1959

The URL Carried a Query, Not Its Authority: RFC 1959

In 1996, a directory lookup could be folded into a string short enough to paste into a document or hand to a web client. That convenience was exact but narrow. RFC 1959 could name a server, a place in the directory, the attributes to request, a search scope and a filter. It could also leave several of those fields blank and thereby activate defaults. What it could not carry was the authority to choose an unnamed server, disclose protected data, certify the returned set or decide what another program should do next.

Space the Standard Never Required: How POP3 Software Made Compatibility Law

The Space the Standard Never Required: How POP3 Software Made Compatibility Law

A single blank character can look too small to deserve a history. RFC 1957 showed why it did: once a common server emitted that character on every response, clients learned to depend on it, and a conforming shorter reply became the dangerous case.

Proposal Added a Header. It Refused to Rewrite the Address: RFC 1955

The Proposal Added a Header. It Refused to Rewrite the Address: RFC 1955

RFC 1955 described a way to make the Internet's routing problem look smaller without pretending that its addressing problem had disappeared. At an entrance border, the proposal would place the original IPv4 datagram inside a second IP header addressed to an autonomous domain. At the exit border, that wrapper would come off and the unchanged datagram would continue. Hosts and most routers would not change. DNS and the borders would. The proposal's real historical value lies in that accounting: a transition can reduce the number of machines that must move while concentrating new state, judgment and failure at the edge of the old system.

Cell Carried a Label. It Did Not Carry a Verdict: RFC 1954

The Cell Carried a Label. It Did Not Carry a Verdict: RFC 1954

In Ipsilon's 1996 ATM design, a flow label did not decorate an IPv4 packet. It changed the virtual channel and, for two flow types, changed which IPv4 fields crossed the link at all. That economy made forwarding state executable—and made the limits of the resulting evidence unusually clear.

Switch Offered a Shortcut. The Router Could Refuse: RFC 1953

The Switch Offered a Shortcut. The Router Could Refuse: RFC 1953

In RFC 1953, the faster path began as a neighbor's request, not a command. A downstream node chose a label from its own local space and asked the upstream node to attach it to a defined IP flow. The upstream node could ignore the request. Even acceptance lasted only for a stated lifetime, and conflicting state sent the traffic back to ordinary forwarding. The document captured a useful Internet instinct at a moment when ATM speed looked irresistible: acceleration could be local, temporary and revocable without making the shortcut sovereign over the route.

File Ended, Then Continued: RFC 1952 and Gzip's Member Boundary

The File Ended, Then Continued: RFC 1952 and Gzip's Member Boundary

A `.gz` filename suggests one object. RFC 1952 describes something more interesting: a procession of self-closing members. Finish one, place another immediately after it, and a decompressor can continue as though the file had acquired a new chapter. The old compressed bytes need not move. That modest boundary made appendability possible, but it also fixed the scale of the evidence. Each trailer checks one member; it does not authenticate the hand that appended it or announce the absolute size of everything the filename contains.

Key Centre Disappeared into the Tree. Its Authority Did Not: RFC 1949

The Key Centre Disappeared into the Tree. Its Authority Did Not: RFC 1949

Scaling usually sounds like subtraction: remove the bottleneck, spread the work, let the network carry the rest. RFC 1949 did spread multicast key distribution, but it could not subtract trust. By letting authenticated tree nodes pass group secrets and authorise later joins, the proposal turned a delivery topology into a delegation topology. The centre became less busy because pieces of its authority travelled outward.

Password Was Correct Once. Acceptance Changed What Correct Meant: RFC 1938

The Password Was Correct Once. Acceptance Changed What Correct Meant: RFC 1938

Passwords usually sound like facts: either the claimant knows the right string or does not. RFC 1938 made that description incomplete. In its one-time-password system, a correct answer was consumed by success. The server replaced the value against which the next answer would be judged, so authentication was not merely a comparison but a shared-state transition. That small move made replay resistance possible—and pulled races, exhausted sequences and reinitialisation inside the meaning of “correct.”