This preprint provides a self-falsifiable verification protocol for testing SRCD-style “ratio-coordinate” unification claims without post hoc fitting. The core contribution is a fully explicit, reproducible pipeline (the “26th-code” protocol) that takes a declared dataset, applies a fixed ratio-coordinate mapping, and evaluates whether the mapped sequence satisfies a restoration-law residual constraint in a purely outcome-based manner. All statistics are computed directly from residuals, with no optimization, no parameter tuning, and no manual alignment. What this paper is (and is not) Is: a methods + verification paper defining how to test the SRCD mapping claims in a way that can fail. Is not: a claim-by-claim narrative argument; the paper instead specifies the exact computations that must be reported. What you will find inside A standardized input specification (what must be declared for each dataset) The canonical mapping to ratio coordinates and the derived invariances under normalization A residual-based “restoration” criterion implemented via discrete operators Mandatory reporting metrics (e.g., normalized residual measures and spacing-based statistics) A submission-ready comparison template intended to prevent “invented numbers” and enforce reproducibility Intended use This protocol is designed so that independent readers can: run the code on the same declared inputs, obtain identical summary outputs, and accept or reject the claim strictly based on the computed statistics. If the projected data do not satisfy the restoration criterion (or fail the declared statistical thresholds), then the SRCD mapping is falsified for that dataset under this protocol.
Seunghyun Hong (Sun,) studied this question.