[Housekeeping] Normalize BIP references

develop
David A. Harding 12 months ago
parent 7412584e41
commit e6f895732a

@ -4,7 +4,7 @@
((("bitcoin improvement proposals", "types of")))Bitcoin Improvement Proposals are design documents providing information to the bitcoin community, or for describing a new feature for bitcoin or its processes or environment.
As per BIP-01 _BIP Purpose and Guidelines_, there are three kinds of BIPs:
As per BIP1 _BIP Purpose and Guidelines_, there are three kinds of BIPs:
_Standard_ BIP:: Describes any change that affects most or all bitcoin implementations, such as a change to the network protocol, a change in block or transaction validity rules, or any change or addition that affects the interoperability of applications using bitcoin.
_Informational_ BIP:: Describes a bitcoin design issue, or provides general guidelines or information to the bitcoin community, but does not propose a new feature. Informational BIPs do not necessarily represent a bitcoin community consensus or recommendation, so users and implementors may ignore informational BIPs or follow their advice.

@ -114,7 +114,7 @@ $ bx ec-to-address < public_key
17re1S4Q8ZHyCP8Kw7xQad1Lr6XUzWUnkG
----
Keys generated in this manner produce a type-0 nondeterministic wallet. That means that each key is generated from an independent seed. Bitcoin Explorer commands can also generate keys deterministically, in accordance with BIP-32. In this case, a "master" key is created from a seed and then extended deterministically to produce a tree of subkeys, resulting in a type-2 deterministic wallet.
Keys generated in this manner produce a type-0 nondeterministic wallet. That means that each key is generated from an independent seed. Bitcoin Explorer commands can also generate keys deterministically, in accordance with BIP32. In this case, a "master" key is created from a seed and then extended deterministically to produce a tree of subkeys, resulting in a type-2 deterministic wallet.
First, we use the +seed+ and +hd-new+ commands to generate a master key that will be used as the basis to derive a hierarchy of keys:

@ -9,9 +9,9 @@ The pycoin library supports both Python 2 (2.7.x) and Python 3 (3.3 and later) a
=== Key Utility (KU)
((("key utility (ku)", id="keyutil17")))The command-line utility +ku+ ("key utility") is a Swiss Army knife for manipulating keys. It supports BIP-32 keys, WIF, and addresses (bitcoin and alt coins). Following are some examples.
((("key utility (ku)", id="keyutil17")))The command-line utility +ku+ ("key utility") is a Swiss Army knife for manipulating keys. It supports BIP32 keys, WIF, and addresses (bitcoin and alt coins). Following are some examples.
Create a BIP-32 key using the default entropy sources of GPG and _/dev/random_:
Create a BIP32 key using the default entropy sources of GPG and _/dev/random_:
----
@ -47,7 +47,7 @@ Bitcoin address : 1FNNRQ5fSv1wBi5gyfVBs2rkNheMGt86sp
uncompressed : 1DSS5isnH4FsVaLVjeVXewVSpfqktdiQAM
----
Create a BIP-32 key from a passphrase:
Create a BIP32 key from a passphrase:
[WARNING]
====

@ -52,8 +52,8 @@ Tables and descriptions sourced from https://en.bitcoin.it/wiki/Script[].
[options="header"]
|=======
| Symbol | Value (hex) | Description
| OP_CHECKLOCKTIMEVERIFY (previously OP_NOP2) | 0xb1 | Marks transaction as invalid if the top stack item is greater than the transaction's nLockTime field, otherwise script evaluation continues as though an OP_NOP was executed. Transaction is also invalid if 1. the stack is empty; or 2. the top stack item is negative; or 3. the top stack item is greater than or equal to 500000000 while the transaction's nLockTime field is less than 500000000, or vice versa; or 4. the input's nSequence field is equal to 0xffffffff. The precise semantics are described in BIP-65
| OP_CHECKSEQUENCEVERIFY (previously OP_NOP3) | 0xb2 | Marks transaction as invalid if the relative lock time of the input (enforced by BIP 0068 with nSequence) is not equal to or longer than the value of the top stack item. The precise semantics are described in BIP-112|
| OP_CHECKLOCKTIMEVERIFY (previously OP_NOP2) | 0xb1 | Marks transaction as invalid if the top stack item is greater than the transaction's lock time field, otherwise script evaluation continues as though an OP_NOP was executed. Transaction is also invalid if 1. the stack is empty; or 2. the top stack item is negative; or 3. the top stack item is greater than or equal to 500000000 while the transaction's lock time field is less than 500000000, or vice versa; or 4. the input's sequence field is equal to 0xffffffff. The precise semantics are described in BIP65
| OP_CHECKSEQUENCEVERIFY (previously OP_NOP3) | 0xb2 | Marks transaction as invalid if the relative lock time of the input (enforced by BIP68 with sequence) is not equal to or longer than the value of the top stack item. The precise semantics are described in BIP112|
|=======
<<tx_script_ops_table_stack>> shows operators used to manipulate the stack.

@ -709,7 +709,7 @@ version prefixes and the resulting base58 characters are shown in
| Testnet Address for P2PKH | 0x6F | m or n
| Testnet Address for P2SH | 0xC4 | 2
| Private Key WIF | 0x80 | 5, K, or L
| BIP-32 Extended Public Key | 0x0488B21E | xpub
| BIP32 Extended Public Key | 0x0488B21E | xpub
|=======
Putting together public keys, hash-based commitments, and base58check

@ -804,7 +804,7 @@ remove a pattern from a bloom filter, a client has to clear and resend a
new bloom filter if a pattern is no longer desired.
The network protocol and bloom filter mechanism for SPV clients is defined
in http://bit.ly/1x6qCiO[BIP-37 (Peer Services)].((("",
in http://bit.ly/1x6qCiO[BIP37 (Peer Services)].((("",
startref="BNebloom08")))((("", startref="bloom08")))
Unfortunately, after the deployment of bloom filters, it became clear

@ -993,7 +993,7 @@ hash operations to verify the transaction.
Segwit represented an opportunity to address this problem by changing
the way the commitment hash is calculated. For segwit version 0 witness
programs, signature verification occurs using an improved commitment
hash algorithm as specified in BIP-143.
hash algorithm as specified in BIP143.
The new algorithm allows the number of
hash operations increases by a much more gradual O(n) to the number of

@ -66,7 +66,7 @@
* Implementing Keys and Addresses in C++
* Implementing Keys and Addresses in Python
* Advanced Keys and Addresses
* Encrypted Private Keys (BIP-38)
* Encrypted Private Keys (BIP38)
* Pay-to-Script Hash (P2SH) and Multisig Addresses
* Vanity Addresses
* Paper Wallets
@ -74,12 +74,12 @@
* Wallet Technology Overview
* Nondeterministic (Random) Wallets
* Deterministic (Seeded) Wallets
* HD Wallets (BIP-32/BIP-44)
* Seeds and Mnemonic Codes (BIP-39)
* HD Wallets (BIP32/BIP44)
* Seeds and Mnemonic Codes (BIP39)
* Wallet Best Practices
* Using a Bitcoin Wallet
* Wallet Technology Details
* Mnemonic Code Words (BIP-39)
* Mnemonic Code Words (BIP39)
* Creating an HD Wallet from the Seed
* Using an Extended Public Key on a Web Store
=== 6. Transactions
@ -203,9 +203,9 @@ Bitcoin Addresses, Balances, and Other Abstractions
* Soft Forks
* Criticisms of Soft Forks
* Soft Fork Signaling with Block Version
* BIP-34 Signaling and Activation
* BIP-9 Signaling and Activation
* NEW BIP-8 Activation
* BIP34 Signaling and Activation
* BIP9 Signaling and Activation
* NEW BIP8 Activation
* *NEW: Speedy Trial Activation*
* Consensus Software Development
=== 11. Bitcoin Security

Loading…
Cancel
Save