AFTD Auto-Formalizing Theoretical Domains

Cslib.Crypto.Protocols.SecretSharing.Shamir.scheme

defimported Lean

The canonical finite-field Shamir scheme with uniformly sampled tail coefficients.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {F Party : Type*} [Field F] [Fintype Party] in
noncomputable def Cslib.Crypto.Protocols.SecretSharing.Shamir.scheme (params : Params F Party)
    [Fintype F] [Nonempty F] :
    SecretSharing.Scheme F (Randomness params) Party F
Defined in
CSLib, `Cslib.Crypto.Protocols.SecretSharing.Shamir.scheme`
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 8
Used by 1

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
/-- The canonical finite-field Shamir scheme with uniformly sampled tail coefficients. -/
noncomputable def Cslib.Crypto.Protocols.SecretSharing.Shamir.scheme (params : Params F Party)
    [Fintype F] [Nonempty F] :
    SecretSharing.Scheme F (Randomness params) Party F :=
  schemeWith params (uniformTailSampler params)
See it in the graphDiscuss this resultChallenge it