mirror of
https://github.com/bitcoin/bips.git
synced 2025-02-23 15:20:50 +01:00
updated BIP number and examples
This commit is contained in:
parent
3ff47ff642
commit
689fcdb878
1 changed files with 12 additions and 12 deletions
|
@ -1,11 +1,11 @@
|
|||
<pre>
|
||||
BIP: TBD
|
||||
BIP: 175
|
||||
Layer: Applications
|
||||
Title: Pay to Contract Protocol
|
||||
Author: Omar Shibli <omar@commerceblock.com>
|
||||
Nicholas Gregory <nicholas@commerceblock.com>
|
||||
Comments-Summary: No comments yet.
|
||||
Comments-URI: https://github.com/bitcoin/bips/wiki/Comments:BIP-TBD
|
||||
Comments-URI: https://github.com/bitcoin/bips/wiki/Comments:BIP-0175
|
||||
Status: Draft
|
||||
Type: Informational Track
|
||||
Created: 2017-07-17
|
||||
|
@ -60,10 +60,10 @@ Each level has special meaning described in the chapters below.
|
|||
|
||||
===Purpose===
|
||||
|
||||
Purpose is a constant set to <code>TBD'</code> (or <code>TBD</code>) following the BIP-0043 recommendation. It indicates that the subtree of this node is used according to this specification.
|
||||
Purpose is a constant set to <code>175'</code> (or <code>0x800000AF</code>) following the BIP-0043 recommendation. It indicates that the subtree of this node is used according to this specification.
|
||||
|
||||
<code>
|
||||
m / TBD' / *
|
||||
m / 175' / *
|
||||
</code>
|
||||
|
||||
Hardened derivation is used at this level.
|
||||
|
@ -141,9 +141,9 @@ For the following given inputs:
|
|||
we can compute payment base as follows:
|
||||
|
||||
payment base derivation path:
|
||||
m/999'/0'
|
||||
m/175'/0'
|
||||
contract base public extended key:
|
||||
xpub6A7Bkv1CFa275xd2vyheGLS1NX8zNizxU82ufcL3fnwnhS7DBpruR16oSFZGUQVtJNEjghCe3ZdPManUWCZFJo6t5U98KC2cYMpXtqNCwi3
|
||||
xpub6B3JSEWjqm5GgfzcjPwBixxLPzi15pFM3jq4E4yCzXXUFS5MFdXiSdw7b5dbdPGHuc7c1V4zXbbFRtc9G1njMUt9ZvMdGVGYQSQsurD6HAW
|
||||
|
||||
In the below examples, we are going to use SHA256 as a cryptographic hash function, and the above contract base public key.
|
||||
|
||||
|
@ -184,15 +184,15 @@ As an input, we have a contract that consists of two documents, below are conten
|
|||
|
||||
contract_base_pub/60466/7653/27379/46703/46238/35279/58182/22051/34991/14461/46729/5725/28518/10809/20520/27223
|
||||
or
|
||||
m/999'/0'/60466/7653/27379/46703/46238/35279/58182/22051/34991/14461/46729/5725/28518/10809/20520/27223
|
||||
m/175'/0'/60466/7653/27379/46703/46238/35279/58182/22051/34991/14461/46729/5725/28518/10809/20520/27223
|
||||
|
||||
6. Compute public extended key.
|
||||
|
||||
xpub6h8197UZpVMsYirUuHZUDbn8d8dewqW6UkZiXFNRf6WsvkgDsJQN5Atn8PUExFmyofccfoY6dMWqb9SpnJ5HDibi6kKbq931Z531ELCXHTn
|
||||
xpub6hML7vSU2Hwww9ctwrwt4ijnhJr4n6XaMRox1nnF3PvZKuF1SZoTymnKQHrF9fp2nWJSqv5ZjJSxJJQ8A3PKcBUWhGvTFmuRKpycSCr5coz
|
||||
|
||||
7. Compute address of the public extended key (P2PKH).
|
||||
|
||||
1LeYXs63uVSDu2XSb82xdEc7RumohCpB7Q
|
||||
1HYjhPTtMmpBJBd5tVepZDAVdvPA7o8KHJ
|
||||
|
||||
|
||||
verification example 1 (negative test):
|
||||
|
@ -218,15 +218,15 @@ Similarliy to the input above, excpet this time we have a contract that consists
|
|||
|
||||
contract_base_pub/14856/24664/10561/15584/48981/6920/53790/18984/56282/28224/32656/61425/50248/59449/1292/29601
|
||||
or
|
||||
m/999'/0'/14856/24664/10561/15584/48981/6920/53790/18984/56282/28224/32656/61425/50248/59449/1292/29601
|
||||
m/175'/0'/14856/24664/10561/15584/48981/6920/53790/18984/56282/28224/32656/61425/50248/59449/1292/29601
|
||||
|
||||
5. Compute public extended key.
|
||||
|
||||
xpub6gvNX6yBEaBu5nGg9rrtEQgSgvAL5vtcbD8MpCfQgd1Wzuga8Kk3bJkhpTzDWvsx5sLj65UQvQaAgW34SwnGBEmxLvWDshBgPyJstd6RQdB
|
||||
xpub6gujKWRhegHXKZBkrprW55oSL6UxYhStxF5FtoUNa4KShLxLPDLQTS39XAwRhdCSvuAv2wogwukmfk3fS7CM6pT6QWwJHiCTw7RkwXMgThy
|
||||
|
||||
7. Compute address of the public extended key (P2PKH).
|
||||
|
||||
1JwnGxLhT9K6RbUsWcjL2mtmpPEHsLFvXG
|
||||
162KDdRXa3KPgYkH3d1DDKfddacH1gn1n8
|
||||
|
||||
8. As expected the address doesn't match the Bitcoin address from the last example <code>1LeYXs63uVSDu2XSb82xdEc7RumohCpB7Q</code>.
|
||||
|
||||
|
|
Loading…
Add table
Reference in a new issue