The game plays exactly as before.
* The NOC intern plans every POP in one pass: portsAt() counts router ports for all cities at once (routers, ports
and cache orders; the ports job keeps ports in use and reserved by city between two jobs), cachePlan() sorts the
boxes by POP once and cityShSum() sums a city's shares once per table, pniFlows() reads every POP's flows from
routing's columns (R.flc) in one pass and pniWant() gives the weekly PNI round its sort key from typed columns.
pniBatchRun() lets a frame through every few networks; pniQuote() looks existing PNIs and ports up from the batch.
* A dark fiber's capacity asks optG() once per run of identical optics (dfLit()); linkDown() and ownGlass() ask
dfOn(), whether it carries anything for you, without the sum unless an optic is out or managed waves are sold on
it. terrIslands() tests !l.sub first.
* Latency: latGraph() lists each city's links once in S.links order (typed arrays), latRun() is the same search with
the same sums, latPairs() searches once per city for a boutique's finance routes and the latency offers.
* Diverse paths: divGraph()/divOn() number the cities and risks once; promiseCheck() shares a diversity graph, the
land islands and one latency search per origin across every customer when the intern weighs taking a fiber out,
and spots0() shares the graph for sovereign offers.
Tests: day-steps (cache planner, ports at every POP and flows from columns equal the old ways; the PNI round through
pniBatchRun), fiber-lit-and-latency (with failed optics and managed waves), shared-promise-checks, intern-personas.