mirror of
https://github.com/dashpay/dash.git
synced 2024-12-27 13:03:17 +01:00
4a3e3af6e7
fa0074e2d82928016a43ca408717154a1c70a4db scripted-diff: Bump copyright headers (MarcoFalke)
Pull request description:
Needs to be done because no one has removed the years yet
ACKs for top commit:
practicalswift:
ACK fa0074e2d82928016a43ca408717154a1c70a4db
Tree-SHA512: 210e92acd7d400b556cf8259c3ec9967797420cfd19f0c2a4fa54cb2b3d32ad9ae27e771269201e7d554c0f4cd73a8b1c1a42c9f65d8685ca4d52e5134b071a3
120 lines
5.7 KiB
Python
Executable File
120 lines
5.7 KiB
Python
Executable File
#!/usr/bin/env python3
|
|
# Copyright (c) 2014-2020 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 the invalidateblock RPC."""
|
|
|
|
from test_framework.test_framework import BitcoinTestFramework
|
|
from test_framework.address import ADDRESS_BCRT1_UNSPENDABLE_DESCRIPTOR
|
|
from test_framework.util import (
|
|
assert_equal,
|
|
assert_raises_rpc_error,
|
|
)
|
|
|
|
|
|
class InvalidateTest(BitcoinTestFramework):
|
|
def set_test_params(self):
|
|
self.setup_clean_chain = True
|
|
self.num_nodes = 3
|
|
|
|
def setup_network(self):
|
|
self.setup_nodes()
|
|
|
|
def run_test(self):
|
|
self.log.info("Make sure we repopulate setBlockIndexCandidates after InvalidateBlock:")
|
|
self.log.info("Mine 4 blocks on Node 0")
|
|
self.nodes[0].generatetoaddress(4, self.nodes[0].get_deterministic_priv_key().address)
|
|
assert_equal(self.nodes[0].getblockcount(), 4)
|
|
besthash_n0 = self.nodes[0].getbestblockhash()
|
|
|
|
self.log.info("Mine competing 6 blocks on Node 1")
|
|
self.nodes[1].generatetoaddress(6, self.nodes[1].get_deterministic_priv_key().address)
|
|
assert_equal(self.nodes[1].getblockcount(), 6)
|
|
|
|
self.log.info("Connect nodes to force a reorg")
|
|
self.connect_nodes(0, 1)
|
|
self.sync_blocks(self.nodes[0:2])
|
|
assert_equal(self.nodes[0].getblockcount(), 6)
|
|
badhash = self.nodes[1].getblockhash(2)
|
|
|
|
self.log.info("Invalidate block 2 on node 0 and verify we reorg to node 0's original chain")
|
|
self.nodes[0].invalidateblock(badhash)
|
|
assert_equal(self.nodes[0].getblockcount(), 4)
|
|
assert_equal(self.nodes[0].getbestblockhash(), besthash_n0)
|
|
|
|
self.log.info("Make sure we won't reorg to a lower work chain:")
|
|
self.connect_nodes( 1, 2)
|
|
self.log.info("Sync node 2 to node 1 so both have 6 blocks")
|
|
self.sync_blocks(self.nodes[1:3])
|
|
assert_equal(self.nodes[2].getblockcount(), 6)
|
|
self.log.info("Invalidate block 5 on node 1 so its tip is now at 4")
|
|
self.nodes[1].invalidateblock(self.nodes[1].getblockhash(5))
|
|
assert_equal(self.nodes[1].getblockcount(), 4)
|
|
self.log.info("Invalidate block 3 on node 2, so its tip is now 2")
|
|
self.nodes[2].invalidateblock(self.nodes[2].getblockhash(3))
|
|
assert_equal(self.nodes[2].getblockcount(), 2)
|
|
self.log.info("..and then mine a block")
|
|
self.nodes[2].generatetoaddress(1, self.nodes[2].get_deterministic_priv_key().address)
|
|
self.log.info("Verify all nodes are at the right height")
|
|
self.wait_until(lambda: self.nodes[2].getblockcount() == 3, timeout=5)
|
|
self.wait_until(lambda: self.nodes[0].getblockcount() == 4, timeout=5)
|
|
self.wait_until(lambda: self.nodes[1].getblockcount() == 4, timeout=5)
|
|
|
|
self.log.info("Make sure ResetBlockFailureFlags does the job correctly")
|
|
self.restart_node(0, extra_args=["-checkblocks=5"])
|
|
self.restart_node(1, extra_args=["-checkblocks=5"])
|
|
self.connect_nodes(0, 1)
|
|
self.nodes[0].generate(10)
|
|
self.sync_blocks(self.nodes[0:2])
|
|
newheight = self.nodes[0].getblockcount()
|
|
for j in range(2):
|
|
self.restart_node(0, extra_args=["-checkblocks=5"])
|
|
tip = self.nodes[0].generate(10)[-1]
|
|
self.nodes[1].generate(9)
|
|
self.connect_nodes(0, 1)
|
|
self.sync_blocks(self.nodes[0:2])
|
|
assert_equal(self.nodes[0].getblockcount(), newheight + 10 * (j + 1))
|
|
assert_equal(self.nodes[1].getblockcount(), newheight + 10 * (j + 1))
|
|
assert_equal(self.nodes[1].getbestblockhash(), tip)
|
|
|
|
tip = self.nodes[1].getbestblockhash()
|
|
self.nodes[1].invalidateblock(self.nodes[1].getblockhash(newheight + 1))
|
|
self.nodes[1].invalidateblock(self.nodes[1].getblockhash(newheight + 1))
|
|
|
|
assert_equal(self.nodes[1].getblockcount(), newheight)
|
|
self.restart_node(1, extra_args=["-checkblocks=5"])
|
|
self.wait_until(lambda: self.nodes[1].getblockcount() == newheight + 20)
|
|
assert_equal(tip, self.nodes[1].getbestblockhash())
|
|
|
|
self.log.info("Verify that we reconsider all ancestors as well")
|
|
blocks = self.nodes[1].generatetodescriptor(10, ADDRESS_BCRT1_UNSPENDABLE_DESCRIPTOR)
|
|
assert_equal(self.nodes[1].getbestblockhash(), blocks[-1])
|
|
# Invalidate the two blocks at the tip
|
|
self.nodes[1].invalidateblock(blocks[-1])
|
|
self.nodes[1].invalidateblock(blocks[-2])
|
|
assert_equal(self.nodes[1].getbestblockhash(), blocks[-3])
|
|
# Reconsider only the previous tip
|
|
self.nodes[1].reconsiderblock(blocks[-1])
|
|
# Should be back at the tip by now
|
|
assert_equal(self.nodes[1].getbestblockhash(), blocks[-1])
|
|
|
|
self.log.info("Verify that we reconsider all descendants")
|
|
blocks = self.nodes[1].generatetodescriptor(10, ADDRESS_BCRT1_UNSPENDABLE_DESCRIPTOR)
|
|
assert_equal(self.nodes[1].getbestblockhash(), blocks[-1])
|
|
# Invalidate the two blocks at the tip
|
|
self.nodes[1].invalidateblock(blocks[-2])
|
|
self.nodes[1].invalidateblock(blocks[-4])
|
|
assert_equal(self.nodes[1].getbestblockhash(), blocks[-5])
|
|
# Reconsider only the previous tip
|
|
self.nodes[1].reconsiderblock(blocks[-4])
|
|
# Should be back at the tip by now
|
|
assert_equal(self.nodes[1].getbestblockhash(), blocks[-1])
|
|
|
|
self.log.info("Verify that invalidating an unknown block throws an error")
|
|
assert_raises_rpc_error(-5, "Block not found", self.nodes[1].invalidateblock, "00" * 32)
|
|
assert_equal(self.nodes[1].getbestblockhash(), blocks[-1])
|
|
|
|
|
|
if __name__ == '__main__':
|
|
InvalidateTest().main()
|