|
|
|
@ -92,24 +92,24 @@ class InvalidTxRequestTest(BitcoinTestFramework):
|
|
|
|
|
SCRIPT_PUB_KEY_OP_TRUE = b'\x51\x75' * 15 + b'\x51'
|
|
|
|
|
tx_withhold = CTransaction()
|
|
|
|
|
tx_withhold.vin.append(CTxIn(outpoint=COutPoint(block1.vtx[0].sha256, 0)))
|
|
|
|
|
tx_withhold.vout.append(CTxOut(nValue=50 * COIN - 12000, scriptPubKey=SCRIPT_PUB_KEY_OP_TRUE))
|
|
|
|
|
tx_withhold.vout = [CTxOut(nValue=25 * COIN - 12000, scriptPubKey=SCRIPT_PUB_KEY_OP_TRUE)] * 2
|
|
|
|
|
tx_withhold.calc_sha256()
|
|
|
|
|
|
|
|
|
|
# Our first orphan tx with some outputs to create further orphan txs
|
|
|
|
|
tx_orphan_1 = CTransaction()
|
|
|
|
|
tx_orphan_1.vin.append(CTxIn(outpoint=COutPoint(tx_withhold.sha256, 0)))
|
|
|
|
|
tx_orphan_1.vout = [CTxOut(nValue=10 * COIN, scriptPubKey=SCRIPT_PUB_KEY_OP_TRUE)] * 3
|
|
|
|
|
tx_orphan_1.vout = [CTxOut(nValue=8 * COIN, scriptPubKey=SCRIPT_PUB_KEY_OP_TRUE)] * 3
|
|
|
|
|
tx_orphan_1.calc_sha256()
|
|
|
|
|
|
|
|
|
|
# A valid transaction with low fee
|
|
|
|
|
tx_orphan_2_no_fee = CTransaction()
|
|
|
|
|
tx_orphan_2_no_fee.vin.append(CTxIn(outpoint=COutPoint(tx_orphan_1.sha256, 0)))
|
|
|
|
|
tx_orphan_2_no_fee.vout.append(CTxOut(nValue=10 * COIN, scriptPubKey=SCRIPT_PUB_KEY_OP_TRUE))
|
|
|
|
|
tx_orphan_2_no_fee.vout.append(CTxOut(nValue=8 * COIN, scriptPubKey=SCRIPT_PUB_KEY_OP_TRUE))
|
|
|
|
|
|
|
|
|
|
# A valid transaction with sufficient fee
|
|
|
|
|
tx_orphan_2_valid = CTransaction()
|
|
|
|
|
tx_orphan_2_valid.vin.append(CTxIn(outpoint=COutPoint(tx_orphan_1.sha256, 1)))
|
|
|
|
|
tx_orphan_2_valid.vout.append(CTxOut(nValue=10 * COIN - 12000, scriptPubKey=SCRIPT_PUB_KEY_OP_TRUE))
|
|
|
|
|
tx_orphan_2_valid.vout.append(CTxOut(nValue=8 * COIN - 12000, scriptPubKey=SCRIPT_PUB_KEY_OP_TRUE))
|
|
|
|
|
tx_orphan_2_valid.calc_sha256()
|
|
|
|
|
|
|
|
|
|
# An invalid transaction with negative fee
|
|
|
|
@ -168,6 +168,31 @@ class InvalidTxRequestTest(BitcoinTestFramework):
|
|
|
|
|
with node.assert_debug_log(['Erased 100 orphan tx from peer=25']):
|
|
|
|
|
self.reconnect_p2p(num_connections=1)
|
|
|
|
|
|
|
|
|
|
self.log.info('Test that a transaction in the orphan pool is included in a new tip block causes erase this transaction from the orphan pool')
|
|
|
|
|
tx_withhold_until_block_A = CTransaction()
|
|
|
|
|
tx_withhold_until_block_A.vin.append(CTxIn(outpoint=COutPoint(tx_withhold.sha256, 1)))
|
|
|
|
|
tx_withhold_until_block_A.vout = [CTxOut(nValue=12 * COIN, scriptPubKey=SCRIPT_PUB_KEY_OP_TRUE)] * 2
|
|
|
|
|
tx_withhold_until_block_A.calc_sha256()
|
|
|
|
|
|
|
|
|
|
tx_orphan_include_by_block_A = CTransaction()
|
|
|
|
|
tx_orphan_include_by_block_A.vin.append(CTxIn(outpoint=COutPoint(tx_withhold_until_block_A.sha256, 0)))
|
|
|
|
|
tx_orphan_include_by_block_A.vout.append(CTxOut(nValue=12 * COIN - 12000, scriptPubKey=SCRIPT_PUB_KEY_OP_TRUE))
|
|
|
|
|
tx_orphan_include_by_block_A.calc_sha256()
|
|
|
|
|
|
|
|
|
|
self.log.info('Send the orphan ... ')
|
|
|
|
|
node.p2ps[0].send_txs_and_test([tx_orphan_include_by_block_A], node, success=False)
|
|
|
|
|
|
|
|
|
|
tip = int(node.getbestblockhash(), 16)
|
|
|
|
|
height = node.getblockcount() + 1
|
|
|
|
|
block_A = create_block(tip, create_coinbase(height))
|
|
|
|
|
block_A.vtx.extend([tx_withhold, tx_withhold_until_block_A, tx_orphan_include_by_block_A])
|
|
|
|
|
block_A.hashMerkleRoot = block_A.calc_merkle_root()
|
|
|
|
|
block_A.solve()
|
|
|
|
|
|
|
|
|
|
self.log.info('Send the block that includes the previous orphan ... ')
|
|
|
|
|
with node.assert_debug_log(["Erased 1 orphan tx included or conflicted by block"]):
|
|
|
|
|
node.p2ps[0].send_blocks_and_test([block_A], node, success=True)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if __name__ == '__main__':
|
|
|
|
|
InvalidTxRequestTest().main()
|
|
|
|
|