highperfocused/bips
1
0
Fork 0
mirror of https://github.com/bitcoin/bips.git synced 2025-04-06 19:20:52 +02:00
Code Issues Packages Projects Releases Wiki Activity

human-readable string representation is big-endian

Browse Source
This commit is contained in:
Daniel Cousens 2015-08-21 08:47:06 +10:00
parent d9acdcb6b1
commit 66cb8346fe
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
bip-0069.mediawiki
View File

@ -92,7 +92,7 @@ N.B. These comparisons do not need to operate in constant time since they are no
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.
Hashes of previous transactions are considered for the purposes of this BIP in their little-endian, byte array format in order to match the traditional, human-readable string representation of the hashes.
Previous transaction hashes are considered for the purposes of this BIP in their big-endian, byte array format in order to match the human-readable string representation of the hashes.
They must be sorted in accordance with the output of the bytearr_cmp() function above: the hash with the earliest lesser byte is ordered first, and shorter hashes are ordered before longer ones as a tie-breaker.
In the event of two matching transaction hashes, output indices will be compared based on their integer value, with the smaller value ordered first.
A further tie is extremely improbable for the aforementioned reasons.