Given the input wires (signals), calculate the values of the remaining wires and return the values of all wires of the circuit. The input wires are a

Coefficient (`c_i`) at the _ith_ position

Commit to a batch of messages and output commitments corresponding to each message.

Returns underlying message commitments.

Compute membership witness

Compute membership witness for batch

Compute new accumulated value after addition.

Compute new accumulated value after addition

Compute new accumulated value after batch addition.

Compute new accumulated value after batch additions and removals

Compute new accumulated value after removal

Compute new accumulated value after removal

Compute new accumulated value after batch removal

Compute non membership witness given `d` where `d = f_V(-non_member) = (member_0 - non_member)*(member_1 - non_member)*...(member_n - non_member)` whe

Compute non-membership witnesses for a batch {`y_i`} given their `d`s, where `d = f_V(-y_i)` for each member `y_i`

Computes `r_0_i = s_i + c_0_i * sk`

Dumps 0, 1, ... PIPELINES_SIZE-1 into Block128 object then unifies it into a Block128x8 this could probably be done faster in a similar manner to as_m

Produces threshold secret key and individual secret keys supporting `message_count` messages for all participants.

Generate a random secret with its shares according to Pedersen's verifiable secret sharing. At least `threshold` number of shares are needed to recons

Same as `deal_random_secret` above but accepts the secret to share

Same as `deal_random_secret` above but accepts the secret to share

Use the party's secret key to decrypt the share

Derive prepared keys for performing pairings. This is done to avoid preparing the same parameters again and is effectively a pre-processing step done

Get the function with given name

Compute the public offsets for P in along G This computes v_hat as (explained in prover round 3) P += 2*T^5*<alpha_d_vec, alpha_r2>*G // Reciprocal co

Compute the public offsets for P in along G_vec. This computes P = alpha_d_vec * t^3 + alpha_r1_vec * t^2 + alpha_r2_vec * t^2 + alpha_m_vec * t^4

Generate proof. Post-challenge phase of the protocol.

Generates random `v` and returns pair `(v, v*g + <g_vec, n> + <h_vec, l>)`

Creates a signature request by committing the attributes in a set commitment and then signing that commitment along with other values. The attributes

Call this on the accumulator before update

Call this on the accumulator before update

Generate Omega when the domain of the accumulator is extended. This means new elements are added to the non-membership accumulator and hence those wit

Generates a random common reference string for a circuit. `commit_witness_count` is the number of witnesses committed in proof

Return `pk * blinding`

Return `pk + g * blinding`

Returns a vector of tuples where each tuple is a pair of commitments to the `v_i` but with different randomnesses

Get the 1st `n` private inputs to the circuit. The order is determined by the order in which `Self::set_private` was called.

These parameters are needed for setting up keys for encryption/decryption

Return number of input signals