Skip to content

Latest commit

 

History

History
259 lines (178 loc) · 15.9 KB

bip-0047.mediawiki

File metadata and controls

259 lines (178 loc) · 15.9 KB
Raw

RECENT CHANGES:

  • (21 Sep 2015) Correct base58check version byte
  • (18 Sep 2015) Clarify decoding of notification transactions
  BIP:     47
  Title:   Reusable Payment Codes for Hierarchical Deterministic Wallets
  Authors: Justus Ranvier <[email protected]>
  Status:  Draft
  Type:    Informational
  Created: 2015-04-24

Table of Contents

Abstract

This BIP defines a technique for creating a payment code which can be publicly advertised and associated with a real-life identity without creating the loss of security or privacy inherent to P2PKH address reuse.

This BIP is a particular application of BIP43 and is intended to supplement HD wallets which implement BIP44.

The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in RFC 2119.

Motivation

Payment codes add identity information to transactions which is useful in a merchant-customer interaction while protecting the privacy of users. Payment codes provide the privacy benefits of Darkwallet-style Stealth Addresses to SPV clients without requiring the assistance of a trusted full node and while greatly reducing reliance on blockchain storage.

Path levels

We define the following 3 levels in BIP32 path: 

m / purpose' / coin_type' / identity'

Apostrophe in the path indicates that BIP32 hardened derivation is used.

Each level has a special meaning, described in the chapters below.

Purpose

Purpose is a constant set to 47' (or 0x8000002F) following the BIP43 recommendation. It indicates that the subtree of this node is used according to this specification.

Coin type

The coin type field is identical to the same field in BIP44

Hardened derivation is used at this level.

Identity

Identity is a particular extended public/private key pair. The extended public key is a payment code.

Identities SHOULD have 1:1 correspondence with a BIP44 account, as in each BIP44 account in an HD wallet should be assigned exactly one payment code which shares the same index value.

Hardened derivation is used at this level.

Except where noted, all keys derived from a payment code use the public derivation method.

Binary Serialization

A payment code contains the following elements:

  • Byte 0: type. required value: 0x01
  • Byte 1: features bit field. All bits must be zero except where specified elsewhere in this specification
    • Bit 0: Bitmessage notification
    • Bits 1-7: reserved
  • Byte 2: sign. required value: 0x02 or 0x03
  • Bytes 3 - 34: x value, must be a member of the secp256k1 group
  • Bytes 35 - 66: chain code
  • Bytes 67 - 79: reserved for future expansion, zero-filled unless otherwise noted

Base58 Serialization

When a payment code is presented to the user, it SHOULD be presented encoded in Base58Check form.

  • The version byte is: 0x47 (produces a "P" as the first character of the serialized form)
  • The payload is the binary serialization of the payment code

Protocol

In the following examples, Alice and Bob are identities with a corresponding payment codes. Alice initiates a Bitcoin transaction, and Bob is the recipient of the transaction.

It is assumed that Alice can easily obtain Bob's payment code via a suitable method outside the scope of the payment code protocol.

Definitions

  • Payment code: an extended public key which is associated with a particular identity
  • Notification address: the P2PKH address associated with the 0th public key derived from a payment code
  • Notification transaction: a transaction which sends an output to a notification address which includes an embedded payment code

Notification Transaction

Prior to the first time Alice initiates a transaction to Bob, Alice MUST inform Bob of her payment code via the following procedure:

  1. Alice constructs a transaction which sends a small quantity of bitcoins to Bob's notification address (notification transaction)
    1. The inputs selected for this transaction MUST NOT be easily associated with Alice's notification address
  2. Alice derives a unique shared secret using ECDH:
    1. Alice selects the private key corresponding to the first exposed public key, of the first pubkey-exposing input, of the transaction: 
      a
    2. Alice selects the public key associated with Bob's notification address: 
      B, where B = bG
    3. Alice calculates a secret point: 
      S = aB
    4. Alice calculates a 64 byte blinding factor: 
      s = HMAC-SHA512(x, o)
      1. "x" is the x value of the secret point
      2. "o" is the outpoint being spent by the first pubkey-exposing input of the transaction.
  3. Alice serializes her payment code in binary form.
  4. Alice renders her payment code (P) unreadable to anyone except Bob:
    1. Replace the x value with x': 
      x' = x XOR (first 32 bytes of s)
    2. Replace the chain code with c': 
      c' = c XOR (last 32 bytes of s)
  5. Alice adds an OP_RETURN output to her transaction which consists of P.

  1. Bob watches for any transactions which create an output at his notification address.
  2. When a transaction is received, the client examines it to determine if it contains a standard OP_RETURN output with an 80 byte payload (notification transactions).
  3. If the first byte of the payload in a notification transaction is 0x01:
    1. Bob selects the first exposed public key, of the first pubkey-exposing input, of the transaction: 
      A, where A = aG
    2. Bob selects the private key associated with his notification address: 
      b
    3. Bob calculates a secret point: 
      S = bA
    4. Bob calculates the binding factor: 
      s = HMAC-SHA512(x, o)
      1. "x" is the x value of the secret point
      2. "o" is the outpoint being spent by the first pubkey-exposing input of the transaction.
    5. Bob interprets the 80 byte payload as a payment code, except:
      1. Replace the x value with x': 
        x' = x XOR (first 32 bytes of s)
      2. Replace the chain code with c': 
        c' = c XOR (last 32 bytes of s)
    6. If the updated x value is a member of the secp256k1 group, the payment code is valid.
    7. If the updated x value is not a member of the secp256k1 group, the payment code is ignored.
Now that Bob's client has received Alice's payment code, it is possible for Alice to send payments (up to 232 payments) to Bob.

Alice will never again need to send a notification transaction to Bob.

Bitcoins received via notification transactions require special handling in order to avoid privacy leaks:

  1. The value of outputs received to notification addresses MUST NOT be displayed to the user as part of their spendable balance.
  2. Outputs received to notification addresses MUST NOT be used as inputs for any transaction that involve ECDH calculations using any of the user's payment codes.
  3. Outputs received to notification addresses MAY be passed through a mixing service before being added to the user's spendable balance.
  4. Outputs received to notification addresses MAY be donated to miners using dust-b-gone or an equivalent procedure.

Sending

  1. Each time Alice wants to initiate a transaction to Bob, Alice derives a unique P2PKH address for the transaction using ECDH follows:
    1. Alice selects the 0th private key derived from her payment code: 
      a
    2. Alice selects the next unused public key derived from Bob's payment code, starting from zero: 
      B, where B = bG
      1. The "next unused" public key is based on an index specific to the Alice-Bob context, not global to either Alice or Bob
    3. Alice calculates a secret point: 
      S = aB
    4. Alice calculates a scalar shared secret using the x value of S: 
      s = SHA256(Sx)
      1. If the value of s is not in the secp256k1 group, Alice MUST increment the index used to derive Bob's public key and try again.
    5. Alice uses the scalar shared secret to calculate the ephemeral public key used to generate the P2PKH address for this transaction: 
      B' = B + sG

  1. Bob is watching for incoming payments on B' ever since he received the notification transaction from Alice.
    1. Bob calculates n shared secrets with Alice, using the 0th public key derived Alice's payment code, and private keys 0 - n derived from Bob's payment code, where n is his desired lookahead window.
    2. Bob calculates the ephemeral deposit addresses using the same procedure as Alice: 
      B' = B + sG
    3. Bob calculate the private key for each ephemeral address as: 
      b' = b + s

Refunds

Because Bob learns Alice's payment code as part of the process of receiving a payment, Bob has all the information he needs in order to send a refund to Alice.

A refund transaction is identical to a payment transactions, with only the roles of the participants switches.

Bob MUST send a notification transaction to Alice prior to the first time he sends funds to Alice, even if he has received transactions from her in the past.

Anonymous Payments

If Alice does not want her payment to Bob to be associated with her identity, she generates an ephemeral payment code to use for the transaction.

  • Ephemeral payment codes are the hardened children of a payment code, starting from an index of zero.
  • An ephemeral payment code SHOULD only be used for a single outgoing payment.
  • The notification address of an ephemeral payment code MUST be monitored for notification transactions in order to detect incoming refund payments
  • The correspondence between BIP44 accounts and ephemeral payment codes is 1:many

Cold Storage

  • Unlike traditional watching-only wallets, those associated with payment codes held in cold storage can not detect incoming payments immediately.
  • When the watching-only wallet detects an incoming notification transaction, it packages the transaction in an implementation-specific format suitable for transfer to the offline device.
  • The offline device recovers the payment code, then pre-generates a large number of relevant keypairs (example: 10000) in order to minimize the need for air gap round trips.
  • The offline device then packages the relevant public keys in an implementation-specific format suitable for transfer to the online device.
  • The online device can then watch for incoming payments using a suitable lookahead window.
  • If the lookahead window reaches the end of the pre-generated public keys, the user must generate more keys on the offline device and transfer them to the online device.

Wallet Recovery

Normal operation of a payment code-enabled wallet can be performed by an SPV client and does not require access to a complete copy of the blockchain.

Recovering a wallet from a seed, however, does require access to a fully-indexed blockchain.

The required data may be obtained from copy of the blockchain under the control of the user, or via a publicly-queriable blockchain explorer.

When querying a public blockchain explorer, wallets SHOULD connect to the explorer through Tor (or equivalent) and SHOULD avoid grouping queries in a manner that associates ephemeral addresses with each other.

Previously-spendable funds will generally not be lost or become inaccessible after a recovery from a seed, but all information regarding previous outgoing payments will be lost.

The metadata which a wallet must store regarding the state an identity consists of:

  1. A list of every payment code to which the identity has sent a notification transaction.
    1. This list is lost if a wallet must be recovered from a seed.
    2. The recovered wallet MUST send notification transactions as if it was a newly-created wallet
  2. The index value corresponding to the next unused pubkey for each payment code on the previous list
    1. This value can be recovered by checking each ephemeral deposit address in sequence for transactions.
    2. Wallets MAY use a lookahead window capable of detecting gaps in the address sequence during this recovery operation.
  3. The index value of the next unused ephemeral payment code.
    1. Recovering all incoming funds associated with ephemeral payment codes with 100% certainty requires exhausting the entire 232 address space of potential ephemeral payment codes.
      1. In most cases, less than 100% certainty is acceptable as long as a fallback "deep scan" is available as an option to the user.
    2. The wallet checks the notification address for each ephemeral payment code for notification transactions in order to recover associated funds.
    3. Since most ephemeral payment codes will not receive a refund transaction wallets SHOULD use a large lookahead window for this recovery operation.
    4. The recovered value MUST be chosen as a number higher than any ephemeral payment code which has received a notification transaction.

Wallet Sharing

Wallets using payment codes generally should not be shared across multiple devices, given the need to synchronize metadata between each instance.

If wallets are shared between devices without a synchronization mechanism, undesirable address reuse can occur.

Wallets may perform an OPTIONAL check for existing transactions to an ephemeral deposit addresses prior to sending a transaction by checking a local copy of the blockchain or querying a public blockchain explorer via Tor or equivalent.

Alternate Notification Methods

In order to ensure that no funds will be lost in the event the recipient must recover their wallet from a seed, the sender MUST send a notification transaction the first time the sender interacts with a particular recipient.

A recipient MAY choose to designate alternate notification methods which the sender may use in addition to a notification transaction.

If the recipient specifies an alternate notification method, a compliant implementation MAY refrain from continually monitoring the notification address and SHOULD check the notification address periodically to detect payments sent by users who can not employ the alternate method.

A recipient specifies their preference for alternate notification by setting the appropriate bits in the feature byte of their payment code.

Bitmessage Notification

A recipient prefers to receive notifications via Bitmessage indiates this preference by:

  • Setting bit 0 of the features byte to 1
  • Setting byte 67 of the serialized payment code to the desired Bitmessage address version
  • Setting byte 67 of the serialized payment code to the desired Bitmessage stream number
The sender uses this information to construct a valid notification Bitmessage address:

  1. Derive a Bitmessage signing key as: 
    B = payment code / 0 / 0
  2. Initialize a counter at 1: 
    n
  3. Derive a candidate encryption key as: 
    B' = payment code / 0 / n
  4. If the combination of B and B` do not form a valid Bitmessage address, increment n by one and try again
  5. Use the address version, signing key, encryption key, and stream number to construct a Bitmessage address per the Bitmessage protocol
The sender transmits their payment code in base58 form to the calculated Bitmessage address.

In order to use Bitmessage notification, the recipient must have a Bitmessage client which listens at the address which the senders will derive and is capable of relaying received payment codes to the Bitcoin wallet.

Reference