diff 626fd2d..f62dbea k_server_squared_log_v2.txt
diff --git a/k_server_squared_log_v2.txt b/k_server_squared_log_v2.txt
index b163013..8488b62 100644
--- a/k_server_squared_log_v2.txt
+++ b/k_server_squared_log_v2.txt
@@ -4021,139 +4021,4 @@ TERMS:
   Witness.         A point of Y whose leaf lies below a given tree
                    vertex v. Used to define anchors and masses.
 
-------------------------------------------------------------------------
-20. A HOW-TO-READ-THE-PAPER MAP
-------------------------------------------------------------------------
-
-The paper is long. Reading order by purpose:
-
-20.1 First impression (30 minutes).
-
-  - Section 5 (main theorem, plain English) - the claim.
-  - Section 4 (history) - why anyone cares.
-  - This document's Sections 5, 6, 17 - the whole story.
-  - Stop.
-
-20.2 High-school mathematical reader (a few hours).
-
-  - Section 1 (the game).
-  - Section 2 (competitive ratio).
-  - Section 3 (randomization and paging).
-  - Section 7 (notation: M(A,C), strong laziness, ell, scales).
-  - Section 8 (lazy simulation. The proof is easy and beautiful).
-  - Section 10 (the tree, only lightly).
-  - Section 17 (the money chain).
-  - The glossary and this map.
-  - SKIP sections 11-16 on first read. Skim on second.
-
-20.3 Algorithm designer (a few days).
-
-  - Everything in 20.2.
-  - Section 11 in detail (allocation).
-  - Section 12 in detail (pilot potential).
-  - Section 13 in detail (partitions).
-  - Section 15 in detail (rounding).
-  - Section 16 (transfer).
-  - Then Section 17 to see how it fits.
-
-  Focus on:
-  - The picture of l^beta: convex, decreasing, linear on [0, p_*],
-    vanishes at s_*.
-  - The simplex tracker argument: feasibility + the payment
-    identity. Nothing else about it matters.
-  - The pilot potential as the one new trick that compresses a
-    scale sum into one logarithm.
-  - The BALL-MASS TELESCOPE (Section 9.6), the small lemma that
-    converts everything into a single log.
-
-20.4 Probabilist / proof hound (weeks).
-
-  - Sections 9 and 12 carefully. Two pillars of stochastic
-    accounting.
-  - Section 11.5-11.9. Rank-drift + rank-tracking lemmas; all the
-    potentials live here.
-  - Sections 13.5-13.7 (the two telescopes) and 14.7 (pointwise
-    coefficient).
-  - Sections 16.3 (Yao) and 16.4 (Tychonoff / compactness). The
-    clean steps that remove the input law and the metric
-    dependence.
-  - Re-read Section 11 once. The tracker makes much more sense
-    after Section 12.
-
-20.5 High-school competition problem solver.
-
-  Look at Section 8 (lazy simulation) and Section 9 (posterior as
-  filtered plus drift). These are the "that is elegant" sections:
-  a matching argument and a conditional-expectation exercise. The
-  pilot potential (Section 12) is the "that is clever" section: a
-  variational formula that behaves smoothly under two seemingly
-  different kinds of update.
-
-20.6 What to skim on a first read.
-
-None of the sections below contains a "trust me"; each is a full
-proof. On a first read you can skim the technical algebra and
-come back later. These are the ones where that is worth doing:
-
-  - Section 11.11a-b (uniform denominator estimates). The three
-    STATEMENTS (a),(b),(c) at the top of 11.11 are what you
-    actually use downstream. The integration identities in 11.11a
-    (regular: 1 exactly; dominant: split at y = 1 into <= 3 + 1)
-    and the case list in 11.11b (small y_i vs tail) are mechanical
-    and can be skimmed on a first pass.
-
-  - Section 11.11c (simplex feasibility). One-sentence idea: if
-    the constraint were violated, a small mass transfer from the
-    violating coordinate to some other active coordinate would
-    strictly decrease the objective, contradicting minimality.
-    The full proof (11.11c) then drills into the two cases
-    (transfer target exists / does not); the constants are
-    mechanical once you accept the idea.
-
-  - Sections 13.4-13.6 (the two partition books). The three
-    budgets labelled (a),(b),(c) at the top of Section 13.7 are
-    the formal statement. Skim each budget's derivation
-    (heavy edits in 13.2; first-hit lemma in 13.4;
-    separation in 13.5; short roster in 13.6) on a first pass;
-    come back if you want to verify a constant.
-
-  - Section 15.2, STEP 3 (rounding repair). STEP 1-2 (clip to the
-    box; adjust to the prescribed total) are easy. STEP 3 is a
-    finite-exchange argument whose only subtlety is the two
-    cases (a) and (b) of the local swap. Read those carefully if
-    you care about the exact constant 32 T + 11 I.
-
-A careful reader will find that each of these is a complete proof
-of the exact claim it is used for downstream.
-
-20.7 Once you have read it once.
-
-  The paper is a chain of telescopes. Every nontrivial bound is a
-  sum of local positive quantities that telescopes over SCALES
-  (not over time). Every inequality has exactly one ell (not ell^2)
-  because the telescopes cancel against the geometry of balls.
-
-  Mental picture: at each scale, a "ball ratio"
-  log(outer_mass / inner_mass) contributes. By near-nestedness of
-  balls at consecutive scales, these ratios sum to about log k
-  over all scales. That is the one fact behind the ell's.
-
-  Every lemma answers one question: how do I pay for X moving by
-  Y?
-    - X = tree allocation, Y = comparator movement. Pay ell per
-      unit.
-    - X = partition, Y = comparator's request stream. Pay ell per
-      unit.
-    - X = rounding, Y = fractional change. Pay constant ~132 per
-      unit.
-    - X = nearby point in the pilot, Y = request. Pay local log
-      per unit.
-
-------------------------------------------------------------------------
-END OF DOCUMENT
-------------------------------------------------------------------------
 
-If you have read this far: the main theorem is Section 5, the proof
-sketch is Section 6, the money chain is Section 17, and the honest
-limits are Section 18. Everything else is detail in service of those
-four sections.