mirror of
https://github.com/allaunthefox/SilverSight.git
synced 2026-07-31 01:25:21 +00:00
The Lean Hkdf had a bug: it used γ^(m+n+1) where γ=1/x, which gives 1/x^(m+n+1). But α and β (both = x) were passed but unused. The Python verification divides by (α*β)^(m+n+1) = x^(2(m+n+1)). With the old formula, (2,13,90,3) projection gate computed 1942069/2^17 ≈ 14.8 > 1/26 (FAILS). With the corrected formula 1942069/2^34 ≈ 1.13e-4 < 1/26 (PASSES). Also: - Removed floating docstrings that caused parser errors - goormaghtigh_passes_rrc now proves BOTH cases via simp+norm_num - closePair_threshold proves all 32 cases via simp+rcases+norm_num - section4_rrc_kernel: 0 sorries, 3298 jobs, 0 errors |
||
|---|---|---|
| .. | ||
| BindingSite | ||
| CoreFormalism | ||
| PVGS_DQ_Bridge | ||
| RRCLib | ||
| SilverSight | ||
| UniversalEncoding | ||