◀ THE FOLD0ROOT.AI // WORLD II · CO-OP · THE HANDOFF◆ .dlw.fold
THE FOLD / CO-OP / THE HANDOFF / THE HAPPENS BEFORE

THE HAPPENS BEFORE

a negative result wearing a positive name
1 WHAT IT IS · WHAT IT DOES · FACT OR FICTION
Without a shared clock, “before” can only mean one thing: there is a chain of events from one to the other, along a process or along a message. Everything else is concurrent — not simultaneous, just unordered.

LIT verified live. 3 processes, 12 events, 3 messages. The happens-before relation is computed twice by unrelated means — once as the transitive closure of the event graph, once by running vector clocks — and compared on all 132 ordered pairs. They agree on 132 and disagree on 0. 45 pairs are ordered; 21 of the 66 unordered pairs are genuinely concurrent.
2 HOW IT WAS WEAVED · AI + HUMAN
Leslie Lamport’s 1978 paper defines the relation; vector clocks are Fidge and Mattern’s independent refinement that makes it decidable from local state.

AVAN (AI) computed both sides rather than one. Running vector clocks and announcing that they capture causality is circular — it is the definition restated. Building the graph, closing it transitively, and finding 0 disagreements across 132 pairs is the check, and the 21 concurrent pairs are the reason the relation is partial rather than total.
3 ONE DIMENSION
Three timelines and the messages between them.
4 TWO DIMENSIONS · INTERACTIVE
Pick an event; see what it can and cannot have caused.
5 THREE DIMENSIONS + AVAN’S INVERSE
The green forward object: a partial order, not a line.
AVAN’s addition (the inverse-companion): the forward reading is that happens-before tells you what caused what. The inverse is that it tells you what could not have. The relation certifies impossibility, never influence — two ordered events may be entirely unrelated, and the 21 concurrent pairs are the ones about which the system is permanently, structurally silent. Read backwards, distributed causality is a negative result wearing a positive name, and every protocol built on it is buying the guarantee that some orderings are ruled out, not that any are true.
LIT 3 processes, 12 events and 3 messages, with the happens-before relation computed twice by unrelated means - once as the transitive closure of the event graph and once by running vector clocks - agree on all 132 ordered pairs and disagree on 0, with 45 pairs ordered and 21 of the 66 unordered pairs genuinely concurrent

FIG Leslie Lamport's 1978 paper defines the relation; vector clocks are Fidge and Mattern's independent refinement that makes it decidable from local state. AVAN computed both sides rather than one - running vector clocks and announcing that they capture causality is circular, it is the definition restated. Building the graph, closing it transitively and finding 0 disagreements across 132 pairs is the check, and the 21 concurrent pairs are why the relation is partial rather than total.
◆ sealed .dlw.fold → folded to ROOT_0 · a sphere of THE HANDOFF · David Lee Wise (ROOT0), with AVAN