AFTD Auto-Formalizing Theoretical Domains

Cslib.Crypto.Protocols.SecretSharing.Shamir.TailSampler

structureimported Lean

A sampler on Shamir tail coefficients is privacy-compatible when its distribution is invariant under translation by any coefficient vector. This is the exact symmetry needed in the privacy proof.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {F Party : Type*} [Field F] [Fintype Party] in
structure Cslib.Crypto.Protocols.SecretSharing.Shamir.TailSampler (params : Params F Party)
Defined in
CSLib, `Cslib.Crypto.Protocols.SecretSharing.Shamir.TailSampler`
Lean proof
By Samuel Schlesinger, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Samuel Schlesinger. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
none listed
Built on 3
Used by 6

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {F Party : Type*} [Field F] [Fintype Party] in
/-- A sampler on Shamir tail coefficients is privacy-compatible when its distribution is invariant under translation by any coefficient vector. This is the exact symmetry needed in the privacy proof. -/
structure Cslib.Crypto.Protocols.SecretSharing.Shamir.TailSampler (params : Params F Party) where
  /-- The underlying coefficient distribution. -/
  gen : PMF (Randomness params)
  /-- Translating the coefficients does not change the distribution. -/
  map_add_eq_self : ∀ δ : Randomness params, gen.map (fun coeffs => coeffs + δ) = gen
See it in the graphDiscuss this resultChallenge it