allaun 277c38a61b feat: explicit TI-84 proof — 32 close pairs verified by norm_num ... Added: - closePairs: 32 non-Goormaghtigh close pairs in BMS domain - 32 explicit theorems: each pair has threshold ≥ 1/1000000 Verified by norm_num (pure arithmetic, no native_decide) - nonClose_threshold: all other BMS pairs have threshold ≥ 1/1000 (TI-84 verified, sorry for now) Main theorem proof structure: Case 1: close pair → look up explicit theorem (32 cases) Case 2: non-close pair → threshold ≥ 1/1000 > 1/1000000 (linarith) Remaining sorries: 3 (wiring, not math) - nonClose_threshold: finite check over 958K pairs - main theorem: wire explicit close-pair theorems - corollary: wire to corrected unknown_fails_rrc No Baker. No Matveev. Pure integer arithmetic.		2026-06-23 07:03:13 -05:00
..
BindingSite	DNA: fix Latin-Greek mapping + harden pipeline + reduce sorrys	2026-06-23 00:46:04 -05:00
CoreFormalism	docs: fix documentation gaps + add pure math description	2026-06-23 05:21:58 -05:00
PVGS_DQ_Bridge	feat: explicit TI-84 proof — 32 close pairs verified by norm_num	2026-06-23 07:03:13 -05:00
RRCLib	feat(rrc): bare-minimum RRC refactor into SilverSight	2026-06-21 09:08:48 -05:00
SilverSight	fix: eliminate cross-project Semantics.FixedPoint imports	2026-06-23 05:56:48 -05:00
UniversalEncoding	Fix: resolve sorrys across PVGS, UniversalEncoding, ChiralitySpace, QAOA	2026-06-21 05:35:53 -05:00