07dcddb4ca
* Merge #9815: Trivial: use EXIT_ codes instead of magic numbers a87d02a use EXIT_ codes instead of magic numbers (Marko Bencun) * Merge #9801: Removed redundant parameter from mempool.PrioritiseTransaction eaea2bb Removed redundant parameter from mempool.PrioritiseTransaction (gubatron) * remove extra parameter (see 3a3745bb) in dash specific code * Merge #9819: Remove harmless read of unusued priority estimates bc8fd12 Remove harmless read of unusued priority estimates (Alex Morcos) * Merge #9766: Add --exclude option to rpc-tests.py c578408 Add exclude option to rpc-tests.py (John Newbery) * Merge #9577: Fix docstrings in qa tests 3f95a80 Fix docstrings in qa tests (John Newbery) * Merge #9823: qa: Set correct path for binaries in rpc tests 3333ad0 qa: Set correct path for binaries in rpc tests (MarcoFalke) * Merge #9833: Trivial: fix comments referencing AppInit2 ef9f495 Trivial: fix comments referencing AppInit2 (Marko Bencun) * Merge #9612: [trivial] Rephrase the definition of difficulty. dc222f8 Trivial: Rephrase the definition of difficulty in the code. (Karl-Johan Alm) * Merge #9847: Extra test vector for BIP32 30aedcb BIP32 extra test vector (Pieter Wuille) * Merge #9839: [qa] Make import-rescan.py watchonly check reliable 864890a [qa] Make import-rescan.py watchonly check reliable (Russell Yanofsky) Tree-SHA512: ea0e2b1d4fc8f35174c3d575fb751b428daf6ad3aa944fad4e3ddcc9195e4f17051473acabc54203b1d27cca64cf911b737ab92e986c40ef384410652e2dbea1 * Change back file params
63 lines
2.5 KiB
Python
Executable File
63 lines
2.5 KiB
Python
Executable File
#!/usr/bin/env python3
|
|
# Copyright (c) 2014-2016 The Bitcoin Core developers
|
|
# Distributed under the MIT software license, see the accompanying
|
|
# file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
"""Test spending coinbase transactions.
|
|
|
|
The coinbase transaction in block N can appear in block
|
|
N+100... so is valid in the mempool when the best block
|
|
height is N+99.
|
|
This test makes sure coinbase spends that will be mature
|
|
in the next block are accepted into the memory pool,
|
|
but less mature coinbase spends are NOT.
|
|
"""
|
|
|
|
from test_framework.test_framework import BitcoinTestFramework
|
|
from test_framework.util import *
|
|
|
|
# Create one-input, one-output, no-fee transaction:
|
|
class MempoolSpendCoinbaseTest(BitcoinTestFramework):
|
|
|
|
def __init__(self):
|
|
super().__init__()
|
|
self.num_nodes = 1
|
|
self.setup_clean_chain = False
|
|
|
|
def setup_network(self):
|
|
# Just need one node for this test
|
|
args = ["-checkmempool", "-debug=mempool"]
|
|
self.nodes = []
|
|
self.nodes.append(start_node(0, self.options.tmpdir, args))
|
|
self.is_network_split = False
|
|
|
|
def run_test(self):
|
|
chain_height = self.nodes[0].getblockcount()
|
|
assert_equal(chain_height, 200)
|
|
node0_address = self.nodes[0].getnewaddress()
|
|
|
|
# Coinbase at height chain_height-100+1 ok in mempool, should
|
|
# get mined. Coinbase at height chain_height-100+2 is
|
|
# is too immature to spend.
|
|
b = [ self.nodes[0].getblockhash(n) for n in range(101, 103) ]
|
|
coinbase_txids = [ self.nodes[0].getblock(h)['tx'][0] for h in b ]
|
|
spends_raw = [ create_tx(self.nodes[0], txid, node0_address, 500) for txid in coinbase_txids ]
|
|
|
|
spend_101_id = self.nodes[0].sendrawtransaction(spends_raw[0], False, False, True)
|
|
|
|
# coinbase at height 102 should be too immature to spend
|
|
assert_raises(JSONRPCException, self.nodes[0].sendrawtransaction, spends_raw[1], False, False, True)
|
|
|
|
# mempool should have just spend_101:
|
|
assert_equal(self.nodes[0].getrawmempool(), [ spend_101_id ])
|
|
|
|
# mine a block, spend_101 should get confirmed
|
|
self.nodes[0].generate(1)
|
|
assert_equal(set(self.nodes[0].getrawmempool()), set())
|
|
|
|
# ... and now height 102 can be spent:
|
|
spend_102_id = self.nodes[0].sendrawtransaction(spends_raw[1], False, False, True)
|
|
assert_equal(self.nodes[0].getrawmempool(), [ spend_102_id ])
|
|
|
|
if __name__ == '__main__':
|
|
MempoolSpendCoinbaseTest().main()
|