Section 2, property (2) — adding participants preserves existing shares
ProvedShamir1979.extension_consistencyKeep the prime field, threshold, secret, and sharing polynomial fixed. Enlarging the participant set from to , where , leaves every existing participant's share unchanged. The comparison uses the same numerical identifier for that participant in the enlarged index type. Removing participants is the reverse restriction of this identity; the claim does not assert erasure of copies that a former participant retained.
import Definitions.Def_Shamir1979_Model open scoped BigOperators universe u
namespace Shamir1979
theorem extension_consistency (p n m k : Nat) [Fact (Nat.Prime p)]
(hk : 0 < k) (hkn : k ≤ n) (hnm : n ≤ m) (hmp : m < p)
(secret : ZMod p) (coins : Coins p k) (i : Fin n) :
share (n := m) secret coins (i.castLE hnm) = share (n := n) secret coins i := 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 function , and every integer index with , form the polynomial . A share at an index in an ambient index set is , with interpreted in . The assertion is that the share at in the ambient set of size equals the share at in the ambient set of size , using the very same secret and coefficient function on both sides; the embedding of the smaller index set into the larger one preserves the integer index. The coefficient space has exactly elements, and this equality is asserted for each element of that space, with no probability or separately chosen coefficient functions involved. When , its coefficient domain is empty, there is exactly one coefficient function, the sum is empty, and the polynomial is the constant . The hypotheses force , so neither ambient index set is empty; equality is allowed, and no share at a newly added index is compared in the displayed equality.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.