Implements functions and primitives to proof Diffie-Hellman tuples (pairs of public keys).
This allows to implement ErgoMix script.
Instead of single primitive for proof of discrete logarithm we have two primitives.
Thus we use Sigma ProofInput to unite the primitives in place of single Sigma PublicKey.
Proof of key ownership is DLog.
Proof of pair of keys is DTuple.
There is boilerplate in Sigma interpreter module that was caused by difference in commitments for
those two types of proofs. First requires single commitment ad second one requires two commitments.
Implements functions and primitives to proof Diffie-Hellman tuples (pairs of public keys). This allows to implement ErgoMix script.
Instead of single primitive for proof of discrete logarithm we have two primitives. Thus we use
Sigma ProofInputto unite the primitives in place of singleSigma PublicKey. Proof of key ownership isDLog. Proof of pair of keys isDTuple.There is boilerplate in Sigma interpreter module that was caused by difference in commitments for those two types of proofs. First requires single commitment ad second one requires two commitments.