Create a test dkg The [`test_dkg_init`] module checks correctness of this setup

Deserialize an ark type with serde

Create a new PVSS instance within this DKG session, contributing to the final key `rng` is a cryptographic random number generator Returns a PVSS deal

Compute the inverse of the lagrange coefficients necessary to interpolate over u

Set up a dkg with enough pvss transcripts to meet the threshold The correctness of this function is tested in the module [`test_dealing`]

Serialize an ark type with serde

Returns the public session key for the publicly verifiable DKG participant

Aggregate the PVSS instances in `pvss` from DKG session `dkg` into a new PVSS instance

Aggregate all received PVSS messages into a single message, prepared to post on-chain

Compute a fast multiexp of many scalars times the same base Only convenient for when called once with given base; if called more than once, it's faste

Returns the public key generated by the DKG

Set up a dkg with enough pvss transcripts to meet the threshold

After consensus has agreed to include a verified message on the blockchain, we apply the chains to the state machine

Evaluate a polynomial f over the subproduct domain u

Generate a set of keypairs for each validator

Generate a few validators

Compute a linear combination of lagrange factors times c_i

partition_domain takes as input a vector of validators from participants in the DKG, containing their total stake amounts and public address (as Bech3

Create a test dkg in state [`DkgState::Init`]

Create a test dkg in state [`DkgState::Init`]

Part of checking the validity of an aggregated PVSS transcript If aggregation fails, a validator needs to know that their pvss transcript was at faul

Generate a set of keypairs for each validator

Generate a set of keypairs for each validator

Generate a few validators

Generate a few validators

Interpolate a polynomial f over the domain, such that f(u_i) = v_i

Set up a dkg with enough pvss transcripts to meet the threshold

Get the total voting power of the validator set

Verify that this PVSS instance is a valid aggregation of the PVSS instances, produced by [`aggregate`], and received by the DKG context `dkg` Returns

Verify the pvss transcript from a validator. This is not the full check, i.e. we optimistically do not check the commitment. This is deferred until th

Build a vector representation of the (n x n) circulant matrix of polynomial f Based on the blog post: https://alinush.github.io/2020/03/19/multiplying

Compute the derivative of polynomial f

GG Algorithm 9.5 Divide f by g in nearly linear time

Increment the number of blocks processed since the DKG protocol began if we are still sharing PVSS transcripts. Returns a value indicating if we shou

Where indicated, algorithms are from Modern Computer Algebra, 3rd edition, by Gathen and Gerhard Abbreviated as GG Let M(n) denote the time to multipl

Create a new DKG context to participate in the DKG Every identity in the DKG is linked to an ed25519 public key; `validator_set`: The set of validator

Create a new PVSS instance `s`: the secret constant coefficient to share `dkg`: the current DKG session `rng` a cryptographic random number generator

Sorts the validators from highest to lowest. This ordering first considers staking weight and breaks ties on established address

Creates a new ephemeral session key for participating in the DKG

Create a new subproduct tree domain over the domain { u_0, ..., u_{n-1} }

GG chapter 9.1 Computes the rev_m(f) function in place rev_m(f) = x^m f(1/x)