Timechain
Search Donate
Sponsors
Cake Wallet, private Bitcoin and Monero walletSideShift.ai, no-signup crypto exchangeOrangeRock, non-custodial bitcoin spot and perps tradingBraiins Hashpower, buy and sell Bitcoin hashrateLayer Two Labs, drivechains for Bitcoin
BIP 374

Discrete Log Equality Proofs

Draft Draft Applications Specification Assigned 2024-12-26
From the BIP’s abstract

This document proposes a standard for 64-byte zero-knowledge discrete logarithm equality proofs (DLEQ proofs) over an elliptic curve. For given elliptic curve points A, B, C, G, and a scalar a known only to the prover where A = a⋅G and C = a⋅B, the prover proves knowledge of a without revealing anything about a. This can, for instance, be useful in ECDH: if A and B are ECDH public keys, and C is their ECDH shared secret computed as C = a⋅B, the proof establishes that the same secret key a is used for generating both A and C without revealing a.

Read BIP 374 on GitHubFind in explorer

Changelog

  • 2026-10-260.3.1 · Add test vectors checking scalar boundaries
  • 2026-08-190.3.0 · Treat the challenge e as a scalar (reduced modulo the curve order) and reject proofs with e ≥ n
  • 2025-02-270.2.0 · Add the message to the rand computation
  • 2024-12-260.1.0 · Initial version
From the BIP’s own Changelog section.
0:000:00