Current task: —

Research Blueprint & Roadmap

Rendered live from NGUYEN.md — the project's master plan. Last updated: 09-02-2026

PROJECT: NGUYEN-RH-1

The Riemann Hypothesis Challenge — Autonomous Agent Research Blueprint

Created: [08-17-2026] | Status: ACTIVE | Version: 1.0

1. MISSION STATEMENT

Prove (or make maximal rigorous progress toward) the Riemann Hypothesis: all nontrivial zeros of ζ(s) satisfy Re(s) = 1/2. Primary launchpad: the Anthropic paper proving ≥ 2/3 of zeros are simple and on the critical line, unconditionally.

2. RESOURCE MANIFEST

ID Resource Contents Use
R1 notes.txt RH Wikipedia link; Physics Hypertextbook (https://physics.info/ — all physics equations); full quantum-mechanics equation list (Schrödinger eqs, commutators, uncertainty, angular momentum, Pauli matrices, hydrogen atom, harmonic oscillator, Heisenberg picture, Ehrenfest) Track B spectral/Hilbert–Pólya modeling
R2 Anthropic Riemann Hypothesis Paper.pdf Theorems A & B (2/3 simple+on-line, 5/6 distinct); Weil-form compression G̃ = P + Q; rank–trace inequality; Montgomery unconditional second moment; window theory R(ψ); sharpness analysis §7.2; Lean 4 verification Foundation for Track A; formal infra for Track D
R3 zeta-23-lean repo (tag v1.0) Lean 4 formalization, counting functions vs Mathlib riemannZeta Track D
R4 Cited literature ([Mon73]…[GS26]) Full method genealogy All tracks
R5 Python stack (mpmath, sympy, numpy, scipy) zetazero, numerical Weil forms, SDP Numerics
R6 Compute resources Local: Ryzen 9 7945HX 16c/32t, 64GB, RTX 4090 Laptop 16GB (CUDA 8.9). On request (ask user first, user provisions): Lambda AI multi-GPU cloud (SSH); IBM Quantum (no identified need as of 2026-08-17 — RH compute is classical) Scaling numerics
R7 research/resources/ atlas (43 notes) User-provided RH-equivalence atlas, step-by-step derivations of ~60 equations: all major RH criteria (Li, Lagarias, Robin, Nyman–Beurling, Redheffer, Mertens, Riesz&H–L, Salem, Volchkov, Franel–Landau, Speiser, de Bruijn–Newman, von Koch–Schoenfeld, Hilbert–Pólya), zero-counting/explicit formulas, RMT statistics, foundations. Index: research/resources/index.md All tracks; cross-pollination reservoir (§4A); D-037 direct inputs

3. KEY KNOWNS (inherited state of the art)

4. ATTACK TRACKS

4A. KNOWLEDGE INTEGRATION & EXTERNAL RESEARCH (STANDING ORDER)

Goal reminder: solve RH by COMBINING all knowledge at our disposal.

  1. Use the full equation inventory. Every attack must actively consider the complete toolset — quantum formalism (R1), analytic number theory (R2, R4), spectral theory, random matrix theory, physics equations (physics.info) — and seek cross-domain combinations, never stay inside a single track by default.
  2. Cross-pollination check. Before abandoning any approach, ask: which OTHER track's machinery could close this gap? Log cross-track ideas in the session journal even when not pursued.
  3. Web research before obstruction. When knowledge is missing, research the web (arXiv, surveys, MathOverflow, LMFDB, OEIS) BEFORE declaring a dead end. Record every external source used — URL, what was taken, date — in the derivation/result file; paper-worthy sources go to references.bib.
  4. Master tool index. research/derivations/D-001 (built in Phase 0.1) is the living index of all usable equations/tools; every newly discovered tool is added there so no later session rediscovers it.
  5. NO-BOUNDARIES RULE (user directive, 2026-08-17). Do not merely follow what has been done. The metric is success on the ultimate goal, not fidelity to any tradition. Actively import ANY domain of human knowledge that could crack a wall in the obstruction map (D-006 §6) — no field is off-limits. Candidate reservoirs to sweep systematically: random matrix theory & free probability; operator theory (de Branges, Krein, canonical systems); harmonic analysis (uncertainty principles, restriction theory, Beurling–Malliavin); mathematical physics (integrable systems, quantum chaos, scattering); probability (Gaussian processes, determinantal point processes); algebraic geometry & finite fields (Weil's proof for curves — the ONE case RH is proven); p-adic and adelic methods; ergodic theory; information theory; optimization (SDP/SOS hierarchies); machine-assisted discovery. At each phase boundary, run a DOMAIN SWEEP: list the current walls, ask which untouched field has machinery shaped like each wall, web-research the top candidates (per §4A.3), and log findings in D-001 Part III — including negative ones (a field that provably does not apply is documented progress).

5. PROJECT PLAN & CHECKLIST

⚠ THE PLAN IS NOT CONCRETE. This is research: the plan and checklist may be updated, extended, reordered, or pruned at ANY time as results demand. Never follow the checklist at the expense of the ultimate goal — solving the Riemann Hypothesis. If a promising direction appears that is not in the plan, the plan changes, not the direction. All plan changes are committed to git with a one-line rationale.

✅ PHASE 0 — Initialization & Ingestion (COMPLETE 2026-08-17)

✅ PHASE 1 — Master the Ceiling (Track A groundwork) (COMPLETE 2026-08-20 — decision gate 1.5/D-013: NO within current data class, Track A → monitoring mode; 1.2 closed as deferred)

🔶 PHASE 2 — Spectral Program (Track B) (MAPPED TO EXHAUSTION at current technology, 2026-08-19 — parked: 2.2/2.3/2.5 unprioritized; live remainder: 2.9 (L1, L3/L4 skeleton) → Paper B / post-publication)

NOTE (2026-08-18 regroup): the Suzuki finite-interval operator program (spawned by 3.4c) IS the live realization of this phase — Suzuki's T_a is a canonical-system / de Branges-type construction (2.4), its Galerkin realization is a validated ⟨ψ|Ĥ|ψ⟩ model (2.1), and Suzuki Cor 1.6 gives an explicit RH-equivalent convergence target (success criterion #3). Items 2.6–2.8 are the active queue; 2.2/2.3 remain open, unprioritized.

✅ PHASE 3 — Positivity Criteria (Track C) (COMPLETE 2026-08-19 — 3.1–3.8 all answered/closed, R-004 full tag; 3.1/3.2 closed by evidence, 3.5 fulfilled via 3.6–3.8)

✅ PHASE 4 — Synthesis Assault (COMPLETE 2026-08-19, session 009)

🔶 PHASE 5 — Verification & Write-up (Track D)

✅ PHASE 5B — TIER ii′: close SfBoundProp in Lean (COMPLETE 2026-08-26, session 041 — sfBoundProp PROVED + lambda_pos_finite_height_closed; design D-064)

FREEZE PROTOCOL: paper files (paperA/paperB/draft/references.bib) and existing Lean proofs are untouched until ii′-7 — the ONLY exception is the liCoeff correctness fix (ii′-1a). Paper A stays submission-ready at every sub-stage boundary (D-064 §8). Perimeter (D-062 §4 + the session-035 additions, user-approved 2026-08-23): Platt–Trudgian RHUpTo, LiVerifiedUpTo, Trudgian N(T)/S(T) [ZeroCountProp — strengthened to the mult-weighted form session 035, matching the declared source; PLUS ZeroCountProp2 (the two-unit specialization) and NoLowZeros (|γ| ≥ 14, the Platt-class zero-location certificate), both for 5f], M₀.

6. GRAVEYARD (documented dead ends — REQUIRED logging)

# Attempt Track Obstruction found Date
G-001 Multiple-zero bounds as chain constraint (Idea C) A s₂/p substitution symmetry (depth→0 pairs = doubles in all 2-moment data) 2026-08-17
(A) Zero-density input into chain (D-009 Idea A) A depth→0 off-line pairs invisible to N(σ,T) bounds 2026-08-17
G-002 Moment-ladder certificates (tr G̃ᵏ, k≥3; oversampled grids) A RS availability λ≤2/k bites before usefulness; caps 0.607N (k=3, λ=2/3) and 0.502N (k=4, λ=1/2) both < 2/3; n₊ q-invariant (E-005) 2026-08-17
G-003 Density certificates → de Bruijn–Newman Λ (task 3.3) C one-sided information: density theorems lower-bound the on-line fraction, Λ needs an upper bound on the complex fraction; extremal vs averaged (E-012); asymptotic vs explicit 2026-08-17
G-004 λ → λ_a⁻ ground-state channel (task 2.13 follow-up) B disjoint feasibility windows: ground-state resolution needs a ≲ 1.3 (λ_a superexponential), zero resolution needs a ≳ 4–6; discretization floor out-ranks λ_a; D-046 sizing 2026-08-19

7. RESULT LEDGER

# Claim Status tag Location
0 ≥2/3 simple on-line (inherited) [PROVED] (R2) Paper Thm A
1 Galerkin realization of Suzuki's Weil-form operator A_a validated to 4.5e-6 against the zero-side explicit formula; Weil formula conventions machine-verified (Gaussian test, 9e-16) [NUMERICAL-VALIDATED] E-009a/b, D-019 §1
2 λ_a (bottom of Weil-form spectrum) positive at a = 0.25..5 with steep cliff (0.414 → ≤1.7e-12), consistent with Yoshida λ_a>0 ∀a ⟺ RH; independently matches Kim et al. superexponential decay report [NUMERICAL] (upper bounds; conforming Galerkin) E-009b, D-019 F1
3 Li coefficients λ_n > 0 for all n ≤ 3000 computed from the arithmetic side (BL Thm 2, zero-free; flint Stieltjes + Arb ζ, dps 1000–1450), cross-validated vs E-008 zero side; λ_1 to 102 digits; refined asymptotic ratio 1.00216 at n=2000, 0.999845 at n=3000 [NUMERICAL-VALIDATED] E-011, E-015, R-001
4 ξ′-certificate strength mechanism: perfect-square node in the diagonal law D₁ ≈ s(1−2s)² (prime-scale cancellation p ~ √(T/2π)); Remark 7.1 constants reproduced to 5e-6; s₂/p symmetry does NOT break; gain not portable to ξ [NUMERICAL-VALIDATED] E-013, R-002, D-022
5 Exact factorization W(a,θ;z) = F·(R₀+R_τ), F = z²ξ/ξ′, with R₀ = 2e^{a+iθ/2}sin(az−θ/2)+o(eᵃ) closed form; Suzuki Cor 1.6 ⟺ (★) tail-cancellation (Wiener–Hopf remainder, RH-gated); W(a,θ;0) = 0 double ∀a,θ; explains full E-010–E-016 phenomenology [PROVED (modulo std tempered-FT bookkeeping)] + [NUMERICAL-VALIDATED] (E-017: skeleton 3.7%→0.009%, off-axis cancellation 99.8%, θ=π preferred) R-003, D-026, D-027, E-017
6 Explicit finite-height Li theorem: λ_n > 0 for all n ≤ N₁ = (T₀−1)² ≈ 9.0×10²⁴ (T₀ = 3×10¹² Platt–Trudgian); conservative window N₁ = 2.73×10²¹; explicit assembled chain (S_∞ elementary lower bound + traced contour constants + margin convexity + finite verification; statement-level precursor Oesterlé 2000 unpublished, published weaker window Lagarias 2007). FULLY MACHINE-PROVED 2026-08-26 (tier ii′ complete): LiSideBounds.sfBoundProp + LiClosed.lambda_pos_finite_height_closed from exactly 7 declared hypotheses (2 computational certificates + 5 analytic perimeter Props); axiom audit on the full chain: 3 standard axioms only, 0 sorryAx; B(n) corrected in 4 places during the closure (F-A/F-B/F-D/F-E, D-037 erratum block + Paper A §3 Step-2 footnote), statement unchanged; finite-verification certificate corrected session 042 (Misguich–Voros RETRACTED — deformed sequence — → Johansson 2015 § 4.2 rigorous ordinary λ_n to 10⁵; LiVerifiedUpTo (5·10⁵) → (10⁵)); the three zero-count perimeter Props derived from Rosser Thm 19 + Trudgian-II in Paper A App. C (session 045, D-075/E-035 — ZeroCountProp needs Trudgian beyond log u ≈ 106.6)* [PROVED-CONDITIONAL(computational RH-to-T₀; finite verification)] — R-bound fully traced D-056 (A = 10.5, B₀ = 48, honest C₀; E-028 verified, 26× slack); N₀ = 80 000; margin convexity PROVED D-057 (E-029) R-004, D-037, D-056, D-057, E-023, E-028; Lean: LiSideBounds.sfBoundProp, LiClosed.lambda_pos_finite_height_closed

8. SESSION PROTOCOL & RESEARCH ARCHIVE (MANDATORY)

Multi-stage project: computer is shut down between stages. NOTHING may live only in conversation. The archive below is the single source of truth.

8.1 Archive map

STATE.md                    ⭐ resume point — READ FIRST every session
research/
├── journal/session-NNN.md  per-session narrative log
├── results/R-NNN-*.md      one file per result (+ index.md ledger)
├── graveyard/G-NNN-*.md    one file per dead end (+ index.md)
├── derivations/D-NNN-*.md  worked derivations (+ index.md)
├── numerics/scripts/       deterministic experiment scripts
├── numerics/data/          E-NNN-*.csv + E-NNN-*.json metadata sidecars
├── research.db             SQLite catalog (sessions, results, graveyard,
│                           derivations, experiments) — schema in
│                           numerics/scripts/schema.sql, CLI: db.py
└── paper/                  paperA.tex (Paper A, split 2026-08-20),
                            paperB.tex (research-note skeleton),
                            draft.tex (FROZEN pre-split combined copy),
                            references.bib

8.2 Storage conventions

8.3 Session START protocol

  1. Read STATE.md → resume point, next action, open threads, blockers.
  2. Skim latest journal entry + results/index.md.

8.4 Session END protocol (before any shutdown — no exceptions)

  1. Write journal/session-NNN.md (work, decisions, outcomes).
  2. File every result/dead end/derivation in its own file; update index.md files; register in research.db.
  3. Update NGUYEN.md checklist (§5), Graveyard (§6), Result Ledger (§7).
  4. Update STATE.md LAST with an explicit "NEXT ACTION:" line.
  5. git add + commit with session number in the message. NOTE: save artifacts IMMEDIATELY when produced (crash-safe), not batched.

8.4a FORK RULE (user directive, 2026-08-17)

When the path FORKS (multiple candidate directions), do ALL of them — one by one — then pause to gather thoughts and evaluate the next step together. No path is dropped at a fork by choice alone; paths are only closed by documented obstruction (Graveyard) or deprioritized by evidence after all forks are explored.

8.5 PACING & SUB-STAGES (user directive, 2026-08-17)

8.6 SESSION LOG (summary; details in research/journal/)

9. SUCCESS CRITERIA (ordered)

  1. 🏆 Full proof of RH (formally verified).
  2. 🥇 Unconditional improvement past 2/3 (or past 0.6725 / 5/6).
  3. 🥈 New equivalence, reduction, or removal of a known obstruction.
  4. 🥉 Rigorously documented obstruction map advancing the field.