public void No_lookup_more_than_256_before()
{
const int chainLength = 512;
Block genesis = Build.A.Block.Genesis.TestObject;
BlockTree tree = Build.A.BlockTree(genesis).OfChainLength(chainLength).TestObject;
BlockhashProvider provider = new BlockhashProvider(tree);
BlockHeader head = tree.FindHeader(chainLength - 1);
Block current = Build.A.Block.WithParent(head).TestObject;
Keccak result = provider.GetBlockhash(current.Header, chainLength - 257);
Assert.Null(result);
}
public void Can_lookup_up_to_256_before_with_headers_only_and_competing_branches()
{
const int chainLength = 512;
Block genesis = Build.A.Block.Genesis.TestObject;
BlockTree tree = Build.A.BlockTree(genesis).OfHeadersOnly.OfChainLength(out Block headBlock, chainLength).OfChainLength(out Block alternativeHeadBlock, chainLength, 1).TestObject;
BlockhashProvider provider = new BlockhashProvider(tree, LimboLogs.Instance);
Block current = Build.A.Block.WithParent(headBlock).TestObject;
long lookupNumber = chainLength - 256;
Keccak result = provider.GetBlockhash(current.Header, lookupNumber);
Assert.NotNull(result);
}
public void Cannot_ask_about_future()
{
const int chainLength = 512;
Block genesis = Build.A.Block.Genesis.TestObject;
BlockTree tree = Build.A.BlockTree(genesis).OfChainLength(chainLength).TestObject;
BlockhashProvider provider = new BlockhashProvider(tree);
BlockHeader head = tree.FindHeader(chainLength - 1);
Block current = Build.A.Block.WithParent(head).TestObject;
Keccak result = provider.GetBlockhash(current.Header, chainLength + 1);
Assert.Null(result);
}
public void Can_lookup_up_to_256_before_with_headers_only()
{
const int chainLength = 512;
Block genesis = Build.A.Block.Genesis.TestObject;
BlockTree tree = Build.A.BlockTree(genesis).OfHeadersOnly.OfChainLength(chainLength).TestObject;
BlockhashProvider provider = new BlockhashProvider(tree, LimboLogs.Instance);
BlockHeader head = tree.FindHeader(chainLength - 1);
Block current = Build.A.Block.WithParent(head).TestObject;
Keccak result = provider.GetBlockhash(current.Header, chainLength - 256);
Assert.AreEqual(tree.FindHeader(256).Hash, result);
}
public void UInt_256_overflow()
{
const int chainLength = 128;
Block genesis = Build.A.Block.Genesis.TestObject;
BlockTree tree = Build.A.BlockTree(genesis).OfChainLength(chainLength).TestObject;
BlockhashProvider provider = new BlockhashProvider(tree, LimboLogs.Instance);
BlockHeader head = tree.FindHeader(chainLength - 1);
Block current = Build.A.Block.WithParent(head).TestObject;
Keccak result = provider.GetBlockhash(current.Header, 127);
Assert.AreEqual(head.Hash, result);
}
public void Cannot_ask_for_self()
{
const int chainLength = 512;
Block genesis = Build.A.Block.Genesis.TestObject;
BlockTree tree = Build.A.BlockTree(genesis).OfChainLength(chainLength).TestObject;
BlockhashProvider provider = new BlockhashProvider(tree, LimboLogs.Instance);
BlockHeader head = tree.FindHeader(chainLength - 1, BlockTreeLookupOptions.None);
Block current = Build.A.Block.WithParent(head).TestObject;
Keccak result = provider.GetBlockhash(current.Header, chainLength);
Assert.Null(result);
}
public void Can_get_parent_hash()
{
const int chainLength = 512;
Block genesis = Build.A.Block.Genesis.TestObject;
BlockTree tree = Build.A.BlockTree(genesis).OfChainLength(chainLength).TestObject;
BlockhashProvider provider = new BlockhashProvider(tree);
BlockHeader head = tree.FindHeader(chainLength - 1);
Block current = Build.A.Block.WithParent(head).TestObject;
Keccak result = provider.GetBlockhash(current.Header, chainLength - 1);
Assert.AreEqual(head.Hash, result);
}
public void Can_get_parent_only_headers()
{
const int chainLength = 512;
Block genesis = Build.A.Block.Genesis.TestObject;
BlockTree tree = Build.A.BlockTree(genesis).OfHeadersOnly.OfChainLength(chainLength).TestObject;
BlockhashProvider provider = new BlockhashProvider(tree, LimboLogs.Instance);
BlockHeader head = tree.FindHeader(chainLength - 1, BlockTreeLookupOptions.None);
Block current = Build.A.Block.WithParent(head).TestObject;
Keccak result = provider.GetBlockhash(current.Header, chainLength - 1);
Assert.AreEqual(head.Hash, result);
}
public void Can_lookup_up_to_256_before_soon_after_fast_sync()
{
const int chainLength = 512;
Block genesis = Build.A.Block.Genesis.TestObject;
BlockTree tree = Build.A.BlockTree(genesis).OfHeadersOnly.OfChainLength(out Block headBlock, chainLength).OfChainLength(out Block alternativeHeadBlock, chainLength, 1).TestObject;
BlockhashProvider provider = new BlockhashProvider(tree, LimboLogs.Instance);
Block current = Build.A.Block.WithParent(headBlock).TestObject;
tree.SuggestBlock(current);
tree.UpdateMainChain(current);
long lookupNumber = chainLength - 256;
Keccak result = provider.GetBlockhash(current.Header, lookupNumber);
Assert.NotNull(result);
}
public void Can_handle_non_main_chain_in_fast_sync()
{
const int chainLength = 512;
Block genesis = Build.A.Block.Genesis.TestObject;
BlockTree tree = Build.A.BlockTree(genesis).OfHeadersOnly.OfChainLength(out Block headBlock, chainLength).OfChainLength(out Block alternativeHeadBlock, chainLength, 1).TestObject;
Block current = Build.A.Block.WithParent(headBlock).TestObject;
for (int i = 0; i < 6; i++)
{
tree.SuggestBlock(current);
tree.UpdateMainChain(current);
current = Build.A.Block.WithParent(current).TestObject;
}
BlockhashProvider provider = new BlockhashProvider(tree, LimboLogs.Instance);
Keccak result = provider.GetBlockhash(current.Header, 509);
Assert.NotNull(result);
}