Read next 32-bytes in little-endian format from the offset `i`

Process received commitments to the shares from another party and store it

Reconstruct the secret. Assumes that shares are unique and have the same threshold

Remove an element from the accumulator and state. Reads and writes to state. Described in section 2 of the paper

Schnorr response for relation `com = g * o + \sum_{i}(h_{i} * m_{i})`

Returns both vectors of key scaled by the given vector entrywise. In other words, it returns $\{v_i^{s_i}\}$

Produces a function which will check for each item to be equal previous plus `n` starting from the supplied value.

Set values for the circuit wires.

Solve discrete log using Baby Step Giant Step as described in section 2 of <https://eprint.iacr.org/2015/605> `max` is the maximum value of the discre

Just for testing, let a trusted party do the keygen and give each signer its keyshare

Just for testing, let a trusted party do the keygen and give each signer its keushare

Maps supplied iterator and attempts to pair each `Ok(_)` item with an item from the slice which has provided index. Returns `Err` containing an invali

Update both membership and non-membership witnesses in a single call. Call this on the accumulator before update

Update accumulator on share created by self. Assumes the share is valid

Update non-membership witnesses when the non-membership accumulator is updated

Verifies the proof of equality without checking for range proof. `comm_g1` and `comm_g2` are the commitments to `witness` in groups G1 and G2 respecti

Signer verifies the signature request before creating a signature

Verifies underlying proof of knowledge using supplied arguments. `indexed_revealed_messages_sorted_by_index` must produce items sorted by unique indic

Verifies relation `com = g * o + \sum_{i}(h_{i} * m_{i})`.

Verify ciphertext commitment and snark proof

Verify the proof except the pairing equations. This is useful when doing several verifications (of this protocol or others) and the pairing equations

Verify the proof except the pairing equations. This is useful when doing several verifications (of this protocol or others) and the pairing equations

Verify the proof except the pairing equations. This is useful when doing several verifications (of this protocol or others) and the pairing equations

Verify the proof except the pairing equations. This is useful when doing several verifications (of this protocol or others) and the pairing equations

Ensures that `e(sigma_1, p1) == e(sigma_2, p2)` and signature isn't zero.

Similar to `Self::verify_with_randomized_pairing_checker` but responses for some messages (witnesses) are provided in `missing_responses`. The keys of

This verifies `pi_3` from the paper.

Compute the inner product of two polynomials

Parse witness as a u64. Expects that witness won't be > u64

Add a batch of members in the accumulator. Reads and writes to state. Described in section 3 of the paper

Add a batch of elements to the accumulator. Returns the membership witness of that batch

Same as `Self::add_multiple_sources_and_target` except that this accepts whether to be lazy or not and does not default to laziness decided during cre

Same as `Self::add_multiple_sources` except that this accepts whether to be lazy or not and does not default to laziness decided during creation of th

Called by a participant when it receives its share during Round 1

Same as `Self::add_sources` except that this accepts whether to be lazy or not and does not default to laziness decided during creation of the checker

Compute a vector of powers of `b` multiplied by powers of `lambda` like this: `(1, b, b^2, b^3, ..., b^{num_digits-1}, lambda, lambda*b, lambda*b^2, l

Same as `alpha_d` except that it accepts lambda powers

Compute alpha_m = vec![x/e, x/(e + 1), x/(e + 2), ...]

Compute alpha_m = vec![x/e, x/(e + 1), x/(e + 2), ...] X q_inv_pows

Convenience method for appending a `u64` to the transcript. The `label` parameter is metadata about the message, and is also appended to the transcri

Adding and removing batches of elements from the accumulator. Reads and writes to state. Described in section 3 of the paper

Returns underlying blindings.

obtain the c poly