Section 2 — exact count of compatible random choices
ProvedShamir1979.privacy_fiber_countFor prime and , fix a coalition with fewer than participants, any secret , and any assignment of values to all their shares. Exactly coefficient vectors produce that assignment. The count is uniform over the secret and over the joint observation. When , the number is one, matching the paper's unique-polynomial argument; the formula also covers smaller and empty coalitions.
import Definitions.Def_Shamir1979_Model open scoped BigOperators universe u
namespace Shamir1979
theorem privacy_fiber_count (p n k : Nat) [Fact (Nat.Prime p)]
(hk : 0 < k) (hkn : k ≤ n) (hnp : n < p)
(Γ : Finset (Fin n)) (hΓ : Γ.card < k)
(secret : ZMod p) (values : Observation p Γ) :
fiberCount (k := k) Γ secret values = p ^ (k-1-Γ.card) := 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 subset with , every secret , and every prescribed complete tuple of elements of , the number of coefficient tuples for which holds simultaneously for every , with interpreted modulo , is exactly . This is the cardinality of the finite set obtained by filtering all coin tuples by equality of their entire observation function with , rather than counting separate events for individual coordinates. The exponent in the definition is the successive truncated natural-number subtraction ; since and , it equals the ordinary nonnegative integer . Primality gives , and the parameter inequalities exclude and . Empty is allowed: its prescribed tuple is the unique empty function, all coefficient tuples satisfy the condition, and the count is . If , the count is for every prescribed tuple and secret. In particular, forces to be empty and gives the count for the unique empty coefficient tuple; zero secrets, zero coefficients, and zero prescribed values are included.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.