summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorDaniel Cousens <github@dcousens.com>2015-08-21 08:51:18 +1000
committerDaniel Cousens <github@dcousens.com>2015-08-21 09:10:00 +1000
commit342058602eb7737ceeb098d07eb9237d5e5fc65a (patch)
treef960c043207def5b8f188c291a03397e4c14fa99
parent8d2a159496b8b1518a66abb29a28a68e70e0209c (diff)
downloadbips-342058602eb7737ceeb098d07eb9237d5e5fc65a.tar.xz
remove probability, specify behaviour for matching prevOut indices
-rw-r--r--bip-0069.mediawiki4
1 files changed, 2 insertions, 2 deletions
diff --git a/bip-0069.mediawiki b/bip-0069.mediawiki
index 85e3fdd..43d25ee 100644
--- a/bip-0069.mediawiki
+++ b/bip-0069.mediawiki
@@ -93,8 +93,8 @@ For sorting inputs, the hash of the previous transaction and the output index wi
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.
-In the event of two matching transaction hashes, the respective output indices will be compared by their integer value, in ascending order.
-A further tie is extremely improbable for the aforementioned reasons.
+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.
Because the hash of previous transactions and output indices must be included in a signed transaction, wallet clients capable of signing transactions will necessarily have access to this data.