Changeset View
Changeset View
Standalone View
Standalone View
test/functional/rpc_preciousblock.py
| Show All 38 Lines | |||||
| class PreciousTest(BitcoinTestFramework): | class PreciousTest(BitcoinTestFramework): | ||||
| def set_test_params(self): | def set_test_params(self): | ||||
| self.setup_clean_chain = True | self.setup_clean_chain = True | ||||
| self.num_nodes = 3 | self.num_nodes = 3 | ||||
| self.extra_args = [["-noparkdeepreorg"], | self.extra_args = [["-noparkdeepreorg"], | ||||
| ["-noparkdeepreorg"], ["-noparkdeepreorg"]] | ["-noparkdeepreorg"], ["-noparkdeepreorg"]] | ||||
| def skip_test_if_missing_module(self): | |||||
| self.skip_if_no_wallet() | |||||
| def setup_network(self): | def setup_network(self): | ||||
| self.setup_nodes() | self.setup_nodes() | ||||
| def run_test(self): | def run_test(self): | ||||
| self.log.info( | self.log.info( | ||||
| "Ensure submitblock can in principle reorg to a competing chain") | "Ensure submitblock can in principle reorg to a competing chain") | ||||
| self.nodes[0].generate(1) | # A non-wallet address to mine to | ||||
| def gen_address( | |||||
| i): return self.nodes[i].get_deterministic_priv_key().address | |||||
| self.nodes[0].generatetoaddress(1, gen_address(0)) | |||||
| assert_equal(self.nodes[0].getblockcount(), 1) | assert_equal(self.nodes[0].getblockcount(), 1) | ||||
| hashZ = self.nodes[1].generate(2)[-1] | hashZ = self.nodes[1].generatetoaddress(2, gen_address(1))[-1] | ||||
| assert_equal(self.nodes[1].getblockcount(), 2) | assert_equal(self.nodes[1].getblockcount(), 2) | ||||
| node_sync_via_rpc(self.nodes[0:3]) | node_sync_via_rpc(self.nodes[0:3]) | ||||
| assert_equal(self.nodes[0].getbestblockhash(), hashZ) | assert_equal(self.nodes[0].getbestblockhash(), hashZ) | ||||
| self.log.info("Mine blocks A-B-C on Node 0") | self.log.info("Mine blocks A-B-C on Node 0") | ||||
| hashC = self.nodes[0].generate(3)[-1] | hashC = self.nodes[0].generatetoaddress(3, gen_address(0))[-1] | ||||
| assert_equal(self.nodes[0].getblockcount(), 5) | assert_equal(self.nodes[0].getblockcount(), 5) | ||||
| self.log.info("Mine competing blocks E-F-G on Node 1") | self.log.info("Mine competing blocks E-F-G on Node 1") | ||||
| hashG = self.nodes[1].generate(3)[-1] | hashG = self.nodes[1].generatetoaddress(3, gen_address(1))[-1] | ||||
| assert_equal(self.nodes[1].getblockcount(), 5) | assert_equal(self.nodes[1].getblockcount(), 5) | ||||
| assert hashC != hashG | assert hashC != hashG | ||||
| self.log.info("Connect nodes and check no reorg occurs") | self.log.info("Connect nodes and check no reorg occurs") | ||||
| # Submit competing blocks via RPC so any reorg should occur before we | # Submit competing blocks via RPC so any reorg should occur before we | ||||
| # proceed (no way to wait on inaction for p2p sync) | # proceed (no way to wait on inaction for p2p sync) | ||||
| node_sync_via_rpc(self.nodes[0:2]) | node_sync_via_rpc(self.nodes[0:2]) | ||||
| connect_nodes_bi(self.nodes[0], self.nodes[1]) | connect_nodes_bi(self.nodes[0], self.nodes[1]) | ||||
| assert_equal(self.nodes[0].getbestblockhash(), hashC) | assert_equal(self.nodes[0].getbestblockhash(), hashC) | ||||
| Show All 15 Lines | def run_test(self): | ||||
| self.log.info("Make Node0 prefer block G again") | self.log.info("Make Node0 prefer block G again") | ||||
| self.nodes[0].preciousblock(hashG) | self.nodes[0].preciousblock(hashG) | ||||
| assert_equal(self.nodes[0].getbestblockhash(), hashG) | assert_equal(self.nodes[0].getbestblockhash(), hashG) | ||||
| self.log.info("Make Node1 prefer block C again") | self.log.info("Make Node1 prefer block C again") | ||||
| self.nodes[1].preciousblock(hashC) | self.nodes[1].preciousblock(hashC) | ||||
| assert_equal(self.nodes[1].getbestblockhash(), hashC) | assert_equal(self.nodes[1].getbestblockhash(), hashC) | ||||
| self.log.info( | self.log.info( | ||||
| "Mine another block (E-F-G-)H on Node 0 and reorg Node 1") | "Mine another block (E-F-G-)H on Node 0 and reorg Node 1") | ||||
| self.nodes[0].generate(1) | self.nodes[0].generatetoaddress(1, gen_address(0)) | ||||
| assert_equal(self.nodes[0].getblockcount(), 6) | assert_equal(self.nodes[0].getblockcount(), 6) | ||||
| sync_blocks(self.nodes[0:2]) | sync_blocks(self.nodes[0:2]) | ||||
| hashH = self.nodes[0].getbestblockhash() | hashH = self.nodes[0].getbestblockhash() | ||||
| assert_equal(self.nodes[1].getbestblockhash(), hashH) | assert_equal(self.nodes[1].getbestblockhash(), hashH) | ||||
| self.log.info("Node1 should not be able to prefer block C anymore") | self.log.info("Node1 should not be able to prefer block C anymore") | ||||
| self.nodes[1].preciousblock(hashC) | self.nodes[1].preciousblock(hashC) | ||||
| assert_equal(self.nodes[1].getbestblockhash(), hashH) | assert_equal(self.nodes[1].getbestblockhash(), hashH) | ||||
| self.log.info("Mine competing blocks I-J-K-L on Node 2") | self.log.info("Mine competing blocks I-J-K-L on Node 2") | ||||
| self.nodes[2].generate(4) | self.nodes[2].generatetoaddress(4, gen_address(2)) | ||||
| assert_equal(self.nodes[2].getblockcount(), 6) | assert_equal(self.nodes[2].getblockcount(), 6) | ||||
| hashL = self.nodes[2].getbestblockhash() | hashL = self.nodes[2].getbestblockhash() | ||||
| self.log.info("Connect nodes and check no reorg occurs") | self.log.info("Connect nodes and check no reorg occurs") | ||||
| node_sync_via_rpc(self.nodes[1:3]) | node_sync_via_rpc(self.nodes[1:3]) | ||||
| connect_nodes_bi(self.nodes[1], self.nodes[2]) | connect_nodes_bi(self.nodes[1], self.nodes[2]) | ||||
| connect_nodes_bi(self.nodes[0], self.nodes[2]) | connect_nodes_bi(self.nodes[0], self.nodes[2]) | ||||
| assert_equal(self.nodes[0].getbestblockhash(), hashH) | assert_equal(self.nodes[0].getbestblockhash(), hashH) | ||||
| assert_equal(self.nodes[1].getbestblockhash(), hashH) | assert_equal(self.nodes[1].getbestblockhash(), hashH) | ||||
| Show All 11 Lines | |||||