File tree Expand file tree Collapse file tree 1 file changed +5
-5
lines changed Expand file tree Collapse file tree 1 file changed +5
-5
lines changed Original file line number Diff line number Diff line change 29
29
* - VARINT(nHeight)
30
30
*
31
31
* The nCode value consists of:
32
- * - bit 1 : IsCoinBase()
33
- * - bit 2 : vout[0] is not spent
34
- * - bit 4 : vout[1] is not spent
32
+ * - bit 0 : IsCoinBase()
33
+ * - bit 1 : vout[0] is not spent
34
+ * - bit 2 : vout[1] is not spent
35
35
* - The higher bits encode N, the number of non-zero bytes in the following bitvector.
36
- * - In case both bit 2 and bit 4 are unset, they encode N-1, as there must be at
36
+ * - In case both bit 1 and bit 2 are unset, they encode N-1, as there must be at
37
37
* least one non-spent output).
38
38
*
39
39
* Example: 0104835800816115944e077fe7c803cfa57f29b36bf87c1d358bb85e
58
58
*
59
59
* - version = 1
60
60
* - code = 9 (coinbase, neither vout[0] or vout[1] are unspent,
61
- * 2 (1, +1 because both bit 2 and bit 4 are unset) non-zero bitvector bytes follow)
61
+ * 2 (1, +1 because both bit 1 and bit 2 are unset) non-zero bitvector bytes follow)
62
62
* - unspentness bitvector: bits 2 (0x04) and 14 (0x4000) are set, so vout[2+2] and vout[14+2] are unspent
63
63
* - vout[4]: 86ef97d5790061b01caab50f1b8e9c50a5057eb43c2d9563a4ee
64
64
* * 86ef97d579: compact amount representation for 234925952 (2.35 BTC)
You can’t perform that action at this time.
0 commit comments