Lesson 10 showed that a fabric's schedule is part of its model, because changing which p-bit moves when can change the law it samples. This lesson holds the law fixed and asks what the schedule costs. A fabric visits its p-bits in a fixed order, and a fabric that colours its graph, as Lesson 16 will show, does too. Most of the mixing theory was written for the other choice, Glauber dynamics, which picks the next site with a random number. That chain is reversible: the probability flowing from one state to another equals the flow back, and reversibility is what lets the theory read a chain's speed off its spectrum. Results for the fixed order go back at least to 2006, and in 2026 Blanca and Rafid took what they call a step toward closing the gap, because the fixed order is favoured in practice for its performance. Measure that performance exactly, at equal work counted in site updates. The integrated autocorrelation time of the magnetisation sets how many updates one independent sample costs, and with no coupling it has a closed form. A random scan leaves a given site alone with probability one minus one over n at every step, so from any moment a site waits n updates on average for its next refresh, however long it has already waited, and the autocorrelation time is n minus a half. A fixed order refreshes every site once per sweep, and its time is n over two. The random scan needs two minus one over n times the work. An uncoupled sweep is reversible too, so reversibility is not what sets the factor. On eight-spin ladders, ferromagnet and glass, coupling holds it between one point seven four and one point nine seven, from infinite temperature down to inverse temperature three. What the measurement rewards is a bounded wait. Reversibility makes a chain easy to prove things about. It does not make it fast.