Changeset View
Changeset View
Standalone View
Standalone View
qa/rpc-tests/preciousblock.py
| Show First 20 Lines • Show All 41 Lines • ▼ Show 20 Lines | |||||
| class PreciousTest(BitcoinTestFramework): | class PreciousTest(BitcoinTestFramework): | ||||
| def __init__(self): | def __init__(self): | ||||
| super().__init__() | super().__init__() | ||||
| self.setup_clean_chain = True | self.setup_clean_chain = True | ||||
| self.num_nodes = 3 | self.num_nodes = 3 | ||||
| self.extra_args = [["-debug"]] * self.num_nodes | |||||
| def setup_network(self): | def setup_network(self): | ||||
| self.nodes = self.setup_nodes() | self.nodes = self.setup_nodes() | ||||
| def run_test(self): | def run_test(self): | ||||
| print("Ensure submitblock can in principle reorg to a competing chain") | self.log.info( | ||||
| "Ensure submitblock can in principle reorg to a competing chain") | |||||
| self.nodes[0].generate(1) | self.nodes[0].generate(1) | ||||
| assert_equal(self.nodes[0].getblockcount(), 1) | assert_equal(self.nodes[0].getblockcount(), 1) | ||||
| (hashY, hashZ) = self.nodes[1].generate(2) | (hashY, hashZ) = self.nodes[1].generate(2) | ||||
| 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) | ||||
| print("Mine blocks A-B-C on Node 0") | self.log.info("Mine blocks A-B-C on Node 0") | ||||
| (hashA, hashB, hashC) = self.nodes[0].generate(3) | (hashA, hashB, hashC) = self.nodes[0].generate(3) | ||||
| assert_equal(self.nodes[0].getblockcount(), 5) | assert_equal(self.nodes[0].getblockcount(), 5) | ||||
| print("Mine competing blocks E-F-G on Node 1") | self.log.info("Mine competing blocks E-F-G on Node 1") | ||||
| (hashE, hashF, hashG) = self.nodes[1].generate(3) | (hashE, hashF, hashG) = self.nodes[1].generate(3) | ||||
| assert_equal(self.nodes[1].getblockcount(), 5) | assert_equal(self.nodes[1].getblockcount(), 5) | ||||
| assert(hashC != hashG) | assert(hashC != hashG) | ||||
| print("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, 1) | connect_nodes_bi(self.nodes, 0, 1) | ||||
| assert_equal(self.nodes[0].getbestblockhash(), hashC) | assert_equal(self.nodes[0].getbestblockhash(), hashC) | ||||
| assert_equal(self.nodes[1].getbestblockhash(), hashG) | assert_equal(self.nodes[1].getbestblockhash(), hashG) | ||||
| print("Make Node0 prefer block G") | self.log.info("Make Node0 prefer block G") | ||||
| self.nodes[0].preciousblock(hashG) | self.nodes[0].preciousblock(hashG) | ||||
| assert_equal(self.nodes[0].getbestblockhash(), hashG) | assert_equal(self.nodes[0].getbestblockhash(), hashG) | ||||
| print("Make Node0 prefer block C again") | self.log.info("Make Node0 prefer block C again") | ||||
| self.nodes[0].preciousblock(hashC) | self.nodes[0].preciousblock(hashC) | ||||
| assert_equal(self.nodes[0].getbestblockhash(), hashC) | assert_equal(self.nodes[0].getbestblockhash(), hashC) | ||||
| print("Make Node1 prefer block C") | self.log.info("Make Node1 prefer block C") | ||||
| self.nodes[1].preciousblock(hashC) | self.nodes[1].preciousblock(hashC) | ||||
| sync_chain(self.nodes[0:2]) | sync_chain(self.nodes[0:2]) | ||||
| # wait because node 1 may not have downloaded hashC | # wait because node 1 may not have downloaded hashC | ||||
| assert_equal(self.nodes[1].getbestblockhash(), hashC) | assert_equal(self.nodes[1].getbestblockhash(), hashC) | ||||
| print("Make Node1 prefer block G again") | self.log.info("Make Node1 prefer block G again") | ||||
| self.nodes[1].preciousblock(hashG) | self.nodes[1].preciousblock(hashG) | ||||
| assert_equal(self.nodes[1].getbestblockhash(), hashG) | assert_equal(self.nodes[1].getbestblockhash(), hashG) | ||||
| print("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) | ||||
| print("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) | ||||
| print("Mine another block (E-F-G-)H on Node 0 and reorg Node 1") | self.log.info( | ||||
| "Mine another block (E-F-G-)H on Node 0 and reorg Node 1") | |||||
| self.nodes[0].generate(1) | self.nodes[0].generate(1) | ||||
| 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) | ||||
| print("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) | ||||
| print("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].generate(4) | ||||
| assert_equal(self.nodes[2].getblockcount(), 6) | assert_equal(self.nodes[2].getblockcount(), 6) | ||||
| hashL = self.nodes[2].getbestblockhash() | hashL = self.nodes[2].getbestblockhash() | ||||
| print("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, 2) | connect_nodes_bi(self.nodes, 1, 2) | ||||
| connect_nodes_bi(self.nodes, 0, 2) | connect_nodes_bi(self.nodes, 0, 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) | ||||
| assert_equal(self.nodes[2].getbestblockhash(), hashL) | assert_equal(self.nodes[2].getbestblockhash(), hashL) | ||||
| print("Make Node1 prefer block L") | self.log.info("Make Node1 prefer block L") | ||||
| self.nodes[1].preciousblock(hashL) | self.nodes[1].preciousblock(hashL) | ||||
| assert_equal(self.nodes[1].getbestblockhash(), hashL) | assert_equal(self.nodes[1].getbestblockhash(), hashL) | ||||
| print("Make Node2 prefer block H") | self.log.info("Make Node2 prefer block H") | ||||
| self.nodes[2].preciousblock(hashH) | self.nodes[2].preciousblock(hashH) | ||||
| assert_equal(self.nodes[2].getbestblockhash(), hashH) | assert_equal(self.nodes[2].getbestblockhash(), hashH) | ||||
| if __name__ == '__main__': | if __name__ == '__main__': | ||||
| PreciousTest().main() | PreciousTest().main() | ||||