Removes unnecessary contents, resulting in a much smaller proof.
Checks that this Chaum-Pedersen proof certifies that the prover knew an x, such that (g, g^x) and (h, h^x) share the same exponent x, without revealing x. Part of the proof is a challenge constant. By suppressing this check, "fake" proofs can be validated. Useful when doing disjunctive proofs.
See above.
See above.
See above.
See above.
Optional additional values to include in the hash challenge computation hash
If false, the challenge constant is not verified. (default: true)
If true, avoids validating correctness of a and b. (default: false)
true if the proof is valid
Produces a generic Chaum-Pedersen proof that two tuples share an exponent, i.e., that for (g, g^x) and (h, h^x), it's the same value of x, but without revealing x. This generic proof can be used as a building-block for many other proofs.
There's no need for g^x and h^x in this particular computation.
An element in Q, typically derived from the seed, used to randomize the generation of the proof
Any valid element in the subgroup of P
Any valid element in the subgroup of P
Any element in Q
Optional additional values to include in the start of the challenge computation hash.
Generated using TypeDoc
Expanded form of the GenericChaumPedersenProof, with the
aandbvalues recomputed. This should not be serialized.