mirror of
https://github.com/dashpay/dash.git
synced 2024-12-27 21:12:48 +01:00
07dcddb4ca
* Merge #9815: Trivial: use EXIT_ codes instead of magic numbersa87d02ause EXIT_ codes instead of magic numbers (Marko Bencun) * Merge #9801: Removed redundant parameter from mempool.PrioritiseTransactioneaea2bbRemoved redundant parameter from mempool.PrioritiseTransaction (gubatron) * remove extra parameter (see 3a3745bb) in dash specific code * Merge #9819: Remove harmless read of unusued priority estimatesbc8fd12Remove harmless read of unusued priority estimates (Alex Morcos) * Merge #9766: Add --exclude option to rpc-tests.pyc578408Add exclude option to rpc-tests.py (John Newbery) * Merge #9577: Fix docstrings in qa tests3f95a80Fix docstrings in qa tests (John Newbery) * Merge #9823: qa: Set correct path for binaries in rpc tests3333ad0qa: Set correct path for binaries in rpc tests (MarcoFalke) * Merge #9833: Trivial: fix comments referencing AppInit2ef9f495Trivial: fix comments referencing AppInit2 (Marko Bencun) * Merge #9612: [trivial] Rephrase the definition of difficulty.dc222f8Trivial: Rephrase the definition of difficulty in the code. (Karl-Johan Alm) * Merge #9847: Extra test vector for BIP3230aedcbBIP32 extra test vector (Pieter Wuille) * Merge #9839: [qa] Make import-rescan.py watchonly check reliable864890a[qa] Make import-rescan.py watchonly check reliable (Russell Yanofsky) Tree-SHA512: ea0e2b1d4fc8f35174c3d575fb751b428daf6ad3aa944fad4e3ddcc9195e4f17051473acabc54203b1d27cca64cf911b737ab92e986c40ef384410652e2dbea1 * Change back file params
74 lines
3.0 KiB
Python
Executable File
74 lines
3.0 KiB
Python
Executable File
#!/usr/bin/env python3
|
|
# Copyright (c) 2014-2016 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.util import *
|
|
|
|
class InvalidateTest(BitcoinTestFramework):
|
|
|
|
|
|
def __init__(self):
|
|
super().__init__()
|
|
self.setup_clean_chain = True
|
|
self.num_nodes = 3
|
|
|
|
def setup_network(self):
|
|
self.nodes = []
|
|
self.is_network_split = False
|
|
self.nodes.append(start_node(0, self.options.tmpdir, ["-debug"]))
|
|
self.nodes.append(start_node(1, self.options.tmpdir, ["-debug"]))
|
|
self.nodes.append(start_node(2, self.options.tmpdir, ["-debug"]))
|
|
|
|
def run_test(self):
|
|
print("Make sure we repopulate setBlockIndexCandidates after InvalidateBlock:")
|
|
print("Mine 4 blocks on Node 0")
|
|
self.nodes[0].generate(4)
|
|
assert(self.nodes[0].getblockcount() == 4)
|
|
besthash = self.nodes[0].getbestblockhash()
|
|
|
|
print("Mine competing 6 blocks on Node 1")
|
|
self.nodes[1].generate(6)
|
|
assert(self.nodes[1].getblockcount() == 6)
|
|
|
|
print("Connect nodes to force a reorg")
|
|
connect_nodes_bi(self.nodes,0,1)
|
|
sync_blocks(self.nodes[0:2])
|
|
assert(self.nodes[0].getblockcount() == 6)
|
|
badhash = self.nodes[1].getblockhash(2)
|
|
|
|
print("Invalidate block 2 on node 0 and verify we reorg to node 0's original chain")
|
|
self.nodes[0].invalidateblock(badhash)
|
|
newheight = self.nodes[0].getblockcount()
|
|
newhash = self.nodes[0].getbestblockhash()
|
|
if (newheight != 4 or newhash != besthash):
|
|
raise AssertionError("Wrong tip for node0, hash %s, height %d"%(newhash,newheight))
|
|
|
|
print("\nMake sure we won't reorg to a lower work chain:")
|
|
connect_nodes_bi(self.nodes,1,2)
|
|
print("Sync node 2 to node 1 so both have 6 blocks")
|
|
sync_blocks(self.nodes[1:3])
|
|
assert(self.nodes[2].getblockcount() == 6)
|
|
print("Invalidate block 5 on node 1 so its tip is now at 4")
|
|
self.nodes[1].invalidateblock(self.nodes[1].getblockhash(5))
|
|
assert(self.nodes[1].getblockcount() == 4)
|
|
print("Invalidate block 3 on node 2, so its tip is now 2")
|
|
self.nodes[2].invalidateblock(self.nodes[2].getblockhash(3))
|
|
assert(self.nodes[2].getblockcount() == 2)
|
|
print("..and then mine a block")
|
|
self.nodes[2].generate(1)
|
|
print("Verify all nodes are at the right height")
|
|
time.sleep(5)
|
|
for i in range(3):
|
|
print(i,self.nodes[i].getblockcount())
|
|
assert(self.nodes[2].getblockcount() == 3)
|
|
assert(self.nodes[0].getblockcount() == 4)
|
|
node1height = self.nodes[1].getblockcount()
|
|
if node1height < 4:
|
|
raise AssertionError("Node 1 reorged to a lower height: %d"%node1height)
|
|
|
|
if __name__ == '__main__':
|
|
InvalidateTest().main()
|