Research-Stack/0-Core-Formalism/lean
Brandon Schneider 91c894aff5 feat(math): adjacent coprime classification for second-order recurrences
Formalize theorem: for a_{n+1} = c_1*a_n + c_2*a_{n-1}:

  gcd(a_n, a_{n+1}) = 1  for all n >= 1
  iff
  gcd(a_1, a_2) = gcd(a_2, c_2) = gcd(c_1, c_2) = 1

Key identity: gcd(a_n, a_{n+1}) = gcd(a_n, c_2*a_{n-1})
Invariant core: gcd(a_n, a_{n+1}) = gcd(a_n, c_2) when prev coprime

5 distinct recurrences, 30 native_decide theorems verified.
Maps directly to: state flow + gate + hidden history channel + leakage failure.
2026-05-13 20:38:03 -05:00
..
external/OTOM Refactor provenance sources for open witness backends 2026-05-12 05:57:04 -05:00
LeanGPT initial: sovereign research stack (consolidated, weightless, and lfs-optimized) 2026-05-04 18:11:36 -05:00
Semantics feat(math): adjacent coprime classification for second-order recurrences 2026-05-13 20:38:03 -05:00
CHAIN_ALL_REVIEW_REPORT.md initial: sovereign research stack (consolidated, weightless, and lfs-optimized) 2026-05-04 18:11:36 -05:00