additive_noise_bayes_vulnerability
def
The Bayes vulnerability V(X | S) of a secret X on Fin m with prior p observed under additive noise S = X + Y with integer mask distribution q is the sum over integers s of the supremum over x in Fin m of p(x) * q(s - x).
Statement
noncomputable def additive_noise_bayes_vulnerability (m : ℕ) (p : Fin m → ℝ) (q : ℤ → ℝ) : ℝ
- Defined in
- arXiv:2611.16066 Proposition 3.1 -- Optimal Additive Integer Masks for One-Guess Vulnerability under an Absolute-Moment Budget
- Verified
- 15 Nov 2026
- Axioms
- none listed
- Used by 2
- additive_noise_map_rule_and_bayes_vulnerabilityFor a secret with distribution p on Fin m and independent additive noise Y with distribution q on ℤ, the optimal average one-guess success…
- decision_rule_success_prob_le_vulnerabilityFor any nonempty alphabet Fin m, nonnegative prior p, probability distribution q on ℤ, and decision rule g : ℤ → Fin m, the success…
Read back from the Lean
The function additive_noise_bayes_vulnerability takes a natural number m : ℕ, a function p : Fin m → ℝ, and a function q : ℤ → ℝ, and returns the real number given by the infinite sum (tsum) over all integers s : ℤ of the supremum (iSup) over all x : Fin m of p x * q (s - x) (with x coerced to an integer).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- Posterior Bayes vulnerability of a secret on Fin m observed under additive integer noise with distribution q. -/ noncomputable def additive_noise_bayes_vulnerability (m : ℕ) (p : Fin m → ℝ) (q : ℤ → ℝ) : ℝ := ∑' s : ℤ, ⨆ x : Fin m, p x * q (s - x)