next_step — the derivation, running
The book claims the derivation is mechanical and the judgment points are named. This page is that claim as an executable. No model runs here: it is a few hundred lines of ordinary code, which is the point — a procedure a program can execute is a different kind of object from a worked example you follow along with.
Three sheets, one domain. Event ticketing at three scales. Only the answers change — the procedure is identical, and so is the code below. If the architecture follows from the answers, three sheets must produce three different vectors, each forced, with no step appealing to taste. Load them in turn and watch the derivation move.
What this does. Runs the entry gate's five disciplines — priced, scoped, decomposed, triaged, surfaced — then the derivation itself: the null vector, pruning by mandate, the pressure pass, and recovery per effectful operation. Every position that moves cites the answer that forced it and the mechanism that justifies it. Every demand that presses nothing is recorded too, because a documented refusal is why a system carries no queue, no replicas, no projections.
What it will not do. It resolves no judgment point. Targets,
recovery ties, contradiction choices and product picks are the book's named
refusals; a tool that answered them would overclaim exactly the way the book warns
against. An UNKNOWN is a valid answer here, recorded and never
guessed — it derives a null position, not machinery.
Where the ledger is thin, the page says so. Four axis values carry no provides / mechanism / costs entry yet, so nothing can be pressed toward them, and that is reported rather than passed over — "the ledger cannot price this" is a different statement from "this cannot be built."
Runs entirely in your browser. Nothing is uploaded.