← RG-SCP: The Counterexample Universe, Obstruction Covers and Self-Audits / RG-SCP 02 · The failure obstruction cover
Proves that N is a failure iff there is a total proper obstruction map p ↦ prime r with r | (N − p), r ≤ √(N − p) on the prime inputs (canonically lpf(N − p), giving a partition into least-factor cells), and that a prime r | N can obstruct only p = r (divisor self-suppression).
This is a full-text translation of the Chinese source, which remains authoritative for its research claims. Translation is not independent mathematical verification and does not upgrade the original evidence level.
Loading…