Order the records the way the system is learned

Jochen asked whether the order made sense. It did not -- it followed when
things happened to be decided, which after consolidation is fictional anyway
since record 5 alone folds decisions taken across a week.

Concretely wrong before: the domain statement sat at 8, after five engineering
rules; the constitution was scattered across 5, 12 and 17; the tiers landed at
15, 16, 21 and 22 with process records in between.

Now it walks: what the mesh is (1-3), its tiers from the bottom up (4-8), what
runs on them and how it gets there (9-10), how it is built (11-16), how it is
checked (17-18), how we work (19-23).

Two things made this safe rather than free. It is a permutation, not a
compaction, so the renames go through temporary names -- otherwise two files
want one slot and one is lost. And the reference rewrite is a single
simultaneous pass, because almost every number moved into a slot another number
was vacating; replacing one at a time would have cascaded and pointed things at
the wrong record while still resolving.

Verified: 284 [ADR NNNN](path) links across the repository, all with matching
text and target.

The ordering principle is now stated in 19 rather than left implicit -- the
repository already said "the numbering is the flow" about its folders, and
there was no reason for the records to be the exception.

01-RESEARCH/010-lab-inner-loop-cost/00-overview.md

@@ -3,8 +3,8 @@ status: active
 initiated: 2026-08-24
 touches:
   - 03-DESIGN/01-to-be/03-scenario-lifecycle.md
-  - 02-DECISIONS/0009-the-lab.md
-  - 02-DECISIONS/0009-the-lab.md
+  - 02-DECISIONS/0016-the-lab.md
+  - 02-DECISIONS/0016-the-lab.md
 became: []
 ---
 
@@ -23,7 +23,7 @@ Measured on a workstation, 2026-08-24. Numbers in [`measurements.md`](measuremen
 
 ## Why it matters
 
-[ADR 0009](../../02-DECISIONS/0009-the-lab.md) makes the
+[ADR 0016](../../02-DECISIONS/0016-the-lab.md) makes the
 bootstrap scenario the inner development loop for tiers 0 and 1 — the argument being that
 raising a node from nothing stops being the least-exercised path and becomes the most-exercised
 one. **That argument is only true if raising and resetting are cheap.** A loop that costs