Part II · Chapter 2 · The Boundary · lesson 4
Move the line one notch and watch the work double
14 min
Part II · Chapter 2 · The Boundary · lesson 4
14 min
Same company as two lessons ago. One hundred and forty systems, 31 of them holding customer data. Two hundred and ten people, 24 of them able to reach production. Twenty-eight contractors. Seventeen other companies inside the delivery.
The line has four positions and each one adds exactly one category to the position below it:
That is a well-defined notch, which is the only reason the phrase move the line one notch means anything. Commit to a number before you move it.
Predict
Scope arithmetic
Hypothetical model, not a forecast
Counts the systems and people inside a stated certification boundary, the ones left outside it, and how far the count moves when the boundary shifts by one category.
It assumes
It ignores
Find the position of the line where moving one more notch would add more than two hundred systems and people — and stop there rather than going past it. The figure you need is one of the summary tiles, not the chart.
0 data systems and production access, 1 adds contractors, 2 adds subprocessors, 3 is everything.
| Where the line falls: 0 narrowest, 3 everything | Inside the line | Left outside it |
|---|---|---|
| 0 | 55 | 340 |
| 1 | 83 | 312 |
| 2 | 100 | 295 |
| 3 | 395 | 0 |
Not there yet — keep moving the controls.
Four positions, four counts inside the line: 55, then 83, then 100, then 395.
The notch arithmetic is lopsided and it is lopsided in the direction nobody expects.
Adding the contractors costs 28. That is the notch with the longest meeting attached to it, because somebody from legal has an opinion about whether a contractor is personnel and somebody from engineering points out that four of them have production access already.
Adding the other companies costs 17. That is the notch with the second-longest meeting, because it is the one where the word supplier appears and everybody has read something about third-party risk.
Adding everything else costs 295 — six and a half times the two arguments combined. That notch has no meeting, because it is not a category anybody names. It is what happens when the filter comes off: the first three positions are defined by a predicate (holds customer data, can reach production) and the fourth abandons the predicate entirely.
So the lever is not really the four positions. The lever is whether a predicate exists at all, and the three notches you argue about are the cheap ones.
Two things follow, and the second is the uncomfortable one.
A boundary decision made by reasoning about percentages is wrong by an order of magnitude. If the instinct is widening it a bit would not hurt, the instinct is calibrated on levers that move by fractions, and this one does not.
And the direction of pressure in a real company runs the wrong way. Every individual request to widen the boundary is small — one environment, one team, one region — and each is argued on its merits by somebody with a good reason. Nobody ever proposes abandoning the predicate. It happens by accretion, one reasonable addition at a time, and the arithmetic above is what it costs when it finishes.
Check
A boundary built on holds customer data separates systems by what is in them. Compromise does not travel that way; it travels along access paths, trust relationships and shared credentials.
So the narrow position survives a reader only if the things crossing the line are themselves inside it. The identity provider, the deployment pipeline and the secret store are the usual three: each sits on the path between what is inside and what is outside, and each has to be in, which is why a well-drawn narrow boundary always contains a handful of systems that hold no customer data at all.
The version that does not survive is the one where a system outside the line can reach a system inside it and nothing in between is enclosed. That is not a counting problem and the model will not show it to you — it reports a count, not a topology. It is the one thing you have to check by hand, and the check is mechanical: for each system inside the line, list what can reach it, and see whether that list stays inside.