A native distance-RAM writes every fixed-width sweep word in cubic table-size time
ProvedStableMSR.Recovery.WindowCSP.native_sweep_word_tablealgorithmsclusteringformal-verificationgraph-theory
Use a fixed word width 2h+3, independently of the original number k of clusters. Repeated division with remainder writes each base-n digit and terminates by the overflow of the most significant digit. The original k is retained in memory. The program accepts every positive word width even if it exceeds n, and executes in at most 100 H³ steps for H words.
Preamble
import Definitions.Def_StableMSR_SweepWords import Definitions.Def_StableMSR_WindowCSP open StableMSR.Recovery.SweepWords StableMSR.Recovery.WindowSweep StableMSR.Recovery.Supplement.BinaryRecovery.Regional open StableMSR.Recovery StableMSR.Recovery.Compiler StableMSR.Recovery.OracleQueries open StableMSR.Recovery.Supplement StableMSR.Recovery.RegionalSeeds StableMSR.Recovery.WindowCSP open StableMSR.Recovery.BallCoverCatalog StableMSR.Recovery.FewBallRows open scoped Classical set_option autoImplicit false set_option maxHeartbeats 2400000 set_option maxRecDepth 12000
Formal statement
theorem StableMSR.Recovery.WindowCSP.native_sweep_word_table (h : ℕ) : ∃cmd : Cmd,∀(n k : ℕ) (d : Point n→Point n→ℝ),2≤ n →
let H:=CartesianBallRows.rows n (SweepWords.slots h)
∃s z,Executes d cmd (initialStore n k) s z ∧ z≤100*H^3 ∧
let x:=worldOf (SweepWords.slots h) H d s
Ready x s ∧ x.mem 1=(k:ℤ) ∧ CartesianBallRows.pairs x := by
sorrySource
Exact Sum-of-Radii Clustering under Any Constant Stability, arXiv:2611.03547, Lemmas 3.3, 3.8, 3.9(iii), 4.4, Proposition 4.2, Algorithm 1, and Appendix A.4–A.6. Alternative pairwise formulation using bounded-overlap window traces in the mission’s real-distance model.