MATRIX.md: item 32 row + final architecture verdict

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>

results-loop/MATRIX.md

@@ -59,6 +59,7 @@ Scored source of truth: PROTOCOL_UNIFIED.md. All items pre-registered before run
 | 29 | trajectory TF (10 waypoint transitions) | **39.1, p=0.045** | 39.1 burst-off (p=1.0) | first significant positive — a training signal, not an inference loop; +fr 30.5 (hurts); answer-only 15.6 < 19.1 |
 | 30 | metacog readiness head on carried state | AUC 0.798 | FF AUC 0.791 | signal real & cheap, NOT recurrence-specific; early-stop loses; oracle +3.9 |
 | 31 | synthetic KV memory (per-layer prefix) | 39.5 | 39.1 (p=1.0) | flat — gates frozen at −10 (init gradient-trap confound; −3 rerun open) |
+| 32 | discrete latent chain ("latent paper": lens-snapped symbols fed back) | TF 20.3 / ST 27.0 | 39.1 | net-harmful — exposure catastrophe (TF) and quantization noise (ST) both lose to the pure analog carry; architecture tree closed |
 
 Instrument (unnumbered): whiteboard microscopy — three specimens + carry-vs-FF divergence (probe_discount*/probe_gsm*; board artifact).
 
@@ -70,3 +71,8 @@ Consumption (8 write-side axes + 1 read-path attempt) · internalization (4 capa
 
 ## Open threads
 Seeds for 39.1 · trajectory TF on rung A (move 57.4) · KV gate-init −3 · extension/deferral gating · g into the depth gate.
+
+## Final architecture verdict (item 32 closes the tree)
+Pauses, bursts, KV memory, analog TF chains, and discrete chains all have controlled answers.
+The loop is a plan machine; tokens are the executor — they win by discreteness PLUS a verified
+commitment distribution (the LM head is trained to commit; the lens readout is not).