Sean Bowe
8 years ago
12 changed files with 86 additions and 324 deletions
@ -1,199 +0,0 @@ |
|||
/** @file
|
|||
***************************************************************************** |
|||
|
|||
Test for Merkle tree. |
|||
|
|||
***************************************************************************** |
|||
* @author This file is part of libzerocash, developed by the Zerocash |
|||
* project and contributors (see AUTHORS). |
|||
* @copyright MIT license (see LICENSE file) |
|||
*****************************************************************************/ |
|||
|
|||
#include "zerocash/IncrementalMerkleTree.h" |
|||
|
|||
#include <iostream> |
|||
#include <vector> |
|||
|
|||
#define BOOST_TEST_MODULE merkleTest |
|||
#include <boost/test/included/unit_test.hpp> |
|||
|
|||
using namespace libzerocash; |
|||
using namespace std; |
|||
|
|||
void constructNonzeroTestVector(std::vector< std::vector<bool> > &values, uint32_t size) |
|||
{ |
|||
values.resize(0); |
|||
std::vector<bool> dummy; |
|||
dummy.resize(256); |
|||
dummy[0] = true; |
|||
|
|||
for (uint32_t i = 0; i < size; i++) |
|||
{ |
|||
values.push_back(dummy); |
|||
} |
|||
} |
|||
|
|||
void constructZeroTestVector(std::vector< std::vector<bool> > &values, uint32_t size) |
|||
{ |
|||
values.resize(0); |
|||
std::vector<bool> dummy; |
|||
dummy.resize(256); |
|||
|
|||
for (uint32_t i = 0; i < size; i++) |
|||
{ |
|||
values.push_back(dummy); |
|||
} |
|||
} |
|||
|
|||
BOOST_AUTO_TEST_CASE( testRootOfTreeOfZerosIsZero ) { |
|||
IncrementalMerkleTree incTree; |
|||
std::vector< std::vector<bool> > values; |
|||
std::vector<bool> actual_root; |
|||
|
|||
constructZeroTestVector(values, 2); |
|||
|
|||
// Create an IncrementalMerkleTree over the values.
|
|||
if (incTree.insertVector(values) == false) { |
|||
BOOST_ERROR("Could not insert into the tree."); |
|||
} |
|||
incTree.prune(); |
|||
incTree.getRootValue(actual_root); |
|||
|
|||
std::vector<bool> expected_root(32*8, 0); |
|||
BOOST_CHECK( expected_root == actual_root ); |
|||
} |
|||
|
|||
void add_values_to_reference(IncrementalMerkleTree &tree, std::vector< std::vector<bool> > &values) { |
|||
IncrementalMerkleTree newtree(20); |
|||
|
|||
if (newtree.insertVector(values) == false) { |
|||
BOOST_ERROR("Could not insert into the tree."); |
|||
} |
|||
|
|||
tree.setTo(newtree); |
|||
} |
|||
|
|||
BOOST_AUTO_TEST_CASE( test_add_values_to_reference ) { |
|||
IncrementalMerkleTree incTree(20); |
|||
IncrementalMerkleTree incTree2(20); |
|||
|
|||
std::vector< std::vector<bool> > values; |
|||
constructNonzeroTestVector(values, 2); |
|||
|
|||
if (incTree.insertVector(values) == false) { |
|||
BOOST_ERROR("Could not insert into the tree."); |
|||
} |
|||
|
|||
add_values_to_reference(incTree2, values); |
|||
|
|||
{ |
|||
std::vector<bool> root1, root2; |
|||
incTree.getRootValue(root1); |
|||
incTree2.getRootValue(root2); |
|||
|
|||
BOOST_CHECK(root1 == root2); |
|||
} |
|||
} |
|||
|
|||
BOOST_AUTO_TEST_CASE( testRootOfTreeOfNonZeroIsNonZero ) { |
|||
IncrementalMerkleTree incTree; |
|||
std::vector< std::vector<bool> > values; |
|||
std::vector<bool> actual_root; |
|||
|
|||
constructNonzeroTestVector(values, 2); |
|||
|
|||
// Create an IncrementalMerkleTree over the values.
|
|||
if (incTree.insertVector(values) == false) { |
|||
BOOST_ERROR("Could not insert into the tree."); |
|||
} |
|||
incTree.prune(); |
|||
incTree.getRootValue(actual_root); |
|||
|
|||
std::vector<bool> expected_root(32*8, 0); |
|||
BOOST_CHECK( expected_root != actual_root ); |
|||
} |
|||
|
|||
BOOST_AUTO_TEST_CASE( testSerializationEdgeCase ) { |
|||
|
|||
} |
|||
|
|||
BOOST_AUTO_TEST_CASE( testCompactRepresentation ) { |
|||
for (uint32_t num_entries = 0; num_entries < 100; num_entries++) { |
|||
size_t test_depth = 64; |
|||
|
|||
if (num_entries == 2) { |
|||
// This is a particular failure I'm testing with weird
|
|||
// padding caused by this depth.
|
|||
test_depth = 20; |
|||
} |
|||
|
|||
std::vector< std::vector<bool> > values; |
|||
std::vector<bool> root1, root2; |
|||
IncrementalMerkleTree incTree(test_depth); |
|||
|
|||
constructNonzeroTestVector(values, num_entries); |
|||
|
|||
BOOST_REQUIRE( incTree.insertVector(values) ); |
|||
BOOST_REQUIRE( incTree.prune() ); |
|||
|
|||
IncrementalMerkleTreeCompact compact = incTree.getCompactRepresentation(); |
|||
|
|||
BOOST_REQUIRE( compact.getTreeHeight() == test_depth ); |
|||
|
|||
// Calculate what the path to the next-added element should be.
|
|||
std::vector<unsigned char> path_bytes(8); |
|||
std::vector<bool> path_bits; |
|||
libzerocash::convertIntToBytesVector(num_entries, path_bytes); |
|||
libzerocash::convertBytesVectorToVector(path_bytes, path_bits); |
|||
|
|||
if (test_depth == 64) { |
|||
// Make sure the paths match.
|
|||
BOOST_REQUIRE( compact.getHashList() == path_bits ); |
|||
} |
|||
|
|||
// Make sure there's a hash for every '1' bit down the path.
|
|||
BOOST_REQUIRE( compact.getHashVec().size() == libzerocash::countOnes(path_bits) ); |
|||
|
|||
/* Test serializing and deserializing. */ |
|||
std::vector<unsigned char> serializedCompact = compact.serialize(); |
|||
IncrementalMerkleTreeCompact deserializedCompact = IncrementalMerkleTreeCompact::deserialize(serializedCompact); |
|||
BOOST_REQUIRE(compact.getTreeHeight() == deserializedCompact.getTreeHeight()); |
|||
BOOST_REQUIRE(compact.getHashList() == deserializedCompact.getHashList()); |
|||
BOOST_REQUIRE(compact.getHashVec() == deserializedCompact.getHashVec()); |
|||
|
|||
// Make sure 'restoring' the tree results in the same root.
|
|||
IncrementalMerkleTree newTree(compact); |
|||
incTree.getRootValue(root1); |
|||
incTree.getRootValue(root2); |
|||
BOOST_REQUIRE( root1 == root2 ); |
|||
} |
|||
} |
|||
|
|||
BOOST_AUTO_TEST_CASE( testCompactDeserializationFailures ) { |
|||
IncrementalMerkleTree incTree(64); |
|||
std::vector< std::vector<bool> > values; |
|||
constructNonzeroTestVector(values, 5); |
|||
BOOST_REQUIRE( incTree.insertVector(values) ); |
|||
BOOST_REQUIRE( incTree.prune() ); |
|||
IncrementalMerkleTreeCompact compact = incTree.getCompactRepresentation(); |
|||
|
|||
/* Base the following tests off of this valid serialization. */ |
|||
std::vector<unsigned char> serialized = compact.serialize(); |
|||
|
|||
/* Should fail if we truncate any number of bytes off the end. */ |
|||
for (size_t trunc_len = 0; trunc_len < serialized.size(); trunc_len++) { |
|||
std::vector<unsigned char> truncated(serialized.begin(), serialized.begin() + trunc_len); |
|||
BOOST_CHECK_THROW( |
|||
IncrementalMerkleTreeCompact::deserialize(truncated), |
|||
std::out_of_range |
|||
); |
|||
} |
|||
|
|||
/* Should fail if we append any number of extra bytes on the end. */ |
|||
std::vector<unsigned char> extra_byte = serialized; |
|||
extra_byte.push_back(0x00); |
|||
BOOST_CHECK_THROW( |
|||
IncrementalMerkleTreeCompact::deserialize(extra_byte), |
|||
std::runtime_error |
|||
); |
|||
} |
|||
Loading…
Reference in new issue