DragonX/dragonx
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 2 Wiki Activity

Remove the Merkle tree hash function's fixed point.

Browse Source
This commit is contained in:
Taylor Hornby
2016-05-04 09:15:14 -06:00
parent 9e387120eb
commit bf2e3122ac
8 changed files with 251 additions and 132 deletions
Download Patch File Download Diff File Expand all files Collapse all files

32
src/gtest/test_merkletree.cpp
View File

@@ -1,6 +1,7 @@
#include <gtest/gtest.h>
#include "test/data/merkle_roots.json.h"
#include "test/data/merkle_roots_empty.json.h"
#include "test/data/merkle_serialization.json.h"
#include "test/data/merkle_witness_serialization.json.h"
#include "test/data/merkle_path.json.h"
@@ -48,6 +49,7 @@ using namespace std;
using namespace libzerocash;
using namespace libsnark;
template<typename T>
void expect_deser_same(const T& expected)
{
@@ -121,8 +123,9 @@ void test_tree(Array root_tests, Array ser_tests, Array witness_ser_tests, Array
Tree tree;
// The root of the tree at this point is expected to be null.
ASSERT_TRUE(tree.root().IsNull());
// The root of the tree at this point is expected to be the root of the
// empty tree.
ASSERT_TRUE(tree.root() == Tree::empty_root());
// We need to witness at every single point in the tree, so
// that the consistency of the tree and the merkle paths can
@@ -235,6 +238,29 @@ TEST(merkletree, vectors) {
test_tree<ZCTestingIncrementalMerkleTree, ZCTestingIncrementalWitness>(root_tests, ser_tests, witness_ser_tests, path_tests);
}
TEST(merkletree, emptyroots) {
Array empty_roots = read_json(std::string(json_tests::merkle_roots_empty, json_tests::merkle_roots_empty + sizeof(json_tests::merkle_roots_empty)));
Array::iterator root_iterator = empty_roots.begin();
libzcash::EmptyMerkleRoots<64, libzcash::SHA256Compress> emptyroots;
for (size_t depth = 0; depth <= 64; depth++) {
expect_test_vector(root_iterator, emptyroots.empty_root(depth));
}
// Double check that we're testing (at least) all the empty roots we'll use.
ASSERT_TRUE(INCREMENTAL_MERKLE_TREE_DEPTH <= 64);
}
TEST(merkletree, emptyroot) {
// This literal is the depth-20 empty tree root with the bytes reversed to
// account for the fact that uint256S() loads a big-endian representation of
// an integer which converted to little-endian internally.
uint256 expected = uint256S("6af0c4cedfb34a98469ecb5af4909116c77e05a6095c4c4b4f44f30b85f22303");
ASSERT_TRUE(ZCIncrementalMerkleTree::empty_root() == expected);
}
TEST(merkletree, deserializeInvalid) {
// attempt to deserialize a small tree from a serialized large tree
// (exceeds depth well-formedness check)
@@ -293,7 +319,7 @@ TEST(merkletree, testZeroElements) {
for (int start = 0; start < 20; start++) {
ZCIncrementalMerkleTree newTree;
ASSERT_TRUE(newTree.root() == uint256());
ASSERT_TRUE(newTree.root() == ZCIncrementalMerkleTree::empty_root());
for (int i = start; i > 0; i--) {
newTree.append(uint256S("54d626e08c1c802b305dad30b7e54a82f102390cc92c7d4db112048935236e9c"));