Deprecate the old tree and remove old tree tests from the test suite.

This commit is contained in:
Sean Bowe
2016-04-03 16:05:08 -06:00
parent 482aefbd0d
commit 1760b3cd88
12 changed files with 85 additions and 323 deletions

View File

@@ -27,7 +27,6 @@ cd "${REPOROOT}"
# Test phases: # Test phases:
run_test_phase "${REPOROOT}/qa/zcash/ensure-no-dot-so-in-depends.py" run_test_phase "${REPOROOT}/qa/zcash/ensure-no-dot-so-in-depends.py"
run_test_phase "${REPOROOT}/src/zerocash/tests/merkleTest"
run_test_phase "${REPOROOT}/src/zerocash/tests/utilTest" run_test_phase "${REPOROOT}/src/zerocash/tests/utilTest"
# If make check fails, show test-suite.log as part of our run_test_phase # If make check fails, show test-suite.log as part of our run_test_phase

View File

@@ -1,6 +1,5 @@
bin_PROGRAMS += \ bin_PROGRAMS += \
zerocash/GenerateParamsForFiles \ zerocash/GenerateParamsForFiles \
zerocash/tests/merkleTest \
zerocash/tests/utilTest \ zerocash/tests/utilTest \
zerocash/tests/zerocashTest \ zerocash/tests/zerocashTest \
zerocash/tests/test_zerocash_pour_ppzksnark zerocash/tests/test_zerocash_pour_ppzksnark
@@ -13,14 +12,6 @@ zerocash_GenerateParamsForFiles_LDADD = \
$(LIBBITCOIN_CRYPTO) \ $(LIBBITCOIN_CRYPTO) \
$(LIBZEROCASH_LIBS) $(LIBZEROCASH_LIBS)
# tests for our incremental merkle tree
zerocash_tests_merkleTest_SOURCES = zerocash/tests/merkleTest.cpp
zerocash_tests_merkleTest_LDADD = \
$(BOOST_LIBS) \
$(LIBZEROCASH) \
$(LIBBITCOIN_CRYPTO) \
$(LIBZEROCASH_LIBS)
# tests for utilities that come with zerocash # tests for utilities that come with zerocash
zerocash_tests_utilTest_SOURCES = zerocash/tests/utilTest.cpp zerocash_tests_utilTest_SOURCES = zerocash/tests/utilTest.cpp
zerocash_tests_utilTest_LDADD = \ zerocash_tests_utilTest_LDADD = \
@@ -38,6 +29,7 @@ zerocash_tests_zerocashTest_SOURCES = \
zerocash_tests_zerocashTest_LDADD = \ zerocash_tests_zerocashTest_LDADD = \
$(BOOST_LIBS) \ $(BOOST_LIBS) \
$(LIBZEROCASH) \ $(LIBZEROCASH) \
$(LIBBITCOIN_UTIL) \
$(LIBBITCOIN_CRYPTO) \ $(LIBBITCOIN_CRYPTO) \
$(LIBZEROCASH_LIBS) $(LIBZEROCASH_LIBS)

View File

@@ -16,7 +16,6 @@
#include <boost/foreach.hpp> #include <boost/foreach.hpp>
#include <boost/unordered_map.hpp> #include <boost/unordered_map.hpp>
#include "zerocash/IncrementalMerkleTree.h"
#include "zcash/IncrementalMerkleTree.hpp" #include "zcash/IncrementalMerkleTree.hpp"
/** /**

View File

@@ -26,7 +26,6 @@
#include "json/json_spirit_writer_template.h" #include "json/json_spirit_writer_template.h"
#include "zerocash/ZerocashParams.h" #include "zerocash/ZerocashParams.h"
#include "zerocash/IncrementalMerkleTree.h"
#include "zerocash/PourInput.h" #include "zerocash/PourInput.h"
#include "zerocash/PourOutput.h" #include "zerocash/PourOutput.h"
#include "zerocash/Address.h" #include "zerocash/Address.h"
@@ -311,44 +310,35 @@ BOOST_AUTO_TEST_CASE(test_basic_pour_verification)
// Also, it's generally libzerocash's job to ensure // Also, it's generally libzerocash's job to ensure
// the integrity of the scheme through its own tests. // the integrity of the scheme through its own tests.
static const unsigned int TEST_TREE_DEPTH = 3;
// construct the r1cs keypair // construct the r1cs keypair
auto keypair = ZerocashParams::GenerateNewKeyPair(TEST_TREE_DEPTH); auto keypair = ZerocashParams::GenerateNewKeyPair(INCREMENTAL_MERKLE_TREE_DEPTH);
ZerocashParams p( ZerocashParams p(
TEST_TREE_DEPTH, INCREMENTAL_MERKLE_TREE_DEPTH,
&keypair &keypair
); );
// construct a merkle tree // construct a merkle tree
IncrementalMerkleTree merkleTree(TEST_TREE_DEPTH); ZCIncrementalMerkleTree merkleTree;
Address addr = Address::CreateNewRandomAddress(); Address addr = Address::CreateNewRandomAddress();
Coin coin(addr.getPublicAddress(), 100); Coin coin(addr.getPublicAddress(), 100);
// commitment from coin // commitment from coin
std::vector<bool> commitment(ZC_CM_SIZE * 8); uint256 commitment(coin.getCoinCommitment().getCommitmentValue());
convertBytesVectorToVector(coin.getCoinCommitment().getCommitmentValue(), commitment);
// insert commitment into the merkle tree // insert commitment into the merkle tree
std::vector<bool> index; merkleTree.append(commitment);
merkleTree.insertElement(commitment, index);
// compute the merkle root we will be working with // compute the merkle root we will be working with
vector<unsigned char> rt(ZC_ROOT_SIZE); uint256 rt = merkleTree.root();
{
vector<bool> root_bv(ZC_ROOT_SIZE * 8);
merkleTree.getRootValue(root_bv);
convertVectorToBytesVector(root_bv, rt);
}
merkle_authentication_path path(TEST_TREE_DEPTH); auto witness = merkleTree.witness();
merkleTree.getWitness(index, path); auto path = witness.path();
// create CPourTx // create CPourTx
CScript scriptPubKey; CScript scriptPubKey;
boost::array<PourInput, NUM_POUR_INPUTS> inputs = { boost::array<PourInput, NUM_POUR_INPUTS> inputs = {
PourInput(coin, addr, convertVectorToInt(index), path), PourInput(coin, addr, path),
PourInput(TEST_TREE_DEPTH) // dummy input of zero value PourInput(INCREMENTAL_MERKLE_TREE_DEPTH) // dummy input of zero value
}; };
boost::array<PourOutput, NUM_POUR_OUTPUTS> outputs = { boost::array<PourOutput, NUM_POUR_OUTPUTS> outputs = {
PourOutput(50), PourOutput(50),

View File

@@ -14,8 +14,6 @@
#include <utility> #include <utility>
#include <vector> #include <vector>
#include "zerocash/IncrementalMerkleTree.h"
class CBlockFileInfo; class CBlockFileInfo;
class CBlockIndex; class CBlockIndex;
struct CDiskTxPos; struct CDiskTxPos;

View File

@@ -2480,10 +2480,9 @@ Value zc_raw_receive(const json_spirit::Array& params, bool fHelp)
uint256 commitment = uint256(commitment_v); uint256 commitment = uint256(commitment_v);
assert(pwalletMain != NULL); assert(pwalletMain != NULL);
libsnark::merkle_authentication_path path(INCREMENTAL_MERKLE_TREE_DEPTH); // We don't care during receive... yet! :) libzcash::MerklePath path;
size_t path_index = 0;
uint256 anchor; uint256 anchor;
auto found_in_chain = pwalletMain->WitnessBucketCommitment(commitment, path, path_index, anchor); auto found_in_chain = pwalletMain->WitnessBucketCommitment(commitment, path, anchor);
CAmount value_of_bucket = decrypted_bucket.getValue(); CAmount value_of_bucket = decrypted_bucket.getValue();
@@ -2587,14 +2586,13 @@ Value zc_raw_pour(const json_spirit::Array& params, bool fHelp)
std::vector<unsigned char> commitment_v = input_coin.getCoinCommitment().getCommitmentValue(); std::vector<unsigned char> commitment_v = input_coin.getCoinCommitment().getCommitmentValue();
uint256 commitment = uint256(commitment_v); uint256 commitment = uint256(commitment_v);
libsnark::merkle_authentication_path path(INCREMENTAL_MERKLE_TREE_DEPTH); libzcash::MerklePath path;
size_t path_index = 0;
assert(pwalletMain != NULL); assert(pwalletMain != NULL);
if (!pwalletMain->WitnessBucketCommitment(commitment, path, path_index, anchor)) { if (!pwalletMain->WitnessBucketCommitment(commitment, path, anchor)) {
throw std::runtime_error("Couldn't find bucket in the blockchain"); throw std::runtime_error("Couldn't find bucket in the blockchain");
} }
vpourin.push_back(PourInput(input_coin, zcaddress, path_index, path)); vpourin.push_back(PourInput(input_coin, zcaddress, path));
} }
while (vpourin.size() < NUM_POUR_INPUTS) { while (vpourin.size() < NUM_POUR_INPUTS) {

View File

@@ -1052,15 +1052,12 @@ bool CWalletTx::WriteToDisk(CWalletDB *pwalletdb)
} }
bool CWallet::WitnessBucketCommitment(uint256 &commitment, bool CWallet::WitnessBucketCommitment(uint256 &commitment,
libsnark::merkle_authentication_path& path, libzcash::MerklePath &path,
size_t &path_index,
uint256 &final_anchor) uint256 &final_anchor)
{ {
bool res = false;
std::vector<bool> commitment_index;
CBlockIndex* pindex = chainActive.Genesis(); CBlockIndex* pindex = chainActive.Genesis();
libzerocash::IncrementalMerkleTree tree(INCREMENTAL_MERKLE_TREE_DEPTH); ZCIncrementalMerkleTree tree;
boost::optional<ZCIncrementalWitness> witness = boost::none;
uint256 current_anchor; uint256 current_anchor;
while (pindex) { while (pindex) {
@@ -1073,25 +1070,23 @@ bool CWallet::WitnessBucketCommitment(uint256 &commitment,
{ {
BOOST_FOREACH(const uint256 &bucket_commitment, pour.commitments) BOOST_FOREACH(const uint256 &bucket_commitment, pour.commitments)
{ {
std::vector<bool> commitment_bv(ZC_CM_SIZE * 8); if (witness) {
std::vector<bool> index; witness->append(bucket_commitment);
std::vector<unsigned char> commitment_value(bucket_commitment.begin(), bucket_commitment.end()); } else {
libzerocash::convertBytesVectorToVector(commitment_value, commitment_bv); tree.append(bucket_commitment);
assert(tree.insertElement(commitment_bv, index));
if (bucket_commitment == commitment) { if (bucket_commitment == commitment) {
// We've found it! Now, we construct a witness. witness = tree.witness();
res = true; }
commitment_index = index;
} }
} }
} }
} }
{ if (witness) {
std::vector<unsigned char> newrt_v(32); current_anchor = witness->root();
tree.getRootValue(newrt_v); } else {
current_anchor = uint256(newrt_v); current_anchor = tree.root();
} }
// Consistency check: we should be able to find the current tree // Consistency check: we should be able to find the current tree
@@ -1102,14 +1097,14 @@ bool CWallet::WitnessBucketCommitment(uint256 &commitment,
pindex = chainActive.Next(pindex); pindex = chainActive.Next(pindex);
} }
if (res) { if (witness) {
assert(tree.getWitness(commitment_index, path)); path = witness->path();
final_anchor = current_anchor;
return true;
} }
path_index = libzerocash::convertVectorToInt(commitment_index); return false;
final_anchor = current_anchor;
return res;
} }
/** /**

View File

@@ -616,7 +616,7 @@ public:
void SyncTransaction(const CTransaction& tx, const CBlock* pblock); void SyncTransaction(const CTransaction& tx, const CBlock* pblock);
bool AddToWalletIfInvolvingMe(const CTransaction& tx, const CBlock* pblock, bool fUpdate); bool AddToWalletIfInvolvingMe(const CTransaction& tx, const CBlock* pblock, bool fUpdate);
void EraseFromWallet(const uint256 &hash); void EraseFromWallet(const uint256 &hash);
bool WitnessBucketCommitment(uint256 &commitment, libsnark::merkle_authentication_path& path, size_t &path_index, uint256 &final_anchor); bool WitnessBucketCommitment(uint256 &commitment, libzcash::MerklePath& path, uint256 &final_anchor);
int ScanForWalletTransactions(CBlockIndex* pindexStart, bool fUpdate = false); int ScanForWalletTransactions(CBlockIndex* pindexStart, bool fUpdate = false);
void ReacceptWalletTransactions(); void ReacceptWalletTransactions();
void ResendWalletTransactions(int64_t nBestBlockTime); void ResendWalletTransactions(int64_t nBestBlockTime);

View File

@@ -11,7 +11,6 @@
* @copyright MIT license (see LICENSE file) * @copyright MIT license (see LICENSE file)
*****************************************************************************/ *****************************************************************************/
#include "IncrementalMerkleTree.h"
#include "PourInput.h" #include "PourInput.h"
namespace libzerocash { namespace libzerocash {
@@ -21,27 +20,20 @@ PourInput::PourInput(int tree_depth): old_coin(), merkle_index(), path() {
this->old_coin = Coin(this->old_address.getPublicAddress(), 0); this->old_coin = Coin(this->old_address.getPublicAddress(), 0);
// dummy merkle tree ZCIncrementalMerkleTree merkleTree;
IncrementalMerkleTree merkleTree(tree_depth); merkleTree.append(uint256(this->old_coin.getCoinCommitment().getCommitmentValue()));
// commitment from coin auto witness = merkleTree.witness();
std::vector<bool> commitment(ZC_CM_SIZE * 8); auto merkle_path = witness.path();
convertBytesVectorToVector(this->old_coin.getCoinCommitment().getCommitmentValue(), commitment);
// insert commitment into the merkle tree this->path = merkle_path.authentication_path;
std::vector<bool> index; this->merkle_index = convertVectorToInt(merkle_path.index);
merkleTree.insertElement(commitment, index);
merkleTree.getWitness(index, this->path);
this->merkle_index = 1;
} }
PourInput::PourInput(Coin old_coin, PourInput::PourInput(Coin old_coin,
Address old_address, Address old_address,
size_t merkle_index, const libzcash::MerklePath &path) : old_address(old_address), old_coin(old_coin), path(path.authentication_path) {
merkle_authentication_path path) : old_coin(old_coin), merkle_index(merkle_index), path(path) { this->merkle_index = convertVectorToInt(path.index);
this->old_address = old_address;
}; };
} /* namespace libzerocash */ } /* namespace libzerocash */

View File

@@ -15,6 +15,8 @@
#include "Coin.h" #include "Coin.h"
#include "ZerocashParams.h" #include "ZerocashParams.h"
#include "zcash/IncrementalMerkleTree.hpp"
namespace libzerocash { namespace libzerocash {
class PourInput { class PourInput {
@@ -23,8 +25,7 @@ public:
PourInput(Coin old_coin, PourInput(Coin old_coin,
Address old_address, Address old_address,
size_t merkle_index, const libzcash::MerklePath& path);
merkle_authentication_path path);
Coin old_coin; Coin old_coin;
Address old_address; Address old_address;

View File

@@ -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
);
}

View File

@@ -29,20 +29,20 @@
#include "zerocash/PourOutput.h" #include "zerocash/PourOutput.h"
#include "zerocash/utils/util.h" #include "zerocash/utils/util.h"
#include "uint256.h"
using namespace std; using namespace std;
using namespace libsnark; using namespace libsnark;
#define TEST_TREE_DEPTH 4
BOOST_AUTO_TEST_CASE( SaveAndLoadKeysFromFiles ) { BOOST_AUTO_TEST_CASE( SaveAndLoadKeysFromFiles ) {
cout << "\nSaveAndLoadKeysFromFiles TEST\n" << endl; cout << "\nSaveAndLoadKeysFromFiles TEST\n" << endl;
cout << "Creating Params...\n" << endl; cout << "Creating Params...\n" << endl;
libzerocash::timer_start("Param Generation"); libzerocash::timer_start("Param Generation");
auto keypair = libzerocash::ZerocashParams::GenerateNewKeyPair(TEST_TREE_DEPTH); auto keypair = libzerocash::ZerocashParams::GenerateNewKeyPair(INCREMENTAL_MERKLE_TREE_DEPTH);
libzerocash::ZerocashParams p( libzerocash::ZerocashParams p(
TEST_TREE_DEPTH, INCREMENTAL_MERKLE_TREE_DEPTH,
&keypair &keypair
); );
libzerocash::timer_stop("Param Generation"); libzerocash::timer_stop("Param Generation");
@@ -72,11 +72,11 @@ BOOST_AUTO_TEST_CASE( SaveAndLoadKeysFromFiles ) {
libzerocash::timer_stop("Saving Verification Key"); libzerocash::timer_stop("Saving Verification Key");
libzerocash::timer_start("Loading Proving Key"); libzerocash::timer_start("Loading Proving Key");
auto pk_loaded = libzerocash::ZerocashParams::LoadProvingKeyFromFile(pk_path, TEST_TREE_DEPTH); auto pk_loaded = libzerocash::ZerocashParams::LoadProvingKeyFromFile(pk_path, INCREMENTAL_MERKLE_TREE_DEPTH);
libzerocash::timer_stop("Loading Proving Key"); libzerocash::timer_stop("Loading Proving Key");
libzerocash::timer_start("Loading Verification Key"); libzerocash::timer_start("Loading Verification Key");
auto vk_loaded = libzerocash::ZerocashParams::LoadVerificationKeyFromFile(vk_path, TEST_TREE_DEPTH); auto vk_loaded = libzerocash::ZerocashParams::LoadVerificationKeyFromFile(vk_path, INCREMENTAL_MERKLE_TREE_DEPTH);
libzerocash::timer_stop("Loading Verification Key"); libzerocash::timer_stop("Loading Verification Key");
cout << "Comparing Proving and Verification key.\n" << endl; cout << "Comparing Proving and Verification key.\n" << endl;
@@ -107,19 +107,19 @@ BOOST_AUTO_TEST_CASE( SaveAndLoadKeysFromFiles ) {
} }
cout << "Creating Merkle Tree...\n" << endl; cout << "Creating Merkle Tree...\n" << endl;
libzerocash::IncrementalMerkleTree merkleTree(coinValues, TEST_TREE_DEPTH); libzerocash::IncrementalMerkleTree merkleTree(coinValues, INCREMENTAL_MERKLE_TREE_DEPTH);
cout << "Successfully created Merkle Tree.\n" << endl; cout << "Successfully created Merkle Tree.\n" << endl;
std::vector<bool> index; std::vector<bool> index;
cout << "Creating Witness 1...\n" << endl; cout << "Creating Witness 1...\n" << endl;
merkle_authentication_path witness_1(TEST_TREE_DEPTH); merkle_authentication_path witness_1(INCREMENTAL_MERKLE_TREE_DEPTH);
libzerocash::convertIntToVector(1, index); libzerocash::convertIntToVector(1, index);
merkleTree.getWitness(index, witness_1); merkleTree.getWitness(index, witness_1);
cout << "Successfully created Witness 1.\n" << endl; cout << "Successfully created Witness 1.\n" << endl;
cout << "Creating Witness 2...\n" << endl; cout << "Creating Witness 2...\n" << endl;
merkle_authentication_path witness_2(TEST_TREE_DEPTH); merkle_authentication_path witness_2(INCREMENTAL_MERKLE_TREE_DEPTH);
libzerocash::convertIntToVector(3, index); libzerocash::convertIntToVector(3, index);
merkleTree.getWitness(index, witness_2); merkleTree.getWitness(index, witness_2);
cout << "Successfully created Witness 2.\n" << endl; cout << "Successfully created Witness 2.\n" << endl;
@@ -170,7 +170,7 @@ BOOST_AUTO_TEST_CASE( SaveAndLoadKeysFromFiles ) {
BOOST_AUTO_TEST_CASE( PourInputOutputTest ) { BOOST_AUTO_TEST_CASE( PourInputOutputTest ) {
// dummy input // dummy input
{ {
libzerocash::PourInput input(TEST_TREE_DEPTH); libzerocash::PourInput input(INCREMENTAL_MERKLE_TREE_DEPTH);
BOOST_CHECK(input.old_coin.getValue() == 0); BOOST_CHECK(input.old_coin.getValue() == 0);
BOOST_CHECK(input.old_address.getPublicAddress() == input.old_coin.getPublicAddress()); BOOST_CHECK(input.old_address.getPublicAddress() == input.old_coin.getPublicAddress());
@@ -192,10 +192,10 @@ void test_pour(libzerocash::ZerocashParams& p,
std::vector<uint64_t> inputs, // values of the inputs (max 2) std::vector<uint64_t> inputs, // values of the inputs (max 2)
std::vector<uint64_t> outputs) // values of the outputs (max 2) std::vector<uint64_t> outputs) // values of the outputs (max 2)
{ {
using pour_input_state = std::tuple<libzerocash::Address, libzerocash::Coin, std::vector<bool>>; using pour_input_state = std::tuple<libzerocash::Address, libzerocash::Coin, ZCIncrementalWitness>;
// Construct incremental merkle tree // Construct incremental merkle tree
libzerocash::IncrementalMerkleTree merkleTree(TEST_TREE_DEPTH); ZCIncrementalMerkleTree merkleTree;
// Dummy sig_pk // Dummy sig_pk
vector<unsigned char> as(ZC_SIG_PK_SIZE, 'a'); vector<unsigned char> as(ZC_SIG_PK_SIZE, 'a');
@@ -210,33 +210,30 @@ void test_pour(libzerocash::ZerocashParams& p,
libzerocash::Coin coin(addr.getPublicAddress(), *it); libzerocash::Coin coin(addr.getPublicAddress(), *it);
// commitment from coin // commitment from coin
std::vector<bool> commitment(ZC_CM_SIZE * 8); uint256 commitment(coin.getCoinCommitment().getCommitmentValue());
libzerocash::convertBytesVectorToVector(coin.getCoinCommitment().getCommitmentValue(), commitment);
// insert commitment into the merkle tree // insert commitment into the merkle tree
std::vector<bool> index; merkleTree.append(commitment);
merkleTree.insertElement(commitment, index);
// and append to any witnesses
for(vector<pour_input_state>::iterator wit = input_state.begin(); wit != input_state.end(); ++wit) {
std::get<2>(*wit).append(commitment);
}
// store the state temporarily // store the state temporarily
input_state.push_back(std::make_tuple(addr, coin, index)); input_state.push_back(std::make_tuple(addr, coin, merkleTree.witness()));
} }
// compute the merkle root we will be working with // compute the merkle root we will be working with
vector<unsigned char> rt(ZC_ROOT_SIZE); auto rt_u = merkleTree.root();
{ std::vector<unsigned char> rt(rt_u.begin(), rt_u.end());
vector<bool> root_bv(ZC_ROOT_SIZE * 8);
merkleTree.getRootValue(root_bv);
libzerocash::convertVectorToBytesVector(root_bv, rt);
}
// get witnesses for all the input coins and construct the pours // get witnesses for all the input coins and construct the pours
for(vector<pour_input_state>::iterator it = input_state.begin(); it != input_state.end(); ++it) { for(vector<pour_input_state>::iterator it = input_state.begin(); it != input_state.end(); ++it) {
merkle_authentication_path path(TEST_TREE_DEPTH); auto witness = std::get<2>(*it);
auto path = witness.path();
auto index = std::get<2>(*it); pour_inputs.push_back(libzerocash::PourInput(std::get<1>(*it), std::get<0>(*it), path));
merkleTree.getWitness(index, path);
pour_inputs.push_back(libzerocash::PourInput(std::get<1>(*it), std::get<0>(*it), libzerocash::convertVectorToInt(index), path));
} }
// construct dummy outputs with the given values // construct dummy outputs with the given values
@@ -250,9 +247,9 @@ void test_pour(libzerocash::ZerocashParams& p,
} }
BOOST_AUTO_TEST_CASE( PourVpubInTest ) { BOOST_AUTO_TEST_CASE( PourVpubInTest ) {
auto keypair = libzerocash::ZerocashParams::GenerateNewKeyPair(TEST_TREE_DEPTH); auto keypair = libzerocash::ZerocashParams::GenerateNewKeyPair(INCREMENTAL_MERKLE_TREE_DEPTH);
libzerocash::ZerocashParams p( libzerocash::ZerocashParams p(
TEST_TREE_DEPTH, INCREMENTAL_MERKLE_TREE_DEPTH,
&keypair &keypair
); );
@@ -331,9 +328,9 @@ BOOST_AUTO_TEST_CASE( PourTxTest ) {
cout << "Creating Params...\n" << endl; cout << "Creating Params...\n" << endl;
libzerocash::timer_start("Param Generation"); libzerocash::timer_start("Param Generation");
auto keypair = libzerocash::ZerocashParams::GenerateNewKeyPair(TEST_TREE_DEPTH); auto keypair = libzerocash::ZerocashParams::GenerateNewKeyPair(INCREMENTAL_MERKLE_TREE_DEPTH);
libzerocash::ZerocashParams p( libzerocash::ZerocashParams p(
TEST_TREE_DEPTH, INCREMENTAL_MERKLE_TREE_DEPTH,
&keypair &keypair
); );
libzerocash::timer_stop("Param Generation"); libzerocash::timer_stop("Param Generation");
@@ -363,12 +360,12 @@ BOOST_AUTO_TEST_CASE( PourTxTest ) {
cout << "Creating Merkle Tree...\n" << endl; cout << "Creating Merkle Tree...\n" << endl;
libzerocash::timer_start("Merkle Tree"); libzerocash::timer_start("Merkle Tree");
libzerocash::IncrementalMerkleTree merkleTree(coinValues, TEST_TREE_DEPTH); libzerocash::IncrementalMerkleTree merkleTree(coinValues, INCREMENTAL_MERKLE_TREE_DEPTH);
libzerocash::timer_stop("Merkle Tree"); libzerocash::timer_stop("Merkle Tree");
cout << "Successfully created Merkle Tree.\n" << endl; cout << "Successfully created Merkle Tree.\n" << endl;
merkle_authentication_path witness_1(TEST_TREE_DEPTH); merkle_authentication_path witness_1(INCREMENTAL_MERKLE_TREE_DEPTH);
libzerocash::timer_start("Witness"); libzerocash::timer_start("Witness");
std::vector<bool> index; std::vector<bool> index;
@@ -384,7 +381,7 @@ BOOST_AUTO_TEST_CASE( PourTxTest ) {
} }
cout << "\n" << endl; cout << "\n" << endl;
merkle_authentication_path witness_2(TEST_TREE_DEPTH); merkle_authentication_path witness_2(INCREMENTAL_MERKLE_TREE_DEPTH);
libzerocash::convertIntToVector(3, index); libzerocash::convertIntToVector(3, index);
if (merkleTree.getWitness(index, witness_2) == false) { if (merkleTree.getWitness(index, witness_2) == false) {
cout << "Could not get witness" << endl; cout << "Could not get witness" << endl;
@@ -539,9 +536,9 @@ BOOST_AUTO_TEST_CASE( SimpleTxTest ) {
cout << "\nSIMPLE TRANSACTION TEST\n" << endl; cout << "\nSIMPLE TRANSACTION TEST\n" << endl;
libzerocash::timer_start("Param Generation"); libzerocash::timer_start("Param Generation");
auto keypair = libzerocash::ZerocashParams::GenerateNewKeyPair(TEST_TREE_DEPTH); auto keypair = libzerocash::ZerocashParams::GenerateNewKeyPair(INCREMENTAL_MERKLE_TREE_DEPTH);
libzerocash::ZerocashParams p( libzerocash::ZerocashParams p(
TEST_TREE_DEPTH, INCREMENTAL_MERKLE_TREE_DEPTH,
&keypair &keypair
); );
libzerocash::timer_stop("Param Generation"); libzerocash::timer_stop("Param Generation");
@@ -571,13 +568,13 @@ BOOST_AUTO_TEST_CASE( SimpleTxTest ) {
} }
cout << "Creating Merkle Tree...\n" << endl; cout << "Creating Merkle Tree...\n" << endl;
libzerocash::IncrementalMerkleTree merkleTree(coinValues, TEST_TREE_DEPTH); libzerocash::IncrementalMerkleTree merkleTree(coinValues, INCREMENTAL_MERKLE_TREE_DEPTH);
cout << "Successfully created Merkle Tree.\n" << endl; cout << "Successfully created Merkle Tree.\n" << endl;
std::vector<bool> index; std::vector<bool> index;
cout << "Creating Witness 1...\n" << endl; cout << "Creating Witness 1...\n" << endl;
merkle_authentication_path witness_1(TEST_TREE_DEPTH); merkle_authentication_path witness_1(INCREMENTAL_MERKLE_TREE_DEPTH);
libzerocash::convertIntToVector(1, index); libzerocash::convertIntToVector(1, index);
if (merkleTree.getWitness(index, witness_1) == false) { if (merkleTree.getWitness(index, witness_1) == false) {
BOOST_ERROR("Could not get witness"); BOOST_ERROR("Could not get witness");
@@ -585,7 +582,7 @@ BOOST_AUTO_TEST_CASE( SimpleTxTest ) {
cout << "Successfully created Witness 1.\n" << endl; cout << "Successfully created Witness 1.\n" << endl;
cout << "Creating Witness 2...\n" << endl; cout << "Creating Witness 2...\n" << endl;
merkle_authentication_path witness_2(TEST_TREE_DEPTH); merkle_authentication_path witness_2(INCREMENTAL_MERKLE_TREE_DEPTH);
libzerocash::convertIntToVector(3, index); libzerocash::convertIntToVector(3, index);
if (merkleTree.getWitness(index, witness_2) == false) { if (merkleTree.getWitness(index, witness_2) == false) {
cout << "Could not get witness" << endl; cout << "Could not get witness" << endl;