AFTD Auto-Formalizing Theoretical Domains

Cslib.Crypto.Protocols.SecretSharing.Shamir.authorized_univ

theoremverifiedformalizationimported Lean

Because params.threshold < |Party|, the full party set can always reconstruct the secret.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {F Party : Type*} [Field F] [Fintype Party] in
theorem Cslib.Crypto.Protocols.SecretSharing.Shamir.authorized_univ {F Party : Type*} [Field F] [Fintype Party]
    (params : Params F Party) :
    authorized params (Finset.univ : Finset Party)
Formalizes
CSLib, `Cslib.Crypto.Protocols.SecretSharing.Shamir.authorized_univ`
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
Classical.choiceQuot.soundpropext
Built on 2

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {F Party : Type*} [Field F] [Fintype Party] in/-- Because `params.threshold < |Party|`, the full party set can always reconstruct the secret. -/theorem Cslib.Crypto.Protocols.SecretSharing.Shamir.authorized_univ {F Party : Type*} [Field F] [Fintype Party]    (params : Params F Party) :    authorized params (Finset.univ : Finset Party) := by  simpa [authorized] using Nat.succ_le_of_lt params.threshold_lt_card
See it in the graphDiscuss this resultChallenge it