App. B.3 —
ProvedHWMaskLeak.sqrt_binom_sum_lefourier-analysishamming-weightleakage-resiliencep2o-gran-per-chapterp2o-plan-paperp2o-v1secret-sharing
For every integer , with ,
This explicit estimate is the input of the bound (Lemma 3.4) and of the model base case (Lemma 4.6, App. C.3).
Differences from the source:
- reading: the display chain Σ√p_w ≤ … ≤ √5 + √(5π/2)·n^{1/4} ≪ n^{1/4} → the inequality between the chain's first member and its explicit last bound, for every n ≥ 1; reason: the intermediate members are steps of the proof; a_w = 1 + (w − n/2)²/n requires n ≥ 1
Preamble
import Mathlib
Formal statement
namespace HWMaskLeak
/-- **The binomial square-root estimate of App. B.3** (Biswas, Hwang, Maji, Shkredov, Ye, *When Masks Leak Their Weight: From Additive Sharing to
Learning with Physical Rounding*, preprint (version of October 31, 2026, sha256 ab686360…), App. B.3 (proof of Lemma 3.4), display
chain, p.43): with `p_w := (n choose w) 2^{−n}`,
`Σ_{0 ⩽ w ⩽ n} √p_w ⩽ √5 + √(5π/2) · n^{1/4}`.
**Formalization Note** Stated for every `n ⩾ 1` (the chain divides by `n`); `n^{1/4}` is a real
power. -/
theorem sqrt_binom_sum_le (n : ℕ) (hn : 1 ≤ n) :
∑ w ∈ Finset.range (n + 1), Real.sqrt ((n.choose w : ℝ) * ((2 : ℝ) ^ n)⁻¹) ≤
Real.sqrt 5 + Real.sqrt (5 * Real.pi / 2) * (n : ℝ) ^ ((1 : ℝ) / 4) := by sorry
end HWMaskLeak
Source
Biswas, Hwang, Maji, Shkredov, Ye, When Masks Leak Their Weight: From Additive Sharing to Learning with Physical Rounding, preprint (version of October 31, 2026, sha256 ab686360…), App. B.3 (proof of Lemma 3.4), p.43, display chain
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.