AFTD Auto-Formalizing Theoretical Domains

biased_bit_vulnerability

def

The 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 infinite sum over all integers s of max(p * q(s), (1 - p) * q(s - 1)).

Statement

noncomputable def biased_bit_vulnerability (p : ℝ) (q : ℤ → ℝ) : ℝ
Defined in
arXiv:2611.16066, Section 5
Verified
13 Nov 2026
Axioms
none listed
Used by 5

Read back from the Lean

biased_bit_vulnerability is a definition that takes a real number p and a function q : ℤ → ℝ, and returns the real number given by the infinite sum over all integers s : ℤ of max (p * q s) ((1 - p) * q (s - 1)) (using Lean's tsum, which evaluates to 0 if the series is not summable).

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 one-guess vulnerability V_p(q) for an additive integer mask with law q. -/
noncomputable def biased_bit_vulnerability (p : ℝ) (q : ℤ → ℝ) : ℝ := ∑' s : ℤ, max (p * q s) ((1 - p) * q (s - 1))
See it in the graphDiscuss this resultChallenge it