mirror of https://github.com/bitcoin/bitcoin
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
436 lines
23 KiB
436 lines
23 KiB
#!/usr/bin/env python3
|
|
# Copyright (c) 2021 The Bitcoin Core developers
|
|
# Distributed under the MIT software license, see the accompanying
|
|
# file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
"""RPCs that handle raw transaction packages."""
|
|
|
|
from decimal import Decimal
|
|
import random
|
|
|
|
from test_framework.address import ADDRESS_BCRT1_P2WSH_OP_TRUE
|
|
from test_framework.test_framework import BitcoinTestFramework
|
|
from test_framework.messages import (
|
|
MAX_BIP125_RBF_SEQUENCE,
|
|
COIN,
|
|
CTxInWitness,
|
|
tx_from_hex,
|
|
)
|
|
from test_framework.p2p import P2PTxInvStore
|
|
from test_framework.script import (
|
|
CScript,
|
|
OP_TRUE,
|
|
)
|
|
from test_framework.util import (
|
|
assert_equal,
|
|
assert_fee_amount,
|
|
assert_raises_rpc_error,
|
|
)
|
|
from test_framework.wallet import (
|
|
create_child_with_parents,
|
|
create_raw_chain,
|
|
DEFAULT_FEE,
|
|
make_chain,
|
|
)
|
|
|
|
class RPCPackagesTest(BitcoinTestFramework):
|
|
def set_test_params(self):
|
|
self.num_nodes = 1
|
|
self.setup_clean_chain = True
|
|
|
|
def assert_testres_equal(self, package_hex, testres_expected):
|
|
"""Shuffle package_hex and assert that the testmempoolaccept result matches testres_expected. This should only
|
|
be used to test packages where the order does not matter. The ordering of transactions in package_hex and
|
|
testres_expected must match.
|
|
"""
|
|
shuffled_indeces = list(range(len(package_hex)))
|
|
random.shuffle(shuffled_indeces)
|
|
shuffled_package = [package_hex[i] for i in shuffled_indeces]
|
|
shuffled_testres = [testres_expected[i] for i in shuffled_indeces]
|
|
assert_equal(shuffled_testres, self.nodes[0].testmempoolaccept(shuffled_package))
|
|
|
|
def run_test(self):
|
|
self.log.info("Generate blocks to create UTXOs")
|
|
node = self.nodes[0]
|
|
self.privkeys = [node.get_deterministic_priv_key().key]
|
|
self.address = node.get_deterministic_priv_key().address
|
|
self.coins = []
|
|
# The last 100 coinbase transactions are premature
|
|
for b in self.generatetoaddress(node, 220, self.address)[:-100]:
|
|
coinbase = node.getblock(blockhash=b, verbosity=2)["tx"][0]
|
|
self.coins.append({
|
|
"txid": coinbase["txid"],
|
|
"amount": coinbase["vout"][0]["value"],
|
|
"scriptPubKey": coinbase["vout"][0]["scriptPubKey"],
|
|
})
|
|
|
|
# Create some transactions that can be reused throughout the test. Never submit these to mempool.
|
|
self.independent_txns_hex = []
|
|
self.independent_txns_testres = []
|
|
for _ in range(3):
|
|
coin = self.coins.pop()
|
|
rawtx = node.createrawtransaction([{"txid": coin["txid"], "vout": 0}],
|
|
{self.address : coin["amount"] - Decimal("0.0001")})
|
|
signedtx = node.signrawtransactionwithkey(hexstring=rawtx, privkeys=self.privkeys)
|
|
assert signedtx["complete"]
|
|
testres = node.testmempoolaccept([signedtx["hex"]])
|
|
assert testres[0]["allowed"]
|
|
self.independent_txns_hex.append(signedtx["hex"])
|
|
# testmempoolaccept returns a list of length one, avoid creating a 2D list
|
|
self.independent_txns_testres.append(testres[0])
|
|
self.independent_txns_testres_blank = [{
|
|
"txid": res["txid"], "wtxid": res["wtxid"]} for res in self.independent_txns_testres]
|
|
|
|
self.test_independent()
|
|
self.test_chain()
|
|
self.test_multiple_children()
|
|
self.test_multiple_parents()
|
|
self.test_conflicting()
|
|
self.test_rbf()
|
|
self.test_submitpackage()
|
|
|
|
def test_independent(self):
|
|
self.log.info("Test multiple independent transactions in a package")
|
|
node = self.nodes[0]
|
|
# For independent transactions, order doesn't matter.
|
|
self.assert_testres_equal(self.independent_txns_hex, self.independent_txns_testres)
|
|
|
|
self.log.info("Test an otherwise valid package with an extra garbage tx appended")
|
|
garbage_tx = node.createrawtransaction([{"txid": "00" * 32, "vout": 5}], {self.address: 1})
|
|
tx = tx_from_hex(garbage_tx)
|
|
# Only the txid and wtxids are returned because validation is incomplete for the independent txns.
|
|
# Package validation is atomic: if the node cannot find a UTXO for any single tx in the package,
|
|
# it terminates immediately to avoid unnecessary, expensive signature verification.
|
|
package_bad = self.independent_txns_hex + [garbage_tx]
|
|
testres_bad = self.independent_txns_testres_blank + [{"txid": tx.rehash(), "wtxid": tx.getwtxid(), "allowed": False, "reject-reason": "missing-inputs"}]
|
|
self.assert_testres_equal(package_bad, testres_bad)
|
|
|
|
self.log.info("Check testmempoolaccept tells us when some transactions completed validation successfully")
|
|
coin = self.coins.pop()
|
|
tx_bad_sig_hex = node.createrawtransaction([{"txid": coin["txid"], "vout": 0}],
|
|
{self.address : coin["amount"] - Decimal("0.0001")})
|
|
tx_bad_sig = tx_from_hex(tx_bad_sig_hex)
|
|
testres_bad_sig = node.testmempoolaccept(self.independent_txns_hex + [tx_bad_sig_hex])
|
|
# By the time the signature for the last transaction is checked, all the other transactions
|
|
# have been fully validated, which is why the node returns full validation results for all
|
|
# transactions here but empty results in other cases.
|
|
assert_equal(testres_bad_sig, self.independent_txns_testres + [{
|
|
"txid": tx_bad_sig.rehash(),
|
|
"wtxid": tx_bad_sig.getwtxid(), "allowed": False,
|
|
"reject-reason": "mandatory-script-verify-flag-failed (Operation not valid with the current stack size)"
|
|
}])
|
|
|
|
self.log.info("Check testmempoolaccept reports txns in packages that exceed max feerate")
|
|
coin = self.coins.pop()
|
|
tx_high_fee_raw = node.createrawtransaction([{"txid": coin["txid"], "vout": 0}],
|
|
{self.address : coin["amount"] - Decimal("0.999")})
|
|
tx_high_fee_signed = node.signrawtransactionwithkey(hexstring=tx_high_fee_raw, privkeys=self.privkeys)
|
|
assert tx_high_fee_signed["complete"]
|
|
tx_high_fee = tx_from_hex(tx_high_fee_signed["hex"])
|
|
testres_high_fee = node.testmempoolaccept([tx_high_fee_signed["hex"]])
|
|
assert_equal(testres_high_fee, [
|
|
{"txid": tx_high_fee.rehash(), "wtxid": tx_high_fee.getwtxid(), "allowed": False, "reject-reason": "max-fee-exceeded"}
|
|
])
|
|
package_high_fee = [tx_high_fee_signed["hex"]] + self.independent_txns_hex
|
|
testres_package_high_fee = node.testmempoolaccept(package_high_fee)
|
|
assert_equal(testres_package_high_fee, testres_high_fee + self.independent_txns_testres_blank)
|
|
|
|
def test_chain(self):
|
|
node = self.nodes[0]
|
|
(chain_hex, chain_txns) = create_raw_chain(node, self.coins.pop(), self.address, self.privkeys)
|
|
self.log.info("Check that testmempoolaccept requires packages to be sorted by dependency")
|
|
assert_equal(node.testmempoolaccept(rawtxs=chain_hex[::-1]),
|
|
[{"txid": tx.rehash(), "wtxid": tx.getwtxid(), "package-error": "package-not-sorted"} for tx in chain_txns[::-1]])
|
|
|
|
self.log.info("Testmempoolaccept a chain of 25 transactions")
|
|
testres_multiple = node.testmempoolaccept(rawtxs=chain_hex)
|
|
|
|
testres_single = []
|
|
# Test accept and then submit each one individually, which should be identical to package test accept
|
|
for rawtx in chain_hex:
|
|
testres = node.testmempoolaccept([rawtx])
|
|
testres_single.append(testres[0])
|
|
# Submit the transaction now so its child should have no problem validating
|
|
node.sendrawtransaction(rawtx)
|
|
assert_equal(testres_single, testres_multiple)
|
|
|
|
# Clean up by clearing the mempool
|
|
self.generate(node, 1)
|
|
|
|
def test_multiple_children(self):
|
|
node = self.nodes[0]
|
|
|
|
self.log.info("Testmempoolaccept a package in which a transaction has two children within the package")
|
|
first_coin = self.coins.pop()
|
|
value = (first_coin["amount"] - Decimal("0.0002")) / 2 # Deduct reasonable fee and make 2 outputs
|
|
inputs = [{"txid": first_coin["txid"], "vout": 0}]
|
|
outputs = [{self.address : value}, {ADDRESS_BCRT1_P2WSH_OP_TRUE : value}]
|
|
rawtx = node.createrawtransaction(inputs, outputs)
|
|
|
|
parent_signed = node.signrawtransactionwithkey(hexstring=rawtx, privkeys=self.privkeys)
|
|
assert parent_signed["complete"]
|
|
parent_tx = tx_from_hex(parent_signed["hex"])
|
|
parent_txid = parent_tx.rehash()
|
|
assert node.testmempoolaccept([parent_signed["hex"]])[0]["allowed"]
|
|
|
|
parent_locking_script_a = parent_tx.vout[0].scriptPubKey.hex()
|
|
child_value = value - Decimal("0.0001")
|
|
|
|
# Child A
|
|
(_, tx_child_a_hex, _, _) = make_chain(node, self.address, self.privkeys, parent_txid, child_value, 0, parent_locking_script_a)
|
|
assert not node.testmempoolaccept([tx_child_a_hex])[0]["allowed"]
|
|
|
|
# Child B
|
|
rawtx_b = node.createrawtransaction([{"txid": parent_txid, "vout": 1}], {self.address : child_value})
|
|
tx_child_b = tx_from_hex(rawtx_b)
|
|
tx_child_b.wit.vtxinwit = [CTxInWitness()]
|
|
tx_child_b.wit.vtxinwit[0].scriptWitness.stack = [CScript([OP_TRUE])]
|
|
tx_child_b_hex = tx_child_b.serialize().hex()
|
|
assert not node.testmempoolaccept([tx_child_b_hex])[0]["allowed"]
|
|
|
|
self.log.info("Testmempoolaccept with entire package, should work with children in either order")
|
|
testres_multiple_ab = node.testmempoolaccept(rawtxs=[parent_signed["hex"], tx_child_a_hex, tx_child_b_hex])
|
|
testres_multiple_ba = node.testmempoolaccept(rawtxs=[parent_signed["hex"], tx_child_b_hex, tx_child_a_hex])
|
|
assert all([testres["allowed"] for testres in testres_multiple_ab + testres_multiple_ba])
|
|
|
|
testres_single = []
|
|
# Test accept and then submit each one individually, which should be identical to package testaccept
|
|
for rawtx in [parent_signed["hex"], tx_child_a_hex, tx_child_b_hex]:
|
|
testres = node.testmempoolaccept([rawtx])
|
|
testres_single.append(testres[0])
|
|
# Submit the transaction now so its child should have no problem validating
|
|
node.sendrawtransaction(rawtx)
|
|
assert_equal(testres_single, testres_multiple_ab)
|
|
|
|
|
|
def test_multiple_parents(self):
|
|
node = self.nodes[0]
|
|
|
|
self.log.info("Testmempoolaccept a package in which a transaction has multiple parents within the package")
|
|
for num_parents in [2, 10, 24]:
|
|
# Test a package with num_parents parents and 1 child transaction.
|
|
package_hex = []
|
|
parents_tx = []
|
|
values = []
|
|
parent_locking_scripts = []
|
|
for _ in range(num_parents):
|
|
parent_coin = self.coins.pop()
|
|
value = parent_coin["amount"]
|
|
(tx, txhex, value, parent_locking_script) = make_chain(node, self.address, self.privkeys, parent_coin["txid"], value)
|
|
package_hex.append(txhex)
|
|
parents_tx.append(tx)
|
|
values.append(value)
|
|
parent_locking_scripts.append(parent_locking_script)
|
|
child_hex = create_child_with_parents(node, self.address, self.privkeys, parents_tx, values, parent_locking_scripts)
|
|
# Package accept should work with the parents in any order (as long as parents come before child)
|
|
for _ in range(10):
|
|
random.shuffle(package_hex)
|
|
testres_multiple = node.testmempoolaccept(rawtxs=package_hex + [child_hex])
|
|
assert all([testres["allowed"] for testres in testres_multiple])
|
|
|
|
testres_single = []
|
|
# Test accept and then submit each one individually, which should be identical to package testaccept
|
|
for rawtx in package_hex + [child_hex]:
|
|
testres_single.append(node.testmempoolaccept([rawtx])[0])
|
|
# Submit the transaction now so its child should have no problem validating
|
|
node.sendrawtransaction(rawtx)
|
|
assert_equal(testres_single, testres_multiple)
|
|
|
|
def test_conflicting(self):
|
|
node = self.nodes[0]
|
|
prevtx = self.coins.pop()
|
|
inputs = [{"txid": prevtx["txid"], "vout": 0}]
|
|
output1 = {node.get_deterministic_priv_key().address: 50 - 0.00125}
|
|
output2 = {ADDRESS_BCRT1_P2WSH_OP_TRUE: 50 - 0.00125}
|
|
|
|
# tx1 and tx2 share the same inputs
|
|
rawtx1 = node.createrawtransaction(inputs, output1)
|
|
rawtx2 = node.createrawtransaction(inputs, output2)
|
|
signedtx1 = node.signrawtransactionwithkey(hexstring=rawtx1, privkeys=self.privkeys)
|
|
signedtx2 = node.signrawtransactionwithkey(hexstring=rawtx2, privkeys=self.privkeys)
|
|
tx1 = tx_from_hex(signedtx1["hex"])
|
|
tx2 = tx_from_hex(signedtx2["hex"])
|
|
assert signedtx1["complete"]
|
|
assert signedtx2["complete"]
|
|
|
|
# Ensure tx1 and tx2 are valid by themselves
|
|
assert node.testmempoolaccept([signedtx1["hex"]])[0]["allowed"]
|
|
assert node.testmempoolaccept([signedtx2["hex"]])[0]["allowed"]
|
|
|
|
self.log.info("Test duplicate transactions in the same package")
|
|
testres = node.testmempoolaccept([signedtx1["hex"], signedtx1["hex"]])
|
|
assert_equal(testres, [
|
|
{"txid": tx1.rehash(), "wtxid": tx1.getwtxid(), "package-error": "conflict-in-package"},
|
|
{"txid": tx1.rehash(), "wtxid": tx1.getwtxid(), "package-error": "conflict-in-package"}
|
|
])
|
|
|
|
self.log.info("Test conflicting transactions in the same package")
|
|
testres = node.testmempoolaccept([signedtx1["hex"], signedtx2["hex"]])
|
|
assert_equal(testres, [
|
|
{"txid": tx1.rehash(), "wtxid": tx1.getwtxid(), "package-error": "conflict-in-package"},
|
|
{"txid": tx2.rehash(), "wtxid": tx2.getwtxid(), "package-error": "conflict-in-package"}
|
|
])
|
|
|
|
def test_rbf(self):
|
|
node = self.nodes[0]
|
|
coin = self.coins.pop()
|
|
inputs = [{"txid": coin["txid"], "vout": 0, "sequence": MAX_BIP125_RBF_SEQUENCE}]
|
|
fee = Decimal('0.00125000')
|
|
output = {node.get_deterministic_priv_key().address: 50 - fee}
|
|
raw_replaceable_tx = node.createrawtransaction(inputs, output)
|
|
signed_replaceable_tx = node.signrawtransactionwithkey(hexstring=raw_replaceable_tx, privkeys=self.privkeys)
|
|
testres_replaceable = node.testmempoolaccept([signed_replaceable_tx["hex"]])
|
|
replaceable_tx = tx_from_hex(signed_replaceable_tx["hex"])
|
|
assert_equal(testres_replaceable, [
|
|
{"txid": replaceable_tx.rehash(), "wtxid": replaceable_tx.getwtxid(),
|
|
"allowed": True, "vsize": replaceable_tx.get_vsize(), "fees": { "base": fee }}
|
|
])
|
|
|
|
# Replacement transaction is identical except has double the fee
|
|
replacement_tx = tx_from_hex(signed_replaceable_tx["hex"])
|
|
replacement_tx.vout[0].nValue -= int(fee * COIN) # Doubled fee
|
|
signed_replacement_tx = node.signrawtransactionwithkey(replacement_tx.serialize().hex(), self.privkeys)
|
|
replacement_tx = tx_from_hex(signed_replacement_tx["hex"])
|
|
|
|
self.log.info("Test that transactions within a package cannot replace each other")
|
|
testres_rbf_conflicting = node.testmempoolaccept([signed_replaceable_tx["hex"], signed_replacement_tx["hex"]])
|
|
assert_equal(testres_rbf_conflicting, [
|
|
{"txid": replaceable_tx.rehash(), "wtxid": replaceable_tx.getwtxid(), "package-error": "conflict-in-package"},
|
|
{"txid": replacement_tx.rehash(), "wtxid": replacement_tx.getwtxid(), "package-error": "conflict-in-package"}
|
|
])
|
|
|
|
self.log.info("Test that packages cannot conflict with mempool transactions, even if a valid BIP125 RBF")
|
|
node.sendrawtransaction(signed_replaceable_tx["hex"])
|
|
testres_rbf_single = node.testmempoolaccept([signed_replacement_tx["hex"]])
|
|
# This transaction is a valid BIP125 replace-by-fee
|
|
assert testres_rbf_single[0]["allowed"]
|
|
testres_rbf_package = self.independent_txns_testres_blank + [{
|
|
"txid": replacement_tx.rehash(), "wtxid": replacement_tx.getwtxid(), "allowed": False,
|
|
"reject-reason": "bip125-replacement-disallowed"
|
|
}]
|
|
self.assert_testres_equal(self.independent_txns_hex + [signed_replacement_tx["hex"]], testres_rbf_package)
|
|
|
|
def assert_equal_package_results(self, node, testmempoolaccept_result, submitpackage_result):
|
|
"""Assert that a successful submitpackage result is consistent with testmempoolaccept
|
|
results and getmempoolentry info. Note that the result structs are different and, due to
|
|
policy differences between testmempoolaccept and submitpackage (i.e. package feerate),
|
|
some information may be different.
|
|
"""
|
|
for testres_tx in testmempoolaccept_result:
|
|
# Grab this result from the submitpackage_result
|
|
submitres_tx = submitpackage_result["tx-results"][testres_tx["wtxid"]]
|
|
assert_equal(submitres_tx["txid"], testres_tx["txid"])
|
|
# No "allowed" if the tx was already in the mempool
|
|
if "allowed" in testres_tx and testres_tx["allowed"]:
|
|
assert_equal(submitres_tx["vsize"], testres_tx["vsize"])
|
|
assert_equal(submitres_tx["fees"]["base"], testres_tx["fees"]["base"])
|
|
entry_info = node.getmempoolentry(submitres_tx["txid"])
|
|
assert_equal(submitres_tx["vsize"], entry_info["vsize"])
|
|
assert_equal(submitres_tx["fees"]["base"], entry_info["fees"]["base"])
|
|
|
|
def test_submit_child_with_parents(self, num_parents, partial_submit):
|
|
node = self.nodes[0]
|
|
peer = node.add_p2p_connection(P2PTxInvStore())
|
|
# Test a package with num_parents parents and 1 child transaction.
|
|
package_hex = []
|
|
package_txns = []
|
|
values = []
|
|
scripts = []
|
|
for _ in range(num_parents):
|
|
parent_coin = self.coins.pop()
|
|
value = parent_coin["amount"]
|
|
(tx, txhex, value, spk) = make_chain(node, self.address, self.privkeys, parent_coin["txid"], value)
|
|
package_hex.append(txhex)
|
|
package_txns.append(tx)
|
|
values.append(value)
|
|
scripts.append(spk)
|
|
if partial_submit and random.choice([True, False]):
|
|
node.sendrawtransaction(txhex)
|
|
child_hex = create_child_with_parents(node, self.address, self.privkeys, package_txns, values, scripts)
|
|
package_hex.append(child_hex)
|
|
package_txns.append(tx_from_hex(child_hex))
|
|
|
|
testmempoolaccept_result = node.testmempoolaccept(rawtxs=package_hex)
|
|
submitpackage_result = node.submitpackage(package=package_hex)
|
|
|
|
# Check that each result is present, with the correct size and fees
|
|
for i in range(num_parents + 1):
|
|
tx = package_txns[i]
|
|
wtxid = tx.getwtxid()
|
|
assert wtxid in submitpackage_result["tx-results"]
|
|
tx_result = submitpackage_result["tx-results"][wtxid]
|
|
assert_equal(tx_result, {
|
|
"txid": tx.rehash(),
|
|
"vsize": tx.get_vsize(),
|
|
"fees": {
|
|
"base": DEFAULT_FEE,
|
|
}
|
|
})
|
|
|
|
# submitpackage result should be consistent with testmempoolaccept and getmempoolentry
|
|
self.assert_equal_package_results(node, testmempoolaccept_result, submitpackage_result)
|
|
|
|
# Package feerate is calculated for the remaining transactions after deduplication and
|
|
# individual submission. If only 0 or 1 transaction is left, e.g. because all transactions
|
|
# had high-feerates or were already in the mempool, no package feerate is provided.
|
|
# In this case, since all of the parents have high fees, each is accepted individually.
|
|
assert "package-feerate" not in submitpackage_result
|
|
|
|
# The node should announce each transaction. No guarantees for propagation.
|
|
peer.wait_for_broadcast([tx.getwtxid() for tx in package_txns])
|
|
self.generate(node, 1)
|
|
|
|
|
|
def test_submit_cpfp(self):
|
|
node = self.nodes[0]
|
|
peer = node.add_p2p_connection(P2PTxInvStore())
|
|
|
|
# 2 parent 1 child CPFP. First parent pays high fees, second parent pays 0 fees and is
|
|
# fee-bumped by the child.
|
|
coin_rich = self.coins.pop()
|
|
coin_poor = self.coins.pop()
|
|
tx_rich, hex_rich, value_rich, spk_rich = make_chain(node, self.address, self.privkeys, coin_rich["txid"], coin_rich["amount"])
|
|
tx_poor, hex_poor, value_poor, spk_poor = make_chain(node, self.address, self.privkeys, coin_poor["txid"], coin_poor["amount"], fee=0)
|
|
package_txns = [tx_rich, tx_poor]
|
|
hex_child = create_child_with_parents(node, self.address, self.privkeys, package_txns, [value_rich, value_poor], [spk_rich, spk_poor])
|
|
tx_child = tx_from_hex(hex_child)
|
|
package_txns.append(tx_child)
|
|
|
|
submitpackage_result = node.submitpackage([hex_rich, hex_poor, hex_child])
|
|
|
|
rich_parent_result = submitpackage_result["tx-results"][tx_rich.getwtxid()]
|
|
poor_parent_result = submitpackage_result["tx-results"][tx_poor.getwtxid()]
|
|
child_result = submitpackage_result["tx-results"][tx_child.getwtxid()]
|
|
assert_equal(rich_parent_result["fees"]["base"], DEFAULT_FEE)
|
|
assert_equal(poor_parent_result["fees"]["base"], 0)
|
|
assert_equal(child_result["fees"]["base"], DEFAULT_FEE)
|
|
# Package feerate is calculated for the remaining transactions after deduplication and
|
|
# individual submission. Since this package had a 0-fee parent, package feerate must have
|
|
# been used and returned.
|
|
assert "package-feerate" in submitpackage_result
|
|
assert_fee_amount(DEFAULT_FEE, rich_parent_result["vsize"] + child_result["vsize"], submitpackage_result["package-feerate"])
|
|
|
|
# The node will broadcast each transaction, still abiding by its peer's fee filter
|
|
peer.wait_for_broadcast([tx.getwtxid() for tx in package_txns])
|
|
self.generate(node, 1)
|
|
|
|
|
|
def test_submitpackage(self):
|
|
node = self.nodes[0]
|
|
|
|
self.log.info("Submitpackage valid packages with 1 child and some number of parents")
|
|
for num_parents in [1, 2, 24]:
|
|
self.test_submit_child_with_parents(num_parents, False)
|
|
self.test_submit_child_with_parents(num_parents, True)
|
|
|
|
self.log.info("Submitpackage valid packages with CPFP")
|
|
self.test_submit_cpfp()
|
|
|
|
self.log.info("Submitpackage only allows packages of 1 child with its parents")
|
|
# Chain of 3 transactions has too many generations
|
|
chain_hex, _ = create_raw_chain(node, self.coins.pop(), self.address, self.privkeys, 3)
|
|
assert_raises_rpc_error(-25, "not-child-with-parents", node.submitpackage, chain_hex)
|
|
|
|
|
|
if __name__ == "__main__":
|
|
RPCPackagesTest().main()
|