Discrete log equivalency (DLEQ)

Discrete log equivalency (DLEQ) or proofs of discrete log equivalency (PODLE) is the ability to prove two points on an elliptic curve were both derived from the same private value (such as a private key). Applications of it include committing to ownership of a key in the UTXO set without publicly revealing the specific UTXO and proving a silent payment output was constructed correctly without disclosing a private key. Read More