diff --git a/poisson_dirichlet_prime_predecessors_v2.txt b/poisson_dirichlet_prime_predecessors_v2.txt
index 99149c3..68e0dcb 100644
--- a/poisson_dirichlet_prime_predecessors_v2.txt
+++ b/poisson_dirichlet_prime_predecessors_v2.txt
@@ -5,24 +5,7 @@ THE POISSON-DIRICHLET LAW FOR PRIME PREDECESSORS
 
 ----------------------------------------------------------------------
 
-NOTE TO THE READER
 
-This document explains a theorem about prime numbers. The theorem
-itself needs nothing more than the ideas you have already met in
-school: primes, multiplication, and a little probability. The proof
-uses much more, so we split this document into two halves.
-
-In the first half (Parts I and II) we explain what the theorem says,
-why anyone cares, and where it sits in the history of number theory.
-
-In the second half (Parts III, IV, V) we give the proof in plain
-language, using as few formulas as possible, and we are honest about
-what is technical and why.
-
-You do not need to read the second half to enjoy the first half. If
-you want to know what mathematicians are doing at the frontier, the
-second half tells you. If you want the punchline, the first half is
-enough.
 
 ----------------------------------------------------------------------
 
@@ -349,11 +332,7 @@ Some partial results were known.
 
   5.8  2026: the full unconditional proof
 
-The OpenAI paper "The Poisson-Dirichlet law for prime predecessors"
-(September 24, 2026) proves the full PD(1) theorem unconditionally.
-This is the paper explained in this guide. The proof uses a new
-"dilation-graph" method and a "memory" identity that we will try to
-explain in Parts III and IV.
+
 
 
 Chapter 6.  WHY IS THIS HARD FOR PRIMES?