2016-03-19 12:58:06 -07:00
|
|
|
#!/usr/bin/env python3
|
|
|
|
# Copyright (c) 2015-2016 The Bitcoin Core developers
|
2015-11-18 17:55:52 -08:00
|
|
|
# Distributed under the MIT software license, see the accompanying
|
|
|
|
# file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
2017-01-17 15:34:40 -08:00
|
|
|
"""Test the prioritisetransaction mining RPC."""
|
2015-11-18 17:55:52 -08:00
|
|
|
|
|
|
|
from test_framework.test_framework import BitcoinTestFramework
|
|
|
|
from test_framework.util import *
|
2016-11-21 13:29:22 -08:00
|
|
|
from test_framework.mininode import COIN, MAX_BLOCK_BASE_SIZE
|
2015-11-18 17:55:52 -08:00
|
|
|
|
|
|
|
class PrioritiseTransactionTest(BitcoinTestFramework):
|
2017-06-09 15:21:21 -07:00
|
|
|
def set_test_params(self):
|
2016-05-14 04:01:31 -07:00
|
|
|
self.setup_clean_chain = True
|
2017-04-18 09:52:08 -07:00
|
|
|
self.num_nodes = 2
|
|
|
|
self.extra_args = [["-printpriority=1"], ["-printpriority=1"]]
|
2015-11-18 17:55:52 -08:00
|
|
|
|
2017-04-03 06:34:04 -07:00
|
|
|
def run_test(self):
|
2016-05-14 04:01:31 -07:00
|
|
|
self.txouts = gen_return_txouts()
|
2015-11-18 17:55:52 -08:00
|
|
|
self.relayfee = self.nodes[0].getnetworkinfo()['relayfee']
|
|
|
|
|
2016-03-01 06:28:16 -08:00
|
|
|
utxo_count = 90
|
|
|
|
utxos = create_confirmed_utxos(self.relayfee, self.nodes[0], utxo_count)
|
2015-11-18 17:55:52 -08:00
|
|
|
base_fee = self.relayfee*100 # our transactions are smaller than 100kb
|
|
|
|
txids = []
|
|
|
|
|
|
|
|
# Create 3 batches of transactions at 3 different fee rate levels
|
2016-03-01 06:28:16 -08:00
|
|
|
range_size = utxo_count // 3
|
2016-03-19 12:58:06 -07:00
|
|
|
for i in range(3):
|
2015-11-18 17:55:52 -08:00
|
|
|
txids.append([])
|
2016-03-01 06:28:16 -08:00
|
|
|
start_range = i * range_size
|
|
|
|
end_range = start_range + range_size
|
2016-12-04 07:16:11 -08:00
|
|
|
txids[i] = create_lots_of_big_transactions(self.nodes[0], self.txouts, utxos[start_range:end_range], end_range - start_range, (i+1)*base_fee)
|
2016-03-01 06:28:16 -08:00
|
|
|
|
|
|
|
# Make sure that the size of each group of transactions exceeds
|
2016-11-21 13:29:22 -08:00
|
|
|
# MAX_BLOCK_BASE_SIZE -- otherwise the test needs to be revised to create
|
2016-03-01 06:28:16 -08:00
|
|
|
# more transactions.
|
|
|
|
mempool = self.nodes[0].getrawmempool(True)
|
|
|
|
sizes = [0, 0, 0]
|
2016-03-19 12:58:06 -07:00
|
|
|
for i in range(3):
|
2016-03-01 06:28:16 -08:00
|
|
|
for j in txids[i]:
|
|
|
|
assert(j in mempool)
|
|
|
|
sizes[i] += mempool[j]['size']
|
2016-11-21 13:29:22 -08:00
|
|
|
assert(sizes[i] > MAX_BLOCK_BASE_SIZE) # Fail => raise utxo_count
|
2015-11-18 17:55:52 -08:00
|
|
|
|
|
|
|
# add a fee delta to something in the cheapest bucket and make sure it gets mined
|
2017-01-19 19:46:50 -08:00
|
|
|
# also check that a different entry in the cheapest bucket is NOT mined
|
2017-04-21 09:41:01 -07:00
|
|
|
self.nodes[0].prioritisetransaction(txid=txids[0][0], fee_delta=int(3*base_fee*COIN))
|
2015-11-18 17:55:52 -08:00
|
|
|
|
|
|
|
self.nodes[0].generate(1)
|
|
|
|
|
|
|
|
mempool = self.nodes[0].getrawmempool()
|
2017-03-07 15:46:17 -08:00
|
|
|
self.log.info("Assert that prioritised transaction was mined")
|
2015-11-18 17:55:52 -08:00
|
|
|
assert(txids[0][0] not in mempool)
|
|
|
|
assert(txids[0][1] in mempool)
|
|
|
|
|
|
|
|
high_fee_tx = None
|
|
|
|
for x in txids[2]:
|
|
|
|
if x not in mempool:
|
|
|
|
high_fee_tx = x
|
|
|
|
|
|
|
|
# Something high-fee should have been mined!
|
|
|
|
assert(high_fee_tx != None)
|
|
|
|
|
|
|
|
# Add a prioritisation before a tx is in the mempool (de-prioritising a
|
2016-03-01 06:28:16 -08:00
|
|
|
# high-fee transaction so that it's now low fee).
|
2017-04-21 09:41:01 -07:00
|
|
|
self.nodes[0].prioritisetransaction(txid=high_fee_tx, fee_delta=-int(2*base_fee*COIN))
|
2015-11-18 17:55:52 -08:00
|
|
|
|
|
|
|
# Add everything back to mempool
|
|
|
|
self.nodes[0].invalidateblock(self.nodes[0].getbestblockhash())
|
|
|
|
|
|
|
|
# Check to make sure our high fee rate tx is back in the mempool
|
|
|
|
mempool = self.nodes[0].getrawmempool()
|
|
|
|
assert(high_fee_tx in mempool)
|
|
|
|
|
2016-03-01 06:28:16 -08:00
|
|
|
# Now verify the modified-high feerate transaction isn't mined before
|
|
|
|
# the other high fee transactions. Keep mining until our mempool has
|
|
|
|
# decreased by all the high fee size that we calculated above.
|
|
|
|
while (self.nodes[0].getmempoolinfo()['bytes'] > sizes[0] + sizes[1]):
|
|
|
|
self.nodes[0].generate(1)
|
2015-11-18 17:55:52 -08:00
|
|
|
|
|
|
|
# High fee transaction should not have been mined, but other high fee rate
|
|
|
|
# transactions should have been.
|
|
|
|
mempool = self.nodes[0].getrawmempool()
|
2017-03-07 15:46:17 -08:00
|
|
|
self.log.info("Assert that de-prioritised transaction is still in mempool")
|
2015-11-18 17:55:52 -08:00
|
|
|
assert(high_fee_tx in mempool)
|
|
|
|
for x in txids[2]:
|
|
|
|
if (x != high_fee_tx):
|
|
|
|
assert(x not in mempool)
|
|
|
|
|
2017-01-19 19:46:50 -08:00
|
|
|
# Create a free transaction. Should be rejected.
|
2015-12-02 06:37:18 -08:00
|
|
|
utxo_list = self.nodes[0].listunspent()
|
|
|
|
assert(len(utxo_list) > 0)
|
|
|
|
utxo = utxo_list[0]
|
|
|
|
|
|
|
|
inputs = []
|
|
|
|
outputs = {}
|
|
|
|
inputs.append({"txid" : utxo["txid"], "vout" : utxo["vout"]})
|
2017-01-19 19:46:50 -08:00
|
|
|
outputs[self.nodes[0].getnewaddress()] = utxo["amount"]
|
2015-12-02 06:37:18 -08:00
|
|
|
raw_tx = self.nodes[0].createrawtransaction(inputs, outputs)
|
|
|
|
tx_hex = self.nodes[0].signrawtransaction(raw_tx)["hex"]
|
2017-01-19 19:46:50 -08:00
|
|
|
tx_id = self.nodes[0].decoderawtransaction(tx_hex)["txid"]
|
2015-12-02 06:37:18 -08:00
|
|
|
|
2017-03-07 11:08:59 -08:00
|
|
|
# This will raise an exception due to min relay fee not being met
|
|
|
|
assert_raises_jsonrpc(-26, "66: min relay fee not met", self.nodes[0].sendrawtransaction, tx_hex)
|
|
|
|
assert(tx_id not in self.nodes[0].getrawmempool())
|
2015-12-02 06:37:18 -08:00
|
|
|
|
|
|
|
# This is a less than 1000-byte transaction, so just set the fee
|
|
|
|
# to be the minimum for a 1000 byte transaction and check that it is
|
|
|
|
# accepted.
|
2017-04-21 09:41:01 -07:00
|
|
|
self.nodes[0].prioritisetransaction(txid=tx_id, fee_delta=int(self.relayfee*COIN))
|
2015-12-02 06:37:18 -08:00
|
|
|
|
2017-03-07 15:46:17 -08:00
|
|
|
self.log.info("Assert that prioritised free transaction is accepted to mempool")
|
2017-01-19 19:46:50 -08:00
|
|
|
assert_equal(self.nodes[0].sendrawtransaction(tx_hex), tx_id)
|
|
|
|
assert(tx_id in self.nodes[0].getrawmempool())
|
2015-12-02 06:37:18 -08:00
|
|
|
|
2017-04-18 09:52:08 -07:00
|
|
|
# Test that calling prioritisetransaction is sufficient to trigger
|
|
|
|
# getblocktemplate to (eventually) return a new block.
|
|
|
|
mock_time = int(time.time())
|
|
|
|
self.nodes[0].setmocktime(mock_time)
|
|
|
|
template = self.nodes[0].getblocktemplate()
|
2017-04-21 09:41:01 -07:00
|
|
|
self.nodes[0].prioritisetransaction(txid=tx_id, fee_delta=-int(self.relayfee*COIN))
|
2017-04-18 09:52:08 -07:00
|
|
|
self.nodes[0].setmocktime(mock_time+10)
|
|
|
|
new_template = self.nodes[0].getblocktemplate()
|
|
|
|
|
|
|
|
assert(template != new_template)
|
|
|
|
|
2015-11-18 17:55:52 -08:00
|
|
|
if __name__ == '__main__':
|
|
|
|
PrioritiseTransactionTest().main()
|