Run

The member the shell was extracted from: one agent run as a five-node graph — Prompt, three Tools, Response — walked in three stages. Nodes glow in the stage hue, edges flow, the activity panel swaps from the typed prompt to three tool columns to the composed answer, and the meter accrues tokens, dollars and seconds.

A brief forks into three branches, an independent review fans them in, rejects only the code, sends only that branch back, reviews again and ships. The retry edge is drawn as a correction and one edge flows twice; the meter counts seven tasks in five units of wall clock — serial, the same seven take seven.

Thought, action, observation, and back to thought — three times round one cycle, leaving it the moment a thought needs no action. The return edge is a plain flow edge that names three phases; the meter counts three turns against two tool calls, because the last thought answered instead of acting.

A question is embedded, twenty-four chunks come back from the index, a reranker keeps five, and the answer is generated from those five plus the question itself — two edges converge on the output. The chunk counter climbs to 24 and falls to 5 while the meter watches; that falling number is what makes it retrieval, not search.

A push fans out to lint, typecheck and test on three runners, waits for the slowest, builds and deploys. Three jobs start together and finish apart — expressed as one phase where all three are lit and one where only test remains — and the meter carries two clocks: compute minutes every job adds to, and wall minutes only the longest path advances.

Three local transactions run forward; the third fails and the walk comes back along the chain through compensations — refund the card, cancel the order — until every committed effect is undone. The compensation edges are drawn as corrections and their nodes are reached only on the way back; the meter counts two committed, two undone, net effects zero.

A coordinator fans out PREPARE to three participants, who lock their rows and vote; the walk cannot move until every vote is in. The decision is logged — the commit point — then the same edges carry COMMIT and the same return edges carry the acks: every edge flows twice with a barrier between. The meter counts three locks held across the wait, in lock·seconds — Saga's twin, atomicity bought up front.

A leader goes quiet; the first follower to time out stands for the next term and asks every peer for a vote — the dead leader included, so one edge flows out and nothing comes back. Two votes return and three of five is enough: the walk moves on to heartbeats while the slow follower's yes is still in flight, and it lands on a closed door. Two-phase commit's boundary: a barrier that opens at most, not all.

Calls flow through a breaker to a service until five fail in a row; the breaker opens, every call is shed to the fallback while a cool-down runs, then exactly one probe is let through — it succeeds and the gate closes. A gate whose destination is decided by a counter and re-opened by a single edge: no fan-out, no reversal, no vote. The meter counts calls made, failed and shed.

A staggered race: a delayed second read wins before the original finishes. The caller returns at 180 ms, then cancellation reaches the loser at 220 ms. Two request lifetimes separate caller latency from work already spent; timings are illustrative.