lbrycrd/src/test/claimtriebranching_tests.cpp

// Copyright (c) 2015 The LBRY Foundation
// Distributed under the MIT software license, see the accompanying
// file COPYING or http://opensource.org/licenses/mit-license.php

#include <chainparams.h>
#include <claimtrie.h>
#include <coins.h>
#include <consensus/merkle.h>
#include <consensus/validation.h>
#include <miner.h>
#include <nameclaim.h>
#include <policy/policy.h>
#include <pow.h>
#include <primitives/transaction.h>
#include <rpc/server.h>
#include <streams.h>
#include <test/test_bitcoin.h>
#include <txmempool.h>
#include <validation.h>

#include <boost/test/unit_test.hpp>
#include <iostream>
#include <random>

extern ::CChainState g_chainstate;
extern ::ArgsManager gArgs;

using namespace std;

BOOST_FIXTURE_TEST_SUITE(claimtriebranching_tests, RegTestingSetup)

static const boost::test_tools::predicate_result predicate_true(true);
static const boost::test_tools::predicate_result predicate_false(false);

//is a claim in queue
boost::test_tools::predicate_result
is_claim_in_queue(std::string name, const CTransaction &tx)
{
    COutPoint outPoint(tx.GetHash(), 0);
    int validAtHeight;
    if (pclaimTrie->haveClaimInQueue(name, outPoint, validAtHeight))
        return true;

    boost::test_tools::predicate_result res(false);
    res.message() << "Is not a claim in queue.";
    return res;
}

// check if tx is best claim based on outpoint
boost::test_tools::predicate_result
is_best_claim(std::string name, const CTransaction &tx)
{
    CClaimValue val;
    COutPoint outPoint(tx.GetHash(), 0);
    const bool have_claim = pclaimTrie->haveClaim(name, outPoint);
    const bool have_info = pclaimTrie->getInfoForName(name, val);
    if (have_claim && have_info && val.outPoint == outPoint)
        return true;

    boost::test_tools::predicate_result res(false);
    res.message() << "Is not best claim";
    return res;
}
// check effective quantity of best claim
boost::test_tools::predicate_result
best_claim_effective_amount_equals(std::string name, CAmount amount)
{
    CClaimValue val;
    CClaimTrieCache cache(pclaimTrie);
    if (!cache.getInfoForName(name, val))
    {
        boost::test_tools::predicate_result res(false);
        res.message() << "No claim found";
        return res;
    }

    const CAmount effective_amount = cache.getEffectiveAmountForClaim(name, val.claimId);
    if (effective_amount != amount)
    {
        boost::test_tools::predicate_result res(false);
        res.message() << amount << " != " << effective_amount;
        return res;
    }

    return true;
}

CMutableTransaction BuildTransaction(const CTransaction& prev, uint32_t prevout=0, unsigned int numOutputs=1)
{
    CMutableTransaction tx;
    tx.nVersion = CTransaction::CURRENT_VERSION;
    tx.nLockTime = 1 << 31; // Disable BIP68
    tx.vin.resize(1);
    tx.vout.resize(numOutputs);
    tx.vin[0].prevout.hash = prev.GetHash();
    tx.vin[0].prevout.n = prevout;
    tx.vin[0].scriptSig = CScript();
    tx.vin[0].nSequence = std::numeric_limits<unsigned int>::max();
    CAmount valuePerOutput = prev.vout[prevout].nValue;
    unsigned int numOutputsCopy = numOutputs;
    while ((numOutputsCopy = numOutputsCopy >> 1) > 0)
    {
        valuePerOutput = valuePerOutput >> 1;
    }
    for (unsigned int i = 0; i < numOutputs; ++i)
    {
        tx.vout[i].scriptPubKey = CScript();
        tx.vout[i].nValue = valuePerOutput;
    }

    return tx;
}

static BlockAssembler AssemblerForTest()
{
    BlockAssembler::Options options;
    options.nBlockMaxWeight = DEFAULT_BLOCK_MAX_WEIGHT;
    options.blockMinFeeRate = CFeeRate(0);
    return BlockAssembler(Params(), options);
}

// Test Fixtures
struct ClaimTrieChainFixture
{
    std::vector<CTransaction> coinbase_txs;
    std::vector<int> marks;
    int coinbase_txs_used;
    int unique_block_counter;
    int normalization_original;
    unsigned int num_txs_for_next_block;

    int64_t expirationForkHeight;
    int64_t originalExpiration;
    int64_t extendedExpiration;

    ClaimTrieChainFixture():
        expirationForkHeight(-1), unique_block_counter(0), normalization_original(-1)
    {
        fRequireStandard = false;
        BOOST_CHECK_EQUAL(pclaimTrie->nCurrentHeight, chainActive.Height() + 1);
        setNormalizationForkHeight(1000000);

        gArgs.ForceSetArg("-limitancestorcount", "1000000");
        gArgs.ForceSetArg("-limitancestorsize", "1000000");
        gArgs.ForceSetArg("-limitdescendantcount", "1000000");
        gArgs.ForceSetArg("-limitdescendantsize", "1000000");

        num_txs_for_next_block = 0;
        coinbase_txs_used = 0;
        unique_block_counter = 0;
        // generate coinbases to spend
        CreateCoinbases(40, coinbase_txs);
    }

    ~ClaimTrieChainFixture()
    {
        DecrementBlocks(chainActive.Height());
        if (normalization_original >= 0)
        {
            auto& consensus = const_cast<Consensus::Params&>(Params().GetConsensus());
            consensus.nNormalizedNameForkHeight = normalization_original;
        }
        if (expirationForkHeight >= 0) {
            const Consensus::Params& consensus = Params().GetConsensus();
            const_cast<Consensus::Params&>(consensus).nExtendedClaimExpirationForkHeight = expirationForkHeight;
            const_cast<Consensus::Params&>(consensus).nExtendedClaimExpirationTime = extendedExpiration;
            const_cast<Consensus::Params&>(consensus).nOriginalClaimExpirationTime = originalExpiration;
            pclaimTrie->setExpirationTime(originalExpiration);
        }
    }

    void setExpirationForkHeight(int targetMinusCurrent, int64_t preForkExpirationTime, int64_t postForkExpirationTime) {
        int target = chainActive.Height() + targetMinusCurrent;
        const Consensus::Params& consensus = Params().GetConsensus();
        if (expirationForkHeight < 0) {
            expirationForkHeight = consensus.nExtendedClaimExpirationForkHeight;
            originalExpiration = consensus.nOriginalClaimExpirationTime;
            extendedExpiration = consensus.nExtendedClaimExpirationTime;
        }
        const_cast<Consensus::Params&>(consensus).nExtendedClaimExpirationForkHeight = target;
        const_cast<Consensus::Params&>(consensus).nExtendedClaimExpirationTime = postForkExpirationTime;
        const_cast<Consensus::Params&>(consensus).nOriginalClaimExpirationTime = preForkExpirationTime;
        pclaimTrie->setExpirationTime(targetMinusCurrent >= 0 ? preForkExpirationTime : postForkExpirationTime);
    }

    void setNormalizationForkHeight(int targetMinusCurrent) {
        int target = chainActive.Height() + targetMinusCurrent;
        auto& consensus = const_cast<Consensus::Params&>(Params().GetConsensus());
        if (normalization_original < 0)
            normalization_original = consensus.nNormalizedNameForkHeight;
        consensus.nNormalizedNameForkHeight = target;
    }

    bool CreateBlock(const std::unique_ptr<CBlockTemplate>& pblocktemplate)
    {
        CBlock* pblock = &pblocktemplate->block;
        {
            LOCK(cs_main);
            pblock->nVersion = 5;
            pblock->hashPrevBlock = chainActive.Tip()->GetBlockHash();
            pblock->nTime = chainActive.Tip()->GetBlockTime() + Params().GetConsensus().nPowTargetSpacing;
            CMutableTransaction txCoinbase(*pblock->vtx[0]);
            txCoinbase.vin[0].scriptSig = CScript() << int(chainActive.Height() + 1) << int(++unique_block_counter);
            txCoinbase.vout[0].nValue = GetBlockSubsidy(chainActive.Height() + 1, Params().GetConsensus());
            pblock->vtx[0] = MakeTransactionRef(std::move(txCoinbase));
            pblock->hashMerkleRoot = BlockMerkleRoot(*pblock);
            for (uint32_t i = 0;; ++i) {
                pblock->nNonce = i;
                if (CheckProofOfWork(pblock->GetPoWHash(), pblock->nBits, Params().GetConsensus())) {
                    break;
                }
            }
        }
        return ProcessNewBlock(Params(), std::make_shared<const CBlock>(*pblock), true, nullptr) && pblock->GetHash() == chainActive.Tip()->GetBlockHash();
    }

    bool CreateCoinbases(unsigned int num_coinbases, std::vector<CTransaction>& coinbases)
    {
        coinbases.clear();
        std::unique_ptr<CBlockTemplate> pblocktemplate = AssemblerForTest().CreateNewBlock(CScript() << OP_TRUE);
        BOOST_CHECK_EQUAL(pblocktemplate != nullptr, true);
        BOOST_CHECK_EQUAL(pblocktemplate->block.vtx.size(), static_cast<size_t>(1));
        for (unsigned int i = 0; i < 100 + num_coinbases; ++i) {
            BOOST_CHECK_EQUAL(CreateBlock(pblocktemplate), true);
            if (coinbases.size() < num_coinbases)
                coinbases.push_back(std::move(*pblocktemplate->block.vtx[0]));
        }
        return true;
    }

    void CommitTx(const CMutableTransaction &tx) {
        num_txs_for_next_block++;

        /* TestMemPoolEntryHelper entry; */
        /* LOCK(mempool.cs); */
        /* mempool.addUnchecked(tx.GetHash(), entry.Fee(0).Time(GetTime()).SpendsCoinbase(true).FromTx(tx)); */
        CValidationState state;
        CAmount txFeeRate = CAmount(0);
        LOCK(cs_main);
        assert(AcceptToMemoryPool(mempool, state, MakeTransactionRef(tx), nullptr, nullptr, false, txFeeRate, false));
    }

    //spend a bid into some non claimtrie related unspent
    CMutableTransaction Spend(const CTransaction &prev)
    {
        CMutableTransaction tx = BuildTransaction(prev, 0);
        tx.vout[0].scriptPubKey = CScript() << OP_TRUE;
        tx.vout[0].nValue = prev.vout[0].nValue;

        CommitTx(tx);
        return tx;
    }

    //make claim at the current block
    CMutableTransaction MakeClaim(const CTransaction& prev, std::string name, std::string value, CAmount quantity)
    {
        uint32_t prevout = prev.vout.size() - 1;
        while (prevout > 0 && prev.vout[prevout].nValue < quantity)
            --prevout;
        CMutableTransaction tx = BuildTransaction(prev, prevout, prev.vout[prevout].nValue > quantity ? 2 : 1);
        tx.vout[0].scriptPubKey = ClaimNameScript(name, value);
        tx.vout[0].nValue = quantity;
        if (tx.vout.size() > 1) {
            tx.vout[1].scriptPubKey = CScript() << OP_TRUE;
            tx.vout[1].nValue = prev.vout[prevout].nValue - quantity;
        }

        CommitTx(tx);
        return tx;
    }

    CMutableTransaction MakeClaim(const CTransaction& prev, std::string name, std::string value)
    {
        return MakeClaim(prev, name, value, prev.vout[0].nValue);
    }

    //make support at the current block
    CMutableTransaction MakeSupport(const CTransaction &prev, const CTransaction &claimtx, std::string name, CAmount quantity)
    {
        uint32_t prevout = prev.vout.size() - 1;
        while (prevout > 0 && prev.vout[prevout].nValue < quantity)
            --prevout;
        CMutableTransaction tx = BuildTransaction(prev, prevout, prev.vout[prevout].nValue > quantity ? 2 : 1);
        tx.vout[0].scriptPubKey = SupportClaimScript(name, ClaimIdHash(claimtx.GetHash(), 0));
        tx.vout[0].nValue = quantity;
        if (tx.vout.size() > 1) {
            tx.vout[1].scriptPubKey = CScript() << OP_TRUE;
            tx.vout[1].nValue = prev.vout[prevout].nValue - quantity;
        }

        CommitTx(tx);
        return tx;
    }

    //make update at the current block
    CMutableTransaction MakeUpdate(const CTransaction &prev, std::string name, std::string value,
                                   uint160 claimId, CAmount quantity)
    {
        CMutableTransaction tx = BuildTransaction(prev, 0);
        tx.vout[0].scriptPubKey = UpdateClaimScript(name, claimId, value);
        tx.vout[0].nValue = quantity;

        CommitTx(tx);
        return tx;
    }

    CTransaction GetCoinbase()
    {
        auto tx = coinbase_txs.at(coinbase_txs_used++);
        return tx;
    }

    //create i blocks
    void IncrementBlocks(int num_blocks, bool mark = false)
    {
        if (mark)
            marks.push_back(chainActive.Height());

        for (int i = 0; i < num_blocks; ++i)
        {
            CScript coinbase_scriptpubkey;
            coinbase_scriptpubkey << CScriptNum(chainActive.Height());
            std::unique_ptr<CBlockTemplate> pblocktemplate = AssemblerForTest().CreateNewBlock(coinbase_scriptpubkey);
            BOOST_CHECK_EQUAL(pblocktemplate != nullptr, true);
            BOOST_CHECK_EQUAL(pblocktemplate->block.vtx.size(), num_txs_for_next_block + 1);
            BOOST_CHECK_EQUAL(CreateBlock(pblocktemplate), true);
            num_txs_for_next_block = 0 ;
        }
    }

    //disconnect i blocks from tip
    void DecrementBlocks(int num_blocks)
    {
        CValidationState state;
        {
            LOCK(cs_main);
            CBlockIndex* pblockindex = chainActive[chainActive.Height() - num_blocks + 1];
            BOOST_CHECK_EQUAL(InvalidateBlock(state, Params(), pblockindex), true);
        }
        BOOST_CHECK_EQUAL(state.IsValid(), true);
        BOOST_CHECK_EQUAL(ActivateBestChain(state, Params()), true);
        mempool.clear();
        num_txs_for_next_block = 0;
    }

    // decrement back to last mark
    void DecrementBlocks()
    {
        int mark = marks.back();
        marks.pop_back();
        DecrementBlocks(chainActive.Height() - mark);
    }

    void WriteClearReadClaimTrie()
    {
        // this will simulate restart of lbrycrdd by writing the claimtrie to disk,
        // clearing the-in memory claimtrie, and then reading the saved claimtrie
        // from disk
        pclaimTrie->WriteToDisk();
        pclaimTrie->clear();
        pclaimTrie->ReadFromDisk(true);
    }
};

std::vector<std::string> random_strings(std::size_t count)
{
    static auto& chrs = "0123456789"
                        "abcdefghijklmnopqrstuvwxyz"
                        "ABCDEFGHIJKLMNOPQRSTUVWXYZ";

    std::mt19937 rg(42);
    std::uniform_int_distribution<std::string::size_type> pick(1, sizeof(chrs) - 2);

    std::unordered_set<std::string> strings;
    strings.reserve(count);

    while(strings.size() < count) {
        auto length = pick(rg);

        std::string s;
        s.reserve(length);

        while (length--)
            s += chrs[pick(rg)];

        strings.emplace(s);
    }

    std::vector<std::string> ret(strings.begin(), strings.end());
    std::shuffle(ret.begin(), ret.end(), rg);
    return ret;
}

BOOST_AUTO_TEST_CASE(triehash_fuzzer_test)
{
    ClaimTrieChainFixture fixture;

    auto envClaims = std::getenv("TRIEHASH_FUZZER_CLAIMS");
    auto envBlocks = std::getenv("TRIEHASH_FUZZER_BLOCKS");

    const int claimsPerBlock = envClaims ? atoi(envClaims) : 100;
    const int blocks = envBlocks ? atoi(envBlocks) : 13;

    auto names = random_strings(blocks * claimsPerBlock);

    std::mt19937 rg(42);
    std::uniform_int_distribution<int> pick4(0, 4);
    std::uniform_int_distribution<std::size_t> pick;
    std::unordered_map<std::string, std::vector<CMutableTransaction>> existingClaims;
    std::vector<CMutableTransaction> existingSupports;
    std::string value(1024, 'c');

    std::vector<CTransaction> cb {fixture.GetCoinbase()};
    for (int i = 0; i < blocks; ++i) {
        for (int j = 0; j < claimsPerBlock; ++j) {
            auto name = names[i * claimsPerBlock + j];
            auto supportFront = pick4(rg) == 0;
            auto supportBack = pick4(rg) == 0;
            auto removeClaim = pick4(rg) == 0;
            auto removeSupport = pick4(rg) == 0;
            auto hit = existingClaims.find(name);
            if (supportFront && hit != existingClaims.end() && hit->second.size()) {
                auto tx = fixture.MakeSupport(cb.back(), hit->second[pick(rg) % hit->second.size()], name, 2);
                existingSupports.push_back(tx);
                cb.emplace_back(std::move(tx));
            }
            if (removeClaim && hit != existingClaims.end() && hit->second.size()) {
                auto idx = pick(rg) % hit->second.size();
                fixture.Spend(hit->second[idx]);
                hit->second.erase(hit->second.begin() + idx);
            }
            else {
                auto tx = fixture.MakeClaim(cb.back(), name, value, 2);
                existingClaims[name].push_back(tx);
                hit = existingClaims.find(name);
                cb.emplace_back(std::move(tx));
            }
            if (supportBack && hit != existingClaims.end() && hit->second.size()) {
                auto tx = fixture.MakeSupport(cb.back(), hit->second[pick(rg) % hit->second.size()], name, 2);
                existingSupports.push_back(tx);
                cb.emplace_back(std::move(tx));
            }
            if (removeSupport && (i & 7) == 7 && !existingSupports.empty()) {
                const auto tidx = pick(rg) % existingSupports.size();
                const auto tx = existingSupports[tidx];
                fixture.Spend(tx);
                existingSupports.erase(existingSupports.begin() + tidx);
            }
            if (cb.back().GetValueOut() < 10 || cb.size() > 40000) {
                cb.clear();
                cb.push_back(fixture.GetCoinbase());
            }
        }
        std::cerr << "Block: " << i << std::endl;
        fixture.IncrementBlocks(1);
    }

    std::cerr << "Hash: "  << pclaimTrie->getMerkleHash().GetHex() << std::endl;
}

/*
    claims
        no competing bids
        there is a competing bid inserted same height
            check the greater one wins
                - quantity is same, check outpoint greater wins
        there is an existing competing bid
            check that rules for delays are observed
            check that a greater amount wins
            check that a smaller amount does not win

*/
BOOST_AUTO_TEST_CASE(claim_test)
{
    // no competing bids
    ClaimTrieChainFixture fixture;
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx1), predicate_true);

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx1), predicate_false);

    // there is a competing bid inserted same height
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",1);
    CMutableTransaction tx3 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",2);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx3), predicate_true);
    BOOST_CHECK_EQUAL(2U, pclaimTrie->getClaimsForName("test").size());

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx2), predicate_false);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx3), predicate_false);
    BOOST_CHECK_EQUAL(0U, pclaimTrie->getClaimsForName("test").size());

    // make two claims , one older
    CMutableTransaction tx4 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx4), predicate_true);
    CMutableTransaction tx5 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "two",1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_claim_in_queue("test", tx5), predicate_true);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx4), predicate_true);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx4), predicate_true);
    BOOST_CHECK_EQUAL(2U, pclaimTrie->getClaimsForName("test").size());

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx4), predicate_true);
    BOOST_CHECK_EQUAL(is_claim_in_queue("test", tx5), predicate_true);
    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx4), predicate_true);
    fixture.DecrementBlocks(1);

    // check claim takeover, note that CClaimTrie.nProportionalDelayFactor is set to 1
    // instead of 32 in test_bitcoin.cpp
    CMutableTransaction tx6 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",1);
    fixture.IncrementBlocks(10);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx6), predicate_true);
    CMutableTransaction tx7 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "two",2);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_claim_in_queue("test", tx7), predicate_true);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx6), predicate_true);
    fixture.IncrementBlocks(10);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx7), predicate_true);
    BOOST_CHECK_EQUAL(2U, pclaimTrie->getClaimsForName("test").size());

    fixture.DecrementBlocks(10);
    BOOST_CHECK_EQUAL(is_claim_in_queue("test", tx7), predicate_true);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx6), predicate_true);
    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx6), predicate_true);
    fixture.DecrementBlocks(10);
}

/*
    spent claims
        spending winning claim will make losing active claim winner
        spending winning claim will make inactive claim winner
        spending winning claim will empty out claim trie
*/
BOOST_AUTO_TEST_CASE(spend_claim_test)
{
    ClaimTrieChainFixture fixture;

    // spending winning claim will make losing active claim winner
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",2);
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx1), predicate_true);
    fixture.Spend(tx1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx2), predicate_true);

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx1), predicate_true);
    fixture.DecrementBlocks(1);


    // spending winning claim will make inactive claim winner
    CMutableTransaction tx3 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",2);
    fixture.IncrementBlocks(10);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx3), predicate_true);
    CMutableTransaction tx4 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",2);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx3), predicate_true);
    fixture.Spend(tx3);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx4), predicate_true);

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx3), predicate_true);
    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx3), predicate_true);
    fixture.DecrementBlocks(10);


    //spending winning claim will empty out claim trie
    CMutableTransaction tx5 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",2);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx5), predicate_true);
    fixture.Spend(tx5);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx5), predicate_false);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx5), predicate_true);
    fixture.DecrementBlocks(1);
}


/*
    supports
        check support with wrong name does not work
        check claim with more support wins
        check support delay
*/
BOOST_AUTO_TEST_CASE(support_test)
{
    ClaimTrieChainFixture fixture;
    // check claim with more support wins
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",2);
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",1);
    CMutableTransaction s1 = fixture.MakeSupport(fixture.GetCoinbase(), tx1, "test",1);
    CMutableTransaction s2 = fixture.MakeSupport(fixture.GetCoinbase(), tx2, "test",10);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx2), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("test",11), predicate_true);
    fixture.DecrementBlocks(1);

    // check support delay
    CMutableTransaction tx3 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",1);
    CMutableTransaction tx4 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "two",2);
    fixture.IncrementBlocks(10);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx4), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("test",2), predicate_true);
    CMutableTransaction s4 = fixture.MakeSupport(fixture.GetCoinbase(), tx3, "test", 10); //10 delay
    fixture.IncrementBlocks(10);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx4), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("test",2), predicate_true);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx3), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("test",11), predicate_true);

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx4), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("test",2), predicate_true);
    fixture.DecrementBlocks(10);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx4), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("test",2), predicate_true);
    fixture.DecrementBlocks(10);
}

/*
    support on abandon
        supporting a claim the same block it gets abandoned,
        or abandoing a support the same block claim gets abandoned,
        when there were no other claims would crash lbrycrd,
        make sure this doesn't happen in below three tests
        (https://github.com/lbryio/lbrycrd/issues/77)
*/
BOOST_AUTO_TEST_CASE(support_on_abandon_test)
{
    ClaimTrieChainFixture fixture;
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one", 2);
    fixture.IncrementBlocks(1);

    //supporting and abandoing on the same block will cause it to crash
    CMutableTransaction s1 = fixture.MakeSupport(fixture.GetCoinbase(), tx1, "test", 1);
    fixture.Spend(tx1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx1), predicate_false);

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx1), predicate_true);
}

BOOST_AUTO_TEST_CASE(support_on_abandon_2_test)
{
    ClaimTrieChainFixture fixture;
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one", 2);
    CMutableTransaction s1 = fixture.MakeSupport(fixture.GetCoinbase(), tx1, "test", 1);
    fixture.IncrementBlocks(1);

    //abandoning a support and abandoing claim on the same block will cause it to crash
    fixture.Spend(tx1);
    fixture.Spend(s1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx1), predicate_false);

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx1), predicate_true);
}

BOOST_AUTO_TEST_CASE(update_on_support_test)
{
    // make sure that support on abandon bug does not affect
    // updates happening on the same block as a support
    // (it should not)
    ClaimTrieChainFixture fixture;
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one", 3);
    fixture.IncrementBlocks(1);

    CMutableTransaction s1 = fixture.MakeSupport(fixture.GetCoinbase(), tx1, "test", 1);
    CMutableTransaction u1 = fixture.MakeUpdate(tx1, "test", "two", ClaimIdHash(tx1.GetHash(),0), 1);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(is_best_claim("test", u1), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("test", 2), predicate_true);

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx1), predicate_true);
}

/*
    support spend
        spending suport on winning claim will cause it to lose

        spending a support on txin[i] where i is not 0
*/
BOOST_AUTO_TEST_CASE(support_spend_test)
{

    ClaimTrieChainFixture fixture;
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one", 1);
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one", 2);
    CMutableTransaction s1 = fixture.MakeSupport(fixture.GetCoinbase(), tx1, "test", 2);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx1), predicate_true);
    CMutableTransaction sp1 = fixture.Spend(s1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx2), predicate_true);

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx1), predicate_true);
    fixture.DecrementBlocks(1);

    // spend a support on txin[i] where i is not 0
    CMutableTransaction tx3 = fixture.MakeClaim(fixture.GetCoinbase(), "x", "one", 3);
    CMutableTransaction tx4 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "two", 2);
    CMutableTransaction tx5 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "three", 1);
    CMutableTransaction s2 = fixture.MakeSupport(fixture.GetCoinbase(), tx5, "test", 2);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx5), predicate_true);
    BOOST_CHECK_EQUAL(2U, pclaimTrie->getClaimsForName("test").size());

    // build the spend where s2 is sppent on txin[1] and tx3 is  spent on txin[0]
    uint32_t prevout = 0;
    CMutableTransaction tx;
    tx.nVersion = CTransaction::CURRENT_VERSION;
    tx.nLockTime = 1 << 31; // Disable BIP68
    tx.vin.resize(2);
    tx.vout.resize(1);
    tx.vin[0].prevout.hash = tx3.GetHash();
    tx.vin[0].prevout.n = prevout;
    tx.vin[0].scriptSig = CScript();
    tx.vin[0].nSequence = std::numeric_limits<unsigned int>::max();
    tx.vin[1].prevout.hash = s2.GetHash();
    tx.vin[1].prevout.n = prevout;
    tx.vin[1].scriptSig = CScript();
    tx.vin[1].nSequence = std::numeric_limits<unsigned int>::max();
    tx.vout[0].scriptPubKey = CScript() << OP_TRUE;
    tx.vout[0].nValue = 1;

    fixture.CommitTx(tx);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(is_best_claim("test", tx4), predicate_true);
    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx5), predicate_true);
}

/*
    update
        update preserves claim id
        update preserves supports
        winning update on winning claim happens without delay
        losing update on winning claim happens without delay
        update on losing claim happens with delay , and wins


*/
BOOST_AUTO_TEST_CASE(claimtrie_update_test)
{
    //update preserves claim id
    ClaimTrieChainFixture fixture;
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",2);
    CMutableTransaction u1 = fixture.MakeUpdate(tx1, "test", "one", ClaimIdHash(tx1.GetHash(), 0), 2);
    fixture.IncrementBlocks(1);
    CClaimValue val;
    pclaimTrie->getInfoForName("test",val);
    BOOST_CHECK_EQUAL(val.claimId, ClaimIdHash(tx1.GetHash(),0));
    BOOST_CHECK_EQUAL(is_best_claim("test", u1), predicate_true);
    fixture.DecrementBlocks(1);

    // update preserves supports
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",1);
    CMutableTransaction s1 = fixture.MakeSupport(fixture.GetCoinbase(), tx2, "test", 1);
    CMutableTransaction u2 = fixture.MakeUpdate(tx2, "test", "one", ClaimIdHash(tx2.GetHash(), 0), 1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("test", 2), predicate_true);
    fixture.DecrementBlocks(1);

    // winning update on winning claim happens without delay
    CMutableTransaction tx3 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",2);
    CMutableTransaction tx4 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",1);
    fixture.IncrementBlocks(10);
    CMutableTransaction u3 = fixture.MakeUpdate(tx3, "test", "one", ClaimIdHash(tx3.GetHash(), 0), 2);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", u3), predicate_true);
    BOOST_CHECK_EQUAL(2U, pclaimTrie->getClaimsForName("test").size());
    fixture.DecrementBlocks(11);

    // losing update on winning claim happens without delay
    CMutableTransaction tx5 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",3);
    CMutableTransaction tx6 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",2);
    fixture.IncrementBlocks(10);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx5), predicate_true);
    BOOST_CHECK_EQUAL(2U, pclaimTrie->getClaimsForName("test").size());
    CMutableTransaction u4 = fixture.MakeUpdate(tx5, "test", "one", ClaimIdHash(tx5.GetHash(), 0), 1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx6), predicate_true);

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx5), predicate_true);
    fixture.DecrementBlocks(10);

    // update on losing claim happens with delay , and wins
    CMutableTransaction tx7 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",3);
    CMutableTransaction tx8 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",2);
    fixture.IncrementBlocks(10);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx7), predicate_true);

    CMutableTransaction tx;
    tx.nVersion = CTransaction::CURRENT_VERSION;
    tx.nLockTime = 1 << 31; // Disable BIP68
    tx.vin.resize(2);
    tx.vout.resize(1);
    tx.vin[0].prevout.hash = tx8.GetHash();
    tx.vin[0].prevout.n = 0;
    tx.vin[0].scriptSig = CScript();
    tx.vin[0].nSequence = std::numeric_limits<unsigned int>::max();
    tx.vin[1].prevout.hash = fixture.GetCoinbase().GetHash();
    tx.vin[1].prevout.n = 0;
    tx.vin[1].scriptSig = CScript();
    tx.vin[1].nSequence = std::numeric_limits<unsigned int>::max();
    tx.vout[0].scriptPubKey = UpdateClaimScript("test",ClaimIdHash(tx8.GetHash(),0), "one");
    tx.vout[0].nValue = 4;
    fixture.CommitTx(tx);

    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx7), predicate_true);
    fixture.IncrementBlocks(10);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx), predicate_true);

    fixture.DecrementBlocks(10);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx7), predicate_true);
    fixture.DecrementBlocks(11);
}

/*
    expiration
        check claims expire and loses claim
        check claims expire and is not updateable (may be changed in future soft fork)
        check supports expire and can cause supported bid to lose claim
*/
BOOST_AUTO_TEST_CASE(claimtrie_expire_test)
{
    ClaimTrieChainFixture fixture;
    fixture.setExpirationForkHeight(1000000, 5, 1000000);

    // check claims expire and loses claim
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",2);
    fixture.IncrementBlocks(pclaimTrie->nExpirationTime);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx1), predicate_true);
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx2), predicate_true);

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx1), predicate_true);
    fixture.DecrementBlocks(pclaimTrie->nExpirationTime);

    // check claims expire and is not updateable (may be changed in future soft fork)
    CMutableTransaction tx3 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",2);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx3), predicate_true);
    fixture.IncrementBlocks(pclaimTrie->nExpirationTime);
    CMutableTransaction u1 = fixture.MakeUpdate(tx3, "test", "two",ClaimIdHash(tx3.GetHash(),0) ,2);
    BOOST_CHECK_EQUAL(is_best_claim("test", u1), predicate_false);

    fixture.DecrementBlocks(pclaimTrie->nExpirationTime);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx3), predicate_true);
    fixture.DecrementBlocks(1);

    // check supports expire and can cause supported bid to lose claim
    CMutableTransaction tx4 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",1);
    CMutableTransaction tx5 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",2);
    CMutableTransaction s1 = fixture.MakeSupport(fixture.GetCoinbase(), tx4, "test",2);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx4), predicate_true);
    CMutableTransaction u2 = fixture.MakeUpdate(tx4, "test", "two",ClaimIdHash(tx4.GetHash(),0) ,1);
    CMutableTransaction u3 = fixture.MakeUpdate(tx5, "test", "two",ClaimIdHash(tx5.GetHash(),0) ,2);
    fixture.IncrementBlocks(pclaimTrie->nExpirationTime);
    BOOST_CHECK_EQUAL(is_best_claim("test", u3), predicate_true);
    fixture.DecrementBlocks(pclaimTrie->nExpirationTime);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx4), predicate_true);
    fixture.DecrementBlocks(1);

    // check updated claims will extend expiration
    CMutableTransaction tx6 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one",2);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx6), predicate_true);
    CMutableTransaction u4 = fixture.MakeUpdate(tx6, "test", "two",ClaimIdHash(tx6.GetHash(),0) ,2);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", u4), predicate_true);
    fixture.IncrementBlocks(pclaimTrie->nExpirationTime-1);
    BOOST_CHECK_EQUAL(is_best_claim("test", u4), predicate_true);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", u4), predicate_false);
    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", u4), predicate_true);
    fixture.DecrementBlocks(pclaimTrie->nExpirationTime);
    BOOST_CHECK_EQUAL(is_best_claim("test", tx6), predicate_true);
}

/*
 * tests for CClaimTrie::getEffectiveAmountForClaim
 */
BOOST_AUTO_TEST_CASE(claimtriebranching_get_effective_amount_for_claim)
{
    // simplest scenario. One claim, no supports
    ClaimTrieChainFixture fixture;
    CMutableTransaction claimtx = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one", 2);
    uint160 claimId = ClaimIdHash(claimtx.GetHash(), 0);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(CClaimTrieCache(pclaimTrie).getEffectiveAmountForClaim("test", claimId), 2);
    BOOST_CHECK_EQUAL(CClaimTrieCache(pclaimTrie).getEffectiveAmountForClaim("inexistent", claimId), 0); //not found returns 0

    // one claim, one support
    fixture.MakeSupport(fixture.GetCoinbase(), claimtx, "test", 40);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(CClaimTrieCache(pclaimTrie).getEffectiveAmountForClaim("test", claimId), 42);

    // Two claims, first one with supports
    CMutableTransaction claimtx2 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "two", 1);
    uint160 claimId2 = ClaimIdHash(claimtx2.GetHash(), 0);
    fixture.IncrementBlocks(10);

    BOOST_CHECK_EQUAL(CClaimTrieCache(pclaimTrie).getEffectiveAmountForClaim("test", claimId), 42);
    BOOST_CHECK_EQUAL(CClaimTrieCache(pclaimTrie).getEffectiveAmountForClaim("test", claimId2), 1);
    BOOST_CHECK_EQUAL(CClaimTrieCache(pclaimTrie).getEffectiveAmountForClaim("inexistent", claimId), 0);
    BOOST_CHECK_EQUAL(CClaimTrieCache(pclaimTrie).getEffectiveAmountForClaim("inexistent", claimId2), 0);

    // Two claims, both with supports, second claim effective amount being less than first claim
    fixture.MakeSupport(fixture.GetCoinbase(), claimtx2, "test", 6);
    fixture.IncrementBlocks(13); //delay

    BOOST_CHECK_EQUAL(CClaimTrieCache(pclaimTrie).getEffectiveAmountForClaim("test", claimId), 42);
    BOOST_CHECK_EQUAL(CClaimTrieCache(pclaimTrie).getEffectiveAmountForClaim("test", claimId2), 7);

    // Two claims, both with supports, second one taking over
    fixture.MakeSupport(fixture.GetCoinbase(), claimtx2, "test", 1330);
    fixture.IncrementBlocks(26); //delay

    BOOST_CHECK_EQUAL(CClaimTrieCache(pclaimTrie).getEffectiveAmountForClaim("test", claimId), 42);
    BOOST_CHECK_EQUAL(CClaimTrieCache(pclaimTrie).getEffectiveAmountForClaim("test", claimId2), 1337);
}

/*
 * tests for CClaimTrie::getClaimById basic consistency checks
 */
BOOST_AUTO_TEST_CASE(get_claim_by_id_test)
{
    ClaimTrieChainFixture fixture;
    const std::string name = "test";
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), name, "one", 2);
    uint160 claimId = ClaimIdHash(tx1.GetHash(), 0);
    fixture.IncrementBlocks(1);

    CClaimValue claimValue;
    std::string claimName;
    pclaimTrie->getClaimById(claimId, claimName, claimValue);
    BOOST_CHECK_EQUAL(claimName, name);
    BOOST_CHECK_EQUAL(claimValue.claimId, claimId);

    fixture.MakeSupport(fixture.GetCoinbase(), tx1, name, 4);
    fixture.IncrementBlocks(1);

    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), name, "two", 2);
    uint160 claimId2 = ClaimIdHash(tx2.GetHash(), 0);
    fixture.IncrementBlocks(1);

    pclaimTrie->getClaimById(claimId2, claimName, claimValue);
    BOOST_CHECK_EQUAL(claimName, name);
    BOOST_CHECK_EQUAL(claimValue.claimId, claimId2);


    CMutableTransaction u1 = fixture.MakeUpdate(tx1, name, "updated one", claimId, 1);
    fixture.IncrementBlocks(1);
    pclaimTrie->getClaimById(claimId, claimName, claimValue);
    BOOST_CHECK_EQUAL(claimName, name);
    BOOST_CHECK_EQUAL(claimValue.claimId, claimId);
    BOOST_CHECK_EQUAL(claimValue.nAmount, 1);
    BOOST_CHECK_EQUAL(claimValue.outPoint.hash, u1.GetHash());

    fixture.Spend(u1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(pclaimTrie->getClaimById(claimId, claimName, claimValue), false);

    fixture.DecrementBlocks(3);

    CClaimValue claimValue2;
    claimName = "";
    pclaimTrie->getClaimById(claimId2, claimName, claimValue2);
    BOOST_CHECK_EQUAL(claimName != name, true);
    BOOST_CHECK_EQUAL(claimValue2.claimId != claimId2, true);

    pclaimTrie->getClaimById(claimId, claimName, claimValue);
    BOOST_CHECK_EQUAL(claimName, name);
    BOOST_CHECK_EQUAL(claimValue.claimId, claimId);

    fixture.DecrementBlocks(2);

    claimName = "";
    pclaimTrie->getClaimById(claimId, claimName, claimValue2);
    BOOST_CHECK_EQUAL(claimName != name, true);
    BOOST_CHECK_EQUAL(claimValue2.claimId != claimId, true);
}

/*
    claim expiration for hard fork
        check claims do not expire post ExpirationForkHeight
        check supports work post ExpirationForkHeight
*/
BOOST_AUTO_TEST_CASE(hardfork_claim_test)
{
    ClaimTrieChainFixture fixture;
    fixture.setExpirationForkHeight(7, 3, 6);

    // First create a claim and make sure it expires pre-fork
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(),"test","one",3);
    fixture.IncrementBlocks(4);
    BOOST_CHECK(!is_best_claim("test",tx1));
    fixture.DecrementBlocks(3);
    BOOST_CHECK(is_best_claim("test",tx1));
    fixture.IncrementBlocks(3);
    BOOST_CHECK(!is_best_claim("test",tx1));

    // Create a claim 1 block before the fork height that will expire after the fork height
    fixture.IncrementBlocks(1);
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(),"test2","one",3);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(pclaimTrie->nExpirationTime, 3);

    // Disable future expirations and fast-forward past the fork height
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(pclaimTrie->nExpirationTime, 6);
    // make sure decrementing to before the fork height will apppropriately set back the
    // expiration time to the original expiraiton time
    fixture.DecrementBlocks(1);
    BOOST_CHECK_NE(pclaimTrie->nExpirationTime, 6);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(pclaimTrie->nExpirationTime, 6);

    // make sure that claim created 1 block before the fork expires as expected
    // at the extended expiration times
    BOOST_CHECK(is_best_claim("test2", tx2));
    fixture.IncrementBlocks(5);
    BOOST_CHECK(!is_best_claim("test2", tx2));
    fixture.DecrementBlocks(5);
    BOOST_CHECK(is_best_claim("test2", tx2));

    // This first claim is still expired since it's pre-fork, even
    // after fork activation
    BOOST_CHECK_EQUAL(is_best_claim("test", tx1), predicate_false);

    // This new claim created at the fork height cannot expire at original expiration
    CMutableTransaction tx3 = fixture.MakeClaim(fixture.GetCoinbase(),"test","one",1);
    fixture.IncrementBlocks(1);
    fixture.IncrementBlocks(3);
    BOOST_CHECK(is_best_claim("test",tx3));
    BOOST_CHECK(!is_best_claim("test",tx1));
    fixture.DecrementBlocks(3);

    // but it expires at the extended expiration, and not a single block below
    fixture.IncrementBlocks(6);
    BOOST_CHECK(!is_best_claim("test",tx3));
    fixture.DecrementBlocks(6);
    fixture.IncrementBlocks(5);
    BOOST_CHECK(is_best_claim("test",tx3));
    fixture.DecrementBlocks(5);


    // Ensure that we cannot update the original pre-fork expired claim
    CMutableTransaction u1 = fixture.MakeUpdate(tx1, "test", "two", ClaimIdHash(tx1.GetHash(),0), 3);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", u1), predicate_false);

    // Ensure that supports for the expired claim don't support it
    CMutableTransaction s1 = fixture.MakeSupport(fixture.GetCoinbase(), u1, "test", 10);
    BOOST_CHECK_EQUAL(is_best_claim("test", u1), predicate_false);

    // Ensure that we can update the new post-fork claim
    CMutableTransaction u2 = fixture.MakeUpdate(tx3, "test", "two", ClaimIdHash(tx3.GetHash(),0), 1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("test", u2), predicate_true);

    // Ensure that supports for the new post-fork claim
    CMutableTransaction s2 = fixture.MakeSupport(fixture.GetCoinbase(), u2, "test", 3);
    BOOST_CHECK_EQUAL(is_best_claim("test", u2), predicate_true);
}

/*
    support expiration for hard fork
*/
BOOST_AUTO_TEST_CASE(hardfork_support_test)
{
    ClaimTrieChainFixture fixture;
    fixture.setExpirationForkHeight(2, 2, 4);

    // Create claim and support it before the fork height
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one", 1);
    CMutableTransaction s1 = fixture.MakeSupport(fixture.GetCoinbase(), tx1, "test", 2);
    // this claim will win without the support
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(),"test","one",2);
    fixture.IncrementBlocks(2);

    // check that the claim expires as expected at the extended time, as does the support
    fixture.IncrementBlocks(2);
    BOOST_CHECK(is_best_claim("test",tx1));
    BOOST_CHECK(best_claim_effective_amount_equals("test",3));
    fixture.DecrementBlocks(2);
    fixture.IncrementBlocks(3);
    BOOST_CHECK(!is_best_claim("test",tx1));
    fixture.DecrementBlocks(3);
    fixture.IncrementBlocks(1);
    BOOST_CHECK(is_best_claim("test",tx1));
    BOOST_CHECK(best_claim_effective_amount_equals("test",3));
    fixture.DecrementBlocks(1);

    // update the claims at fork
    fixture.DecrementBlocks(1);
    CMutableTransaction u1 = fixture.MakeUpdate(tx1, "test", "two", ClaimIdHash(tx1.GetHash(),0), 1);
    CMutableTransaction u2 = fixture.MakeUpdate(tx2, "test", "two", ClaimIdHash(tx2.GetHash(),0), 2);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(Params().GetConsensus().nExtendedClaimExpirationForkHeight, chainActive.Height());

    BOOST_CHECK_EQUAL(is_best_claim("test", u1), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("test",3), predicate_true);
    BOOST_CHECK_EQUAL(is_claim_in_queue("test", tx1), predicate_false);
    BOOST_CHECK_EQUAL(is_claim_in_queue("test", tx2), predicate_false);

    // check that the support expires as expected
    fixture.IncrementBlocks(3);
    BOOST_CHECK(is_best_claim("test", u2));
    fixture.DecrementBlocks(3);
    fixture.IncrementBlocks(2);
    BOOST_CHECK(is_best_claim("test",u1));
    BOOST_CHECK(best_claim_effective_amount_equals("test",3));
}

/*
    activation_fall_through and supports_fall_through
        Tests for where claims/supports in queues would be undone properly in a decrement.
        See https://github.com/lbryio/lbrycrd/issues/243 for more details
*/

BOOST_AUTO_TEST_CASE(activations_fall_through)
{
    ClaimTrieChainFixture fixture;

    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "A", "1", 1);
    fixture.IncrementBlocks(3);
    BOOST_CHECK_EQUAL(pclaimTrie->nProportionalDelayFactor, 1);
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), "A", "2", 3);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(is_best_claim("A", tx1), predicate_true);
    fixture.IncrementBlocks(3);
    BOOST_CHECK_EQUAL(is_best_claim("A", tx2), predicate_true);
    fixture.DecrementBlocks(3);
    fixture.Spend(tx1); // this will trigger early activation on tx2 claim
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("A", tx2), predicate_true);
    fixture.DecrementBlocks(1); //reorg the early activation
    BOOST_CHECK_EQUAL(is_best_claim("A", tx1), predicate_true);
    fixture.Spend(tx1);
    fixture.IncrementBlocks(1); // this should not cause tx2 to activate again and crash
    BOOST_CHECK_EQUAL(is_best_claim("A", tx2), predicate_true);
}

BOOST_AUTO_TEST_CASE(supports_fall_through)
{
    ClaimTrieChainFixture fixture;

    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "A", "1", 3);
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), "A", "2", 1);
    CMutableTransaction tx3 = fixture.MakeClaim(fixture.GetCoinbase(), "A", "3", 2);
    fixture.IncrementBlocks(3);
    BOOST_CHECK_EQUAL(pclaimTrie->nProportionalDelayFactor, 1);
    CMutableTransaction sx2 = fixture.MakeSupport(fixture.GetCoinbase(), tx2, "A", 3);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(is_best_claim("A", tx1), predicate_true);
    fixture.IncrementBlocks(3);
    BOOST_CHECK_EQUAL(is_best_claim("A", tx2), predicate_true);
    fixture.DecrementBlocks(3);
    fixture.Spend(tx1); // this will trigger early activation
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("A", tx2), predicate_true);
    fixture.DecrementBlocks(1); // reorg the early activation
    BOOST_CHECK_EQUAL(is_best_claim("A", tx1), predicate_true);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("A", tx1), predicate_true); //tx2 support should not be active
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("A", tx1), predicate_true); //tx2 support should not be active
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("A", tx2), predicate_true); //tx2 support should be active now
}

 /*
    normalization
        test normalization function indpendent from rest of the code

*/
BOOST_AUTO_TEST_CASE(normalization_only)
{
    CClaimTrieCache ccache(pclaimTrie);

    // basic ASCII casing tests
    BOOST_CHECK_EQUAL("test", ccache.normalizeClaimName("TESt", true));
    BOOST_CHECK_EQUAL("test", ccache.normalizeClaimName("tesT", true));
    BOOST_CHECK_EQUAL("test", ccache.normalizeClaimName("TesT", true));
    BOOST_CHECK_EQUAL("test", ccache.normalizeClaimName("test", true));
    BOOST_CHECK_EQUAL("test this", ccache.normalizeClaimName("Test This", true));

    // test invalid utf8 bytes are returned as is
    BOOST_CHECK_EQUAL("\xFF", ccache.normalizeClaimName("\xFF", true));
    BOOST_CHECK_EQUAL("\xC3\x28", ccache.normalizeClaimName("\xC3\x28", true));

    // ohm sign unicode code point \x2126 should be transformed to equivalent
    // unicode code point \x03C9 , greek small letter omega
    BOOST_CHECK_EQUAL("\xCF\x89", ccache.normalizeClaimName("\xE2\x84\xA6", true));

    // cyrillic capital ef code point \x0424 should be transformed to lower case
    // \x0444
    BOOST_CHECK_EQUAL("\xD1\x84", ccache.normalizeClaimName("\xD0\xA4", true));

    // armenian capital ben code point \x0532 should be transformed to lower case
    // \x0562
    BOOST_CHECK_EQUAL("\xD5\xA2", ccache.normalizeClaimName("\xD4\xB2", true));

    // japanese pbu code point \x3076 should be transformed by NFD decomposition
    // into \x3075 and \x3099
    BOOST_CHECK_EQUAL("\xE3\x81\xB5\xE3\x82\x99",
                      ccache.normalizeClaimName("\xE3\x81\xB6", true));

    // hangul ggwalg unicode code point \xAF51 should be transformed by NFD
    // decomposition into unicode code points \x1101 \x116A \x11B0
    // source: http://unicode.org/L2/L2009/09052-tr47.html
    BOOST_CHECK_EQUAL("\xE1\x84\x81\xE1\x85\xAA\xE1\x86\xB0",
                      ccache.normalizeClaimName("\xEA\xBD\x91", true));
}

/*
    normalization
        check claim name normalization before the fork
        check claim name normalization after the fork
*/
BOOST_AUTO_TEST_CASE(claimtriebranching_normalization)
{
    ClaimTrieChainFixture fixture;

    // check claim names are not normalized
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "normalizeTest", "one", 3);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("normalizeTest", tx1), predicate_true);
    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(pclaimTrie->getTotalNamesInTrie(), static_cast<size_t>(0));
    fixture.CommitTx(tx1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("normalizeTest", tx1), predicate_true);

    CMutableTransaction tx2a = fixture.MakeClaim(fixture.GetCoinbase(), "Normalizetest", "one_a", 2);
    CMutableTransaction tx2 = fixture.MakeUpdate(tx2a, "Normalizetest", "one", ClaimIdHash(tx2a.GetHash(), 0), 2);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("normalizeTest", tx1), predicate_true);
    BOOST_CHECK_EQUAL(is_best_claim("Normalizetest", tx2), predicate_true);

    // Activate the fork (which rebuilds the existing claimtrie and
    // cache), flattening all previously existing name clashes due to
    // the normalization
    fixture.setNormalizationForkHeight(2);
    BOOST_CHECK_EQUAL(Params().GetConsensus().nNormalizedNameForkHeight, chainActive.Height() + 2);

    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("normalizeTest", tx1), predicate_true);
    BOOST_CHECK_EQUAL(is_best_claim("Normalizetest", tx2), predicate_true);

    fixture.IncrementBlocks(1, true);

    // Post-fork, tx1 (the previous winning claim) assumes all name
    // variants of what it originally was ...
    BOOST_CHECK_EQUAL(is_best_claim("normalizetest", tx1), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("normalizetest", 3), predicate_true);

    CClaimValue val;
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName("normalizeTest", val), false);

    // Check equivalence of normalized claim names
    BOOST_CHECK_EQUAL(is_best_claim("normalizetest", tx1), predicate_true); // collapsed tx2
    fixture.IncrementBlocks(1);

    CMutableTransaction tx3 = fixture.MakeClaim(fixture.GetCoinbase(), "NORMALIZETEST", "one", 1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("normalizetest", tx3), predicate_false);

    CMutableTransaction s1 = fixture.MakeSupport(fixture.GetCoinbase(), tx1, "NoRmAlIzEtEsT", 2);
    fixture.IncrementBlocks(1);

    // Ensure that supports work for normalized claim names
    BOOST_CHECK_EQUAL(is_best_claim("normalizetest", tx1), predicate_true); // effective amount is 5
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("normalizetest", 5), predicate_true);

    CMutableTransaction tx4 = fixture.MakeClaim(fixture.GetCoinbase(), "foo", "bar", 1);
    CMutableTransaction s2 = fixture.MakeSupport(fixture.GetCoinbase(), tx4, "Foo", 1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("foo", tx4), predicate_true);

    CMutableTransaction u1 = fixture.MakeUpdate(tx4, "foo", "baz", ClaimIdHash(tx4.GetHash(), 0), 1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("foo", u1), predicate_true);

    CMutableTransaction u2 = fixture.MakeUpdate(tx1, "nOrmalIzEtEst", "two", ClaimIdHash(tx1.GetHash(), 0), 3);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(is_best_claim("normalizetest", u2), predicate_true);

    // Add another set of unicode claims that will collapse after the fork
    CMutableTransaction tx5 = fixture.MakeClaim(fixture.GetCoinbase(), "Ame\u0301lie", "amelie", 2);
    fixture.IncrementBlocks(1);
    CClaimValue nval1;
    pclaimTrie->getInfoForName("amélie", nval1);
    BOOST_CHECK(nval1.claimId == ClaimIdHash(tx5.GetHash(), 0));
    BOOST_CHECK(best_claim_effective_amount_equals("amélie", 2));

    // Check equivalence of normalized claim names
    BOOST_CHECK(is_best_claim("amélie", tx5));

    CMutableTransaction tx7 = fixture.MakeClaim(fixture.GetCoinbase(), "あてはまる", "jn1", 1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK(is_best_claim("あてはまる", tx7));

    CMutableTransaction tx8 = fixture.MakeClaim(fixture.GetCoinbase(), "AÑEJO", "es1", 1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK(is_best_claim("añejo", tx8));

    // Rewind to 1 block before the fork and be sure that the fork is no longer active
    fixture.DecrementBlocks();

    // Now check that our old (non-normalized) claims are 'alive' again
    BOOST_CHECK_EQUAL(is_best_claim("normalizeTest", tx1), predicate_true);
    BOOST_CHECK_EQUAL(is_best_claim("Normalizetest", tx1), predicate_false); // no longer equivalent
    BOOST_CHECK_EQUAL(is_best_claim("Normalizetest", tx2), predicate_true);

    // Create new claim
    CMutableTransaction tx9 = fixture.MakeClaim(fixture.GetCoinbase(), "blah", "blah", 1);
    std::string invalidUtf8("\xFF\xFF");
    CMutableTransaction tx10 = fixture.MakeClaim(fixture.GetCoinbase(), invalidUtf8, "blah", 1); // invalid UTF8

    // Roll forward to fork height again and check again that we're normalized
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(chainActive.Height(), Params().GetConsensus().nNormalizedNameForkHeight);
    BOOST_CHECK_EQUAL(is_best_claim("normalizetest", tx1), predicate_true); // collapsed tx2
    BOOST_CHECK_EQUAL(is_best_claim(invalidUtf8, tx10), predicate_true);

    // Rewind to 1 block before the fork and be sure that the fork is
    // no longer active
    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("Normalizetest", tx2), predicate_true);

    // Roll forward to fork height again and check again that we're normalized
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(chainActive.Height(), Params().GetConsensus().nNormalizedNameForkHeight);
    BOOST_CHECK_EQUAL(is_best_claim("normalizetest", tx1), predicate_true); // collapsed tx2
}

BOOST_AUTO_TEST_CASE(claimtriecache_normalization)
{
    ClaimTrieChainFixture fixture;

    std::string name = "Ame\u0301lie";

    std::string name_upper = "Amélie";
    std::string name_normd = "amélie"; // this accented e is not actually the same as the one above; this has been "normalized"

    BOOST_CHECK_EQUAL(name == name_upper, false);

    // Add another set of unicode claims that will collapse after the fork
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), name, "amilie", 2);
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), name_upper, "amelie", 2);
    fixture.MakeClaim(fixture.GetCoinbase(), "amelie1", "amelie", 2);
    fixture.IncrementBlocks(1);

    CClaimValue lookupClaim;
    std::string lookupName;
    BOOST_CHECK_EQUAL(pclaimTrie->getClaimById(ClaimIdHash(tx2.GetHash(), 0), lookupName, lookupClaim), true);
    CClaimValue nval1;
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName("amelie1", nval1), true);
    // amélie is not found cause normalization still not appear
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(name_normd, nval1), false);

    // Activate the fork (which rebuilds the existing claimtrie and
    // cache), flattening all previously existing name clashes due to
    // the normalization
    fixture.setNormalizationForkHeight(1);
    int currentHeight = chainActive.Height();

    fixture.IncrementBlocks(1);
    // Ok normalization fix the name problem
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(name_normd, nval1), true);
    BOOST_CHECK_EQUAL(nval1.nHeight, currentHeight);
    BOOST_CHECK_EQUAL(lookupClaim, nval1);

    CCoinsViewCache coins(pcoinsTip.get());
    CClaimTrieCache trieCache(pclaimTrie);
    CBlockIndex* pindex = chainActive.Tip();
    CBlock block;
    int amelieValidHeight;
    BOOST_CHECK_EQUAL(trieCache.shouldNormalize(), true);
    BOOST_CHECK_EQUAL(ReadBlockFromDisk(block, pindex, Params().GetConsensus()), true);
    BOOST_CHECK_EQUAL(g_chainstate.DisconnectBlock(block, pindex, coins, trieCache), DisconnectResult::DISCONNECT_OK);
    BOOST_CHECK_EQUAL(trieCache.shouldNormalize(), false);
    BOOST_CHECK_EQUAL(trieCache.spendClaim(name_normd, COutPoint(tx2.GetHash(), 0), currentHeight, amelieValidHeight), false);
    BOOST_CHECK_EQUAL(trieCache.spendClaim(name_upper, COutPoint(tx2.GetHash(), 0), currentHeight, amelieValidHeight), true);

    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(name, nval1), false);
    BOOST_CHECK_EQUAL(trieCache.getInfoForName(name, nval1), true);
    BOOST_CHECK_EQUAL(trieCache.addClaim(name, COutPoint(tx1.GetHash(), 0), ClaimIdHash(tx1.GetHash(), 0), CAmount(2), currentHeight + 1), true);
    BOOST_CHECK_EQUAL(trieCache.getInfoForName(name, nval1), true);
    insertUndoType insertUndo;
    claimQueueRowType expireUndo;
    insertUndoType insertSupportUndo;
    supportQueueRowType expireSupportUndo;
    std::vector<std::pair<std::string, int> > takeoverHeightUndo;
    BOOST_CHECK_EQUAL(trieCache.incrementBlock(insertUndo, expireUndo, insertSupportUndo, expireSupportUndo, takeoverHeightUndo), true);
    BOOST_CHECK_EQUAL(trieCache.shouldNormalize(), true);
    // we cannot use getXXXForName cause the name will be normalized

    struct CNameVerifierCallback : public CNodeCallback
    {
      const std::string& cmp;

      CNameVerifierCallback(const std::string& cmp) : cmp(cmp) {}

      void visit(const std::string& nodeName, const CClaimTrieNode* node)
      {
          BOOST_CHECK_EQUAL(nodeName == cmp, false);
      }
    };

    CNameVerifierCallback callback(name);
    trieCache.iterateTrie(callback);
}

BOOST_AUTO_TEST_CASE(undo_normalization_does_not_kill_claim_order)
{
    ClaimTrieChainFixture fixture;
    fixture.setNormalizationForkHeight(5);
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "A", "1", 1);
    CMutableTransaction tx3 = fixture.MakeClaim(fixture.GetCoinbase(), "a", "3", 3);
    fixture.IncrementBlocks(1);
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), "A", "2", 2);
    fixture.IncrementBlocks(2);
    BOOST_CHECK_EQUAL(is_best_claim("A", tx2), predicate_true);
    fixture.IncrementBlocks(3, true);
    BOOST_CHECK_EQUAL(is_best_claim("a", tx3), predicate_true);
    fixture.DecrementBlocks();
    BOOST_CHECK_EQUAL(is_best_claim("A", tx2), predicate_true);
}

BOOST_AUTO_TEST_CASE(normalized_activations_fall_through)
{
    ClaimTrieChainFixture fixture;
    fixture.setNormalizationForkHeight(5);

    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "AB", "1", 1);
    fixture.IncrementBlocks(3);
    BOOST_CHECK_EQUAL(pclaimTrie->nProportionalDelayFactor, 1);
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), "Ab", "2", 4);
    CMutableTransaction tx3 = fixture.MakeClaim(fixture.GetCoinbase(), "aB", "2", 3);
    CMutableTransaction tx4 = fixture.MakeClaim(fixture.GetCoinbase(), "ab", "2", 2);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(is_best_claim("AB", tx1), predicate_true);
    fixture.IncrementBlocks(3);
    BOOST_CHECK_EQUAL(is_best_claim("ab", tx2), predicate_true);
    BOOST_CHECK_EQUAL(pclaimTrie->getClaimsForName("ab").size(), 4U);
    fixture.DecrementBlocks(3);
    fixture.Spend(tx1);
    fixture.Spend(tx2);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("ab", tx3), predicate_true);
    BOOST_CHECK_EQUAL(pclaimTrie->getClaimsForName("ab").size(), 2U);
    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("AB", tx1), predicate_true);
    fixture.Spend(tx1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("ab", tx2), predicate_true);

    for (int i = 0; i < 7; i++)
    {
        fixture.IncrementBlocks(i, true); // well into normalized teritory
        CMutableTransaction tx5 = fixture.MakeClaim(fixture.GetCoinbase(), "CD", "a", 1 + i);
        fixture.IncrementBlocks(3);
        CMutableTransaction tx6 = fixture.MakeClaim(fixture.GetCoinbase(), "Cd", "b", 2 + i);
        CMutableTransaction tx7 = fixture.MakeClaim(fixture.GetCoinbase(), "cD", "c", 3 + i);
        fixture.IncrementBlocks(1);
        BOOST_CHECK_EQUAL(is_best_claim("cd", tx5), predicate_true);
        fixture.Spend(tx5);
        fixture.IncrementBlocks(1);
        BOOST_CHECK_EQUAL(is_best_claim("cd", tx7), predicate_true);
        fixture.DecrementBlocks();
    }
}

BOOST_AUTO_TEST_CASE(normalization_removal_test)
{
    ClaimTrieChainFixture fixture;
    fixture.setNormalizationForkHeight(2);
    fixture.IncrementBlocks(3);
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "AB", "1", 1);
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), "Ab", "2", 2);
    CMutableTransaction tx3 = fixture.MakeClaim(fixture.GetCoinbase(), "aB", "3", 3);
    CMutableTransaction sx1 = fixture.MakeSupport(fixture.GetCoinbase(), tx1, "AB", 1);
    CMutableTransaction sx2 = fixture.MakeSupport(fixture.GetCoinbase(), tx2, "Ab", 1);

    CClaimTrieCache cache(pclaimTrie);
    cache.addClaim("AB", COutPoint(tx1.GetHash(), 0), ClaimIdHash(tx1.GetHash(), 0), 1, pclaimTrie->nCurrentHeight);
    cache.addClaim("Ab", COutPoint(tx2.GetHash(), 0), ClaimIdHash(tx2.GetHash(), 0), 2, pclaimTrie->nCurrentHeight);
    cache.addClaim("aB", COutPoint(tx3.GetHash(), 0), ClaimIdHash(tx3.GetHash(), 0), 3, pclaimTrie->nCurrentHeight);
    cache.addSupport("AB", COutPoint(sx1.GetHash(), 0), 1, ClaimIdHash(tx1.GetHash(), 0), pclaimTrie->nCurrentHeight);
    cache.addSupport("Ab", COutPoint(sx2.GetHash(), 0), 1, ClaimIdHash(tx2.GetHash(), 0), pclaimTrie->nCurrentHeight);
    insertUndoType insertUndo;
    claimQueueRowType expireUndo;
    insertUndoType insertSupportUndo;
    supportQueueRowType expireSupportUndo;
    std::vector<std::pair<std::string, int> > takeoverHeightUndo;
    BOOST_CHECK_EQUAL(cache.incrementBlock(insertUndo, expireUndo, insertSupportUndo, expireSupportUndo, takeoverHeightUndo), true);
    BOOST_CHECK_EQUAL(cache.getClaimsForName("ab").claims.size(), 3U);
    BOOST_CHECK_EQUAL(cache.getClaimsForName("ab").supports.size(), 2U);
    BOOST_CHECK_EQUAL(cache.decrementBlock(insertUndo, expireUndo, insertSupportUndo, expireSupportUndo, takeoverHeightUndo), true);
    BOOST_CHECK_EQUAL(cache.undoAddSupport("AB", COutPoint(sx1.GetHash(), 0), pclaimTrie->nCurrentHeight), true);
    BOOST_CHECK_EQUAL(cache.undoAddSupport("Ab", COutPoint(sx2.GetHash(), 0), pclaimTrie->nCurrentHeight), true);
    BOOST_CHECK_EQUAL(cache.undoAddClaim("AB", COutPoint(tx1.GetHash(), 0), pclaimTrie->nCurrentHeight), true);
    BOOST_CHECK_EQUAL(cache.undoAddClaim("Ab", COutPoint(tx2.GetHash(), 0), pclaimTrie->nCurrentHeight), true);
    BOOST_CHECK_EQUAL(cache.undoAddClaim("aB", COutPoint(tx3.GetHash(), 0), pclaimTrie->nCurrentHeight), true);
    BOOST_CHECK_EQUAL(cache.getClaimsForName("ab").claims.size(), 0U);
}

BOOST_AUTO_TEST_CASE(normalization_does_not_kill_supports)
{
    ClaimTrieChainFixture fixture;
    fixture.setNormalizationForkHeight(3);
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "A", "1", 1);
    fixture.MakeSupport(fixture.GetCoinbase(), tx1, "A", 1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("A", 2), predicate_true);
    fixture.MakeSupport(fixture.GetCoinbase(), tx1, "A", 1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("A", 3), predicate_true);
    fixture.MakeSupport(fixture.GetCoinbase(), tx1, "A", 1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("a", 4), predicate_true);
    fixture.MakeSupport(fixture.GetCoinbase(), tx1, "A", 1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("a", 5), predicate_true);

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("a", 4), predicate_true);
    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("A", 3), predicate_true);
    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("A", 2), predicate_true);
    fixture.IncrementBlocks(5);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("a", 3), predicate_true);
}

BOOST_AUTO_TEST_CASE(normalization_does_not_fail_on_spend)
{
    ClaimTrieChainFixture fixture;
    fixture.setNormalizationForkHeight(2);

    std::string sName1("testN");
    std::string sName2("testn");

    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), sName1, "1", 3);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim(sName1, tx1), predicate_true);
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), sName1, "2", 2);
    CMutableTransaction tx1s = fixture.MakeSupport(fixture.GetCoinbase(), tx1, sName1, 2);
    fixture.IncrementBlocks(2, true);
    BOOST_CHECK_EQUAL(is_best_claim(sName2, tx1), predicate_true);

    CMutableTransaction tx3 = fixture.Spend(tx1); // abandon the claim
    CMutableTransaction tx3s = fixture.Spend(tx1s);
    fixture.IncrementBlocks(2);
    BOOST_CHECK_EQUAL(is_best_claim(sName2, tx2), predicate_true);
    fixture.DecrementBlocks();
    BOOST_CHECK_EQUAL(is_best_claim(sName1, tx1), predicate_true);
}

BOOST_AUTO_TEST_CASE(normalization_does_not_kill_sort_order)
{
    ClaimTrieChainFixture fixture;
    fixture.setNormalizationForkHeight(2);

    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "A", "1", 1);
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), "A", "2", 2);
    CMutableTransaction tx3 = fixture.MakeClaim(fixture.GetCoinbase(), "a", "3", 3);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("A", tx2), predicate_true);
    BOOST_CHECK_EQUAL(is_best_claim("a", tx3), predicate_true);

    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("A", tx2), predicate_false);
    BOOST_CHECK_EQUAL(is_best_claim("a", tx3), predicate_true);
    BOOST_CHECK_EQUAL(pclaimTrie->getClaimsForName("a").size(), 3U);

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(is_best_claim("A", tx2), predicate_true);
    BOOST_CHECK_EQUAL(is_best_claim("a", tx3), predicate_true);
}

BOOST_AUTO_TEST_CASE(normalization_does_not_kill_expirations)
{
    ClaimTrieChainFixture fixture;
    pclaimTrie->setExpirationTime(3);
    fixture.setNormalizationForkHeight(4);
    // need to see that claims expiring on the frame when we normalize aren't kept
    // need to see that supports expiring on the frame when we normalize aren't kept
    // need to see that claims & supports carried through the normalization fork do expire
    // and that they come back correctly when we roll backwards

    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "A", "1", 1);
    fixture.MakeSupport(fixture.GetCoinbase(), tx1, "A", 1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("A", 2), predicate_true);

    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), "B", "1", 1);
    fixture.MakeSupport(fixture.GetCoinbase(), tx2, "B", 1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("A", 2), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("B", 2), predicate_true);

    CMutableTransaction tx3 = fixture.MakeClaim(fixture.GetCoinbase(), "C", "1", 1);
    fixture.MakeSupport(fixture.GetCoinbase(), tx3, "C", 1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("A", 2), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("B", 2), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("C", 2), predicate_true);

    CMutableTransaction tx4 = fixture.MakeClaim(fixture.GetCoinbase(), "D", "1", 1);
    fixture.MakeSupport(fixture.GetCoinbase(), tx4, "D", 1);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("a", 2), predicate_false);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("b", 2), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("c", 2), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("d", 2), predicate_true);

    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("a", 2), predicate_false);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("b", 2), predicate_false);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("c", 2), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("d", 2), predicate_true);

    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("a", 2), predicate_false);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("b", 2), predicate_false);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("c", 2), predicate_false);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("d", 2), predicate_true);

    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("a", 2), predicate_false);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("b", 2), predicate_false);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("c", 2), predicate_false);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("d", 2), predicate_false);

    fixture.DecrementBlocks(2);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("a", 2), predicate_false);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("b", 2), predicate_false);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("c", 2), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("d", 2), predicate_true);

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("a", 2), predicate_false);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("b", 2), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("c", 2), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("d", 2), predicate_true);

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("A", 2), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("B", 2), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("C", 2), predicate_true);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("d", 2), predicate_false);

    fixture.IncrementBlocks(3);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("a", 2), predicate_false);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("b", 2), predicate_false);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("c", 2), predicate_false);
    BOOST_CHECK_EQUAL(best_claim_effective_amount_equals("d", 2), predicate_false); // (not re-added)
}

/*
    claim/support expiration for hard fork, but with checks for disk procedures
*/
BOOST_AUTO_TEST_CASE(hardfork_disk_test)
{
    ClaimTrieChainFixture fixture;

    fixture.setExpirationForkHeight(7, 3, 6);

    // Check that incrementing to fork height, reseting to disk will get proper expiration time
    BOOST_CHECK_EQUAL(pclaimTrie->nExpirationTime, 3);
    fixture.IncrementBlocks(7, true);
    BOOST_CHECK_EQUAL(pclaimTrie->nExpirationTime, 6);
    fixture.WriteClearReadClaimTrie();
    BOOST_CHECK_EQUAL(pclaimTrie->nExpirationTime, 6);

    // Create a claim and support 1 block before the fork height that will expire after the fork height.
    // Reset to disk, increment past the fork height and make sure we get
    // proper behavior
    fixture.DecrementBlocks(2);
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), "test", "one", 1);
    CMutableTransaction s1 = fixture.MakeSupport(fixture.GetCoinbase(), tx1, "test", 1);
    fixture.IncrementBlocks(1);

    fixture.WriteClearReadClaimTrie();
    BOOST_CHECK_EQUAL(pclaimTrie->nExpirationTime, 3);
    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(pclaimTrie->nExpirationTime, 6);
    BOOST_CHECK(is_best_claim("test", tx1));
    BOOST_CHECK(best_claim_effective_amount_equals("test",2));
    fixture.IncrementBlocks(2);
    BOOST_CHECK(is_best_claim("test", tx1));
    BOOST_CHECK(best_claim_effective_amount_equals("test",2));
    fixture.DecrementBlocks(2);
    fixture.IncrementBlocks(5);
    BOOST_CHECK(!is_best_claim("test", tx1));

    // Create a claim and support before the fork height, reset to disk, update the claim
    // increment past the fork height and make sure we get proper behavior
    fixture.DecrementBlocks();
    fixture.setExpirationForkHeight(3, 5, 6);

    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(),"test2","one",1);
    CMutableTransaction s2 = fixture.MakeSupport(fixture.GetCoinbase(),tx2,"test2",1);
    fixture.IncrementBlocks(1);
    fixture.WriteClearReadClaimTrie();
    CMutableTransaction u2 = fixture.MakeUpdate(tx2, "test2", "two", ClaimIdHash(tx2.GetHash(), 0), 1);
    // increment to fork
    fixture.IncrementBlocks(2);
    BOOST_CHECK(is_best_claim("test2", u2));
    BOOST_CHECK(best_claim_effective_amount_equals("test2",2));
    // increment to original expiration, should not be expired
    fixture.IncrementBlocks(2);
    BOOST_CHECK(is_best_claim("test2", u2));
    BOOST_CHECK(best_claim_effective_amount_equals("test2", 2));
    fixture.DecrementBlocks(2);
    // increment to extended expiration, should be expired and not one block before
    fixture.IncrementBlocks(5);
    BOOST_CHECK(!is_best_claim("test2", u2));
    fixture.DecrementBlocks(5);
    fixture.IncrementBlocks(4);
    BOOST_CHECK(is_best_claim("test2", u2));
    BOOST_CHECK(best_claim_effective_amount_equals("test2", 1)); // the support expires one block before
}

BOOST_AUTO_TEST_CASE(insert_update_claim_test)
{
    ClaimTrieChainFixture fixture;

    std::string sName1("atest");
    std::string sName2("btest");
    std::string sName3("atest123");
    std::string sValue1("testa");
    std::string sValue2("testb");
    std::string sValue3("123testa");

    uint256 hash0(uint256S("0000000000000000000000000000000000000000000000000000000000000001"));
    BOOST_CHECK_EQUAL(pclaimTrie->getMerkleHash(), hash0);

    CMutableTransaction tx1 = BuildTransaction(fixture.GetCoinbase());
    tx1.vout[0].scriptPubKey = CScript()
        << OP_CLAIM_NAME
        << std::vector<unsigned char>(sName1.begin(), sName1.end())
        << std::vector<unsigned char>(sValue1.begin(), sValue1.end()) << OP_2DROP << OP_DROP << OP_TRUE;
    uint160 tx1ClaimId = ClaimIdHash(tx1.GetHash(), 0);
    COutPoint tx1OutPoint(tx1.GetHash(), 0);

    CMutableTransaction tx7 = fixture.MakeClaim(fixture.GetCoinbase(), sName1, sValue2, tx1.vout[0].nValue - 10001);
    uint160 tx7ClaimId = ClaimIdHash(tx7.GetHash(), 0);
    COutPoint tx7OutPoint(tx7.GetHash(), 0);

    CClaimValue val;
    int nThrowaway;

    // Verify claims (tx7) for uncontrolled names go in immediately
    fixture.IncrementBlocks(1, true);

    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName1, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx7OutPoint);

    // Verify claims for controlled names are delayed, and that the bigger claim wins when inserted
    fixture.IncrementBlocks(5);
    fixture.CommitTx(tx1);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);

    fixture.IncrementBlocks(5); // 12

    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);

    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName1, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx1OutPoint);

    // Verify updates to the best claim get inserted immediately, and others don't.
    CMutableTransaction tx3 = fixture.MakeUpdate(tx1, sName1, sValue1, tx1ClaimId, tx1.vout[0].nValue - 10000);
    COutPoint tx3OutPoint(tx3.GetHash(), 0);
    CMutableTransaction tx9 = fixture.MakeUpdate(tx7, sName1, sValue2, tx7ClaimId, tx7.vout[0].nValue - 10000);
    COutPoint tx9OutPoint(tx9.GetHash(), 0);
    fixture.IncrementBlocks(1, true); // 14

    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName1, tx1OutPoint), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName1, tx7OutPoint), false);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName1, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx3OutPoint);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName1, tx9OutPoint, nThrowaway), true);

    // Roll back the last block, make sure tx1 and tx7 are put back in the trie
    fixture.DecrementBlocks(); // 13

    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName1, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx1OutPoint);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName1, tx7OutPoint), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);

    // Roll all the way back, make sure all txs are out of the trie
    fixture.DecrementBlocks();

    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName1, val), false);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getMerkleHash(), hash0);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // Test undoing a claim before the claim gets into the trie

    // Put tx1 in the chain, then advance a few blocks.
    fixture.CommitTx(tx1);
    fixture.IncrementBlocks(1, true);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    fixture.IncrementBlocks(10); // 11

    // Put tx7 in the chain, verify it goes into the queue
    fixture.CommitTx(tx7);
    fixture.IncrementBlocks(1, true);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);

    // Undo that block and make sure it's not in the queue
    fixture.DecrementBlocks();

    // Make sure it's not in the queue
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // Go back to the beginning
    fixture.DecrementBlocks();

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // Test spend a claim which was just inserted into the trie

    // Immediately spend tx2 with tx4, verify nothing gets put in the trie
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), sName2, sValue2, tx1.vout[0].nValue - 1);
    COutPoint tx2OutPoint(tx2.GetHash(), 0);
    CMutableTransaction tx4 = fixture.Spend(tx2);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    fixture.DecrementBlocks(1);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // Verify that if a claim in the queue is spent, it does not get into the trie

    // Put tx5 into the chain, advance until it's in the trie for a few blocks

    CMutableTransaction tx5 = fixture.MakeClaim(fixture.GetCoinbase(), sName2, sValue2);
    COutPoint tx5OutPoint(tx5.GetHash(), 0);
    fixture.IncrementBlocks(6, true);

    // Put tx2 into the chain, and then advance a few blocks but not far enough for it to get into the trie
    fixture.CommitTx(tx2);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName2, tx2OutPoint, nThrowaway), true);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);

    fixture.IncrementBlocks(3);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);

    // Spend tx2 with tx4, and then advance to where tx2 would be inserted into the trie and verify it hasn't happened

    fixture.CommitTx(tx4);
    fixture.IncrementBlocks(1, true);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    fixture.IncrementBlocks(5);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName2, tx2OutPoint), false);

    // Undo spending tx2 with tx4, and then advance and verify tx2 is inserted into the trie when it should be

    fixture.DecrementBlocks();
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName2, tx2OutPoint, nThrowaway), true);

    fixture.IncrementBlocks(2);

    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName2, tx2OutPoint), true);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName2, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx5OutPoint);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName2, tx2OutPoint), true);

    // Test undoing a spend which involves a claim in the trie

    // spend tx2, which is in the trie, with tx4
    fixture.CommitTx(tx4);
    fixture.IncrementBlocks(1, true);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName2, tx2OutPoint), false);

    // undo spending tx2 with tx4, and verify tx2 is back in the trie
    fixture.DecrementBlocks();

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName2, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx5OutPoint);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName2, tx2OutPoint), true);

    // roll back to the beginning
    fixture.DecrementBlocks();

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // Test undoing a spent update which updated a claim still in the queue

    // Create the claim that will cause the others to be in the queue

    fixture.CommitTx(tx7);
    fixture.IncrementBlocks(6, true);

    // Create the original claim (tx1)

    fixture.CommitTx(tx1);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName1, tx1OutPoint, nThrowaway), true);

    // move forward some, but not far enough for the claim to get into the trie
    fixture.IncrementBlocks(2);

    // update the original claim (tx3 spends tx1)
    fixture.CommitTx(tx3);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName1, tx1OutPoint, nThrowaway), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName1, tx1OutPoint), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName1, tx3OutPoint, nThrowaway), true);

    // spend the update (tx6 spends tx3)

    CMutableTransaction tx6 = fixture.Spend(tx3);
    fixture.IncrementBlocks(1, true);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName1, tx3OutPoint), false);

    // undo spending the update (undo tx6 spending tx3)
    fixture.DecrementBlocks();

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);

    // make sure the update (tx3) still goes into effect when it's supposed to
    fixture.IncrementBlocks(9);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName1, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx3OutPoint);

    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName1, tx3OutPoint), true);

    // roll all the way back
    fixture.DecrementBlocks();

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // Test undoing an spent update which updated the best claim to a name

    // move forward until the original claim is inserted into the trie

    fixture.CommitTx(tx1);
    fixture.IncrementBlocks(1, true);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    fixture.IncrementBlocks(5);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName1, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx1OutPoint);

    // update the original claim (tx3 spends tx1)
    fixture.CommitTx(tx3);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName1, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx3OutPoint);

    // spend the update (tx6 spends tx3)
    fixture.CommitTx(tx6);
    fixture.IncrementBlocks(1, true);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // undo spending the update (undo tx6 spending tx3)
    fixture.DecrementBlocks();

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName1, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx3OutPoint);

    // Test having two updates to a claim in the same transaction

    // Add both txouts (tx8 spends tx3)
    CMutableTransaction tx8 = BuildTransaction(tx3, 0, 2);
    tx8.vout[0].scriptPubKey = CScript() << OP_UPDATE_CLAIM
                                         << std::vector<unsigned char>(sName1.begin(), sName1.end())
                                         << std::vector<unsigned char>(tx1ClaimId.begin(), tx1ClaimId.end())
                                         << std::vector<unsigned char>(sValue1.begin(), sValue1.end()) << OP_2DROP << OP_2DROP << OP_TRUE;
    tx8.vout[0].nValue = tx8.vout[0].nValue - 1;
    tx8.vout[1].scriptPubKey = CScript() << OP_CLAIM_NAME
                                         << std::vector<unsigned char>(sName1.begin(), sName1.end())
                                         << std::vector<unsigned char>(sValue2.begin(), sValue2.end()) << OP_2DROP << OP_DROP << OP_TRUE;
    COutPoint tx8OutPoint0(tx8.GetHash(), 0);
    COutPoint tx8OutPoint1(tx8.GetHash(), 1);

    fixture.CommitTx(tx8);
    fixture.IncrementBlocks(1, true);

    // ensure txout 0 made it into the trie and txout 1 did not

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);

    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName1, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx8OutPoint0);

    // roll forward until tx8 output 1 gets into the trie
    fixture.IncrementBlocks(6);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);

    fixture.IncrementBlocks(1);

    // ensure txout 1 made it into the trie and is now in control

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName1, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx8OutPoint1);

    // roll back to before tx8
    fixture.DecrementBlocks();

    // roll all the way back
    fixture.DecrementBlocks();

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // make sure invalid updates don't wreak any havoc

    // put tx1 into the trie
    fixture.CommitTx(tx1);
    fixture.IncrementBlocks(1, true);

    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName1, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx1OutPoint);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // advance a few blocks
    fixture.IncrementBlocks(5);

    // put in bad tx10
    CTransaction root = fixture.GetCoinbase();
    CMutableTransaction tx10 = fixture.MakeUpdate(root, sName1, sValue1, tx1ClaimId, root.vout[0].nValue);
    COutPoint tx10OutPoint(tx10.GetHash(), 0);
    fixture.IncrementBlocks(1, true);

    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName1, tx10OutPoint, nThrowaway), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // roll back, make sure nothing bad happens
    fixture.DecrementBlocks();

    // put it back in
    fixture.CommitTx(tx10);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName1, tx10OutPoint, nThrowaway), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // update it
    CMutableTransaction tx11 = fixture.MakeUpdate(tx10, sName1, sValue1, tx1ClaimId, tx10.vout[0].nValue);
    COutPoint tx11OutPoint(tx11.GetHash(), 0);
    fixture.IncrementBlocks(1, true);

    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName1, tx11OutPoint, nThrowaway), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    fixture.IncrementBlocks(10);

    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName1, tx11OutPoint, nThrowaway), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName1, tx11OutPoint), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // roll back to before the update
    fixture.DecrementBlocks();

    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName1, tx11OutPoint), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName1, tx11OutPoint, nThrowaway), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName1, tx10OutPoint), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName1, tx10OutPoint, nThrowaway), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // make sure tx10 would have gotten into the trie, then run tests again

    fixture.IncrementBlocks(10);

    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName1, tx10OutPoint), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName1, tx10OutPoint, nThrowaway), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // update it
    fixture.CommitTx(tx11);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName1, tx11OutPoint, nThrowaway), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName1, tx11OutPoint), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // make sure tx11 would have gotten into the trie

    fixture.IncrementBlocks(20);

    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName1, tx11OutPoint, nThrowaway), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName1, tx11OutPoint), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName1, tx10OutPoint, nThrowaway), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName1, tx10OutPoint), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // roll all the way back
    fixture.DecrementBlocks();

    // Put tx10 and tx11 in without tx1 in
    fixture.CommitTx(tx10);
    fixture.IncrementBlocks(1, true);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // update with tx11
    fixture.CommitTx(tx11);
    fixture.IncrementBlocks(1, true);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // roll back to before tx11
    fixture.DecrementBlocks();

    // spent tx10 with tx12 instead which is not a claim operation of any kind
    CMutableTransaction tx12 = BuildTransaction(tx10);

    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // roll all the way back
    fixture.DecrementBlocks();

    // make sure all claim for names which exist in the trie but have no
    // values get inserted immediately

    CMutableTransaction tx13 = fixture.MakeClaim(fixture.GetCoinbase(), sName3, sValue3, 1);
    fixture.IncrementBlocks(1, true);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    fixture.CommitTx(tx1);
    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // roll back
    fixture.DecrementBlocks();
}

BOOST_AUTO_TEST_CASE(basic_merkle_test)
{
    ClaimTrieChainFixture fixture;

    std::string sName("atest");
    std::string sValue("testa");

    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), sName, sValue, 10);
    fixture.IncrementBlocks(20);
    uint256 tx1MerkleHash = pclaimTrie->getMerkleHash();
    fixture.DecrementBlocks(20);
    BOOST_CHECK_EQUAL(tx1MerkleHash != pclaimTrie->getMerkleHash(), true);
    fixture.CommitTx(tx1);
    fixture.IncrementBlocks(20);
    BOOST_CHECK_EQUAL(tx1MerkleHash, pclaimTrie->getMerkleHash());
}

BOOST_AUTO_TEST_CASE(claim_expiration_test)
{
    ClaimTrieChainFixture fixture;

    std::string sName("atest");
    std::string sValue("testa");

    int nThrowaway;

    // set expiration time to 80 blocks after the block is created
    fixture.setExpirationForkHeight(1000000, 80, 1000000);

    // create a claim. verify the expiration event has been scheduled.
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), sName, sValue, 10);
    COutPoint tx1OutPoint(tx1.GetHash(), 0);
    fixture.IncrementBlocks(1, true);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), false);

    // advance until the expiration event occurs. verify the expiration event occurs on time.

    fixture.IncrementBlocks(79); // 80

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), false);

    fixture.IncrementBlocks(1); // 81

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), true);

    // roll forward a bit and then roll back to before the expiration event. verify the claim is reinserted. verify the expiration event is scheduled again.
    fixture.IncrementBlocks(20); // 101

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), true);

    fixture.DecrementBlocks(21); // 80

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), false);

    // advance until the expiration event occurs. verify the expiration event occurs on time.
    fixture.IncrementBlocks(1); // 81

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), true);

    // roll back to before the expiration event. verify the claim is reinserted. verify the expiration event is scheduled again.
    fixture.DecrementBlocks(2); // 79

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), false);

    // roll back some more.
    fixture.DecrementBlocks(39); // 40

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), false);

    // spend the claim. verify the expiration event is removed.
    CMutableTransaction tx2 = fixture.Spend(tx1);
    fixture.IncrementBlocks(1); // 41

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), true);

    // roll back the spend. verify the expiration event is returned.
    fixture.DecrementBlocks(1); // 40

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), false);

    // advance until the expiration event occurs. verify the event occurs on time.
    fixture.IncrementBlocks(40); // 80

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), false);

    fixture.IncrementBlocks(1); // 81

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), true);

    // spend the expired claim
    fixture.CommitTx(tx2);
    fixture.IncrementBlocks(1); // 82

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), true);

    // undo the spend. verify everything remains empty.
    fixture.DecrementBlocks(1); // 81

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), true);

    // roll back to before the expiration event. verify the claim is reinserted. verify the expiration event is scheduled again.
    fixture.DecrementBlocks(1); // 80

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), false);

    // verify the expiration event happens at the right time again
    fixture.IncrementBlocks(1); // 81

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), true);

    // roll back to before the expiration event. verify it gets reinserted and expiration gets scheduled.
    fixture.DecrementBlocks(1); // 80

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), false);

    // roll all the way back. verify the claim is removed and the expiration event is removed.
    fixture.DecrementBlocks(); // 0

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), true);

    // Make sure that when a claim expires, a lesser claim for the same name takes over

    CClaimValue val;

    // create one claim for the name
    fixture.CommitTx(tx1);
    fixture.IncrementBlocks(1, true); // 1

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), false);

    // advance a little while and insert the second claim
    fixture.IncrementBlocks(4); // 5
    CMutableTransaction tx3 = fixture.MakeClaim(fixture.GetCoinbase(), sName, sValue, 5);
    COutPoint tx3OutPoint(tx3.GetHash(), 0);
    fixture.IncrementBlocks(1); // 6

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), false);

    // advance until tx3 is valid, ensure tx1 is winning
    fixture.IncrementBlocks(4); // 10

    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName, tx3OutPoint, nThrowaway), true);

    fixture.IncrementBlocks(1); // 11

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx1OutPoint);
    uint256 tx1MerkleHash = pclaimTrie->getMerkleHash();

    // roll back to before tx3 is valid
    fixture.DecrementBlocks(1); // 10

    // advance again until tx is valid
    fixture.IncrementBlocks(1); // 11

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx1OutPoint);
    BOOST_CHECK_EQUAL(tx1MerkleHash, pclaimTrie->getMerkleHash());

    // advance until the expiration event occurs. verify the expiration event occurs on time.
    fixture.IncrementBlocks(69, true); // 80

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), false);

    fixture.IncrementBlocks(1); // 81

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx3OutPoint);
    BOOST_CHECK_EQUAL(tx1MerkleHash != pclaimTrie->getMerkleHash(), true);

    // spend tx1
    fixture.CommitTx(tx2);
    fixture.IncrementBlocks(1); // 82

    // roll back to when tx1 and tx3 are in the trie and tx1 is winning
    fixture.DecrementBlocks(); // 11

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx1OutPoint);
    BOOST_CHECK_EQUAL(tx1MerkleHash, pclaimTrie->getMerkleHash());

    // roll all the way back
    fixture.DecrementBlocks();
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->expirationQueueEmpty(), true);
}

BOOST_AUTO_TEST_CASE(claimtrienode_serialize_unserialize)
{
    CDataStream ss(SER_DISK, 0);

    uint160 hash160;

    CClaimTrieNode n1;
    CClaimTrieNode n2;
    CClaimValue throwaway;

    ss << n1;
    ss >> n2;
    BOOST_CHECK_EQUAL(n1, n2);

    n1.hash.SetHex("0000000000000000000000000000000000000000000000000000000000000001");
    BOOST_CHECK_EQUAL(n1 != n2, true);
    ss << n1;
    ss >> n2;
    BOOST_CHECK_EQUAL(n1, n2);

    n1.hash.SetHex("a79e8a5b28f7fa5e8836a4b48da9988bdf56ce749f81f413cb754f963a516200");
    BOOST_CHECK_EQUAL(n1 != n2, true);
    ss << n1;
    ss >> n2;
    BOOST_CHECK_EQUAL(n1, n2);

    CClaimValue v1(COutPoint(uint256S("0000000000000000000000000000000000000000000000000000000000000001"), 0), hash160, 50, 0, 100);
    CClaimValue v2(COutPoint(uint256S("0123456789abcdef0123456789abcdef0123456789abcdef0123456789abcdef"), 1), hash160, 100, 1, 101);

    n1.insertClaim(v1);
    BOOST_CHECK_EQUAL(n1 != n2, true);
    ss << n1;
    ss >> n2;
    BOOST_CHECK_EQUAL(n1, n2);

    n1.insertClaim(v2);
    BOOST_CHECK_EQUAL(n1 != n2, true);
    ss << n1;
    ss >> n2;
    BOOST_CHECK_EQUAL(n1, n2);

    n1.removeClaim(v1.outPoint, throwaway);
    BOOST_CHECK_EQUAL(n1 != n2, true);
    ss << n1;
    ss >> n2;
    BOOST_CHECK_EQUAL(n1, n2);

    n1.removeClaim(v2.outPoint, throwaway);
    BOOST_CHECK_EQUAL(n1 != n2, true);
    ss << n1;
    ss >> n2;
    BOOST_CHECK_EQUAL(n1, n2);
}

BOOST_AUTO_TEST_CASE(claimtrienode_remove_invalid_claim)
{
    uint160 hash160;

    CClaimTrieNode n1;
    CClaimTrieNode n2;
    CClaimValue throwaway;

    CClaimValue v1(COutPoint(uint256S("0000000000000000000000000000000000000000000000000000000000000001"), 0), hash160, 50, 0, 100);
    CClaimValue v2(COutPoint(uint256S("0123456789abcdef0123456789abcdef0123456789abcdef0123456789abcdef"), 1), hash160, 100, 1, 101);

    n1.insertClaim(v1);

    n2.insertClaim(v2);

    bool invalidClaim = n2.removeClaim(v1.outPoint, throwaway);
    BOOST_CHECK_EQUAL(invalidClaim, false);

    invalidClaim = n1.removeClaim(v2.outPoint, throwaway);
    BOOST_CHECK_EQUAL(invalidClaim, false);
}


BOOST_AUTO_TEST_CASE(invalid_claimid_test)
{
    ClaimTrieChainFixture fixture;

    std::string sName("atest");
    std::string sValue1("testa");
    std::string sValue2("testb");

    CClaimValue val;
    std::vector<uint256> blocks_to_invalidate;

    // Verify that supports expire

    // Create a 1 LBC claim (tx1)
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), sName, sValue1, 1);
    fixture.IncrementBlocks(1, true); // 1

    BOOST_CHECK_EQUAL(pcoinsTip->HaveCoin(COutPoint(tx1.GetHash(), 0)), true);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);

    // Make sure it gets way in there
    fixture.IncrementBlocks(100); // 101

    // Create a 5 LBC claim (tx2)
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), sName, sValue2, 5);
    fixture.IncrementBlocks(1); // 102

    BOOST_CHECK_EQUAL(pcoinsTip->HaveCoin(COutPoint(tx2.GetHash(), 0)), true);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);

    // Create a tx with a bogus claimId
    uint160 tx1ClaimId = ClaimIdHash(tx1.GetHash(), 0);
    CMutableTransaction tx3 = fixture.MakeUpdate(tx2, sName, sValue2, tx1ClaimId, 4);
    CMutableTransaction tx4 = BuildTransaction(tx3);
    COutPoint tx4OutPoint(tx4.GetHash(), 0);

    fixture.IncrementBlocks(1); // 103

    BOOST_CHECK_EQUAL(pcoinsTip->HaveCoin(COutPoint(tx3.GetHash(), 0)), true);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // Verify it's not in the claim trie
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());

    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName, tx4OutPoint), false);

    // Update the tx with the bogus claimId
    fixture.CommitTx(tx4);
    fixture.IncrementBlocks(1); // 104

    BOOST_CHECK_EQUAL(pcoinsTip->HaveCoin(tx4OutPoint), true);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);

    // Verify it's not in the claim trie

    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName, tx4OutPoint), false);

    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());

    // Go forward a few hundred blocks and verify it's not in there

    fixture.IncrementBlocks(101); // 205

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName, tx4OutPoint), false);

    // go all the way back
    fixture.DecrementBlocks();
    BOOST_CHECK(pclaimTrie->empty());
}


BOOST_AUTO_TEST_CASE(supporting_claims_test)
{
    ClaimTrieChainFixture fixture;

    std::string sName("atest");
    std::string sValue1("testa");
    std::string sValue2("testb");

    int initialHeight = chainActive.Height();

    CClaimValue val;

    // Test 1: create 1 LBC claim (tx1), create 5 LBC support (tx3), create 5 LBC claim (tx2)
    // Verify that tx1 retains control throughout
    // spend tx3, verify that tx2 gains control
    // roll back to before tx3 is spent, verify tx1 regains control
    // update tx1 with tx7, verify tx7 has control
    // roll back to before tx7 is inserted, verify tx1 regains control
    // roll back to before tx2 is valid, spend tx3
    // advance to tx2 valid, verify tx2 gains control
    // roll back to before tx3 is valid, spend tx3
    // advance to tx2 valid, verify tx2 gains control
    // roll back to insertion of tx3, and don't insert it
    // insert tx2, advance until it is valid, verify tx2 gains control

    // Put tx1 in the blockchain

    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), sName, sValue1, 1);
    fixture.IncrementBlocks(1); // 1

    BOOST_CHECK_EQUAL(pcoinsTip->HaveCoin(COutPoint(tx1.GetHash(), 0)), true);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);

    // advance a few blocks
    fixture.IncrementBlocks(5); // 6

    // Put tx3 into the blockchain
    CMutableTransaction tx3 = fixture.MakeSupport(fixture.GetCoinbase(), tx1, sName, 5);
    fixture.IncrementBlocks(1); // 7

    BOOST_CHECK_EQUAL(pcoinsTip->HaveCoin(COutPoint(tx3.GetHash(), 0)), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);

    // advance a few blocks
    fixture.IncrementBlocks(3); // 10

    // Put tx2 into the blockchain
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), sName, sValue2, 5);
    fixture.IncrementBlocks(1); // 11

    BOOST_CHECK_EQUAL(pcoinsTip->HaveCoin(COutPoint(tx2.GetHash(), 0)), true);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);

    // advance until tx2 is valid
    fixture.IncrementBlocks(9); // 20

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);

    fixture.IncrementBlocks(1); // 21

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);

    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());
    BOOST_CHECK_EQUAL(val.outPoint.n, static_cast<size_t>(0));
    uint256 tx1MerkleHash = pclaimTrie->getMerkleHash();

    CMutableTransaction tx4 = BuildTransaction(tx1);
    CMutableTransaction tx5 = BuildTransaction(tx2);
    CMutableTransaction tx6 = BuildTransaction(tx3);

    // spend tx3
    fixture.CommitTx(tx6);
    fixture.IncrementBlocks(1); // 22

    // verify tx2 gains control
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());
    BOOST_CHECK_EQUAL(tx1MerkleHash != pclaimTrie->getMerkleHash(), true);

    // unspend tx3, verify tx1 regains control
    fixture.DecrementBlocks(1); // 21

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());
    BOOST_CHECK_EQUAL(tx1MerkleHash, pclaimTrie->getMerkleHash());

    // update tx1 with tx7, verify tx7 has control
    uint160 claimId = ClaimIdHash(tx1.GetHash(), 0);
    CMutableTransaction tx7 = fixture.MakeUpdate(tx1, sName, sValue1, claimId, tx1.vout[0].nValue);
    fixture.IncrementBlocks(1); // 22

    BOOST_CHECK_EQUAL(pcoinsTip->HaveCoin(COutPoint(tx7.GetHash(), 0)), true);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx7.GetHash());
    BOOST_CHECK_EQUAL(tx1MerkleHash != pclaimTrie->getMerkleHash(), true);

    // roll back to before tx7 is inserted, verify tx1 has control
    fixture.DecrementBlocks(1); // 21

    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());
    BOOST_CHECK_EQUAL(tx1MerkleHash, pclaimTrie->getMerkleHash());

    // roll back to before tx2 is valid
    fixture.DecrementBlocks(1); // 20

    // spend tx3
    fixture.CommitTx(tx6);
    fixture.IncrementBlocks(1); // 21

    // Verify tx2 gains control
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());
    BOOST_CHECK_EQUAL(tx1MerkleHash != pclaimTrie->getMerkleHash(), true);

    // roll back to before tx3 is inserted
    fixture.DecrementBlocks(15); // 6

    // advance a few blocks
    fixture.IncrementBlocks(4); // 10

    // Put tx2 into the blockchain
    fixture.CommitTx(tx2);
    fixture.IncrementBlocks(1); // 11

    BOOST_CHECK_EQUAL(pcoinsTip->HaveCoin(COutPoint(tx2.GetHash(), 0)), true);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);

    // advance until tx2 is valid
    fixture.IncrementBlocks(9); // 20

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);

    fixture.IncrementBlocks(2); // 22

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());
    BOOST_CHECK_EQUAL(tx1MerkleHash != pclaimTrie->getMerkleHash(), true);

    // roll all the way back
    fixture.DecrementBlocks(22); // 0
    BOOST_CHECK_EQUAL(initialHeight, chainActive.Height());

    // Make sure that when a support in the queue gets spent and then the spend is
    // undone, it goes back into the queue in the right spot

    // put tx2 and tx1 into the trie

    fixture.CommitTx(tx1);
    fixture.CommitTx(tx2);
    fixture.IncrementBlocks(1); // 1

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());
    BOOST_CHECK_EQUAL(tx1MerkleHash != pclaimTrie->getMerkleHash(), true);

    // advance a few blocks
    fixture.IncrementBlocks(5); // 6

    // put tx3 into the support queue
    fixture.CommitTx(tx3);
    fixture.IncrementBlocks(1); // 7

    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), false);

    // advance a couple of blocks
    fixture.IncrementBlocks(2); // 9

    // spend tx3
    fixture.CommitTx(tx6);
    fixture.IncrementBlocks(1); // 10

    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);

    // undo spend of tx3, verify it gets back in the right place in the queue
    fixture.DecrementBlocks(1); // 9

    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), false);

    fixture.IncrementBlocks(4); // 13

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());
    BOOST_CHECK_EQUAL(val.outPoint.n, static_cast<size_t>(0));
    // tx1MerkleHash doesn't match right here because it is at a different activation height (part of the node hash)
    tx1MerkleHash = pclaimTrie->getMerkleHash();

    // spend tx3 again, then undo the spend and roll back until it's back in the queue
    fixture.CommitTx(tx6);
    fixture.IncrementBlocks(1); // 14

    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());
    BOOST_CHECK_EQUAL(tx1MerkleHash != pclaimTrie->getMerkleHash(), true);

    fixture.DecrementBlocks(1); // 13

    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());
    BOOST_CHECK_EQUAL(tx1MerkleHash, pclaimTrie->getMerkleHash());

    // roll all the way back
    fixture.DecrementBlocks(13);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
}

BOOST_AUTO_TEST_CASE(supporting_claims2_test)
{
    ClaimTrieChainFixture fixture;

    std::string sName("atest");
    std::string sValue1("testa");
    std::string sValue2("testb");

    CClaimValue val;
    int nThrowaway;

    // Test 2: create 1 LBC claim (tx1), create 5 LBC claim (tx2), create 5 LBC support (tx3)
    // Verify that tx1 loses control when tx2 becomes valid, and then tx1 gains control when tx3 becomes valid
    // Then, verify that tx2 regains control when A) tx3 is spent and B) tx3 is undone

    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), sName, sValue1, 1);
    fixture.IncrementBlocks(1); // 1

    BOOST_CHECK_EQUAL(pcoinsTip->HaveCoin(COutPoint(tx1.GetHash(), 0)), true);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);

    // advance a few blocks
    fixture.IncrementBlocks(4); // 5

    // put tx2 into the blockchain
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), sName, sValue2, 5);
    fixture.IncrementBlocks(1); // 6

    BOOST_CHECK_EQUAL(pcoinsTip->HaveCoin(COutPoint(tx2.GetHash(), 0)), true);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);

    // advance until tx2 is in the trie
    fixture.IncrementBlocks(4); // 10

    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);
    COutPoint tx2cp(tx2.GetHash(), 0);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaimInQueue(sName, tx2cp, nThrowaway), true);

    fixture.IncrementBlocks(1); // 11
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());

    // advance a few blocks
    fixture.IncrementBlocks(4); // 15

    // put tx3 into the blockchain

    CMutableTransaction tx3 = fixture.MakeSupport(fixture.GetCoinbase(), tx1, sName, 5);
    fixture.IncrementBlocks(1); // 16

    BOOST_CHECK_EQUAL(pcoinsTip->HaveCoin(COutPoint(tx3.GetHash(), 0)), true);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), false);

    // advance until tx3 is valid
    fixture.IncrementBlocks(4); // 20

    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), false);

    fixture.IncrementBlocks(1); // 21

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());

    CMutableTransaction tx4 = BuildTransaction(tx1);
    CMutableTransaction tx5 = BuildTransaction(tx2);
    CMutableTransaction tx6 = BuildTransaction(tx3);

    // spend tx3
    fixture.CommitTx(tx6);
    fixture.IncrementBlocks(1); // 22

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());

    // undo spend
    fixture.DecrementBlocks(1); // 21

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());

    // roll back to before tx3 is valid
    fixture.DecrementBlocks(1); // 20

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());

    // roll all the way back
    fixture.DecrementBlocks(20); // 0

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);

    // Test 4: create 1 LBC claim (tx1), wait till valid, create 5 LBC claim (tx2), create 5 LBC support (tx3)
    // Verify that tx1 retains control throughout

    // put tx1 into the blockchain

    fixture.CommitTx(tx1);
    fixture.IncrementBlocks(1); // 1

    BOOST_CHECK_EQUAL(pcoinsTip->HaveCoin(COutPoint(tx1.GetHash(), 0)), true);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());

    // advance a few blocks
    fixture.IncrementBlocks(5); // 6

    // put tx2 into the blockchain
    fixture.CommitTx(tx2);
    fixture.IncrementBlocks(1); // 7

    uint256 rootMerkleHash = pclaimTrie->getMerkleHash();

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());
    BOOST_CHECK_EQUAL(rootMerkleHash, pclaimTrie->getMerkleHash());

    // advance some, insert tx3, should be immediately valid
    fixture.IncrementBlocks(2); // 9
    fixture.CommitTx(tx3);
    fixture.IncrementBlocks(1); // 10

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());
    BOOST_CHECK_EQUAL(rootMerkleHash, pclaimTrie->getMerkleHash());

    // advance until tx2 is valid, verify tx1 retains control
    fixture.IncrementBlocks(3); // 13

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());
    BOOST_CHECK_EQUAL(rootMerkleHash, pclaimTrie->getMerkleHash());
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName, tx2cp), true);

    // roll all the way back
    fixture.DecrementBlocks(13); // 0

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);

    // Test 5: create 5 LBC claim (tx2), wait till valid, create 1 LBC claim (tx1), create 5 LBC support (tx3)
    // Verify that tx2 retains control until support becomes valid

    // insert tx2 into the blockchain
    fixture.CommitTx(tx2);
    fixture.IncrementBlocks(1); // 1

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());
    BOOST_CHECK_EQUAL(rootMerkleHash != pclaimTrie->getMerkleHash(), true);

    // advance a few blocks
    fixture.IncrementBlocks(9); // 10

    // insert tx1 into the block chain
    fixture.CommitTx(tx1);
    fixture.IncrementBlocks(1); // 11

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());
    BOOST_CHECK_EQUAL(rootMerkleHash != pclaimTrie->getMerkleHash(), true);

    // advance some
    fixture.IncrementBlocks(5); // 16

    // insert tx3 into the block chain
    fixture.CommitTx(tx3);
    fixture.IncrementBlocks(1); // 17

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());
    BOOST_CHECK_EQUAL(rootMerkleHash != pclaimTrie->getMerkleHash(), true);

    // advance until tx1 is valid
    fixture.IncrementBlocks(5); // 22

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());
    COutPoint tx1cp(tx1.GetHash(), 0);
    BOOST_CHECK_EQUAL(pclaimTrie->haveClaim(sName, tx1cp), true);

    // advance until tx3 is valid
    fixture.IncrementBlocks(11); // 33

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());

    // roll all the way back
    fixture.DecrementBlocks(33); // 0

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);


    // Test 6: create 1 LBC claim (tx1), wait till valid, create 5 LBC claim (tx2), create 5 LBC support (tx3), spend tx1
    // Verify that tx1 retains control until it is spent
    fixture.CommitTx(tx1);
    fixture.IncrementBlocks(1); // 1

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());

    // advance a few blocks
    fixture.IncrementBlocks(5); // 6

    // insert tx2 into the blockchain
    fixture.CommitTx(tx2);
    fixture.IncrementBlocks(1); // 7

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());

    // advance some, insert tx3
    fixture.IncrementBlocks(2); // 9
    fixture.CommitTx(tx3);
    fixture.IncrementBlocks(1); // 10

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());

    // advance until tx2 is valid
    fixture.IncrementBlocks(3); // 13

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());

    // spend tx1
    fixture.CommitTx(tx4);
    fixture.IncrementBlocks(1); // 14

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());

    // undo spend of tx1
    fixture.DecrementBlocks(1); // 13

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());

    // roll all the way back
    fixture.DecrementBlocks(13); // 0

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);

    // Test 7: create 1 LBC claim (tx1), wait till valid, create 5 LBC support (tx3), spend tx1
    // Verify name trie is empty

    // insert tx1 into blockchain
    fixture.CommitTx(tx1);
    fixture.IncrementBlocks(1); // 1

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);

    // insert tx3 into blockchain
    fixture.CommitTx(tx3);
    fixture.IncrementBlocks(1); // 2

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);

    // spent tx1
    fixture.CommitTx(tx4);
    fixture.IncrementBlocks(1); // 3

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);

    // roll all the way back
    fixture.DecrementBlocks(3);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
}

BOOST_AUTO_TEST_CASE(expiring_supports_test)
{
    ClaimTrieChainFixture fixture;

    std::string sName("atest");
    std::string sValue1("testa");
    std::string sValue2("testb");

    CClaimValue val;
    std::vector<uint256> blocks_to_invalidate;

    fixture.setExpirationForkHeight(1000000, 80, 1000000);

    // to be active bid must have: a higher block number and current block >= (current height - block number) / 32

    // Verify that supports expire

    // Create a 1 LBC claim (tx1)
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), sName, sValue1, 1);
    fixture.IncrementBlocks(1); // 1, expires at 81

    BOOST_CHECK_EQUAL(pcoinsTip->HaveCoin(COutPoint(tx1.GetHash(), 0)), true);
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);

    // Create a 5 LBC support (tx3)
    CMutableTransaction tx3 = fixture.MakeSupport(fixture.GetCoinbase(), tx1, sName, 5);
    fixture.IncrementBlocks(1); // 2, expires at 82

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);

    // Advance some, then insert 5 LBC claim (tx2)
    fixture.IncrementBlocks(19); // 21

    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), sName, sValue2, 5);
    fixture.IncrementBlocks(1); // 22, activating in (22 - 2) / 1 = 20block (but not then active because support still holds tx1 up)

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    uint256 rootMerkleHash = pclaimTrie->getMerkleHash();

    // Advance until tx2 is valid
    fixture.IncrementBlocks(20); // 42

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(rootMerkleHash, pclaimTrie->getMerkleHash());

    fixture.IncrementBlocks(1); // 43

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx1.GetHash());
    rootMerkleHash = pclaimTrie->getMerkleHash();

    // Update tx1 so that it expires after tx3 expires
    uint160 claimId = ClaimIdHash(tx1.GetHash(), 0);
    CMutableTransaction tx4 = fixture.MakeUpdate(tx1, sName, sValue1, claimId, tx1.vout[0].nValue);

    fixture.IncrementBlocks(1); // 44

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx4.GetHash());
    BOOST_CHECK_EQUAL(rootMerkleHash != pclaimTrie->getMerkleHash(), true);

    // Advance until the support expires
    fixture.IncrementBlocks(37); // 81

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    rootMerkleHash = pclaimTrie->getMerkleHash();

    fixture.IncrementBlocks(1); // 82

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());
    BOOST_CHECK_EQUAL(rootMerkleHash != pclaimTrie->getMerkleHash(), true);
    rootMerkleHash = pclaimTrie->getMerkleHash();

    // undo the block, make sure control goes back
    fixture.DecrementBlocks(1); // 81

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx4.GetHash());
    BOOST_CHECK_EQUAL(rootMerkleHash != pclaimTrie->getMerkleHash(), true);

    // redo the block, make sure it expires again
    fixture.IncrementBlocks(1); // 82

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());
    rootMerkleHash = pclaimTrie->getMerkleHash();

    // roll back some, spend the support, and make sure nothing unexpected
    // happens at the time the support should have expired

    fixture.DecrementBlocks(19); // 63

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx4.GetHash());
    BOOST_CHECK_EQUAL(rootMerkleHash != pclaimTrie->getMerkleHash(), true);

    fixture.Spend(tx3);
    fixture.IncrementBlocks(1); // 64

    blocks_to_invalidate.push_back(chainActive.Tip()->GetBlockHash());

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());

    fixture.IncrementBlocks(20); // 84

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());

    //undo the spend, and make sure it still expires on time

    fixture.DecrementBlocks(21); // 63

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx4.GetHash());

    fixture.IncrementBlocks(18); // 81

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx4.GetHash());

    fixture.IncrementBlocks(1); // 82

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName, val), true);
    BOOST_CHECK_EQUAL(val.outPoint.hash, tx2.GetHash());

    // roll all the way back
    fixture.DecrementBlocks(82);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->supportQueueEmpty(), true);
}

bool verify_proof(const CClaimTrieProof proof, uint256 rootHash, const std::string& name)
{
    uint256 previousComputedHash;
    std::string computedReverseName;
    bool verifiedValue = false;

    for (std::vector<CClaimTrieProofNode>::const_reverse_iterator itNodes = proof.nodes.rbegin(); itNodes != proof.nodes.rend(); ++itNodes) {
        bool foundChildInChain = false;
        std::vector<unsigned char> vchToHash;
        for (std::vector<std::pair<unsigned char, uint256> >::const_iterator itChildren = itNodes->children.begin(); itChildren != itNodes->children.end(); ++itChildren) {
            vchToHash.push_back(itChildren->first);
            uint256 childHash;
            if (itChildren->second.IsNull()) {
                if (previousComputedHash.IsNull()) {
                    return false;
                }
                if (foundChildInChain) {
                    return false;
                }
                foundChildInChain = true;
                computedReverseName += itChildren->first;
                childHash = previousComputedHash;
            } else {
                childHash = itChildren->second;
            }
            vchToHash.insert(vchToHash.end(), childHash.begin(), childHash.end());
        }
        if (itNodes != proof.nodes.rbegin() && !foundChildInChain) {
            return false;
        }
        if (itNodes->hasValue) {
            uint256 valHash;
            if (itNodes->valHash.IsNull()) {
                if (itNodes != proof.nodes.rbegin()) {
                    return false;
                }
                if (!proof.hasValue) {
                    return false;
                }
                valHash = getValueHash(proof.outPoint,
                    proof.nHeightOfLastTakeover);

                verifiedValue = true;
            } else {
                valHash = itNodes->valHash;
            }
            vchToHash.insert(vchToHash.end(), valHash.begin(), valHash.end());
        } else if (proof.hasValue && itNodes == proof.nodes.rbegin()) {
            return false;
        }
        CHash256 hasher;
        std::vector<unsigned char> vchHash(hasher.OUTPUT_SIZE);
        hasher.Write(vchToHash.data(), vchToHash.size());
        hasher.Finalize(&(vchHash[0]));
        uint256 calculatedHash(vchHash);
        previousComputedHash = calculatedHash;
    }
    if (previousComputedHash != rootHash) {
        return false;
    }
    if (proof.hasValue && !verifiedValue) {
        return false;
    }
    std::string::reverse_iterator itComputedName = computedReverseName.rbegin();
    std::string::const_iterator itName = name.begin();
    for (; itName != name.end() && itComputedName != computedReverseName.rend(); ++itName, ++itComputedName) {
        if (*itName != *itComputedName) {
            return false;
        }
    }
    return (!proof.hasValue || itName == name.end());
}

BOOST_AUTO_TEST_CASE(value_proof_test)
{
    ClaimTrieChainFixture fixture;

    std::string sName1("a");
    std::string sValue1("testa");

    std::string sName2("abc");
    std::string sValue2("testabc");

    std::string sName3("abd");
    std::string sValue3("testabd");

    std::string sName4("zyx");
    std::string sValue4("testzyx");

    std::string sName5("zyxa");
    std::string sName6("omg");
    std::string sName7("");

    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), sName1, sValue1);
    COutPoint tx1OutPoint(tx1.GetHash(), 0);

    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), sName2, sValue2);
    COutPoint tx2OutPoint(tx2.GetHash(), 0);

    CMutableTransaction tx3 = fixture.MakeClaim(fixture.GetCoinbase(), sName3, sValue3);
    COutPoint tx3OutPoint(tx3.GetHash(), 0);

    CMutableTransaction tx4 = fixture.MakeClaim(fixture.GetCoinbase(), sName4, sValue4);
    COutPoint tx4OutPoint(tx4.GetHash(), 0);
    CClaimValue val;

    // create a claim. verify the expiration event has been scheduled.
    fixture.IncrementBlocks(5, true);

    BOOST_CHECK_EQUAL(pclaimTrie->empty(), false);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName1, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx1OutPoint);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName2, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx2OutPoint);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName3, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx3OutPoint);
    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName4, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx4OutPoint);

    CClaimTrieCache cache(pclaimTrie);

    CClaimTrieProof proof;

    BOOST_CHECK_EQUAL(cache.getProofForName(sName1, proof), true);
    BOOST_CHECK_EQUAL(verify_proof(proof, chainActive.Tip()->hashClaimTrie, sName1), true);
    BOOST_CHECK_EQUAL(proof.outPoint, tx1OutPoint);

    BOOST_CHECK_EQUAL(cache.getProofForName(sName2, proof), true);
    BOOST_CHECK_EQUAL(verify_proof(proof, chainActive.Tip()->hashClaimTrie, sName2), true);
    BOOST_CHECK_EQUAL(proof.outPoint, tx2OutPoint);

    BOOST_CHECK_EQUAL(cache.getProofForName(sName3, proof), true);
    BOOST_CHECK_EQUAL(verify_proof(proof, chainActive.Tip()->hashClaimTrie, sName3), true);
    BOOST_CHECK_EQUAL(proof.outPoint, tx3OutPoint);

    BOOST_CHECK_EQUAL(cache.getProofForName(sName4, proof), true);
    BOOST_CHECK_EQUAL(verify_proof(proof, chainActive.Tip()->hashClaimTrie, sName4), true);
    BOOST_CHECK_EQUAL(proof.outPoint, tx4OutPoint);

    BOOST_CHECK_EQUAL(cache.getProofForName(sName5, proof), true);
    BOOST_CHECK_EQUAL(verify_proof(proof, chainActive.Tip()->hashClaimTrie, sName5), true);
    BOOST_CHECK_EQUAL(proof.hasValue, false);

    BOOST_CHECK_EQUAL(cache.getProofForName(sName6, proof), true);
    BOOST_CHECK_EQUAL(verify_proof(proof, chainActive.Tip()->hashClaimTrie, sName6), true);
    BOOST_CHECK_EQUAL(proof.hasValue, false);

    BOOST_CHECK_EQUAL(cache.getProofForName(sName7, proof), true);
    BOOST_CHECK_EQUAL(verify_proof(proof, chainActive.Tip()->hashClaimTrie, sName7), true);
    BOOST_CHECK_EQUAL(proof.hasValue, false);

    CMutableTransaction tx5 = fixture.MakeClaim(fixture.GetCoinbase(), sName7, sValue4);
    COutPoint tx5OutPoint(tx5.GetHash(), 0);

    fixture.IncrementBlocks(1);

    BOOST_CHECK_EQUAL(pclaimTrie->getInfoForName(sName7, val), true);
    BOOST_CHECK_EQUAL(val.outPoint, tx5OutPoint);

    cache = CClaimTrieCache(pclaimTrie);

    BOOST_CHECK_EQUAL(cache.getProofForName(sName1, proof), true);
    BOOST_CHECK_EQUAL(verify_proof(proof, chainActive.Tip()->hashClaimTrie, sName1), true);
    BOOST_CHECK_EQUAL(proof.outPoint, tx1OutPoint);

    BOOST_CHECK_EQUAL(cache.getProofForName(sName2, proof), true);
    BOOST_CHECK_EQUAL(verify_proof(proof, chainActive.Tip()->hashClaimTrie, sName2), true);
    BOOST_CHECK_EQUAL(proof.outPoint, tx2OutPoint);

    BOOST_CHECK_EQUAL(cache.getProofForName(sName3, proof), true);
    BOOST_CHECK_EQUAL(verify_proof(proof, chainActive.Tip()->hashClaimTrie, sName3), true);
    BOOST_CHECK_EQUAL(proof.outPoint, tx3OutPoint);

    BOOST_CHECK_EQUAL(cache.getProofForName(sName4, proof), true);
    BOOST_CHECK_EQUAL(verify_proof(proof, chainActive.Tip()->hashClaimTrie, sName4), true);
    BOOST_CHECK_EQUAL(proof.outPoint, tx4OutPoint);

    BOOST_CHECK_EQUAL(cache.getProofForName(sName5, proof), true);
    BOOST_CHECK_EQUAL(verify_proof(proof, chainActive.Tip()->hashClaimTrie, sName5), true);
    BOOST_CHECK_EQUAL(proof.hasValue, false);

    BOOST_CHECK_EQUAL(cache.getProofForName(sName6, proof), true);
    BOOST_CHECK_EQUAL(verify_proof(proof, chainActive.Tip()->hashClaimTrie, sName6), true);
    BOOST_CHECK_EQUAL(proof.hasValue, false);

    BOOST_CHECK_EQUAL(cache.getProofForName(sName7, proof), true);
    BOOST_CHECK_EQUAL(verify_proof(proof, chainActive.Tip()->hashClaimTrie, sName7), true);
    BOOST_CHECK_EQUAL(proof.outPoint, tx5OutPoint);

    fixture.DecrementBlocks();
    BOOST_CHECK_EQUAL(pclaimTrie->empty(), true);
    BOOST_CHECK_EQUAL(pclaimTrie->queueEmpty(), true);
}

// Check that blocks with bogus calimtrie hash is rejected
BOOST_AUTO_TEST_CASE(bogus_claimtrie_hash_test)
{
    ClaimTrieChainFixture fixture;
    std::string sName("test");
    std::string sValue1("test");

    int orig_chain_height = chainActive.Height();

    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), sName, sValue1, 1);

    std::unique_ptr<CBlockTemplate> pblockTemp = AssemblerForTest().CreateNewBlock(tx1.vout[0].scriptPubKey);
    BOOST_CHECK_EQUAL(pblockTemp != nullptr, true);
    pblockTemp->block.hashPrevBlock = chainActive.Tip()->GetBlockHash();
    pblockTemp->block.nVersion = 5;
    pblockTemp->block.nTime = chainActive.Tip()->GetBlockTime() + Params().GetConsensus().nPowTargetSpacing;
    CMutableTransaction txCoinbase(*pblockTemp->block.vtx[0]);
    txCoinbase.vin[0].scriptSig = CScript() << int(chainActive.Height() + 1) << 1;
    txCoinbase.vout[0].nValue = GetBlockSubsidy(chainActive.Height() + 1, Params().GetConsensus());
    pblockTemp->block.vtx[0] = MakeTransactionRef(std::move(txCoinbase));
    pblockTemp->block.hashMerkleRoot = BlockMerkleRoot(pblockTemp->block);
    //create bogus hash

    uint256 bogusHashClaimTrie;
    bogusHashClaimTrie.SetHex("aaa");
    pblockTemp->block.hashClaimTrie = bogusHashClaimTrie;

    for (uint32_t i = 0;; ++i) {
        pblockTemp->block.nNonce = i;
        if (CheckProofOfWork(pblockTemp->block.GetPoWHash(), pblockTemp->block.nBits, Params().GetConsensus())) {
            break;
        }
    }
    bool success = ProcessNewBlock(Params(), std::make_shared<const CBlock>(pblockTemp->block), true, nullptr);
    // will process , but will not be connected
    BOOST_CHECK_EQUAL(success, true);
    BOOST_CHECK_EQUAL(pblockTemp->block.GetHash() != chainActive.Tip()->GetBlockHash(), true);
    BOOST_CHECK_EQUAL(orig_chain_height, chainActive.Height());
}

/*
 * tests for CClaimTrie::getClaimById basic consistency checks
 */
BOOST_AUTO_TEST_CASE(get_claim_by_id_test_2)
{
    ClaimTrieChainFixture fixture;
    const std::string name = "test";
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), name, "one", 1);
    uint160 claimId = ClaimIdHash(tx1.GetHash(), 0);
    CMutableTransaction txx = fixture.MakeClaim(fixture.GetCoinbase(), name, "one", 1);
    uint160 claimIdx = ClaimIdHash(txx.GetHash(), 0);

    fixture.IncrementBlocks(1);

    CClaimValue claimValue;
    std::string claimName;
    pclaimTrie->getClaimById(claimId, claimName, claimValue);
    BOOST_CHECK_EQUAL(claimName, name);
    BOOST_CHECK_EQUAL(claimValue.claimId, claimId);

    CMutableTransaction txa = fixture.Spend(tx1);
    CMutableTransaction txb = fixture.Spend(txx);

    fixture.IncrementBlocks(1);
    BOOST_CHECK_EQUAL(pclaimTrie->getClaimById(claimId, claimName, claimValue), false);
    BOOST_CHECK_EQUAL(pclaimTrie->getClaimById(claimIdx, claimName, claimValue), false);

    fixture.DecrementBlocks(1);
    pclaimTrie->getClaimById(claimId, claimName, claimValue);
    BOOST_CHECK_EQUAL(claimName, name);
    BOOST_CHECK_EQUAL(claimValue.claimId, claimId);

    // this test fails
    pclaimTrie->getClaimById(claimIdx, claimName, claimValue);
    BOOST_CHECK_EQUAL(claimName, name);
    BOOST_CHECK_EQUAL(claimValue.claimId, claimIdx);
}

BOOST_AUTO_TEST_CASE(get_claim_by_id_test_3)
{
    ClaimTrieChainFixture fixture;
    fixture.setExpirationForkHeight(1000000, 5, 1000000);

    const std::string name = "test";
    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), name, "one", 1);
    uint160 claimId = ClaimIdHash(tx1.GetHash(), 0);

    fixture.IncrementBlocks(1);

    CClaimValue claimValue;
    std::string claimName;
    pclaimTrie->getClaimById(claimId, claimName, claimValue);
    BOOST_CHECK_EQUAL(claimName, name);
    BOOST_CHECK_EQUAL(claimValue.claimId, claimId);
    // make second claim with activation delay 1
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), name, "one", 2);
    uint160 claimId2 = ClaimIdHash(tx2.GetHash(), 0);

    fixture.IncrementBlocks(1);
    // second claim is not activated yet, but can still access by claim id
    BOOST_CHECK_EQUAL(is_best_claim(name, tx1), predicate_true);
    BOOST_CHECK_EQUAL(pclaimTrie->getClaimById(claimId2, claimName, claimValue), true);
    BOOST_CHECK_EQUAL(claimName, name);
    BOOST_CHECK_EQUAL(claimValue.claimId, claimId2);

    fixture.IncrementBlocks(1);
    // second claim has activated
    BOOST_CHECK_EQUAL(is_best_claim(name, tx2), predicate_true);
    BOOST_CHECK_EQUAL(pclaimTrie->getClaimById(claimId2, claimName, claimValue), true);
    BOOST_CHECK_EQUAL(claimName, name);
    BOOST_CHECK_EQUAL(claimValue.claimId, claimId2);


    fixture.DecrementBlocks(1);
    // second claim has been deactivated via decrement
    // should still be accesible via claim id
    BOOST_CHECK_EQUAL(is_best_claim(name, tx1), predicate_true);
    BOOST_CHECK_EQUAL(pclaimTrie->getClaimById(claimId2, claimName, claimValue), true);
    BOOST_CHECK_EQUAL(claimName, name);
    BOOST_CHECK_EQUAL(claimValue.claimId, claimId2);

    fixture.IncrementBlocks(1);
    // second claim should have been re activated via increment
    BOOST_CHECK_EQUAL(is_best_claim(name, tx2), predicate_true);
    BOOST_CHECK_EQUAL(pclaimTrie->getClaimById(claimId2, claimName, claimValue), true);
    BOOST_CHECK_EQUAL(claimName, name);
    BOOST_CHECK_EQUAL(claimValue.claimId, claimId2);
}

BOOST_AUTO_TEST_CASE(getclaimsintrie_test)
{
    ClaimTrieChainFixture fixture;
    std::string sName1("test");
    std::string sValue1("test");
    std::string sName2("test2");
    std::string sValue2("test2");

    fixture.MakeClaim(fixture.GetCoinbase(), sName1, sValue1, 42);
    fixture.IncrementBlocks(1);

    uint256 blockHash = chainActive.Tip()->GetBlockHash();

    fixture.MakeClaim(fixture.GetCoinbase(), sName2, sValue2, 43);
    fixture.IncrementBlocks(1);

    rpcfn_type getclaimsintrie = tableRPC["getclaimsintrie"]->actor;
    JSONRPCRequest req;
    req.params = UniValue(UniValue::VARR);

    UniValue results = getclaimsintrie(req);
    BOOST_CHECK_EQUAL(results.size(), 2U);
    BOOST_CHECK_EQUAL(results[0]["normalized_name"].get_str(), sName1);
    BOOST_CHECK_EQUAL(results[1]["normalized_name"].get_str(), sName2);

    req.params.push_back(blockHash.GetHex());

    results = getclaimsintrie(req);
    BOOST_CHECK_EQUAL(results.size(), 1U);
    BOOST_CHECK_EQUAL(results[0]["normalized_name"].get_str(), sName1);
}

BOOST_AUTO_TEST_CASE(getclaimsintrie_test2)
{
    ClaimTrieChainFixture fixture;
    std::string sName1("test");
    std::string sValue1("test");

    uint256 blockHash = chainActive.Tip()->GetBlockHash();

    rpcfn_type getclaimsintrie = tableRPC["getclaimsintrie"]->actor;
    rpcfn_type getclaimtrie = tableRPC["getclaimtrie"]->actor;
    JSONRPCRequest req;
    req.params = UniValue(UniValue::VARR);
    req.params.push_back(blockHash.GetHex());
    UniValue results = getclaimsintrie(req);
    BOOST_CHECK_EQUAL(results.size(), 0U);
    results = getclaimtrie(req);
    BOOST_CHECK_EQUAL(results.size(), 1U);

    fixture.IncrementBlocks(10);
    fixture.MakeClaim(fixture.GetCoinbase(), sName1, sValue1, 42);
    fixture.IncrementBlocks(10);
    results = getclaimsintrie(req);
    BOOST_CHECK_EQUAL(results.size(), 0U);
    results = getclaimtrie(req);
    BOOST_CHECK_EQUAL(results.size(), 1U);
}

BOOST_AUTO_TEST_CASE(getclaimtrie_test)
{
    ClaimTrieChainFixture fixture;
    std::string sName1("test");
    std::string sValue1("test");
    std::string sName2("test2");
    std::string sValue2("test2");

    int height = chainActive.Height();

    fixture.MakeClaim(fixture.GetCoinbase(), sName1, sValue1, 42);
    fixture.IncrementBlocks(1);

    uint256 blockHash = chainActive.Tip()->GetBlockHash();

    fixture.MakeClaim(fixture.GetCoinbase(), sName2, sValue2, 43);
    fixture.IncrementBlocks(1);

    rpcfn_type getclaimtrie = tableRPC["getclaimtrie"]->actor;
    JSONRPCRequest req;
    req.params = UniValue(UniValue::VARR);

    UniValue results = getclaimtrie(req);
    BOOST_CHECK_EQUAL(results.size(), 6U);
    BOOST_CHECK_EQUAL(results[4]["name"].get_str(), sName1);
    BOOST_CHECK_EQUAL(results[5]["name"].get_str(), sName2);
    BOOST_CHECK_EQUAL(results[4]["height"].get_int(), height + 1);
    BOOST_CHECK_EQUAL(results[5]["height"].get_int(), height + 2);

    req.params.push_back(blockHash.GetHex());

    results = getclaimtrie(req);
    BOOST_CHECK_EQUAL(results.size(), 5U);
    BOOST_CHECK_EQUAL(results[4]["name"].get_str(), sName1);
    BOOST_CHECK_EQUAL(results[4]["height"].get_int(), height + 1);
}

BOOST_AUTO_TEST_CASE(getvalueforname_test)
{
    ClaimTrieChainFixture fixture;
    std::string sName1("testN");
    std::string sValue1("testV");

    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), sName1, sValue1, 2);
    fixture.IncrementBlocks(1);

    uint256 blockHash = chainActive.Tip()->GetBlockHash();

    fixture.MakeSupport(fixture.GetCoinbase(), tx1, sName1, 3);
    fixture.IncrementBlocks(10);

    rpcfn_type getvalueforname = tableRPC["getvalueforname"]->actor;
    JSONRPCRequest req;
    req.params = UniValue(UniValue::VARR);
    req.params.push_back(UniValue(sName1));

    UniValue results = getvalueforname(req);
    BOOST_CHECK_EQUAL(results["value"].get_str(), HexStr(sValue1));
    BOOST_CHECK_EQUAL(results["amount"].get_int(), 2);
    BOOST_CHECK_EQUAL(results["effective amount"].get_int(), 5);

    req.params.push_back(blockHash.GetHex());

    results = getvalueforname(req);
    BOOST_CHECK_EQUAL(results["amount"].get_int(), 2);
    BOOST_CHECK_EQUAL(results["effective amount"].get_int(), 2);
}

BOOST_AUTO_TEST_CASE(getclaimsforname_test)
{
    ClaimTrieChainFixture fixture;
    std::string sName1("testN");
    std::string sValue1("test1");
    std::string sValue2("test2");

    int height = chainActive.Height();

    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), sName1, sValue1, 2);
    fixture.IncrementBlocks(1);

    uint256 blockHash = chainActive.Tip()->GetBlockHash();

    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), sName1, sValue2, 3);
    fixture.IncrementBlocks(1);

    rpcfn_type getclaimsforname = tableRPC["getclaimsforname"]->actor;
    JSONRPCRequest req;
    req.params = UniValue(UniValue::VARR);
    req.params.push_back(UniValue(sName1));

    UniValue results = getclaimsforname(req);
    UniValue claims = results["claims"];
    BOOST_CHECK_EQUAL(claims.size(), 1U);
    BOOST_CHECK_EQUAL(results["nLastTakeoverHeight"].get_int(), height + 1);
    BOOST_CHECK_EQUAL(claims[0]["nEffectiveAmount"].get_int(), 2);
    BOOST_CHECK_EQUAL(claims[0]["supports"].size(), 0U);

    fixture.IncrementBlocks(1);

    results = getclaimsforname(req);
    claims = results["claims"];
    BOOST_CHECK_EQUAL(claims.size(), 2U);
    BOOST_CHECK_EQUAL(results["nLastTakeoverHeight"].get_int(), height + 3);
    BOOST_CHECK_EQUAL(claims[0]["nEffectiveAmount"].get_int(), 3);
    BOOST_CHECK_EQUAL(claims[1]["nEffectiveAmount"].get_int(), 2);
    BOOST_CHECK_EQUAL(claims[0]["supports"].size(), 0U);
    BOOST_CHECK_EQUAL(claims[1]["supports"].size(), 0U);

    req.params.push_back(blockHash.GetHex());

    results = getclaimsforname(req);
    claims = results["claims"];
    BOOST_CHECK_EQUAL(claims.size(), 1U);
    BOOST_CHECK_EQUAL(results["nLastTakeoverHeight"].get_int(), height + 1);
    BOOST_CHECK_EQUAL(claims[0]["nEffectiveAmount"].get_int(), 2);
    BOOST_CHECK_EQUAL(claims[0]["supports"].size(), 0U);
}

BOOST_AUTO_TEST_CASE(claim_rpcs_rollback2_test)
{
    ClaimTrieChainFixture fixture;
    std::string sName1("testN");
    std::string sValue1("test1");
    std::string sValue2("test2");

    int height = chainActive.Height();

    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), sName1, sValue1, 1);
    fixture.IncrementBlocks(2);
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), sName1, sValue2, 2);
    fixture.IncrementBlocks(3);

    uint256 blockHash = chainActive.Tip()->GetBlockHash();

    CMutableTransaction tx3 = fixture.MakeSupport(fixture.GetCoinbase(), tx1, sValue1, 3);
    fixture.IncrementBlocks(1);

    rpcfn_type getclaimsforname = tableRPC["getclaimsforname"]->actor;
    rpcfn_type getvalueforname = tableRPC["getvalueforname"]->actor;
    JSONRPCRequest req;
    req.params = UniValue(UniValue::VARR);
    req.params.push_back(UniValue(sName1));
    req.params.push_back(blockHash.GetHex());

    UniValue claimsResults = getclaimsforname(req);
    BOOST_CHECK_EQUAL(claimsResults["nLastTakeoverHeight"].get_int(), height + 5);
    BOOST_CHECK_EQUAL(claimsResults["claims"][0]["supports"].size(), 0U);
    BOOST_CHECK_EQUAL(claimsResults["claims"][1]["supports"].size(), 0U);

    UniValue valueResults = getvalueforname(req);
    BOOST_CHECK_EQUAL(valueResults["value"].get_str(), HexStr(sValue2));
    BOOST_CHECK_EQUAL(valueResults["amount"].get_int(), 2);
}

BOOST_AUTO_TEST_CASE(claim_rpcs_rollback3_test)
{
    ClaimTrieChainFixture fixture;
    std::string sName1("testN");
    std::string sValue1("test1");
    std::string sValue2("test2");

    int height = chainActive.Height();

    CMutableTransaction tx1 = fixture.MakeClaim(fixture.GetCoinbase(), sName1, sValue1, 3);
    fixture.IncrementBlocks(1);
    CMutableTransaction tx2 = fixture.MakeClaim(fixture.GetCoinbase(), sName1, sValue2, 2);
    fixture.IncrementBlocks(2);

    uint256 blockHash = chainActive.Tip()->GetBlockHash();

    CMutableTransaction tx3 = fixture.Spend(tx1); // abandon the claim
    fixture.IncrementBlocks(1);

    rpcfn_type getclaimsforname = tableRPC["getclaimsforname"]->actor;
    rpcfn_type getvalueforname = tableRPC["getvalueforname"]->actor;
    rpcfn_type getblocktemplate = tableRPC["getblocktemplate"]->actor;

    JSONRPCRequest req;
    req.params = UniValue(UniValue::VARR);
    UniValue templateResults = getblocktemplate(req);
    BOOST_CHECK_EQUAL(templateResults["claimtrie"].get_str(), chainActive.Tip()->hashClaimTrie.GetHex());

    req.params.push_back(UniValue(sName1));
    req.params.push_back(blockHash.GetHex());

    UniValue claimsResults = getclaimsforname(req);
    BOOST_CHECK_EQUAL(claimsResults["nLastTakeoverHeight"].get_int(), height + 1);

    UniValue valueResults = getvalueforname(req);
    BOOST_CHECK_EQUAL(valueResults["value"].get_str(), HexStr(sValue1));
    BOOST_CHECK_EQUAL(valueResults["amount"].get_int(), 3);

}

BOOST_AUTO_TEST_SUITE_END()