Section 2 — reconstruction from any authorized coalition
ProvedShamir1979.reconstructionLet be prime and . Participants have the distinct public identifiers in . For every secret, every coefficient vector, and every set of at least participants, the explicitly defined Lagrange-at-zero reconstruction formula returns the secret from their jointly observed shares. The formula uses all the supplied locations, so the statement covers coalitions larger than as well as those of size exactly .
import Definitions.Def_Shamir1979_Model open scoped BigOperators universe u
namespace Shamir1979
theorem reconstruction (p n k : Nat) [Fact (Nat.Prime p)]
(hk : 0 < k) (hkn : k ≤ n) (hnp : n < p)
(secret : ZMod p) (coins : Coins p k) (Γ : Finset (Fin n)) (hΓ : k ≤ Γ.card) :
recover Γ (observe Γ secret coins) = secret := by sorry
end Shamir1979Read-back
What the Lean code literally says, in plain math · OpenAI Codex (inherited session model)
For every prime natural number , natural numbers satisfying , , and , every secret , every coefficient tuple , and every subset with , set and for . The complete observed tuple on is . Applying the recovery function to this tuple gives exactly ; explicitly, in . In the recovery definition, the factor indexed by is , so it contributes no division. The inequality makes all the distinct and nonzero, hence every displayed denominator with is nonzero. The formula uses every member of , including when . These hypotheses exclude , , and empty ; they include and . For the coefficient tuple and polynomial sum are empty and every observed value is the constant ; the all-zero secret and coefficients are also allowed.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.