Indexing the archive…
Your Universe of Digital Possibilities
In 1964 Paul Baran drew a network with no centre: stations wired to a few neighbours, messages cut into blocks, every block passed on at once to whichever link looks nearest — with no map, only tables learned from the traffic itself. Give it a little redundancy, strike it, and watch it route around the crater by itself.
Baran’s measure of how meshed a network is: the link-to-node ratio of a large array, with the fewest links that connect everyone (a tree) as level one. A square grid is R = 2, eight neighbours R = 4. Redundancy is what a strike has to cut through.
After a strike, the share of surviving station pairs that can still reach each other: ck are the sizes of the surviving components, ns the survivors. Baran’s own criterion is its cousin — the share of survivors still in the largest group. Both are counted by breadth-first search, which no station can run.
Pass every block at once to the live link whose table entry toward its destination is lowest. The table is learned backwards: a block from station o that arrives over link k after a hops says k reaches o in a. Entries age by α a round until refreshed, so routes that stop working are forgotten.
Destroy each station with probability q and the survivors are an open-site configuration with p = 1 − q. The net stays whole while the survivors still percolate — the law The Percolation measures on a lattice, read here as a design margin: redundancy moves the threshold.
This is the Baran Edition’s first protocol, and the first image of the internet. Baran’s nets are the engineered counterpart of The Percolation and The Hub: there a lattice or a graph’s shape decides what survives; here the designer chooses the shape — a redundancy of about three — and a one-line rule does the rest. Nine protocols follow, each keeping something alive with no one in charge, and the last, The Chain, runs this instrument’s survivability on a network of miners.