def test_merge_in_merge(self):
dag = Dag(0)
genesis_hash = dag.genesis_block().get_hash()
ChainGenerator.fill_with_dummies_and_skips(dag, genesis_hash,
range(1, 5), [1, 3])
second_block = dag.blocks_by_number[2][0].get_hash()
ChainGenerator.fill_with_dummies_and_skips(dag, second_block,
range(3, 4), [])
tops = dag.get_top_hashes()
merging_block = BlockFactory.create_block_with_timestamp(
tops, BLOCK_TIME * 5)
merging_signed_block = BlockFactory.sign_block(merging_block,
Private.generate())
dag.add_signed_block(5, merging_signed_block)
ChainGenerator.fill_with_dummies_and_skips(dag, genesis_hash,
range(1, 7), [2, 3, 4, 5])
tops = dag.get_top_hashes()
merging_block = BlockFactory.create_block_with_timestamp(
tops, BLOCK_TIME * 7)
merging_signed_block = BlockFactory.sign_block(merging_block,
Private.generate())
dag.add_signed_block(7, merging_signed_block)
# DagVisualizer.visualize(dag, True)
iterator = MergingIter(dag, merging_block.get_hash())
#shortest chain goes last
# 3 and 4 are swapped because 4 has a priority
#TODO But is it okay? Maybe we should sometimes give priority to earlier blocks if equal?1
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[7][0].get_hash())
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[6][0].get_hash())
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[1][0].get_hash())
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[5][0].get_hash())
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[3][0].get_hash())
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[4][0].get_hash())
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[2][0].get_hash())
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[0][0].get_hash())
def test_merge_with_conflict_simple(self):
dag = Dag(0)
genesis_hash = dag.genesis_block().get_hash()
block_hash1 = ChainGenerator.insert_dummy(dag, [genesis_hash], 1)
conflicting_block_hash1 = ChainGenerator.insert_dummy(
dag, [block_hash1], 2)
conflicting_block_hash2 = ChainGenerator.insert_dummy(
dag, [block_hash1], 2)
block_hash3 = ChainGenerator.insert_dummy(dag,
[conflicting_block_hash2], 3)
# DagVisualizer.visualize(dag, True) # uncomment for discover in visualization folder
conflicts = [conflicting_block_hash1]
merger = Merger(dag)
res = merger.merge(dag.get_top_hashes(), conflicts)
res = res.filter_out_skipped_blocks()
# self.assertEqual(res[0].get_hash(), genesis_hash) #no genesis hash since common ancestor is first block
self.assertEqual(res[0].get_hash(), block_hash1)
self.assertEqual(res[1].get_hash(), conflicting_block_hash2)
self.assertEqual(res[2].get_hash(), block_hash3)
def test_complex_merge(self):
dag = Dag(0)
genesis_hash = dag.genesis_block().get_hash()
ChainGenerator.fill_with_dummies_and_skips(dag, genesis_hash,
range(1, 10), [2, 5, 7, 8])
first_block = dag.blocks_by_number[1][0].get_hash()
ChainGenerator.fill_with_dummies_and_skips(dag, first_block,
range(2, 10),
[3, 4, 6, 7, 8, 9])
second_block = dag.blocks_by_number[2][0].get_hash()
ChainGenerator.fill_with_dummies_and_skips(dag, second_block,
range(3, 10),
[3, 4, 5, 6, 9])
merger = Merger(dag)
res = merger.merge(dag.get_top_hashes())
res = res.filter_out_skipped_blocks()
# res.debug_print_block_numbers(dag)
self.assertEqual(res[0], dag.blocks_by_number[1][0])
self.assertEqual(res[1], dag.blocks_by_number[3][0])
self.assertEqual(res[2], dag.blocks_by_number[4][0])
self.assertEqual(res[3], dag.blocks_by_number[6][0])
self.assertEqual(res[4], dag.blocks_by_number[9][0])
self.assertEqual(
res[5],
dag.blocks_by_number[2][0]) # TODO find out why is this 2 here
self.assertEqual(res[6], dag.blocks_by_number[7][0])
self.assertEqual(res[7], dag.blocks_by_number[8][0])
self.assertEqual(res[8], dag.blocks_by_number[5][0])
def test_both_types_of_conflicts(self):
dag = Dag(0)
watcher = ConflictWatcher(dag)
actor1 = Private.publickey(Private.generate())
actor2 = Private.publickey(Private.generate())
actor3 = Private.publickey(Private.generate())
block1_hash = ChainGenerator.insert_dummy(dag, [dag.genesis_hash()], 1)
watcher.on_new_block_by_validator(block1_hash, 1, actor1)
block2_hash = ChainGenerator.insert_dummy(dag, [block1_hash], 2)
watcher.on_new_block_by_validator(block2_hash, 1, actor2)
block2c_hash = ChainGenerator.insert_dummy(dag, [block1_hash], 2)
watcher.on_new_block_by_validator(block2c_hash, 1, actor2)
block3_hash = ChainGenerator.insert_dummy(dag, [block2_hash], 3)
watcher.on_new_block_by_validator(block3_hash, 1, actor3)
#this is possible if we have two epoch seeds
block4_hash = ChainGenerator.insert_dummy(dag, [block2c_hash], 4)
watcher.on_new_block_by_validator(block4_hash, 1, actor1)
tops = dag.get_top_hashes()
explicits, candidate_groups = watcher.find_conflicts_in_between(tops)
self.assertEqual(len(explicits), 1)
self.assertIn(block4_hash, explicits)
self.assertEqual(len(candidate_groups), 1)
self.assertEqual(len(candidate_groups[0]), 2)
self.assertIn(block2_hash, candidate_groups[0])
self.assertIn(block2c_hash, candidate_groups[0])
def test_explicit_conflict(self):
dag = Dag(0)
watcher = ConflictWatcher(dag)
actor1 = Private.publickey(Private.generate())
actor2 = Private.publickey(Private.generate())
block1_hash = ChainGenerator.insert_dummy(dag, [dag.genesis_hash()], 1)
watcher.on_new_block_by_validator(block1_hash, 1, actor2)
block2_hash = ChainGenerator.insert_dummy(dag, [block1_hash], 2)
watcher.on_new_block_by_validator(block2_hash, 1, actor1)
block3_hash = ChainGenerator.insert_dummy(dag, [block2_hash], 3)
watcher.on_new_block_by_validator(block3_hash, 1, actor2)
block3c_hash = ChainGenerator.insert_dummy(dag, [block2_hash], 3)
watcher.on_new_block_by_validator(block3c_hash, 1, actor2)
tops = dag.get_top_hashes()
#here block was signed by node even before merge appeared
#this is explicit merge and both following blocks are conflicting
explicits, candidates = watcher.find_conflicts_in_between(tops)
self.assertEqual(len(explicits), 2)
self.assertEqual(len(candidates), 0)
self.assertIn(block3_hash, explicits)
self.assertIn(block3c_hash, explicits)
def test_find_conflicts(self):
dag = Dag(0)
watcher = ConflictWatcher(dag)
actor1 = Private.publickey(Private.generate())
actor2 = Private.publickey(Private.generate())
block1_hash = ChainGenerator.insert_dummy(dag, [dag.genesis_hash()], 1)
watcher.on_new_block_by_validator(block1_hash, 1, actor1)
block2_hash = ChainGenerator.insert_dummy(dag, [block1_hash], 2)
watcher.on_new_block_by_validator(block2_hash, 1, actor2)
block2c_hash = ChainGenerator.insert_dummy(dag, [block1_hash], 2)
watcher.on_new_block_by_validator(block2c_hash, 1, actor2)
# block3_hash = ChainGenerator.insert_dummy(dag, [block2_hash, block2c_hash], 3)
# watcher.on_new_block_by_validator(block3_hash, 1, actor3)
tops = dag.get_top_hashes()
explicits, candidate_groups = watcher.find_conflicts_in_between(tops)
self.assertEqual(len(explicits), 0)
self.assertEqual(len(candidate_groups), 1)
self.assertEqual(len(candidate_groups[0]), 2)
self.assertIn(block2_hash, candidate_groups[0])
self.assertIn(block2c_hash, candidate_groups[0])
def test_recursive_sequence_found(self):
dag = Dag(0)
conf_req = ConfirmationRequirement(dag)
genesis_hash = dag.genesis_block().get_hash()
block_hash = ChainGenerator.insert_dummy(dag, [genesis_hash], 1)
conf_req.blocks[block_hash] = 2
block_hash = ChainGenerator.insert_dummy(dag, [genesis_hash], 1)
conf_req.blocks[block_hash] = 3
block_hash = ChainGenerator.insert_dummy(dag, dag.get_top_hashes(), 2)
conf_req.blocks[block_hash] = 3
last_block_in_seq_hash = ChainGenerator.insert_dummy(
dag, [genesis_hash], 1)
conf_req.blocks[last_block_in_seq_hash] = 3
block_hash = ChainGenerator.insert_dummy(dag, [genesis_hash], 1)
conf_req.blocks[block_hash] = 3
block_hash = ChainGenerator.insert_dummy(
dag, [last_block_in_seq_hash, block_hash], 2)
conf_req.blocks[block_hash] = 4
block_hash = ChainGenerator.insert_dummy(dag, dag.get_top_hashes(), 3)
conf_req.blocks[block_hash] = 4
block_hash = ChainGenerator.insert_dummy(dag, dag.get_top_hashes(), 4)
# DagVisualizer.visualize(dag, True) # take a look to understand what's going on
# there will be only two blocks with consecutive 4 behind, which is not enough to increase
best_requirement = conf_req.choose_next_best_requirement(block_hash)
self.assertEqual(best_requirement, 4)
# make three blocks with consecutive 4 behind
# it should lead to following block increasing requirement value
conf_req.blocks[last_block_in_seq_hash] = 4
best_requirement = conf_req.choose_next_best_requirement(block_hash)
self.assertEqual(best_requirement, 5)
def test_merged_dag(self):
dag = Dag(0)
# generate test case
# time_slot [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
# ----------------------------------------
# 1 ------- [0, 1, 2, 3, 4]
# 2 ------- [-, -, 2, s, s]
# 3 ------- [-, -, 2, s, s]
# 4 ------- [-, -, 2, 3, s]
# s - same block (merged)
conf_req = ConfirmationRequirement(dag)
genesis_hash = dag.genesis_block().get_hash()
block_hash = ChainGenerator.insert_dummy(dag, [genesis_hash], 1)
conf_req.blocks[block_hash] = 2
block_hash = ChainGenerator.insert_dummy(dag, [genesis_hash], 1)
conf_req.blocks[block_hash] = 3
block_hash = ChainGenerator.insert_dummy(dag, dag.get_top_hashes(), 2)
conf_req.blocks[block_hash] = 3
last_block_in_seq_hash = ChainGenerator.insert_dummy(dag, [genesis_hash], 1)
conf_req.blocks[last_block_in_seq_hash] = 3
block_hash = ChainGenerator.insert_dummy(dag, [genesis_hash], 1)
conf_req.blocks[block_hash] = 3
block_hash = ChainGenerator.insert_dummy(dag, [last_block_in_seq_hash, block_hash], 2)
conf_req.blocks[block_hash] = 4
block_hash = ChainGenerator.insert_dummy(dag, dag.get_top_hashes(), 3)
conf_req.blocks[block_hash] = 4
top_hash = ChainGenerator.insert_dummy(dag, dag.get_top_hashes(), 4)
# DagVisualizer.visualize(dag)
conflict_finder = ConflictFinder(dag)
top_blocks = list(dag.get_top_blocks().keys())
top, conflicts = conflict_finder.find_conflicts(top_blocks)
self.assertEqual(top, top_hash) # strong determined top
# CHAIN ALREADY MERGED
self.assertEqual(len(conflicts), 0)
def test_merge(self):
dag = Dag(0)
prev_hash = dag.genesis_block().get_hash()
ChainGenerator.fill_with_dummies_and_skips(dag, prev_hash, range(1, 4),
[1, 2])
ChainGenerator.fill_with_dummies_and_skips(dag, prev_hash, range(1, 4),
[3])
merger = Merger(dag)
res = merger.merge(dag.get_top_hashes())
res = res.filter_out_skipped_blocks()
self.assertEqual(res[0], dag.blocks_by_number[0][0])
self.assertEqual(res[1], dag.blocks_by_number[1][0])
self.assertEqual(res[2], dag.blocks_by_number[2][0])
self.assertEqual(res[3], dag.blocks_by_number[3][0])
def test_simple_merge(self):
dag = Dag(0)
genesis_hash = dag.genesis_block().get_hash()
ChainGenerator.fill_with_dummies_and_skips(dag, genesis_hash,
range(1, 10), [2, 5, 7, 8])
first_block = dag.blocks_by_number[1][0].get_hash()
ChainGenerator.fill_with_dummies_and_skips(dag, first_block,
range(2, 10),
[3, 4, 6, 7, 8, 9])
second_block = dag.blocks_by_number[2][0].get_hash()
ChainGenerator.fill_with_dummies_and_skips(dag, second_block,
range(3, 10),
[3, 4, 5, 6, 9])
hanging_tips = dag.get_top_hashes()
merging_block = BlockFactory.create_block_with_timestamp(
hanging_tips, BLOCK_TIME * 10)
merging_signed_block = BlockFactory.sign_block(merging_block,
Private.generate())
dag.add_signed_block(10, merging_signed_block)
# DagVisualizer.visualize(dag, True)
iterator = MergingIter(dag, merging_block.get_hash())
self.assertEqual(iterator.next().get_hash(), merging_block.get_hash())
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[5][0].get_hash())
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[8][0].get_hash())
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[7][0].get_hash())
self.assertEqual(iterator.next().get_hash(), dag.blocks_by_number[2]
[0].get_hash()) #TODO find out why is this 2 here
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[9][0].get_hash())
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[6][0].get_hash())
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[4][0].get_hash())
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[3][0].get_hash())
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[1][0].get_hash())
self.assertEqual(iterator.next().get_hash(),
dag.blocks_by_number[0][0].get_hash())
def test_merge_with_conflict_simplest(self):
dag = Dag(0)
genesis_hash = dag.genesis_block().get_hash()
block_hash1 = ChainGenerator.insert_dummy(dag, [genesis_hash], 1)
block_hash2 = ChainGenerator.insert_dummy(dag, [genesis_hash], 1)
# DagVisualizer.visualize(dag, True) # uncomment for discover in visualization folder
conflicts = [block_hash1]
merger = Merger(dag)
res = merger.merge(dag.get_top_hashes(), conflicts)
res = res.filter_out_skipped_blocks()
self.assertEqual(res[0].get_hash(), genesis_hash)
self.assertEqual(res[1].get_hash(), block_hash2)
def test_explicit_conflict_right_on_common_ancestor(self):
dag = Dag(0)
watcher = ConflictWatcher(dag)
actor2 = Private.publickey(Private.generate())
#consider common ancestor already resolved
block1_hash = ChainGenerator.insert_dummy(dag, [dag.genesis_hash()], 1)
watcher.on_new_block_by_validator(block1_hash, 1, actor2)
block2_hash = ChainGenerator.insert_dummy(dag, [block1_hash], 2)
watcher.on_new_block_by_validator(block2_hash, 1, actor2)
block2c_hash = ChainGenerator.insert_dummy(dag, [block1_hash], 2)
watcher.on_new_block_by_validator(block2c_hash, 1, actor2)
tops = dag.get_top_hashes()
explicits, candidates = watcher.find_conflicts_in_between(tops)
self.assertEqual(len(explicits), 2)
self.assertEqual(len(candidates), 0)
self.assertIn(block2_hash, explicits)
self.assertIn(block2c_hash, explicits)
