def update_tree(self, root, height):
leaf = self.node_for_block(height - 1)
root = append(root, leaf)
assert_equal(self.nodes[0].getblock(str(height))["chainhistoryroot"],
bytes_to_hex_str(make_root_commitment(root)[::-1]))
return root
def run_test(self):
self.nodes[0].generate(10)
self.sync_all()
# Verify all blocks up to and including Heartwood activation set
# hashChainHistoryRoot to null.
print("Verifying blocks up to and including Heartwood activation")
blockcount = self.nodes[0].getblockcount()
assert_equal(blockcount, 10)
for height in range(0, blockcount + 1):
blk = self.nodes[0].getblock(str(height))
assert_equal(blk["chainhistoryroot"], NULL_FIELD)
# Create the initial history tree, containing a single node.
root = self.node_for_block(10)
# Generate the first block that contains a non-null chain history root.
print("Verifying first non-null chain history root")
self.nodes[0].generate(1)
self.sync_all()
# Verify that hashChainHistoryRoot is set correctly.
assert_equal(self.nodes[0].getblock('11')["chainhistoryroot"],
bytes_to_hex_str(make_root_commitment(root)[::-1]))
# Generate 9 more blocks on node 0, and verify their chain history roots.
print("Mining 9 blocks on node 0")
self.nodes[0].generate(9)
self.sync_all()
print("Verifying node 0's chain history")
for height in range(12, 21):
leaf = self.node_for_block(height - 1)
root = append(root, leaf)
assert_equal(
self.nodes[0].getblock(str(height))["chainhistoryroot"],
bytes_to_hex_str(make_root_commitment(root)[::-1]))
# The rest of the test only applies to Heartwood-aware node versions.
# Earlier versions won't serialize chain history roots in the block
# index, and splitting the network below requires restarting the nodes.
if self.nodes[0].getnetworkinfo(
)["version"] < CHAIN_HISTORY_ROOT_VERSION:
print(
"Node's block index is not Heartwood-aware, skipping reorg test"
)
return
# Split the network so we can test the effect of a reorg.
print("Splitting the network")
self.split_network()
# Generate 10 more blocks on node 0, and verify their chain history roots.
print("Mining 10 more blocks on node 0")
self.nodes[0].generate(10)
self.sync_all()
print("Verifying node 0's chain history")
for height in range(21, 31):
leaf = self.node_for_block(height - 1)
root = append(root, leaf)
assert_equal(
self.nodes[0].getblock(str(height))["chainhistoryroot"],
bytes_to_hex_str(make_root_commitment(root)[::-1]))
# Generate 11 blocks on node 2.
print("Mining alternate chain on node 2")
self.nodes[2].generate(11)
self.sync_all()
# Reconnect the nodes; node 0 will re-org to node 2's chain.
print("Re-joining the network so that node 0 reorgs")
self.join_network()
# Verify that node 0's chain history was correctly updated.
print("Deleting orphaned blocks from the expected chain history")
for _ in range(10):
root = delete(root)
print("Verifying that node 0 is now on node 1's chain history")
for height in range(21, 32):
leaf = self.node_for_block(height - 1)
root = append(root, leaf)
assert_equal(
self.nodes[2].getblock(str(height))["chainhistoryroot"],
bytes_to_hex_str(make_root_commitment(root)[::-1]))
def new_tree(self, height):
newRoot = self.node_for_block(height - 1)
assert_equal(self.nodes[0].getblock(str(height))["chainhistoryroot"],
bytes_to_hex_str(make_root_commitment(newRoot)[::-1]))
return newRoot