dayTick() routes the day, then appends today's transit use to t.hist. Every
compute() after that (any click, the intern, the sales trial) took the last 29
entries of t.hist, which now end on today, and added today's use again: today
counted twice and the 30th day back dropped out. So compute() gave a different
transit bill the second time after each day. p95() now leaves today's sample out
once S.hist says the day has been recorded.
This was the only part of compute() that was not a pure function of S. The rest
of the drift round 1 saw (R right after dayTick vs. a fresh compute) is dayTick
itself changing S after its compute (customers churning, events ending), which
is intended: the next day routes the new state. Scenic circuits' hysteresis is
documented, with a test that two calls converge.
Spicy chaos moved attacks onto the gamers' daily schedule without scaling it, so the
preset had about 20x the attacks of On-call. Without gaming customers, attacks stay
on the failure schedule (which spicy already runs 1.8x as often, with a slightly
heavier DDoS weight to make it 2x); gaming customers still bring their busier one.
stretchInc() stretched anything ending on the same day: always the primary attack
(even when the incident was about another one, never the overlapping ones) and any
unrelated outage that happened to end then. It now finds the attack by i.atk and
everything else by the incident's ref, as clearInc() does, and saves allow the
longest stretched attack (11 days).
Every attack stored every ingress port with traffic (over a thousand on a big
network), which grew the save from 272 KB to 1.8 MB with 14 attacks. The rest is now
one share at the victim, routed like the classic flood over its usual exits; old
saves are folded on load.
ddosSf() took the worst service of every city with an ingress port, so on a big
network every attack counted as lost and charged SLA payouts to protected customers
anywhere. Held/lost, the SLA check and the far-scrubbing warning now look at the
attacked city.
Each ingress slice gave its junk the ingress city as source, so a flood only filled
the port it came in on: it never loaded the backbone or the victim's router, as it
did before distributed ingress. Junk is now created at the victim, pinned to its
entry port, before any real traffic and in attack order, so S.pops order no longer
decides who gets a full port. A port the victim cannot reach still fills.
After three stars, Next puzzle is the one big button (and has the focus); the
results card counts the stars still to win in the pack; and when one more link
within budget would earn the third star, the card and the results say so.
base() now takes the target network; pinned junk has none, so coneOf() called every
PNI a cone route and the flood was routed late (behind real traffic) or not at all.
Pinned flows use the port's own rank (low preference still last), those ranks join
RSET, and the reference allocation in the routing test does the same.
On phones the puzzle card's Undo, Reset, Back and menu buttons are 40 px touch
targets and stay pinned at the foot of the sheet when longer languages make it
scroll. Goal cities show a leading mark (○ to reach, ◐ POP open, ✓ joined)
instead of a trailing one that looked cut off.
Toasts are cleared when a puzzle starts and when you leave it, and every
main-game action (ops, inbox, bank, building, routers and the rest) does
nothing while a puzzle is on; only the puzzle's own actions, menus and
settings work there.
Progress is recorded on every change, not only when the stars go up: more stars
start the best spend again, and a cheaper build at the same stars replaces it.
The first pack leaves 16-18% over the cheapest three-star build, the Pacific and
speed packs about 10%, and the N-1 Club 6-7%. The first pack no longer promises
no budget. A brute-force check in the tests keeps each reference build the cheapest.
The puzzle price and the city panel now use the city's own monthly POP rent
(Suva is 1.5x), not the plain one, matching the higher setup already charged.
Two waves on the same cable now share one failure, as in the main game's
diversity checks. Kiwi Fruit Salad gets Los Angeles as a stepping stone (Seattle's
only cable south is Hawaiki), Samba Sprint's budget rises to $1.06M, and the
weekly reference ring never puts two hops on one cable.
With events booked ahead the trial routed the network twice: without the offer (who is happy now)
and with it. compute() only reads the previous result for scenic circuits, so without those the
order of the two passes does not matter. With the offer first, a failing offer or one nobody is
unhappy with needs no second pass. The same offers are signed (tests/sales-trial.test.js checks
over 100 seeded offers against the original trial, scenic or not).
Most flows from one city ask the same rank list for the same nearest group of exits. Exits only
fill up while routing, so while every exit in that group still has room the scan would find it
again; it is reused instead. Networks with identical exit lists share one list, so the memory
serves them all. Same groups, same order, same result (routing-reference and speed tests).
The big fixture is a dozen islands (POPs no backbone joins). Each flow scanned every exit in its
rank's list and threw away the unreachable ones, two thirds of the scan. Lists are now split per
island once per compute; with one island nothing changes. Same exits, same order, same result
(routing-reference gains a network-of-islands case).