Publication

SEERAVERSE RH Program: A Meta-Methodology for Auditable Proof Search

Overview

This preprint presents a meta-methodology for keeping long-horizon proof search auditable, resumable, and reusable, with the Riemann Hypothesis as its case study. It treats the history of exploration itself as a research asset: what was attempted, why a branch failed, which obligation remains, and what should be tested next.

Research position

The paper does not claim a proof of the Riemann Hypothesis and does not claim novelty for classical analytic or number-theoretic tools. Its contribution is an architecture for long iteration that avoids mistaking equivalent reformulations for progress, preserves failed branches as negative information, and compresses the remaining obligation toward rigorous finite certification.

Core components

Invariant proof spine
One-live-lock / one-next-move discipline
No-Go ledger
Equivalence-preserving compression
GCD/LCM common-core and minimal-refinement analysis
Truth by Shadow

The methodology distinguishes qualitative mathematics, effective constants, and machine-assisted finite certification, including interval/Krawczyk methods and arbitrary-precision ball arithmetic. Although RH is the case study, the architecture is intended to be reusable in other difficult, branching research programs.

Bibliographic information

Type: Preprint
Published: 2 October 2026
Publisher: SEERAVERSE Research Group
Languages: Japanese and English
DOI: 10.5281/zenodo.23101473