diff options
| author | Daniel Cousens <github@dcousens.com> | 2015-09-10 07:43:00 +1000 |
|---|---|---|
| committer | Daniel Cousens <github@dcousens.com> | 2015-09-10 07:50:19 +1000 |
| commit | 8368e7553ca073ff887bf8d22cde21bec545b56d (patch) | |
| tree | 3623d6601c63f73bffdcf4da72a5999fc4b71587 | |
| parent | 1d74463fd97f81d9612214420f44978991cd3ca6 (diff) | |
| download | bips-8368e7553ca073ff887bf8d22cde21bec545b56d.tar.xz | |
endianness not relevant, use byte order
| -rw-r--r-- | bip-0069.mediawiki | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/bip-0069.mediawiki b/bip-0069.mediawiki index 56400cb..e868df3 100644 --- a/bip-0069.mediawiki +++ b/bip-0069.mediawiki @@ -83,7 +83,7 @@ Transaction inputs are defined by the hash of a previous transaction, the output For sorting inputs, the hash of the previous transaction and the output index within that transaction are sufficient for sorting purposes; each transaction hash has an extremely high probability of being unique in the blockchain — this is enforced for coinbase transactions by BIP30 — and output indices within a transaction are unique. For the sake of efficiency, transaction hashes should be compared first before output indices, since output indices from different transactions are often equivalent, while all bytes of the transaction hash are effectively random variables. -Previous transaction hashes (in their little-endian, byte-array form) are to be sorted in descending order, lexicographically. +Previous transaction hashes (in reversed byte-order) are to be sorted in ascending order, lexicographically. In the event of two matching transaction hashes, the respective previous output indices will be compared by their integer value, in ascending order. If the previous output indices match, the inputs are considered equal. @@ -96,7 +96,7 @@ A transaction output is defined by its scriptPubKey and amount. [3] For the sake of efficiency, amounts should be compared first for sorting, since they contain fewer bytes of information (8 bytes) compared to a standard P2PKH scriptPubKey (25 bytes). [4] Transaction output amounts (as 64-bit unsigned integers) are to be sorted in ascending order. -In the event of two matching output amounts, the respective output scriptPubKeys (in their little-endian, byte-array form) will be compared lexicographically, in ascending order. +In the event of two matching output amounts, the respective output scriptPubKeys (as a byte-array) will be compared lexicographically, in ascending order. If the scriptPubKeys match, the outputs are considered equal. ===Examples=== |