AFTD Auto-Formalizing Theoretical Domains

biased_bit_optimal_vulnerability

def

For real numbers p and c, biased_bit_optimal_vulnerability p c is the real infimum (sInf) of biased_bit_vulnerability p q over all functions q : ℤ → ℝ satisfying: for all integers s, 0 ≤ q s; HasSum q 1; Summable (fun s : ℤ => |(s : ℝ)| * q s); and (∑' s : ℤ, |(s : ℝ)| * q s) ≤ c.

Statement

noncomputable def biased_bit_optimal_vulnerability (p : ℝ) (c : ℝ) : ℝ
Defined in
arXiv:2611.16066, Section 5
Verified
13 Nov 2026
Axioms
none listed
Built on 1
  • biased_bit_vulnerabilityThe one-guess vulnerability V_p(q) of an additive integer mask with distribution q against a secret bit with bias p ∈ (1/2, 1) is the…
Used by 1

Read back from the Lean

biased_bit_optimal_vulnerability p c is defined as the infimum (in ℝ) of the set of values biased_bit_vulnerability p q over all functions q : ℤ → ℝ satisfying: 1. 0 ≤ q s for all s : ℤ, 2. HasSum q 1 (i.e., q sums to 1 over ℤ), 3. Summable (fun s : ℤ => |(s : ℝ)| * q s) (the first absolute moment is finite), and 4. (∑' s : ℤ, |(s : ℝ)| * q s) ≤ c (the first absolute moment is at most c).

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

/-- The optimal one-guess vulnerability V_p^*(c) under an absolute-moment budget c. -/
noncomputable def biased_bit_optimal_vulnerability (p : ℝ) (c : ℝ) : ℝ := sInf { biased_bit_vulnerability p q | (q : ℤ → ℝ) (_ : ∀ s, 0 ≤ q s) (_ : HasSum q 1) (_ : Summable (fun s : ℤ => |(s : ℝ)| * q s)) (_ : (∑' s : ℤ, |(s : ℝ)| * q s) ≤ c) }
See it in the graphDiscuss this resultChallenge it