summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorDaniel Cousens <github@dcousens.com>2015-08-21 09:08:50 +1000
committerDaniel Cousens <github@dcousens.com>2015-08-21 09:10:15 +1000
commit64a44180b87ceb6101f4b62c5dd6c2b4bba33669 (patch)
treee28ea65f7adb10c3765e07962ccd18637c3e3796
parentc60771d2299a08299a7734a697587dde2378d489 (diff)
downloadbips-64a44180b87ceb6101f4b62c5dd6c2b4bba33669.tar.xz
remove random 104
-rw-r--r--bip-0069.mediawiki2
1 files changed, 1 insertions, 1 deletions
diff --git a/bip-0069.mediawiki b/bip-0069.mediawiki
index f3dff42..e4d273c 100644
--- a/bip-0069.mediawiki
+++ b/bip-0069.mediawiki
@@ -88,7 +88,7 @@ N.B. These comparisons do not need to operate in constant time since they are no
===Transaction Inputs===
-104 Transaction inputs are defined by the hash of a previous transaction, the output index of of a UTXO from that previous transaction, the size of an unlocking script, the unlocking script, and a sequence number. [3]
+Transaction inputs are defined by the hash of a previous transaction, the output index of of a UTXO from that previous transaction, the size of an unlocking script, the unlocking script, and a sequence number. [3]
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.