changed so each LDB key was in its own DB

optimized a little
first pass at not loading full claimtrie into RAM
2019-08-19 08:29:56 -06:00 · 2019-08-02 17:27:28 -06:00 · 2019-08-01 18:35:58 -06:00 · 2019-08-01 15:44:05 -06:00
19 changed files with 672 additions and 525 deletions
--- a/src/claimtrie.cpp
+++ b/src/claimtrie.cpp
@ -8,8 +8,6 @@
 #include <algorithm>
 #include <memory>

-#include <boost/scoped_ptr.hpp>
-
 static const uint256 one = uint256S("0000000000000000000000000000000000000000000000000000000000000001");

 std::vector<unsigned char> heightToVch(int n)
@ -123,28 +121,51 @@ void CClaimTrieData::reorderClaims(const supportEntryType& supports)
                claim.nEffectiveAmount += support.nAmount;
    }

-    std::make_heap(claims.begin(), claims.end());
+    std::sort(claims.rbegin(), claims.rend());
 }

 CClaimTrie::CClaimTrie(bool fMemory, bool fWipe, int proportionalDelayFactor)
 {
    nProportionalDelayFactor = proportionalDelayFactor;
-    db.reset(new CDBWrapper(GetDataDir() / "claimtrie", 100 * 1024 * 1024, fMemory, fWipe, false));
+    if (fWipe) {
+        fs::remove_all(GetDataDir() / "claimtrie"); // old folder
+    }
+    db_TRIE_NODE_BY_HASH.reset(new CDBWrapper(GetDataDir() / "claimtrie_TRIE_NODE_BY_HASH", 240 * 1024 * 1024, fMemory, fWipe, false));
+    db_TRIE_NODE_BY_NAME.reset(new CDBWrapper(GetDataDir() / "claimtrie_TRIE_NODE_BY_NAME", 120 * 1024 * 1024, fMemory, fWipe, false));
+    db_CLAIM_BY_ID.reset(new CDBWrapper(GetDataDir() / "claimtrie_CLAIM_BY_ID", 20 * 1024 * 1024, fMemory, fWipe, false));
+    db_CLAIM_EXP_QUEUE_ROW.reset(new CDBWrapper(GetDataDir() / "claimtrie_CLAIM_EXP_QUEUE_ROW", 16 * 1024 * 1024, fMemory, fWipe, false));
+    db_CLAIM_QUEUE_ROW.reset(new CDBWrapper(GetDataDir() / "claimtrie_CLAIM_QUEUE_ROW", 16 * 1024 * 1024, fMemory, fWipe, false));
+    db_CLAIM_QUEUE_NAME_ROW.reset(new CDBWrapper(GetDataDir() / "claimtrie_CLAIM_QUEUE_NAME_ROW", 32 * 1024 * 1024, fMemory, fWipe, false));
+    db_SUPPORT_EXP_QUEUE_ROW.reset(new CDBWrapper(GetDataDir() / "claimtrie_SUPPORT_EXP_QUEUE_ROW", 12 * 1024 * 1024, fMemory, fWipe, false));
+    db_SUPPORT_QUEUE_ROW.reset(new CDBWrapper(GetDataDir() / "claimtrie_SUPPORT_QUEUE_ROW", 12 * 1024 * 1024, fMemory, fWipe, false));
+    db_SUPPORT_QUEUE_NAME_ROW.reset(new CDBWrapper(GetDataDir() / "claimtrie_SUPPORT_QUEUE_NAME_ROW", 24 * 1024 * 1024, fMemory, fWipe, false));
+    db_SUPPORT.reset(new CDBWrapper(GetDataDir() / "claimtrie_SUPPORT", 24 * 1024 * 1024, fMemory, fWipe, false));
 }

 bool CClaimTrie::SyncToDisk()
 {
-    return db && db->Sync();
+    auto success = true;
+    success &= db_TRIE_NODE_BY_HASH->Sync();
+    success &= db_TRIE_NODE_BY_NAME->Sync();
+    success &= db_CLAIM_BY_ID->Sync();
+    success &= db_CLAIM_EXP_QUEUE_ROW->Sync();
+    success &= db_CLAIM_QUEUE_ROW->Sync();
+    success &= db_CLAIM_QUEUE_NAME_ROW->Sync();
+    success &= db_SUPPORT_EXP_QUEUE_ROW->Sync();
+    success &= db_SUPPORT_QUEUE_ROW->Sync();
+    success &= db_SUPPORT_QUEUE_NAME_ROW->Sync();
+    success &= db_SUPPORT->Sync();
+    return success;
 }

 template <typename Key, typename Container>
-typename Container::value_type* getQueue(CDBWrapper& db, uint8_t dbkey, const Key& key, Container& queue, bool create)
+typename Container::value_type* getQueue(CDBWrapper& db, const Key& key, Container& queue, bool create)
 {
    auto itQueue = queue.find(key);
    if (itQueue != queue.end())
        return &(*itQueue);
    typename Container::mapped_type row;
-    if (db.Read(std::make_pair(dbkey, key), row) || create) {
+    if (db.Read(key, row) || create) {
        auto ret = queue.insert(std::make_pair(key, row));
        assert(ret.second);
        return &(*ret.first);
@ -162,13 +183,13 @@ inline constexpr bool supportedType()
 template <>
 std::pair<const int, std::vector<queueEntryType<CClaimValue>>>* CClaimTrieCacheBase::getQueueCacheRow(int nHeight, bool createIfNotExists)
 {
-    return getQueue(*(base->db), CLAIM_QUEUE_ROW, nHeight, claimQueueCache, createIfNotExists);
+    return getQueue(*(base->db_CLAIM_QUEUE_ROW), nHeight, claimQueueCache, createIfNotExists);
 }

 template <>
 std::pair<const int, std::vector<queueEntryType<CSupportValue>>>* CClaimTrieCacheBase::getQueueCacheRow(int nHeight, bool createIfNotExists)
 {
-    return getQueue(*(base->db), SUPPORT_QUEUE_ROW, nHeight, supportQueueCache, createIfNotExists);
+    return getQueue(*(base->db_SUPPORT_QUEUE_ROW), nHeight, supportQueueCache, createIfNotExists);
 }

 template <typename T>
@ -181,13 +202,13 @@ std::pair<const int, std::vector<queueEntryType<T>>>* CClaimTrieCacheBase::getQu
 template <>
 typename queueNameType::value_type* CClaimTrieCacheBase::getQueueCacheNameRow<CClaimValue>(const std::string& name, bool createIfNotExists)
 {
-    return getQueue(*(base->db), CLAIM_QUEUE_NAME_ROW, name, claimQueueNameCache, createIfNotExists);
+    return getQueue(*(base->db_CLAIM_QUEUE_NAME_ROW), name, claimQueueNameCache, createIfNotExists);
 }

 template <>
 typename queueNameType::value_type* CClaimTrieCacheBase::getQueueCacheNameRow<CSupportValue>(const std::string& name, bool createIfNotExists)
 {
-    return getQueue(*(base->db), SUPPORT_QUEUE_NAME_ROW, name, supportQueueNameCache, createIfNotExists);
+    return getQueue(*(base->db_SUPPORT_QUEUE_NAME_ROW), name, supportQueueNameCache, createIfNotExists);
 }

 template <typename T>
@ -200,13 +221,13 @@ typename queueNameType::value_type* CClaimTrieCacheBase::getQueueCacheNameRow(co
 template <>
 typename expirationQueueType::value_type* CClaimTrieCacheBase::getExpirationQueueCacheRow<CClaimValue>(int nHeight, bool createIfNotExists)
 {
-    return getQueue(*(base->db), EXP_QUEUE_ROW, nHeight, expirationQueueCache, createIfNotExists);
+    return getQueue(*(base->db_CLAIM_EXP_QUEUE_ROW), nHeight, expirationQueueCache, createIfNotExists);
 }

 template <>
 typename expirationQueueType::value_type* CClaimTrieCacheBase::getExpirationQueueCacheRow<CSupportValue>(int nHeight, bool createIfNotExists)
 {
-    return getQueue(*(base->db), SUPPORT_EXP_QUEUE_ROW, nHeight, supportExpirationQueueCache, createIfNotExists);
+    return getQueue(*(base->db_SUPPORT_EXP_QUEUE_ROW), nHeight, supportExpirationQueueCache, createIfNotExists);
 }

 template <typename T>
@ -218,8 +239,14 @@ typename expirationQueueType::value_type* CClaimTrieCacheBase::getExpirationQueu

 bool CClaimTrieCacheBase::haveClaim(const std::string& name, const COutPoint& outPoint) const
 {
-    auto it = find(name);
-    return it && it->haveClaim(outPoint);
+    auto it = nodesToAddOrUpdate.find(name);
+    if (it && it->haveClaim(outPoint))
+        return true;
+    if (it || nodesToDelete.count(name))
+        return false;
+    CClaimTrieDataNode node;
+    node.childrenSerialization = false;
+    return base->find(name, node) && node.data.haveClaim(outPoint);
 }

 bool CClaimTrieCacheBase::haveSupport(const std::string& name, const COutPoint& outPoint) const
@ -235,7 +262,7 @@ supportEntryType CClaimTrieCacheBase::getSupportsForName(const std::string& name
        return sit->second;

    supportEntryType supports;
-    if (base->db->Read(std::make_pair(SUPPORT, name), supports)) // don't trust the try/catch in here
+    if (base->db_SUPPORT->Read(name, supports)) // don't trust the try/catch in here
        return supports;
    return {};
 }
@ -272,39 +299,63 @@ bool CClaimTrieCacheBase::haveSupportInQueue(const std::string& name, const COut
    return haveInQueue<CSupportValue>(name, outPoint, nValidAtHeight);
 }

-std::size_t CClaimTrieCacheBase::getTotalNamesInTrie() const
+void CClaimTrie::recurseAllHashedNodes(const std::string& name, const CClaimTrieDataNode& current, std::function<void(const std::string&, const CClaimTrieDataNode&)> function) const {
+    function(name, current);
+    for (auto& child: current.children) {
+        CClaimTrieDataNode node;
+        if (find(child.second, node))
+            recurseAllHashedNodes(name + child.first, node, function);
+    }
+}
+
+std::size_t CClaimTrie::getTotalNamesInTrie() const
 {
    std::size_t count = 0;
-    for (auto it = base->cbegin(); it != base->cend(); ++it)
-        if (!it->empty()) ++count;
+    CClaimTrieDataNode node;
+    if (find("", node))
+        recurseAllHashedNodes("", node, [&count](const std::string&, const CClaimTrieDataNode& node) {
+            count += !node.data.empty();
+        });
    return count;
 }

-std::size_t CClaimTrieCacheBase::getTotalClaimsInTrie() const
+std::size_t CClaimTrie::getTotalClaimsInTrie() const
 {
    std::size_t count = 0;
-    for (auto it = base->cbegin(); it != base->cend(); ++it)
-        count += it->claims.size();
+    CClaimTrieDataNode node;
+    if (find("", node))
+        recurseAllHashedNodes("", node, [&count](const std::string&, const CClaimTrieDataNode& node) {
+            count += node.data.claims.size();
+        });
    return count;
 }

-CAmount CClaimTrieCacheBase::getTotalValueOfClaimsInTrie(bool fControllingOnly) const
+CAmount CClaimTrie::getTotalValueOfClaimsInTrie(bool fControllingOnly) const
 {
    CAmount value_in_subtrie = 0;
-    for (auto it = base->cbegin(); it != base->cend(); ++it) {
-        for (const auto& claim : it->claims) {
+    std::size_t count = 0;
+    CClaimTrieDataNode node;
+    if (find("", node))
+        recurseAllHashedNodes("", node, [&value_in_subtrie, fControllingOnly](const std::string&, const CClaimTrieDataNode& node) {
+            for (const auto& claim : node.data.claims) {
                value_in_subtrie += claim.nAmount;
                if (fControllingOnly)
                    break;
            }
-    }
+        });
    return value_in_subtrie;
 }

 bool CClaimTrieCacheBase::getInfoForName(const std::string& name, CClaimValue& claim) const
 {
-    auto it = find(name);
-    return it && it->getBestClaim(claim);
+    auto it = nodesToAddOrUpdate.find(name);
+    if (it && it->getBestClaim(claim))
+        return true;
+    if (it || nodesToDelete.count(name))
+        return false;
+    CClaimTrieDataNode node;
+    node.childrenSerialization = false;
+    return base->find(name, node) && node.data.getBestClaim(claim);
 }

 CClaimsForNameType CClaimTrieCacheBase::getClaimsForName(const std::string& name) const
@ -313,10 +364,16 @@ CClaimsForNameType CClaimTrieCacheBase::getClaimsForName(const std::string& name
    int nLastTakeoverHeight = 0;
    auto supports = getSupportsForName(name);

-    if (auto it = find(name)) {
+    CClaimTrieDataNode node;
+    node.childrenSerialization = false;
+    if (auto it = nodesToAddOrUpdate.find(name)) {
        claims = it->claims;
        nLastTakeoverHeight = it->nHeightOfLastTakeover;
    }
+    else if (!nodesToDelete.count(name) && base->find(name, node)) {
+        claims = node.data.claims;
+        nLastTakeoverHeight = node.data.nHeightOfLastTakeover;
+    }
    return {std::move(claims), std::move(supports), nLastTakeoverHeight, name};
 }

@ -381,66 +438,103 @@ uint256 recursiveMerkleHash(TIterator& it, const iCbType<TIterator>& process, co
    return Hash(vchToHash.begin(), vchToHash.end());
 }

-bool recursiveCheckConsistency(CClaimTrie::const_iterator& it, std::string& failed)
+bool CClaimTrie::checkConsistency(const uint256& rootHash) const
 {
-    struct CRecursiveBreak : public std::exception {};
+    CClaimTrieDataNode node;
+    if (!find("", node) || node.data.hash != rootHash) {
+        if (rootHash == one)
+            return true;

-    using iterator = CClaimTrie::const_iterator;
-    iCbType<iterator> verify = [&failed](iterator& it) {
-        if (!it.hasChildren()) {
-            // we don't allow a situation of no children and no claims; no empty leaf nodes allowed
-            failed = it.key();
-            throw CRecursiveBreak();
+        return error("Mismatched root claim trie hashes. This may happen when there is not a clean process shutdown. Please run with -reindex.");
    }
-    };

-    iCbType<iterator> process = [&failed, &process, &verify](iterator& it) {
-        if (it->hash != recursiveMerkleHash(it, process, verify)) {
-            failed = it.key();
-            throw CRecursiveBreak();
+    bool success = true;
+    recurseAllHashedNodes("", node, [&success, this](const std::string& name, const CClaimTrieDataNode& node) {
+        if (!success) return;
+
+        success &= contains(name);
+
+        std::vector<uint8_t> vchToHash;
+        const auto pos = name.size();
+        for (auto& child : node.children) {
+            auto key = name + child.first;
+            auto hash = child.second;
+            completeHash(hash, key, pos);
+            vchToHash.push_back(key[pos]);
+            vchToHash.insert(vchToHash.end(), hash.begin(), hash.end());
        }
-    };

-    try {
-        process(it);
-    } catch (const CRecursiveBreak&) {
+        CClaimValue claim;
+        if (node.data.getBestClaim(claim)) {
+            uint256 valueHash = getValueHash(claim.outPoint, node.data.nHeightOfLastTakeover);
+            vchToHash.insert(vchToHash.end(), valueHash.begin(), valueHash.end());
+        } else {
+            success &= !node.children.empty(); // we disallow leaf nodes without claims
+        }
+
+        success &= node.data.hash == Hash(vchToHash.begin(), vchToHash.end());
+    });
+
+    return success;
+}
+
+std::vector<std::pair<std::string, CClaimTrieDataNode>> CClaimTrie::nodes(const std::string &key) const {
+    std::vector<std::pair<std::string, CClaimTrieDataNode>> ret;
+    CClaimTrieDataNode node;
+
+    if (!find("", node))
+        return ret;
+    ret.emplace_back("", node);
+
+    std::string partialKey = key;
+
+    while (!node.children.empty()) {
+        // auto it = node.children.lower_bound(partialKey); // for using a std::map
+        auto it = std::lower_bound(node.children.begin(), node.children.end(), std::make_pair(partialKey, uint256()));
+        if (it != node.children.end() && it->first == partialKey) {
+            // we're completely done
+            if (find(it->second, node))
+                ret.emplace_back(key, node);
+            break;
+        }
+        if (it != node.children.begin()) --it;
+        const auto count = match(partialKey, it->first);
+
+        if (count != it->first.size()) break;
+        if (count == partialKey.size()) break;
+        partialKey = partialKey.substr(count);
+        if (find(it->second, node))
+            ret.emplace_back(key.substr(0, key.size() - partialKey.size()), node);
+        else break;
+    }
+
+    return ret;
+}
+
+bool CClaimTrie::contains(const std::string &key) const {
+    return db_TRIE_NODE_BY_NAME->Exists(key);
+}
+
+bool CClaimTrie::empty() const {
+    return !contains("");
+}
+
+bool CClaimTrie::find(const std::string &key, CClaimTrieDataNode &node) const {
+    uint256 hash;
+    if (!db_TRIE_NODE_BY_NAME->Read(key, hash))
        return false;
-    }
-    return true;
+    auto found = find(hash, node);
+    return found;
 }

-bool CClaimTrieCacheBase::checkConsistency() const
-{
-    if (base->empty())
-        return true;
-
-    auto it = base->cbegin();
-    std::string failed;
-    auto consistent = recursiveCheckConsistency(it, failed);
-    if (!consistent) {
-        LogPrintf("\nPrinting base tree from its parent:\n");
-        auto basePath = base->nodes(failed);
-        if (basePath.size() > 1) basePath.pop_back();
-        dumpToLog(basePath.back(), false);
-        auto cachePath = nodesToAddOrUpdate.nodes(failed);
-        if (!cachePath.empty()) {
-            LogPrintf("\nPrinting %s's parent from cache:\n", failed);
-            if (cachePath.size() > 1) cachePath.pop_back();
-            dumpToLog(cachePath.back(), false);
-        }
-        if (!nodesToDelete.empty()) {
-            std::string joined;
-            for (const auto &piece : nodesToDelete) joined += ", " + piece;
-            LogPrintf("Nodes to be deleted: %s\n", joined.substr(2));
-        }
-    }
-    return consistent;
+bool CClaimTrie::find(const uint256 &key, CClaimTrieDataNode &node) const {
+    return db_TRIE_NODE_BY_HASH->Read(key, node);
 }

 bool CClaimTrieCacheBase::getClaimById(const uint160& claimId, std::string& name, CClaimValue& claim) const
 {
    CClaimIndexElement element;
-    if (!base->db->Read(std::make_pair(CLAIM_BY_ID, claimId), element))
+    if (!base->db_CLAIM_BY_ID->Read(claimId, element))
        return false;
    if (element.claim.claimId == claimId) {
        name = element.name;
@ -451,25 +545,27 @@ bool CClaimTrieCacheBase::getClaimById(const uint160& claimId, std::string& name
 }

 template <typename K, typename T>
-void BatchWrite(CDBBatch& batch, uint8_t dbkey, const K& key, const std::vector<T>& value)
+void BatchWrite(CDBBatch& batch, const K& key, const std::vector<T>& value)
 {
    if (value.empty()) {
-        batch.Erase(std::make_pair(dbkey, key));
+        batch.Erase(key);
    } else {
-        batch.Write(std::make_pair(dbkey, key), value);
+        batch.Write(key, value);
    }
 }

 template <typename Container>
-void BatchWriteQueue(CDBBatch& batch, uint8_t dbkey, const Container& queue)
+bool BatchWriteQueue(CDBWrapper& db, const Container& queue)
 {
+    CDBBatch batch(db);
    for (auto& itQueue : queue)
-        BatchWrite(batch, dbkey, itQueue.first, itQueue.second);
+        BatchWrite(batch, itQueue.first, itQueue.second);
+    return db.WriteBatch(batch);
 }

 bool CClaimTrieCacheBase::flush()
 {
-    CDBBatch batch(*(base->db));
+    CDBBatch batch_CLAIM_BY_ID(*(base->db_CLAIM_BY_ID));

    for (const auto& claim : claimsToDeleteFromByIdIndex) {
        auto it = std::find_if(claimsToAddToByIdIndex.begin(), claimsToAddToByIdIndex.end(),
@ -478,107 +574,94 @@ bool CClaimTrieCacheBase::flush()
            }
        );
        if (it == claimsToAddToByIdIndex.end())
-            batch.Erase(std::make_pair(CLAIM_BY_ID, claim.claimId));
+            batch_CLAIM_BY_ID.Erase(claim.claimId);
    }

    for (const auto& e : claimsToAddToByIdIndex)
-        batch.Write(std::make_pair(CLAIM_BY_ID, e.claim.claimId), e);
+        batch_CLAIM_BY_ID.Write(e.claim.claimId, e);
+
+    auto success = base->db_CLAIM_BY_ID->WriteBatch(batch_CLAIM_BY_ID);

    getMerkleHash();

+    std::set<std::string> forDeletion;
    for (const auto& nodeName : nodesToDelete) {
-        if (nodesToAddOrUpdate.contains(nodeName))
-            continue;
+        // TODO: we don't need to deserialize all the nodes right here
+        // we could be smarter about this and fill in the whole list in removeClaimFromTrie
        auto nodes = base->nodes(nodeName);
-        base->erase(nodeName);
        for (auto& node : nodes)
-            if (!node)
-                batch.Erase(std::make_pair(TRIE_NODE, node.key()));
+            forDeletion.insert(node.first);
    }

+    CDBBatch batch_TRIE_NODE_BY_HASH(*(base->db_TRIE_NODE_BY_HASH));
+    CDBBatch batch_TRIE_NODE_BY_NAME(*(base->db_TRIE_NODE_BY_NAME));
    for (auto it = nodesToAddOrUpdate.begin(); it != nodesToAddOrUpdate.end(); ++it) {
-        auto old = base->find(it.key());
-        if (!old || old.data() != it.data()) {
-            base->copy(it);
-            batch.Write(std::make_pair(TRIE_NODE, it.key()), it.data());
-        }
+        forDeletion.erase(it.key());
+        if (!dirtyNodes.count(it.key()))
+            continue;
+
+        CClaimTrieDataNode node;
+        node.data = it.data();
+        for (auto &child: it.children()) // ordering here is important
+            node.children.emplace_back(child.key().substr(it.key().size()), child->hash);
+
+        batch_TRIE_NODE_BY_HASH.Write(it->hash, node);
+        batch_TRIE_NODE_BY_NAME.Write(it.key(), it->hash);
    }

-    BatchWriteQueue(batch, SUPPORT, supportCache);
-    BatchWriteQueue(batch, CLAIM_QUEUE_ROW, claimQueueCache);
-    BatchWriteQueue(batch, CLAIM_QUEUE_NAME_ROW, claimQueueNameCache);
-    BatchWriteQueue(batch, EXP_QUEUE_ROW, expirationQueueCache);
-    BatchWriteQueue(batch, SUPPORT_QUEUE_ROW, supportQueueCache);
-    BatchWriteQueue(batch, SUPPORT_QUEUE_NAME_ROW, supportQueueNameCache);
-    BatchWriteQueue(batch, SUPPORT_EXP_QUEUE_ROW, supportExpirationQueueCache);
+    success &= base->db_TRIE_NODE_BY_HASH->WriteBatch(batch_TRIE_NODE_BY_HASH);
+
+    for (auto& name: forDeletion) {
+        batch_TRIE_NODE_BY_NAME.Erase(name);
+    }
+
+    success &= base->db_TRIE_NODE_BY_NAME->WriteBatch(batch_TRIE_NODE_BY_NAME);
+
+    success &= BatchWriteQueue(*(base->db_SUPPORT), supportCache);
+
+    success &= BatchWriteQueue(*(base->db_CLAIM_QUEUE_ROW), claimQueueCache);
+    success &= BatchWriteQueue(*(base->db_CLAIM_QUEUE_NAME_ROW), claimQueueNameCache);
+    success &= BatchWriteQueue(*(base->db_CLAIM_EXP_QUEUE_ROW), expirationQueueCache);
+
+    success &= BatchWriteQueue(*(base->db_SUPPORT_QUEUE_ROW), supportQueueCache);
+    success &= BatchWriteQueue(*(base->db_SUPPORT_QUEUE_NAME_ROW), supportQueueNameCache);
+    success &= BatchWriteQueue(*(base->db_SUPPORT_EXP_QUEUE_ROW), supportExpirationQueueCache);

    base->nNextHeight = nNextHeight;
-    if (!nodesToAddOrUpdate.empty())
-        LogPrint(BCLog::CLAIMS, "Cache size: %zu from base size: %zu on block %d\n", nodesToAddOrUpdate.height(), base->height(), nNextHeight);
-    auto ret = base->db->WriteBatch(batch);
+    if (!nodesToAddOrUpdate.empty() && (LogAcceptCategory(BCLog::CLAIMS) || LogAcceptCategory(BCLog::BENCH))) {
+        LogPrintf("TrieCache size: %zu nodes on block %d.\n",
+                nodesToAddOrUpdate.height(), nNextHeight);
+    }
    clear();
-    return ret;
+    return success;
 }

-bool CClaimTrieCacheBase::ReadFromDisk(const CBlockIndex* tip)
+bool CClaimTrieCacheBase::validateTrieConsistency(const CBlockIndex* tip)
 {
-    LogPrintf("Loading the claim trie from disk...\n");
-
-    base->nNextHeight = nNextHeight = tip ? tip->nHeight + 1 : 0;
-
-    clear();
-    base->clear();
-    boost::scoped_ptr<CDBIterator> pcursor(base->db->NewIterator());
-
-    std::vector<std::pair<std::string, uint256>> hashesOnEmptyNodes;
-
-    for (pcursor->SeekToFirst(); pcursor->Valid(); pcursor->Next()) {
-        std::pair<uint8_t, std::string> key;
-        if (!pcursor->GetKey(key) || key.first != TRIE_NODE)
-            continue;
-
-        CClaimTrieData data;
-        if (pcursor->GetValue(data)) {
-            if (data.empty()) {
-                // we have a situation where our old trie had many empty nodes
-                // we don't want to automatically throw those all into our prefix trie
-                hashesOnEmptyNodes.emplace_back(key.second, data.hash);
-                continue;
-            }
-
-            // nEffectiveAmount isn't serialized but it needs to be initialized (as done in reorderClaims):
-            auto supports = getSupportsForName(key.second);
-            data.reorderClaims(supports);
-            base->insert(key.second, std::move(data));
-        } else {
-            return error("%s(): error reading claim trie from disk", __func__);
-        }
-    }
-
-    CDBBatch batch(*(base->db));
-    for (auto& kvp: hashesOnEmptyNodes) {
-        auto hit = base->find(kvp.first);
-        if (hit != base->end())
-            hit->hash = kvp.second;
-        else {
-            // the first time the prefix trie is ran there will be many unused nodes
-            // we need to clean those out so that we can go faster next time
-            batch.Erase(std::make_pair(TRIE_NODE, kvp.first));
-        }
-    }
+    if (!tip || tip->nHeight < 1)
+        return true;

    LogPrintf("Checking claim trie consistency... ");
-    if (checkConsistency()) {
+    if (base->checkConsistency(tip->hashClaimTrie)) {
        LogPrintf("consistent\n");
-        if (tip && tip->hashClaimTrie != getMerkleHash())
-            return error("%s(): hashes don't match when reading claimtrie from disk", __func__);
-        base->db->WriteBatch(batch);
        return true;
    }
    LogPrintf("inconsistent!\n");
    return false;
 }

+bool CClaimTrieCacheBase::ReadFromDisk(const CBlockIndex* tip)
+{
+    base->nNextHeight = nNextHeight = tip ? tip->nHeight + 1 : 0;
+    clear();
+
+    if (tip && fs::is_directory(GetDataDir() / "claimtrie")) {
+        LogPrintf("The claim trie database contains deprecated data and will need to be rebuilt");
+        return false;
+    }
+    return validateTrieConsistency(tip);
+}
+
 CClaimTrieCacheBase::CClaimTrieCacheBase(CClaimTrie* base) : base(base)
 {
    assert(base);
@ -590,9 +673,9 @@ int CClaimTrieCacheBase::expirationTime() const
    return Params().GetConsensus().nOriginalClaimExpirationTime;
 }

-uint256 CClaimTrieCacheBase::recursiveComputeMerkleHash(CClaimTrie::iterator& it)
+uint256 CClaimTrieCacheBase::recursiveComputeMerkleHash(CClaimPrefixTrie::iterator& it)
 {
-    using iterator = CClaimTrie::iterator;
+    using iterator = CClaimPrefixTrie::iterator;
    iCbType<iterator> process = [&process](iterator& it) {
        if (it->hash.IsNull())
            it->hash = recursiveMerkleHash(it, process);
@ -604,54 +687,52 @@ uint256 CClaimTrieCacheBase::recursiveComputeMerkleHash(CClaimTrie::iterator& it
 uint256 CClaimTrieCacheBase::getMerkleHash()
 {
    auto it = nodesToAddOrUpdate.begin();
-    if (nodesToAddOrUpdate.empty() && nodesToDelete.empty())
-        it = base->begin();
-    return !it ? one : recursiveComputeMerkleHash(it);
+    if (it)
+        return recursiveComputeMerkleHash(it);
+    if (nodesToDelete.empty() && nodesAlreadyCached.empty()) {
+        CClaimTrieDataNode node;
+        node.childrenSerialization = false;
+        if (base->find("", node))
+            return node.data.hash; // it may be valuable to have base cache its current root hash
+    }
+    return one; // we have no data or we deleted everything
 }

-CClaimTrie::const_iterator CClaimTrieCacheBase::begin() const
+CClaimPrefixTrie::const_iterator CClaimTrieCacheBase::begin() const
 {
-    return nodesToAddOrUpdate.empty() && nodesToDelete.empty() ? base->cbegin() : nodesToAddOrUpdate.begin();
+    return nodesToAddOrUpdate.begin();
 }

-CClaimTrie::const_iterator CClaimTrieCacheBase::end() const
+CClaimPrefixTrie::const_iterator CClaimTrieCacheBase::end() const
 {
-    return nodesToAddOrUpdate.empty() && nodesToDelete.empty() ? base->cend() : nodesToAddOrUpdate.end();
-}
-
-CClaimTrie::const_iterator CClaimTrieCacheBase::find(const std::string& name) const
-{
-    if (auto it = nodesToAddOrUpdate.find(name))
-        return it;
-    return base->find(name);
+    return nodesToAddOrUpdate.end();
 }

 bool CClaimTrieCacheBase::empty() const
 {
-    return base->empty() && nodesToAddOrUpdate.empty();
+    return nodesToAddOrUpdate.empty();
 }

-CClaimTrie::iterator CClaimTrieCacheBase::cacheData(const std::string& name, bool create)
+CClaimPrefixTrie::iterator CClaimTrieCacheBase::cacheData(const std::string& name, bool create)
 {
-    // get data from the cache. if no data, create empty one
-    const auto insert = [this](CClaimTrie::iterator& it) {
-        auto& key = it.key();
-        // we only ever cache nodes once per cache instance
-        if (!nodesAlreadyCached.count(key)) {
-            // do not insert nodes that are already present
-            nodesAlreadyCached.insert(key);
-            nodesToAddOrUpdate.insert(key, it.data());
-        }
-    };
-
    // we need all parent nodes and their one level deep children
    // to calculate merkle hash
    auto nodes = base->nodes(name);
    for (auto& node: nodes) {
-        for (auto& child : node.children())
-            if (!nodesAlreadyCached.count(child.key()))
-                nodesToAddOrUpdate.copy(child);
-        insert(node);
+        if (nodesAlreadyCached.insert(node.first).second) {
+            // do not insert nodes that are already present
+            nodesToAddOrUpdate.insert(node.first, node.second.data);
+        }
+        for (auto& child : node.second.children) {
+            auto childKey = node.first + child.first;
+            if (nodesAlreadyCached.insert(childKey).second) {
+                CClaimTrieDataNode childNode;
+                childNode.childrenSerialization = false;
+                if (base->find(child.second, childNode)) {
+                    nodesToAddOrUpdate.insert(childKey, childNode.data);
+                }
+            }
+        }
    }

    auto it = nodesToAddOrUpdate.find(name);
@ -677,10 +758,12 @@ bool CClaimTrieCacheBase::getLastTakeoverForName(const std::string& name, uint16
        std::tie(claimId, takeoverHeight) = cit->second;
        return true;
    }
-    if (auto it = base->find(name)) {
-        takeoverHeight = it->nHeightOfLastTakeover;
+    CClaimTrieDataNode data;
+    data.childrenSerialization = false;
+    if (base->find(name, data)) {
+        takeoverHeight = data.data.nHeightOfLastTakeover;
        CClaimValue claim;
-        if (it->getBestClaim(claim)) {
+        if (data.data.getBestClaim(claim)) {
            claimId = claim.claimId;
            return true;
        }
@ -690,8 +773,10 @@ bool CClaimTrieCacheBase::getLastTakeoverForName(const std::string& name, uint16

 void CClaimTrieCacheBase::markAsDirty(const std::string& name, bool fCheckTakeover)
 {
-    for (auto& node : nodesToAddOrUpdate.nodes(name))
+    for (auto& node : nodesToAddOrUpdate.nodes(name)) {
+        dirtyNodes.insert(node.key());
        node->hash.SetNull();
+    }

    if (fCheckTakeover)
        namesToCheckForTakeover.insert(name);
@ -712,7 +797,7 @@ bool CClaimTrieCacheBase::removeClaimFromTrie(const std::string& name, const COu
    auto it = cacheData(name, false);

    if (!it || !it->removeClaim(outPoint, claim)) {
-        LogPrint(BCLog::CLAIMS, "%s: Removing a claim was unsuccessful. name = %s, txhash = %s, nOut = %d", __func__, name, outPoint.hash.GetHex(), outPoint.n);
+        LogPrint(BCLog::CLAIMS, "%s: Removing a claim was unsuccessful. name = %s, txhash = %s, nOut = %d\n", __func__, name, outPoint.hash.GetHex(), outPoint.n);
        return false;
    }

@ -963,11 +1048,14 @@ bool CClaimTrieCacheBase::removeSupportFromMap(const std::string& name, const CO
    return false;
 }

-void CClaimTrieCacheBase::dumpToLog(CClaimTrie::const_iterator it, bool diffFromBase) const
+void CClaimTrieCacheBase::dumpToLog(CClaimPrefixTrie::const_iterator it, bool diffFromBase) const
 {
+    if (!it) return;
+
    if (diffFromBase) {
-        auto hit = base->find(it.key());
-        if (hit && hit->hash == it->hash)
+        CClaimTrieDataNode node;
+        node.childrenSerialization = false;
+        if (base->find(it.key(), node) && node.data.hash == it->hash)
            return;
    }

@ -1281,8 +1369,16 @@ int CClaimTrieCacheBase::getNumBlocksOfContinuousOwnership(const std::string& na
        that->removalWorkaround.erase(hit);
        return 0;
    }
-    auto it = find(name);
-    return it && !it->empty() ? nNextHeight - it->nHeightOfLastTakeover : 0;
+    auto it = nodesToAddOrUpdate.find(name);
+    if (it && !it->empty())
+        return nNextHeight - it->nHeightOfLastTakeover;
+    if (it) // we specifically ignore deleted nodes here to allow this to fall into the base lookup in that scenario
+        return 0;
+    CClaimTrieDataNode node;
+    node.childrenSerialization = false;
+    if (base->find(name, node) && !node.data.empty())
+        return nNextHeight - node.data.nHeightOfLastTakeover;
+    return 0;
 }

 int CClaimTrieCacheBase::getDelayForName(const std::string& name) const
@ -1311,6 +1407,7 @@ bool CClaimTrieCacheBase::clear()
 {
    nodesToAddOrUpdate.clear();
    claimsToAddToByIdIndex.clear();
+    dirtyNodes.clear();
    supportCache.clear();
    nodesToDelete.clear();
    claimsToDeleteFromByIdIndex.clear();
--- a/src/claimtrie.h
+++ b/src/claimtrie.h
@ -17,17 +17,6 @@
 #include <unordered_map>
 #include <unordered_set>

-// leveldb keys
-#define TRIE_NODE 'n'
-#define CLAIM_BY_ID 'i'
-#define CLAIM_QUEUE_ROW 'r'
-#define CLAIM_QUEUE_NAME_ROW 'm'
-#define EXP_QUEUE_ROW 'e'
-#define SUPPORT 's'
-#define SUPPORT_QUEUE_ROW 'u'
-#define SUPPORT_QUEUE_NAME_ROW 'p'
-#define SUPPORT_EXP_QUEUE_ROW 'x'
-
 uint256 getValueHash(const COutPoint& outPoint, int nHeightOfLastTakeover);

 struct CClaimValue
@ -61,6 +50,7 @@ struct CClaimValue
        READWRITE(nAmount);
        READWRITE(nHeight);
        READWRITE(nValidAtHeight);
+        READWRITE(nEffectiveAmount);
    }

    bool operator<(const CClaimValue& other) const
@ -157,17 +147,6 @@ struct CClaimTrieData
    inline void SerializationOp(Stream& s, Operation ser_action)
    {
        READWRITE(hash);
-
-        if (ser_action.ForRead()) {
-            if (s.eof()) {
-                claims.clear();
-                nHeightOfLastTakeover = 0;
-                return;
-            }
-        }
-        else if (claims.empty())
-            return;
-
        READWRITE(claims);
        READWRITE(nHeightOfLastTakeover);
    }
@ -188,6 +167,30 @@ struct CClaimTrieData
    }
 };

+struct CClaimTrieDataNode {
+    CClaimTrieData data;
+    // we're using a vector to avoid RAM thrashing and for faster serialization ops.
+    // We're assuming its data is inserted in order and never modified.
+    std::vector<std::pair<std::string, uint256>> children;
+    bool childrenSerialization = true;
+
+    CClaimTrieDataNode() = default;
+    CClaimTrieDataNode(CClaimTrieDataNode&&) = default;
+    CClaimTrieDataNode(const CClaimTrieDataNode&) = default;
+    CClaimTrieDataNode& operator=(CClaimTrieDataNode&&) = default;
+    CClaimTrieDataNode& operator=(const CClaimTrieDataNode& d) = default;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action)
+    {
+        READWRITE(data);
+        if (childrenSerialization) // wanting constexpr but hoping the compiler is smart enough anyway
+            READWRITE(children);
+    }
+};
+
 struct COutPointHeightType
 {
    COutPoint outPoint;
@ -301,11 +304,20 @@ struct CClaimsForNameType
    CClaimsForNameType& operator=(const CClaimsForNameType&) = default;
 };

-class CClaimTrie : public CPrefixTrie<std::string, CClaimTrieData>
+class CClaimTrie
 {
    int nNextHeight = 0;
    int nProportionalDelayFactor = 0;
-    std::unique_ptr<CDBWrapper> db;
+    std::unique_ptr<CDBWrapper> db_TRIE_NODE_BY_HASH;
+    std::unique_ptr<CDBWrapper> db_TRIE_NODE_BY_NAME;
+    std::unique_ptr<CDBWrapper> db_CLAIM_BY_ID;
+    std::unique_ptr<CDBWrapper> db_CLAIM_EXP_QUEUE_ROW;
+    std::unique_ptr<CDBWrapper> db_CLAIM_QUEUE_ROW;
+    std::unique_ptr<CDBWrapper> db_CLAIM_QUEUE_NAME_ROW;
+    std::unique_ptr<CDBWrapper> db_SUPPORT_EXP_QUEUE_ROW;
+    std::unique_ptr<CDBWrapper> db_SUPPORT_QUEUE_ROW;
+    std::unique_ptr<CDBWrapper> db_SUPPORT_QUEUE_NAME_ROW;
+    std::unique_ptr<CDBWrapper> db_SUPPORT;

 public:
    CClaimTrie() = default;
@ -322,6 +334,19 @@ public:
    friend struct ClaimTrieChainFixture;
    friend class CClaimTrieCacheExpirationFork;
    friend class CClaimTrieCacheNormalizationFork;
+
+    std::size_t getTotalNamesInTrie() const;
+    std::size_t getTotalClaimsInTrie() const;
+    CAmount getTotalValueOfClaimsInTrie(bool fControllingOnly) const;
+    bool checkConsistency(const uint256& rootHash) const;
+
+    bool contains(const std::string& key) const;
+    bool empty() const;
+    bool find(const uint256& key, CClaimTrieDataNode& node) const;
+    bool find(const std::string& key, CClaimTrieDataNode& node) const;
+
+    std::vector<std::pair<std::string, CClaimTrieDataNode>> nodes(const std::string& key) const;
+    void recurseAllHashedNodes(const std::string& name, const CClaimTrieDataNode& current, std::function<void(const std::string&, const CClaimTrieDataNode&)> function) const;
 };

 struct CClaimTrieProofNode
@ -381,6 +406,8 @@ typedef std::map<int, expirationQueueRowType> expirationQueueType;
 typedef std::set<CClaimValue> claimIndexClaimListType;
 typedef std::vector<CClaimIndexElement> claimIndexElementListType;

+typedef CPrefixTrie<std::string, CClaimTrieData> CClaimPrefixTrie;
+
 class CClaimTrieCacheBase
 {
 public:
@ -388,7 +415,6 @@ public:
    virtual ~CClaimTrieCacheBase() = default;

    uint256 getMerkleHash();
-    bool checkConsistency() const;

    bool getClaimById(const uint160& claimId, std::string& name, CClaimValue& claim) const;

@ -402,10 +428,6 @@ public:
    bool haveSupport(const std::string& name, const COutPoint& outPoint) const;
    bool haveSupportInQueue(const std::string& name, const COutPoint& outPoint, int& nValidAtHeight);

-    std::size_t getTotalNamesInTrie() const;
-    std::size_t getTotalClaimsInTrie() const;
-    CAmount getTotalValueOfClaimsInTrie(bool fControllingOnly) const;
-
    bool addClaim(const std::string& name, const COutPoint& outPoint, const uint160& claimId, CAmount nAmount, int nHeight);
    bool undoAddClaim(const std::string& name, const COutPoint& outPoint, int nHeight);

@ -441,18 +463,18 @@ public:
    CAmount getEffectiveAmountForClaim(const std::string& name, const uint160& claimId, std::vector<CSupportValue>* supports = nullptr) const;
    CAmount getEffectiveAmountForClaim(const CClaimsForNameType& claims, const uint160& claimId, std::vector<CSupportValue>* supports = nullptr) const;

-    CClaimTrie::const_iterator begin() const;
-    CClaimTrie::const_iterator end() const;
-    CClaimTrie::const_iterator find(const std::string& name) const;
+    CClaimPrefixTrie::const_iterator begin() const;
+    CClaimPrefixTrie::const_iterator end() const;

-    void dumpToLog(CClaimTrie::const_iterator it, bool diffFromBase = true) const;
+    void dumpToLog(CClaimPrefixTrie::const_iterator it, bool diffFromBase = true) const;
+    virtual std::string adjustNameForValidHeight(const std::string& name, int validHeight) const;

 protected:
    CClaimTrie* base;
-    CClaimTrie nodesToAddOrUpdate; // nodes pulled in from base (and possibly modified thereafter), written to base on flush
+    CClaimPrefixTrie nodesToAddOrUpdate; // nodes pulled in from base (and possibly modified thereafter), written to base on flush
    std::unordered_set<std::string> namesToCheckForTakeover; // takeover numbers are updated on increment

-    uint256 recursiveComputeMerkleHash(CClaimTrie::iterator& it);
+    uint256 recursiveComputeMerkleHash(CClaimPrefixTrie::iterator& it);

    virtual bool insertClaimIntoTrie(const std::string& name, const CClaimValue& claim, bool fCheckTakeover);
    virtual bool removeClaimFromTrie(const std::string& name, const COutPoint& outPoint, CClaimValue& claim, bool fCheckTakeover);
@ -460,14 +482,12 @@ protected:
    virtual bool insertSupportIntoMap(const std::string& name, const CSupportValue& support, bool fCheckTakeover);
    virtual bool removeSupportFromMap(const std::string& name, const COutPoint& outPoint, CSupportValue& support, bool fCheckTakeover);

-    virtual std::string adjustNameForValidHeight(const std::string& name, int validHeight) const;
-
    supportEntryType getSupportsForName(const std::string& name) const;

    int getDelayForName(const std::string& name) const;
    virtual int getDelayForName(const std::string& name, const uint160& claimId) const;

-    CClaimTrie::iterator cacheData(const std::string& name, bool create = true);
+    CClaimPrefixTrie::iterator cacheData(const std::string& name, bool create = true);

    bool getLastTakeoverForName(const std::string& name, uint160& claimId, int& takeoverHeight) const;

@ -499,6 +519,7 @@ private:
    std::unordered_set<std::string> nodesAlreadyCached; // set of nodes already pulled into cache from base
    std::unordered_map<std::string, bool> takeoverWorkaround;
    std::unordered_set<std::string> removalWorkaround;
+    std::unordered_set<std::string> dirtyNodes;

    bool shouldUseTakeoverWorkaround(const std::string& key) const;
    void addTakeoverWorkaroundPotential(const std::string& key);
@ -510,6 +531,8 @@ private:
    bool removeSupport(const std::string& name, const COutPoint& outPoint, int nHeight, int& nValidAtHeight, bool fCheckTakeover);
    bool removeClaim(const std::string& name, const COutPoint& outPoint, int nHeight, int& nValidAtHeight, bool fCheckTakeover);

+    bool validateTrieConsistency(const CBlockIndex* tip);
+
    template <typename T>
    std::pair<const int, std::vector<queueEntryType<T>>>* getQueueCacheRow(int nHeight, bool createIfNotExists = false);

@ -614,6 +637,7 @@ public:
    bool getProofForName(const std::string& name, CClaimTrieProof& proof) override;
    bool getInfoForName(const std::string& name, CClaimValue& claim) const override;
    CClaimsForNameType getClaimsForName(const std::string& name) const override;
+    std::string adjustNameForValidHeight(const std::string& name, int validHeight) const override;

 protected:
    bool insertClaimIntoTrie(const std::string& name, const CClaimValue& claim, bool fCheckTakeover) override;
@ -624,8 +648,6 @@ protected:

    int getDelayForName(const std::string& name, const uint160& claimId) const override;

-    std::string adjustNameForValidHeight(const std::string& name, int validHeight) const override;
-
 private:
    bool overrideInsertNormalization;
    bool overrideRemoveNormalization;
--- a/src/claimtrieforks.cpp
+++ b/src/claimtrieforks.cpp
@ -8,6 +8,7 @@
 #include <boost/locale/conversion.hpp>
 #include <boost/locale/localization_backend.hpp>
 #include <boost/scope_exit.hpp>
+#include <boost/scoped_ptr.hpp>

 CClaimTrieCacheExpirationFork::CClaimTrieCacheExpirationFork(CClaimTrie* base)
    : CClaimTrieCacheBase(base)
@ -60,29 +61,31 @@ bool CClaimTrieCacheExpirationFork::forkForExpirationChange(bool increment)
    */

    //look through db for expiration queues, if we haven't already found it in dirty expiration queue
-    boost::scoped_ptr<CDBIterator> pcursor(base->db->NewIterator());
-    for (pcursor->SeekToFirst(); pcursor->Valid(); pcursor->Next()) {
-        std::pair<uint8_t, int> key;
-        if (!pcursor->GetKey(key))
+    boost::scoped_ptr<CDBIterator> pcursor_ceqr(base->db_CLAIM_EXP_QUEUE_ROW->NewIterator());
+    for (pcursor_ceqr->SeekToFirst(); pcursor_ceqr->Valid(); pcursor_ceqr->Next()) {
+        int height;
+        if (!pcursor_ceqr->GetKey(height))
            continue;
-        int height = key.second;
-        if (key.first == EXP_QUEUE_ROW) {
        expirationQueueRowType row;
-            if (pcursor->GetValue(row)) {
+        if (pcursor_ceqr->GetValue(row)) {
            reactivateClaim(row, height, increment);
        } else {
            return error("%s(): error reading expiration queue rows from disk", __func__);
        }
-        } else if (key.first == SUPPORT_EXP_QUEUE_ROW) {
+    }
+
+    boost::scoped_ptr<CDBIterator> pcursor_seqr(base->db_SUPPORT_EXP_QUEUE_ROW->NewIterator());
+    for (pcursor_seqr->SeekToFirst(); pcursor_seqr->Valid(); pcursor_seqr->Next()) {
+        int height;
+        if (!pcursor_seqr->GetKey(height))
+            continue;
        expirationQueueRowType row;
-            if (pcursor->GetValue(row)) {
+        if (pcursor_seqr->GetValue(row)) {
            reactivateSupport(row, height, increment);
        } else {
            return error("%s(): error reading support expiration queue rows from disk", __func__);
        }
    }
-    }
-
    return true;
 }

@ -160,40 +163,47 @@ bool CClaimTrieCacheNormalizationFork::normalizeAllNamesInTrieIfNecessary(insert
    // run the one-time upgrade of all names that need to change
    // it modifies the (cache) trie as it goes, so we need to grab everything to be modified first

-    for (auto it = base->begin(); it != base->end(); ++it) {
-        const std::string normalized = normalizeClaimName(it.key(), true);
-        if (normalized == it.key())
+    boost::scoped_ptr<CDBIterator> pcursor(base->db_TRIE_NODE_BY_NAME->NewIterator());
+    for (pcursor->SeekToFirst(); pcursor->Valid(); pcursor->Next()) {
+        std::string name;
+        if (!pcursor->GetKey(name))
            continue;

-        auto supports = getSupportsForName(it.key());
+        const std::string normalized = normalizeClaimName(name, true);
+        if (normalized == name)
+            continue;
+
+        auto supports = getSupportsForName(name);
        for (auto support : supports) {
            // if it's already going to expire just skip it
            if (support.nHeight + expirationTime() <= nNextHeight)
                continue;

-            assert(removeSupportFromMap(it.key(), support.outPoint, support, false));
-            expireSupportUndo.emplace_back(it.key(), support);
+            assert(removeSupportFromMap(name, support.outPoint, support, false));
+            expireSupportUndo.emplace_back(name, support);
            assert(insertSupportIntoMap(normalized, support, false));
-            insertSupportUndo.emplace_back(it.key(), support.outPoint, -1);
+            insertSupportUndo.emplace_back(name, support.outPoint, -1);
        }

        namesToCheckForTakeover.insert(normalized);

-        auto cached = cacheData(it.key(), false);
+        auto cached = cacheData(name, false);
        if (!cached || cached->empty())
            continue;

-        for (auto claim : it->claims) {
+        auto claimsCopy = cached->claims;
+        auto takeoverHeightCopy = cached->nHeightOfLastTakeover;
+        for (auto claim : claimsCopy) {
            if (claim.nHeight + expirationTime() <= nNextHeight)
                continue;

-            assert(removeClaimFromTrie(it.key(), claim.outPoint, claim, false));
-            removeUndo.emplace_back(it.key(), claim);
+            assert(removeClaimFromTrie(name, claim.outPoint, claim, false));
+            removeUndo.emplace_back(name, claim);
            assert(insertClaimIntoTrie(normalized, claim, true));
-            insertUndo.emplace_back(it.key(), claim.outPoint, -1);
+            insertUndo.emplace_back(name, claim.outPoint, -1);
        }

-        takeoverHeightUndo.emplace_back(it.key(), it->nHeightOfLastTakeover);
+        takeoverHeightUndo.emplace_back(name, takeoverHeightCopy);
    }
    return true;
 }
--- a/src/dbwrapper.cpp
+++ b/src/dbwrapper.cpp
@ -116,7 +116,7 @@ static leveldb::Options GetOptions(size_t nCacheSize)
 }

 CDBWrapper::CDBWrapper(const fs::path& path, size_t nCacheSize, bool fMemory, bool fWipe, bool obfuscate)
-    : m_name(fs::basename(path))
+    : m_name(fs::basename(path)), ssKey(SER_DISK, CLIENT_VERSION), ssValue(SER_DISK, CLIENT_VERSION)
 {
    penv = nullptr;
    readoptions.verify_checksums = true;
@ -239,6 +239,11 @@ bool CDBIterator::Valid() const { return piter->Valid(); }
 void CDBIterator::SeekToFirst() { piter->SeekToFirst(); }
 void CDBIterator::Next() { piter->Next(); }

+bool CDBWrapper::Sync() {
+    CDBBatch batch(*this);
+    return WriteBatch(batch, true);
+}
+
 namespace dbwrapper_private {

 void HandleError(const leveldb::Status& status)
--- a/src/dbwrapper.h
+++ b/src/dbwrapper.h
@ -16,9 +16,6 @@
 #include <leveldb/db.h>
 #include <leveldb/write_batch.h>

-static const size_t DBWRAPPER_PREALLOC_KEY_SIZE = 64;
-static const size_t DBWRAPPER_PREALLOC_VALUE_SIZE = 1024;
-
 class dbwrapper_error : public std::runtime_error
 {
 public:
@ -43,77 +40,6 @@ const std::vector<unsigned char>& GetObfuscateKey(const CDBWrapper &w);

 };

-/** Batch of changes queued to be written to a CDBWrapper */
-class CDBBatch
-{
-    friend class CDBWrapper;
-
-private:
-    const CDBWrapper &parent;
-    leveldb::WriteBatch batch;
-
-    CDataStream ssKey;
-    CDataStream ssValue;
-
-    size_t size_estimate;
-
-public:
-    /**
-     * @param[in] _parent   CDBWrapper that this batch is to be submitted to
-     */
-    explicit CDBBatch(const CDBWrapper &_parent) : parent(_parent), ssKey(SER_DISK, CLIENT_VERSION), ssValue(SER_DISK, CLIENT_VERSION), size_estimate(0) { };
-
-    void Clear()
-    {
-        batch.Clear();
-        size_estimate = 0;
-    }
-
-    template <typename K, typename V>
-    void Write(const K& key, const V& value)
-    {
-        ssKey.reserve(DBWRAPPER_PREALLOC_KEY_SIZE);
-        ssKey << key;
-        leveldb::Slice slKey(ssKey.data(), ssKey.size());
-
-        ssValue.reserve(DBWRAPPER_PREALLOC_VALUE_SIZE);
-        ssValue << value;
-        ssValue.Xor(dbwrapper_private::GetObfuscateKey(parent));
-        leveldb::Slice slValue(ssValue.data(), ssValue.size());
-
-        batch.Put(slKey, slValue);
-        // LevelDB serializes writes as:
-        // - byte: header
-        // - varint: key length (1 byte up to 127B, 2 bytes up to 16383B, ...)
-        // - byte[]: key
-        // - varint: value length
-        // - byte[]: value
-        // The formula below assumes the key and value are both less than 16k.
-        size_estimate += 3 + (slKey.size() > 127) + slKey.size() + (slValue.size() > 127) + slValue.size();
-        ssKey.clear();
-        ssValue.clear();
-    }
-
-    template <typename K>
-    void Erase(const K& key)
-    {
-        ssKey.reserve(DBWRAPPER_PREALLOC_KEY_SIZE);
-        ssKey << key;
-        leveldb::Slice slKey(ssKey.data(), ssKey.size());
-
-        batch.Delete(slKey);
-        // LevelDB serializes erases as:
-        // - byte: header
-        // - varint: key length
-        // - byte[]: key
-        // The formula below assumes the key is less than 16kB.
-        size_estimate += 2 + (slKey.size() > 127) + slKey.size();
-        ssKey.clear();
-    }
-
-    size_t SizeEstimate() const { return size_estimate; }
-};
-
 class CDBIterator
 {
 private:
@ -135,10 +61,10 @@ public:
    void SeekToFirst();

    template<typename K> void Seek(const K& key) {
-        CDataStream ssKey(SER_DISK, CLIENT_VERSION);
-        ssKey.reserve(DBWRAPPER_PREALLOC_KEY_SIZE);
-        ssKey << key;
-        leveldb::Slice slKey(ssKey.data(), ssKey.size());
+        CDataStream ssKey1(SER_DISK, CLIENT_VERSION);
+        // ssKey1.reserve(parent.ssKey.capacity());
+        ssKey1 << key;
+        leveldb::Slice slKey(ssKey1.data(), ssKey1.size());
        piter->Seek(slKey);
    }

@ -173,6 +99,8 @@ public:

 };

+class CDBBatch;
+
 class CDBWrapper
 {
    friend const std::vector<unsigned char>& dbwrapper_private::GetObfuscateKey(const CDBWrapper &w);
@ -213,6 +141,8 @@ private:
    std::vector<unsigned char> CreateObfuscateKey() const;

 public:
+    mutable CDataStream ssKey, ssValue;
+
    /**
     * @param[in] path        Location in the filesystem where leveldb data will be stored.
     * @param[in] nCacheSize  Configures various leveldb cache settings.
@ -230,13 +160,12 @@ public:
    template <typename K, typename V>
    bool Read(const K& key, V& value) const
    {
-        CDataStream ssKey(SER_DISK, CLIENT_VERSION);
-        ssKey.reserve(DBWRAPPER_PREALLOC_KEY_SIZE);
        ssKey << key;
        leveldb::Slice slKey(ssKey.data(), ssKey.size());

        std::string strValue;
        leveldb::Status status = pdb->Get(readoptions, slKey, &strValue);
+        ssKey.clear();
        if (!status.ok()) {
            if (status.IsNotFound())
                return false;
@ -254,23 +183,17 @@ public:
    }

    template <typename K, typename V>
-    bool Write(const K& key, const V& value, bool fSync = false)
-    {
-        CDBBatch batch(*this);
-        batch.Write(key, value);
-        return WriteBatch(batch, fSync);
-    }
+    bool Write(const K& key, const V& value, bool fSync = false);

    template <typename K>
    bool Exists(const K& key) const
    {
-        CDataStream ssKey(SER_DISK, CLIENT_VERSION);
-        ssKey.reserve(DBWRAPPER_PREALLOC_KEY_SIZE);
        ssKey << key;
        leveldb::Slice slKey(ssKey.data(), ssKey.size());

        std::string strValue;
        leveldb::Status status = pdb->Get(readoptions, slKey, &strValue);
+        ssKey.clear();
        if (!status.ok()) {
            if (status.IsNotFound())
                return false;
@ -281,12 +204,7 @@ public:
    }

    template <typename K>
-    bool Erase(const K& key, bool fSync = false)
-    {
-        CDBBatch batch(*this);
-        batch.Erase(key);
-        return WriteBatch(batch, fSync);
-    }
+    bool Erase(const K& key, bool fSync = false);

    bool WriteBatch(CDBBatch& batch, bool fSync = false);

@ -299,11 +217,7 @@ public:
        return true;
    }

-    bool Sync()
-    {
-        CDBBatch batch(*this);
-        return WriteBatch(batch, true);
-    }
+    bool Sync();

    CDBIterator *NewIterator()
    {
@ -319,8 +233,6 @@ public:
    size_t EstimateSize(const K& key_begin, const K& key_end) const
    {
        CDataStream ssKey1(SER_DISK, CLIENT_VERSION), ssKey2(SER_DISK, CLIENT_VERSION);
-        ssKey1.reserve(DBWRAPPER_PREALLOC_KEY_SIZE);
-        ssKey2.reserve(DBWRAPPER_PREALLOC_KEY_SIZE);
        ssKey1 << key_begin;
        ssKey2 << key_end;
        leveldb::Slice slKey1(ssKey1.data(), ssKey1.size());
@ -338,8 +250,8 @@ public:
    void CompactRange(const K& key_begin, const K& key_end) const
    {
        CDataStream ssKey1(SER_DISK, CLIENT_VERSION), ssKey2(SER_DISK, CLIENT_VERSION);
-        ssKey1.reserve(DBWRAPPER_PREALLOC_KEY_SIZE);
-        ssKey2.reserve(DBWRAPPER_PREALLOC_KEY_SIZE);
+        ssKey1.reserve(ssKey.capacity());
+        ssKey2.reserve(ssKey.capacity());
        ssKey1 << key_begin;
        ssKey2 << key_end;
        leveldb::Slice slKey1(ssKey1.data(), ssKey1.size());
@ -349,4 +261,83 @@ public:

 };

+/** Batch of changes queued to be written to a CDBWrapper */
+class CDBBatch
+{
+    friend class CDBWrapper;
+    const CDBWrapper &parent;
+    leveldb::WriteBatch batch;
+
+    size_t size_estimate;
+
+public:
+    /**
+     * @param[in] _parent   CDBWrapper that this batch is to be submitted to
+     */
+    explicit CDBBatch(const CDBWrapper &_parent) : parent(_parent), size_estimate(0) { };
+
+    void Clear()
+    {
+        batch.Clear();
+        size_estimate = 0;
+    }
+
+    template <typename K, typename V>
+    void Write(const K& key, const V& value)
+    {
+        assert(parent.ssKey.empty());
+        parent.ssKey << key;
+        leveldb::Slice slKey(parent.ssKey.data(), parent.ssKey.size());
+
+        assert(parent.ssValue.empty());
+        parent.ssValue << value;
+        parent.ssValue.Xor(dbwrapper_private::GetObfuscateKey(parent));
+        leveldb::Slice slValue(parent.ssValue.data(), parent.ssValue.size());
+
+        batch.Put(slKey, slValue);
+        // LevelDB serializes writes as:
+        // - byte: header
+        // - varint: key length (1 byte up to 127B, 2 bytes up to 16383B, ...)
+        // - byte[]: key
+        // - varint: value length
+        // - byte[]: value
+        // The formula below assumes the key and value are both less than 16k.
+        size_estimate += 3 + (slKey.size() > 127) + slKey.size() + (slValue.size() > 127) + slValue.size();
+        parent.ssKey.clear();
+        parent.ssValue.clear();
+    }
+
+    template <typename K>
+    void Erase(const K& key)
+    {
+        parent.ssKey << key;
+        leveldb::Slice slKey(parent.ssKey.data(), parent.ssKey.size());
+
+        batch.Delete(slKey);
+        // LevelDB serializes erases as:
+        // - byte: header
+        // - varint: key length
+        // - byte[]: key
+        // The formula below assumes the key is less than 16kB.
+        size_estimate += 2 + (slKey.size() > 127) + slKey.size();
+        parent.ssKey.clear();
+    }
+
+    size_t SizeEstimate() const { return size_estimate; }
+};
+
+template<typename K>
+bool CDBWrapper::Erase(const K &key, bool fSync) {
+    CDBBatch batch(*this);
+    batch.Erase(key);
+    return WriteBatch(batch, fSync);
+}
+
+template<typename K, typename V>
+bool CDBWrapper::Write(const K &key, const V &value, bool fSync) {
+    CDBBatch batch(*this);
+    batch.Write(key, value);
+    return WriteBatch(batch, fSync);
+}
+
 #endif // BITCOIN_DBWRAPPER_H
--- a/src/init.cpp
+++ b/src/init.cpp
@ -1461,7 +1461,7 @@ bool AppInitMain()
                pblocktree.reset();
                pblocktree.reset(new CBlockTreeDB(nBlockTreeDBCache, false, fReset));
                delete pclaimTrie;
-                pclaimTrie = new CClaimTrie(false, fReindex);
+                pclaimTrie = new CClaimTrie(false, fReindex || fReindexChainState);

                if (fReset) {
                    pblocktree->WriteReindexing(true);
--- a/src/miner.cpp
+++ b/src/miner.cpp
@ -207,7 +207,7 @@ std::unique_ptr<CBlockTemplate> BlockAssembler::CreateNewBlock(const CScript& sc

    CValidationState state;
    if (!TestBlockValidity(state, chainparams, *pblock, pindexPrev, false, false)) {
-        if (!trieCache.empty() && trieCache.checkConsistency())
+        if (!trieCache.empty())
            trieCache.dumpToLog(trieCache.begin());
        throw std::runtime_error(strprintf("%s: TestBlockValidity failed: %s", __func__, FormatStateMessage(state)));
    }
--- a/src/prefixtrie.cpp
+++ b/src/prefixtrie.cpp
@ -174,21 +174,6 @@ std::vector<typename CPrefixTrie<TKey, TData>::template Iterator<IsConst>> CPref
    return ret;
 }

-template <typename TKey>
-static std::size_t match(const TKey& a, const TKey& b)
-{
-    std::size_t count = 0;
-    auto ait = a.cbegin(), aend = a.cend();
-    auto bit = b.cbegin(), bend = b.cend();
-    while (ait != aend && bit != bend) {
-        if (*ait != *bit) break;
-        ++count;
-        ++ait;
-        ++bit;
-    }
-    return count;
-}
-
 template <typename TKey, typename TData>
 template <typename TIterator, typename TNode>
 TIterator CPrefixTrie<TKey, TData>::find(const TKey& key, TNode node, TIterator end)
--- a/src/prefixtrie.h
+++ b/src/prefixtrie.h
@ -193,4 +193,19 @@ inline bool operator!=(const std::reference_wrapper<std::unique_ptr<T>>& ref, co
    return !(ref == obj);
 }

+template <typename TKey>
+static std::size_t match(const TKey& a, const TKey& b)
+{
+    std::size_t count = 0;
+    auto ait = a.cbegin(), aend = a.cend();
+    auto bit = b.cbegin(), bend = b.cend();
+    while (ait != aend && bit != bend) {
+        if (*ait != *bit) break;
+        ++count;
+        ++ait;
+        ++bit;
+    }
+    return count;
+}
+
 #endif // BITCOIN_PREFIXTRIE_H
--- a/src/rpc/claimtrie.cpp
+++ b/src/rpc/claimtrie.cpp
@ -174,6 +174,8 @@ static UniValue getclaimsintrie(const JSONRPCRequest& request)
        throw JSONRPCError(RPC_METHOD_DEPRECATED, msg);
    }

+    UniValue ret(UniValue::VARR);
+    uint256 rootHash;
    LOCK(cs_main);

    CCoinsViewCache coinsCache(pcoinsTip.get());
@ -183,20 +185,24 @@ static UniValue getclaimsintrie(const JSONRPCRequest& request)
        CBlockIndex *blockIndex = BlockHashIndex(ParseHashV(request.params[0], "blockhash (optional parameter 1)"));
        RollBackTo(blockIndex, coinsCache, trieCache);
    }
+    rootHash = trieCache.getMerkleHash();

-    UniValue ret(UniValue::VARR);
-    for (auto it = trieCache.begin(); it != trieCache.end(); ++it)
-    {
+    CClaimTrieDataNode rootNode;
+    if (!pclaimTrie->find(rootHash, rootNode))
+        return ret;
+
+    pclaimTrie->recurseAllHashedNodes("", rootNode, [&ret, &trieCache, &coinsCache](const std::string &name,
+                                                                                    const CClaimTrieDataNode &node) {
        if (ShutdownRequested())
            throw JSONRPCError(RPC_INTERNAL_ERROR, "Shutdown requested");

        boost::this_thread::interruption_point();

-        if (it->empty())
-            continue;
+        if (node.data.empty())
+            return;

        UniValue claims(UniValue::VARR);
-        for (auto itClaims = it->claims.cbegin(); itClaims != it->claims.cend(); ++itClaims) {
+        for (auto itClaims = node.data.claims.cbegin(); itClaims != node.data.claims.cend(); ++itClaims) {
            UniValue claim(UniValue::VOBJ);
            claim.pushKV("claimId", itClaims->claimId.GetHex());
            claim.pushKV("txid", itClaims->outPoint.hash.GetHex());
@ -204,18 +210,16 @@ static UniValue getclaimsintrie(const JSONRPCRequest& request)
            claim.pushKV("amount", ValueFromAmount(itClaims->nAmount));
            claim.pushKV("height", itClaims->nHeight);
            const Coin &coin = coinsCache.AccessCoin(itClaims->outPoint);
-            if (coin.IsSpent())
-            {
-                LogPrintf("%s: the specified txout of %s appears to have been spent\n", __func__, itClaims->outPoint.hash.GetHex());
+            if (coin.IsSpent()) {
+                LogPrintf("%s: the specified txout of %s appears to have been spent\n", __func__,
+                          itClaims->outPoint.hash.GetHex());
                claim.pushKV("error", "Txout spent");
-            }
-            else
-            {
+            } else {
                int op;
                std::vector<std::vector<unsigned char> > vvchParams;
-                if (!DecodeClaimScript(coin.out.scriptPubKey, op, vvchParams))
-                {
-                    LogPrintf("%s: the specified txout of %s does not have an claim command\n", __func__, itClaims->outPoint.hash.GetHex());
+                if (!DecodeClaimScript(coin.out.scriptPubKey, op, vvchParams)) {
+                    LogPrintf("%s: the specified txout of %s does not have an claim command\n", __func__,
+                              itClaims->outPoint.hash.GetHex());
                }
                claim.pushKV("value", HexStr(vvchParams[1].begin(), vvchParams[1].end()));
            }
@ -228,11 +232,10 @@ static UniValue getclaimsintrie(const JSONRPCRequest& request)
        }

        UniValue nodeObj(UniValue::VOBJ);
-        nodeObj.pushKV("normalized_name", escapeNonUtf8(it.key()));
+        nodeObj.pushKV("normalized_name", escapeNonUtf8(name));
        nodeObj.pushKV("claims", claims);
        ret.push_back(nodeObj);
-    }
-
+    });
    return ret;
 }

@ -258,6 +261,8 @@ static UniValue getnamesintrie(const JSONRPCRequest& request)
            "Result: \n"
            "\"names\"            (array) all names in the trie that have claims\n");

+    uint256 rootHash;
+    {
        LOCK(cs_main);

        CCoinsViewCache coinsCache(pcoinsTip.get());
@ -267,18 +272,22 @@ static UniValue getnamesintrie(const JSONRPCRequest& request)
            CBlockIndex *blockIndex = BlockHashIndex(ParseHashV(request.params[0], "blockhash (optional parameter 1)"));
            RollBackTo(blockIndex, coinsCache, trieCache);
        }
-
+        rootHash = trieCache.getMerkleHash();
+    }
    UniValue ret(UniValue::VARR);

-    for (auto it = trieCache.begin(); it != trieCache.end(); ++it) {
+    CClaimTrieDataNode rootNode;
+    if (!pclaimTrie->find(rootHash, rootNode))
+        return ret;
+
+    pclaimTrie->recurseAllHashedNodes("", rootNode, [&ret](const std::string& name, const CClaimTrieDataNode& node) {
+        if (!node.data.empty())
+            ret.push_back(escapeNonUtf8(name));
        if (ShutdownRequested())
            throw JSONRPCError(RPC_INTERNAL_ERROR, "Shutdown requested");

        boost::this_thread::interruption_point();
-
-        if (!it->empty())
-            ret.push_back(escapeNonUtf8(it.key()));
-    }
+    });

    return ret;
 }
@ -580,8 +589,7 @@ UniValue gettotalclaimednames(const JSONRPCRequest& request)
            "                                         names in the trie\n"
        );
    LOCK(cs_main);
-    CClaimTrieCache trieCache(pclaimTrie);
-    auto num_names = trieCache.getTotalNamesInTrie();
+    auto num_names = pclaimTrie->getTotalNamesInTrie();
    return int(num_names);
 }

@ -597,8 +605,7 @@ UniValue gettotalclaims(const JSONRPCRequest& request)
            "                                       of active claims\n"
        );
    LOCK(cs_main);
-    CClaimTrieCache trieCache(pclaimTrie);
-    auto num_claims = trieCache.getTotalClaimsInTrie();
+    auto num_claims = pclaimTrie->getTotalClaimsInTrie();
    return int(num_claims);
 }

@ -619,8 +626,7 @@ UniValue gettotalvalueofclaims(const JSONRPCRequest& request)
    bool controlling_only = false;
    if (request.params.size() == 1)
        controlling_only = request.params[0].get_bool();
-    CClaimTrieCache trieCache(pclaimTrie);
-    auto total_amount = trieCache.getTotalValueOfClaimsInTrie(controlling_only);
+    auto total_amount = pclaimTrie->getTotalValueOfClaimsInTrie(controlling_only);
    return ValueFromAmount(total_amount);
 }

--- a/src/serialize.h
+++ b/src/serialize.h
@ -559,8 +559,8 @@ template<typename Stream, typename K, typename T> void Unserialize(Stream& is, s
 /**
 * map
 */
-template<typename Stream, typename K, typename T, typename Pred, typename A> void Serialize(Stream& os, const std::map<K, T, Pred, A>& m);
-template<typename Stream, typename K, typename T, typename Pred, typename A> void Unserialize(Stream& is, std::map<K, T, Pred, A>& m);
+template<typename Stream, typename K, typename T, typename ... Z> void Serialize(Stream& os, const std::map<K, T, Z...>& m);
+template<typename Stream, typename K, typename T, typename ... Z> void Unserialize(Stream& is, std::map<K, T, Z...>& m);

 /**
 * set
@ -781,20 +781,20 @@ void Unserialize(Stream& is, std::pair<K, T>& item)
 /**
 * map
 */
-template<typename Stream, typename K, typename T, typename Pred, typename A>
-void Serialize(Stream& os, const std::map<K, T, Pred, A>& m)
+template<typename Stream, typename K, typename T, typename ... Z>
+void Serialize(Stream& os, const std::map<K, T, Z...>& m)
 {
    WriteCompactSize(os, m.size());
    for (const auto& entry : m)
        Serialize(os, entry);
 }

-template<typename Stream, typename K, typename T, typename Pred, typename A>
-void Unserialize(Stream& is, std::map<K, T, Pred, A>& m)
+template<typename Stream, typename K, typename T, typename ... Z>
+void Unserialize(Stream& is, std::map<K, T, Z...>& m)
 {
    m.clear();
    unsigned int nSize = ReadCompactSize(is);
-    typename std::map<K, T, Pred, A>::iterator mi = m.begin();
+    typename std::map<K, T, Z...>::iterator mi = m.begin();
    for (unsigned int i = 0; i < nSize; i++)
    {
        std::pair<K, T> item;
--- a/src/streams.h
+++ b/src/streams.h
@ -227,6 +227,11 @@ public:
        return (std::string(begin(), end()));
    }

+    std::size_t capacity() const
+    {
+        return vch.capacity();
+    }
+

    //
    // Vector subset
--- a/src/test/claimtriebranching_tests.cpp
+++ b/src/test/claimtriebranching_tests.cpp
@ -319,30 +319,13 @@ struct ClaimTrieChainFixture: public CClaimTrieCacheExpirationFork
        DecrementBlocks(chainActive.Height() - mark);
    }

-    template <typename K>
-    bool keyTypeEmpty(uint8_t keyType)
-    {
-        boost::scoped_ptr<CDBIterator> pcursor(base->db->NewIterator());
-        pcursor->SeekToFirst();
-
-        while (pcursor->Valid()) {
-            std::pair<uint8_t, K> key;
-            if (pcursor->GetKey(key)) {
-                if (key.first == keyType)
-                    return false;
-            }
-            pcursor->Next();
-        }
-        return true;
-    }
-
    bool queueEmpty()
    {
        for (const auto& claimQueue: claimQueueCache) {
            if (!claimQueue.second.empty())
                return false;
        }
-        return keyTypeEmpty<int>(CLAIM_QUEUE_ROW);
+        return base->db_CLAIM_QUEUE_ROW->IsEmpty();
    }

    bool expirationQueueEmpty()
@ -351,7 +334,7 @@ struct ClaimTrieChainFixture: public CClaimTrieCacheExpirationFork
            if (!expirationQueue.second.empty())
                return false;
        }
-        return keyTypeEmpty<int>(EXP_QUEUE_ROW);
+        return base->db_CLAIM_EXP_QUEUE_ROW->IsEmpty();
    }

    bool supportEmpty()
@ -360,7 +343,7 @@ struct ClaimTrieChainFixture: public CClaimTrieCacheExpirationFork
            if (!entry.second.empty())
                return false;
        }
-        return supportCache.empty() && keyTypeEmpty<std::string>(SUPPORT);
+        return supportCache.empty() && base->db_SUPPORT->IsEmpty();
    }

    bool supportQueueEmpty()
@ -369,7 +352,7 @@ struct ClaimTrieChainFixture: public CClaimTrieCacheExpirationFork
            if (!support.second.empty())
                return false;
        }
-        return keyTypeEmpty<int>(SUPPORT_QUEUE_ROW);
+        return base->db_SUPPORT_QUEUE_ROW->IsEmpty();
    }

    int proportionalDelayFactor()
@ -431,6 +414,8 @@ struct ClaimTrieChainFixture: public CClaimTrieCacheExpirationFork
            }
        }
    }
+
+    std::size_t getTotalNamesInTrie() const { return base->getTotalNamesInTrie(); }
 };

 BOOST_FIXTURE_TEST_SUITE(claimtriebranching_tests, RegTestingSetup)
@ -495,6 +480,8 @@ BOOST_AUTO_TEST_CASE(triehash_fuzzer_test)
            }
        }
        fixture.IncrementBlocks(1);
+        if (blocks > 13 && i % 50 == 0) // travisCI needs some periodic output
+            std::cerr << "In triehash_fuzzer_test with " << fixture.getTotalNamesInTrie() << " names at block " << i << std::endl;
    }

    if (blocks == 1000 && claimsPerBlock == 100)
@ -1021,7 +1008,7 @@ BOOST_AUTO_TEST_CASE(claimtrie_expire_test)
    BOOST_CHECK(fixture.is_best_claim("test", tx6));
 }
 /*
- * tests for CClaimTrie::getEffectiveAmountForClaim
+ * tests for CClaimPrefixTrie::getEffectiveAmountForClaim
 */
 BOOST_AUTO_TEST_CASE(claimtriebranching_get_effective_amount_for_claim)
 {
@ -1066,7 +1053,7 @@ BOOST_AUTO_TEST_CASE(claimtriebranching_get_effective_amount_for_claim)
 }

 /*
- * tests for CClaimTrie::getClaimById basic consistency checks
+ * tests for CClaimPrefixTrie::getClaimById basic consistency checks
 */
 BOOST_AUTO_TEST_CASE(get_claim_by_id_test)
 {
@ -1544,10 +1531,8 @@ BOOST_AUTO_TEST_CASE(claimtriecache_normalization)
    BOOST_CHECK(trieCache.incrementBlock(insertUndo, expireUndo, insertSupportUndo, expireSupportUndo, takeoverHeightUndo));
    BOOST_CHECK(trieCache.shouldNormalize());

-    // we cannot use getXXXForName cause they will normalized name
-    for (auto it = pclaimTrie->begin(); it != pclaimTrie->end(); ++it) {
-        BOOST_CHECK(it.key() != name);
-    }
+    CClaimTrieDataNode node;
+    BOOST_CHECK(!pclaimTrie->find(name, node));
 }

 BOOST_AUTO_TEST_CASE(undo_normalization_does_not_kill_claim_order)
@ -2183,7 +2168,7 @@ BOOST_AUTO_TEST_CASE(insert_update_claim_test)
                                         << 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[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;
@ -3817,7 +3802,7 @@ BOOST_AUTO_TEST_CASE(bogus_claimtrie_hash_test)
 }

 /*
- * tests for CClaimTrie::getClaimById basic consistency checks
+ * tests for CClaimPrefixTrie::getClaimById basic consistency checks
 */
 BOOST_AUTO_TEST_CASE(get_claim_by_id_test_2)
 {
@ -4099,14 +4084,17 @@ BOOST_AUTO_TEST_CASE(update_on_support2_test)
    CMutableTransaction s2 = fixture.MakeSupport(fixture.GetCoinbase(), tx1, name, 1);
    fixture.IncrementBlocks(1);

-    BOOST_CHECK_EQUAL(pclaimTrie->find(name)->nHeightOfLastTakeover, height + 1);
+    CClaimTrieDataNode node;
+    BOOST_CHECK(pclaimTrie->find(name, node));
+    BOOST_CHECK_EQUAL(node.data.nHeightOfLastTakeover, height + 1);

    fixture.Spend(s1);
    fixture.Spend(s2);
    CMutableTransaction u1 = fixture.MakeUpdate(tx1, name, value, ClaimIdHash(tx1.GetHash(), 0), 3);
    fixture.IncrementBlocks(1);

-    BOOST_CHECK_EQUAL(pclaimTrie->find(name)->nHeightOfLastTakeover, height + 1);
+    BOOST_CHECK(pclaimTrie->find(name, node));
+    BOOST_CHECK_EQUAL(node.data.nHeightOfLastTakeover, height + 1);
 }

 BOOST_AUTO_TEST_SUITE_END()
--- a/src/test/claimtriecache_tests.cpp
+++ b/src/test/claimtriecache_tests.cpp
@ -36,7 +36,7 @@ public:
        return nodesToAddOrUpdate.height();
    }

-    CClaimTrie::iterator getCache(const std::string& key)
+    CClaimPrefixTrie::iterator getCache(const std::string& key)
    {
        return nodesToAddOrUpdate.find(key);
    }
@ -124,7 +124,7 @@ BOOST_AUTO_TEST_CASE(merkle_hash_multiple_test)

    BOOST_CHECK(!pclaimTrie->empty());
    BOOST_CHECK_EQUAL(ntState.getMerkleHash(), hash2);
-    BOOST_CHECK(ntState.checkConsistency());
+    BOOST_CHECK(pclaimTrie->checkConsistency(hash2));

    CClaimTrieCacheTest ntState1(pclaimTrie);
    ntState1.removeClaimFromTrie(std::string("test"), tx1OutPoint, unused, true);
@ -144,7 +144,7 @@ BOOST_AUTO_TEST_CASE(merkle_hash_multiple_test)

    BOOST_CHECK(!pclaimTrie->empty());
    BOOST_CHECK_EQUAL(ntState2.getMerkleHash(), hash3);
-    BOOST_CHECK(ntState2.checkConsistency());
+    BOOST_CHECK(pclaimTrie->checkConsistency(hash3));

    CClaimTrieCacheTest ntState3(pclaimTrie);
    ntState3.insertClaimIntoTrie(std::string("test"), CClaimValue(tx1OutPoint, hash160, 50, 100, 200), true);
@ -152,7 +152,7 @@ BOOST_AUTO_TEST_CASE(merkle_hash_multiple_test)
    ntState3.flush();
    BOOST_CHECK(!pclaimTrie->empty());
    BOOST_CHECK_EQUAL(ntState3.getMerkleHash(), hash4);
-    BOOST_CHECK(ntState3.checkConsistency());
+    BOOST_CHECK(pclaimTrie->checkConsistency(hash4));

    CClaimTrieCacheTest ntState4(pclaimTrie);
    ntState4.removeClaimFromTrie(std::string("abab"), tx6OutPoint, unused, true);
@ -160,7 +160,7 @@ BOOST_AUTO_TEST_CASE(merkle_hash_multiple_test)
    ntState4.flush();
    BOOST_CHECK(!pclaimTrie->empty());
    BOOST_CHECK_EQUAL(ntState4.getMerkleHash(), hash2);
-    BOOST_CHECK(ntState4.checkConsistency());
+    BOOST_CHECK(pclaimTrie->checkConsistency(hash2));

    CClaimTrieCacheTest ntState5(pclaimTrie);
    ntState5.removeClaimFromTrie(std::string("test"), tx3OutPoint, unused, true);
@ -169,7 +169,7 @@ BOOST_AUTO_TEST_CASE(merkle_hash_multiple_test)
    ntState5.flush();
    BOOST_CHECK(!pclaimTrie->empty());
    BOOST_CHECK_EQUAL(ntState5.getMerkleHash(), hash2);
-    BOOST_CHECK(ntState5.checkConsistency());
+    BOOST_CHECK(pclaimTrie->checkConsistency(hash2));

    CClaimTrieCacheTest ntState6(pclaimTrie);
    ntState6.insertClaimIntoTrie(std::string("test"), CClaimValue(tx3OutPoint, hash160, 50, 101, 201), true);
@ -178,7 +178,7 @@ BOOST_AUTO_TEST_CASE(merkle_hash_multiple_test)
    ntState6.flush();
    BOOST_CHECK(!pclaimTrie->empty());
    BOOST_CHECK_EQUAL(ntState6.getMerkleHash(), hash2);
-    BOOST_CHECK(ntState6.checkConsistency());
+    BOOST_CHECK(pclaimTrie->checkConsistency(hash2));

    CClaimTrieCacheTest ntState7(pclaimTrie);
    ntState7.removeClaimFromTrie(std::string("test"), tx3OutPoint, unused, true);
@ -190,7 +190,7 @@ BOOST_AUTO_TEST_CASE(merkle_hash_multiple_test)
    ntState7.flush();
    BOOST_CHECK(pclaimTrie->empty());
    BOOST_CHECK_EQUAL(ntState7.getMerkleHash(), hash0);
-    BOOST_CHECK(ntState7.checkConsistency());
+    BOOST_CHECK(pclaimTrie->checkConsistency(hash0));
 }

 BOOST_AUTO_TEST_CASE(basic_insertion_info_test)
@ -299,28 +299,12 @@ BOOST_AUTO_TEST_CASE(iteratetrie_test)
    BOOST_CHECK(ctc.flush());

    std::size_t count = 0;
-    for (auto it = pclaimTrie->begin(); it != pclaimTrie->end(); ++it) {
-        ++count;
-        if (it.key() == "test") {
-            BOOST_CHECK_EQUAL(it->claims.size(), 1);
-        }
-    }
-    BOOST_CHECK_EQUAL(count, 2);
-
-    count = 0;
-    for (const auto& it: *pclaimTrie) {
-        ++count;
-        if (it.first == "test") {
-            const CClaimTrieData& data = it.second;
-            BOOST_CHECK_EQUAL(data.claims.size(), 1);
-        }
-    }
-    BOOST_CHECK_EQUAL(count, 2);
-
-    auto it = pclaimTrie->find("test");
-    BOOST_CHECK(it != pclaimTrie->end());
-    BOOST_CHECK_EQUAL(it->claims.size(), 1);
-    BOOST_CHECK_EQUAL(pclaimTrie->height(), 1);
+    CClaimTrieDataNode node;
+    BOOST_CHECK(pclaimTrie->find("", node));
+    BOOST_CHECK_EQUAL(node.children.size(), 1U);
+    BOOST_CHECK(pclaimTrie->find("test", node));
+    BOOST_CHECK_EQUAL(node.children.size(), 0U);
+    BOOST_CHECK_EQUAL(node.data.claims.size(), 1);
 }

 BOOST_AUTO_TEST_CASE(trie_stays_consistent_test)
@ -337,15 +321,15 @@ BOOST_AUTO_TEST_CASE(trie_stays_consistent_test)
        BOOST_CHECK(cache.insertClaimIntoTrie(name, value, false));

    cache.flush();
-    BOOST_CHECK(cache.checkConsistency());
+    BOOST_CHECK(trie.checkConsistency(cache.getMerkleHash()));

    for (auto& name: names) {
        CClaimValue temp;
        BOOST_CHECK(cache.removeClaimFromTrie(name, COutPoint(), temp, false));
        cache.flush();
-        BOOST_CHECK(cache.checkConsistency());
+        BOOST_CHECK(trie.checkConsistency(cache.getMerkleHash()));
    }
-    BOOST_CHECK_EQUAL(trie.height(), 0);
+    BOOST_CHECK(trie.empty());
 }

 BOOST_AUTO_TEST_CASE(takeover_workaround_triggers)
@ -394,9 +378,29 @@ BOOST_AUTO_TEST_CASE(takeover_workaround_triggers)

    BOOST_CHECK(cache.incrementBlock(icu, ecu, isu, esu, thu));

-    BOOST_CHECK_EQUAL(3, cache.find("aa")->nHeightOfLastTakeover);
-    BOOST_CHECK_EQUAL(3, cache.find("bb")->nHeightOfLastTakeover);
-    BOOST_CHECK_EQUAL(1, cache.find("cc")->nHeightOfLastTakeover);
+    BOOST_CHECK_EQUAL(3, cache.getCache("aa")->nHeightOfLastTakeover);
+    BOOST_CHECK_EQUAL(3, cache.getCache("bb")->nHeightOfLastTakeover);
+    BOOST_CHECK_EQUAL(1, cache.getCache("cc")->nHeightOfLastTakeover);
+}
+
+BOOST_AUTO_TEST_CASE(verify_basic_serialization)
+{
+    CClaimValue cv;
+    cv.outPoint = COutPoint(uint256S("123"), 2);
+    cv.nHeight = 3;
+    cv.claimId.SetHex("4567");
+    cv.nEffectiveAmount = 4;
+    cv.nAmount = 5;
+    cv.nValidAtHeight = 6;
+
+    CDataStream ssData(SER_NETWORK, PROTOCOL_VERSION);
+    ssData << cv;
+
+    CClaimValue cv2;
+    ssData >> cv2;
+
+    BOOST_CHECK_EQUAL(cv, cv2);
+    BOOST_CHECK_EQUAL(cv.nEffectiveAmount, cv2.nEffectiveAmount);
 }

 BOOST_AUTO_TEST_SUITE_END()
--- a/src/test/test_bitcoin.cpp
+++ b/src/test/test_bitcoin.cpp
@ -20,6 +20,8 @@
 #include <script/sigcache.h>

 #include "claimtrie.h"
+#include <boost/test/unit_test.hpp>
+#include <boost/test/unit_test_parameters.hpp>

 void CConnmanTest::AddNode(CNode& node)
 {
@ -39,7 +41,6 @@ void CConnmanTest::ClearNodes()
 uint256 insecure_rand_seed = GetRandHash();
 FastRandomContext insecure_rand_ctx(insecure_rand_seed);

-extern bool fPrintToConsole;
 extern void noui_connect();

 std::ostream& operator<<(std::ostream& os, const uint256& num)
@ -90,6 +91,14 @@ std::ostream& operator<<(std::ostream& os, const CSupportValue& support)
 BasicTestingSetup::BasicTestingSetup(const std::string& chainName)
    : m_path_root(fs::temp_directory_path() / "test_bitcoin" / strprintf("%lu_%i", (unsigned long)GetTime(), (int)(InsecureRandRange(1 << 30))))
 {
+    // for debugging:
+    if (boost::unit_test::runtime_config::get<boost::unit_test::log_level>(boost::unit_test::runtime_config::btrt_log_level)
+            <= boost::unit_test::log_level::log_messages) {
+        g_logger->m_print_to_console = true;
+        g_logger->m_log_time_micros = true;
+        g_logger->EnableCategory(BCLog::ALL);
+    }
+
    SHA256AutoDetect();
    RandomInit();
    ECC_Start();
--- a/src/test/test_bitcoin.h
+++ b/src/test/test_bitcoin.h
@ -44,7 +44,7 @@ struct BasicTestingSetup {
    ECCVerifyHandle globalVerifyHandle;

    explicit BasicTestingSetup(const std::string& chainName = CBaseChainParams::MAIN);
-    ~BasicTestingSetup();
+    virtual ~BasicTestingSetup();

    fs::path SetDataDir(const std::string& name);

@ -70,7 +70,7 @@ struct TestingSetup: public BasicTestingSetup {
    std::unique_ptr<PeerLogicValidation> peerLogic;

    explicit TestingSetup(const std::string& chainName = CBaseChainParams::MAIN);
-    ~TestingSetup();
+    ~TestingSetup() override;
 };

 class CBlock;
@ -89,7 +89,7 @@ struct TestChain100Setup : public TestingSetup {
    CBlock CreateAndProcessBlock(const std::vector<CMutableTransaction>& txns,
                                 const CScript& scriptPubKey);

-    ~TestChain100Setup();
+    ~TestChain100Setup() override;

    std::vector<CTransactionRef> m_coinbase_txns; // For convenience, coinbase transactions
    CKey coinbaseKey; // private/public key needed to spend coinbase transactions
@ -97,7 +97,7 @@ struct TestChain100Setup : public TestingSetup {

 struct RegTestingSetup: public TestingSetup {
    RegTestingSetup();
-    ~RegTestingSetup();
+    ~RegTestingSetup() override;
 };

 class CTxMemPoolEntry;
--- a/src/validation.cpp
+++ b/src/validation.cpp
@ -1562,14 +1562,12 @@ DisconnectResult CChainState::DisconnectBlock(const CBlock& block, const CBlockI
    assert(trieCache.finalizeDecrement(blockUndo.takeoverHeightUndo));
    auto merkleHash = trieCache.getMerkleHash();
    if (merkleHash != pindex->pprev->hashClaimTrie) {
-        if (trieCache.checkConsistency()) {
        for (auto cit = trieCache.begin(); cit != trieCache.end(); ++cit) {
            if (cit->claims.size() && cit->nHeightOfLastTakeover <= 0)
                LogPrintf("Invalid takeover height discovered in cache for %s\n", cit.key());
            if (cit->hash.IsNull())
                LogPrintf("Invalid hash discovered in cache for %s\n", cit.key());
        }
-        }
        LogPrintf("Hash comparison failure at block %d\n", pindex->nHeight);
        assert(merkleHash == pindex->pprev->hashClaimTrie);
    }
@ -2048,7 +2046,7 @@ bool CChainState::ConnectBlock(const CBlock& block, CValidationState& state, CBl

    if (trieCache.getMerkleHash() != block.hashClaimTrie)
    {
-        if (!trieCache.empty() && trieCache.checkConsistency())
+        if (!trieCache.empty()) // we could run checkConsistency here, but it would take a while
            trieCache.dumpToLog(trieCache.begin());
        return state.DoS(100, error("ConnectBlock() : the merkle root of the claim trie does not match "
                               "(actual=%s vs block=%s on height=%d)", trieCache.getMerkleHash().GetHex(),
@ -2296,13 +2294,13 @@ void static UpdateTip(const CBlockIndex *pindexNew, const CChainParams& chainPar
    auto oldBlock = pindexNew->nTime + MAX_FUTURE_BLOCK_TIME < currentTime;
    if (!warningMessages.empty() || !oldBlock || lastBlockPrintTime < currentTime - 15 || LogAcceptCategory(BCLog::CLAIMS)) {
        lastBlockPrintTime = currentTime;
-        LogPrintf("%s: new best=%s height=%d version=0x%08x log2_work=%.8g txb=%lu tx=%lu date='%s' progress=%f cache=%.1fMiB(%utxo) trie nodes=%zu%s",
+        LogPrintf("%s: new best=%s height=%d version=0x%08x log2_work=%.8g txb=%lu tx=%lu date='%s' progress=%f cache=%.1fMiB(%utxo)%s",
                __func__, pindexNew->GetBlockHash().ToString(), pindexNew->nHeight, pindexNew->nVersion,
                log(pindexNew->nChainWork.getdouble()) / log(2.0), (unsigned long) pindexNew->nTx,
                (unsigned long) pindexNew->nChainTx, FormatISO8601DateTime(pindexNew->GetBlockTime()),
                GuessVerificationProgress(chainParams.TxData(), pindexNew),
                pcoinsTip->DynamicMemoryUsage() * (1.0 / (1U << 20U)), pcoinsTip->GetCacheSize(),
-                pclaimTrie->height(), oldBlock ? " (synchronizing)" : "");
+                oldBlock ? " (synchronizing)" : "");
        if (!warningMessages.empty())
            LogPrintf(" warning='%s'", warningMessages); /* Continued */
        LogPrintf("\n");
--- a/src/wallet/db.cpp
+++ b/src/wallet/db.cpp
@ -154,6 +154,7 @@ BerkeleyEnvironment::BerkeleyEnvironment(const fs::path& dir_path) : strPath(dir

 BerkeleyEnvironment::~BerkeleyEnvironment()
 {
+    LOCK(cs_db);
    g_dbenvs.erase(strPath);
    Close();
 }
@ -558,6 +559,7 @@ BerkeleyBatch::BerkeleyBatch(BerkeleyDatabase& database, const char* pszMode, bo

 void BerkeleyBatch::Flush()
 {
+    LOCK(cs_db);
    if (activeTxn)
        return;

@ -566,8 +568,10 @@ void BerkeleyBatch::Flush()
    if (fReadOnly)
        nMinutes = 1;

+    if (env && env->dbenv) { // env is nullptr for dummy databases (i.e. in tests). Don't actually flush if env is nullptr so we don't segfault
        env->dbenv->txn_checkpoint(nMinutes ? gArgs.GetArg("-dblogsize", DEFAULT_WALLET_DBLOGSIZE) * 1024 : 0, nMinutes, 0);
    }
+}

 void BerkeleyDatabase::IncrementUpdateCounter()
 {
--- a/src/wallet/test/claim_rpc_tests.cpp
+++ b/src/wallet/test/claim_rpc_tests.cpp
@ -28,11 +28,11 @@ struct CatchWalletTestSetup: public TestingSetup {
        UniValue results = rpc_method(req);
        BOOST_CHECK_EQUAL(results["name"].get_str(), "tester_wallet");
    }
-    ~CatchWalletTestSetup() {
+    ~CatchWalletTestSetup() override {
        rpcfn_type rpc_method = tableRPC["unloadwallet"]->actor;
        JSONRPCRequest req;
+        req.URI = "/wallet/tester_wallet";
        req.params = UniValue(UniValue::VARR);
-        req.params.push_back("tester_wallet");
        rpc_method(req);
    }
 };
@ -42,6 +42,7 @@ BOOST_FIXTURE_TEST_SUITE(claim_rpc_tests, CatchWalletTestSetup)
 double AvailableBalance() {
    rpcfn_type rpc_method = tableRPC["getbalance"]->actor;
    JSONRPCRequest req;
+    req.URI = "/wallet/tester_wallet";
    req.params = UniValue(UniValue::VARR);
    UniValue results = rpc_method(req);
    return results.get_real();
@ -51,6 +52,7 @@ uint256 ClaimAName(const std::string& name, const std::string& data, const std::
    // pass a txid as name for update
    rpcfn_type rpc_method = tableRPC[isUpdate ? "updateclaim" : "claimname"]->actor;
    JSONRPCRequest req;
+    req.URI = "/wallet/tester_wallet";
    req.params = UniValue(UniValue::VARR);
    req.params.push_back(name);
    req.params.push_back(data);
@ -67,6 +69,7 @@ uint256 SupportAName(const std::string& name, const std::string& claimId, const
    // pass a txid as name for update
    rpcfn_type rpc_method = tableRPC["supportclaim"]->actor;
    JSONRPCRequest req;
+    req.URI = "/wallet/tester_wallet";
    req.params = UniValue(UniValue::VARR);
    req.params.push_back(name);
    req.params.push_back(claimId);
@ -82,6 +85,7 @@ uint256 SupportAName(const std::string& name, const std::string& claimId, const
 UniValue LookupAllNames() {
    rpcfn_type rpc_method = tableRPC["listnameclaims"]->actor;
    JSONRPCRequest req;
+    req.URI = "/wallet/tester_wallet";
    req.params = UniValue(UniValue::VARR);
    return rpc_method(req);
 }
@ -89,6 +93,7 @@ UniValue LookupAllNames() {
 std::vector<uint256> generateBlock(int blocks = 1) {
    rpcfn_type rpc_method = tableRPC["generate"]->actor;
    JSONRPCRequest req;
+    req.URI = "/wallet/tester_wallet";
    req.params = UniValue(UniValue::VARR);
    req.params.push_back(blocks);
    UniValue results = rpc_method(req);
@ -107,6 +112,7 @@ void rollbackBlock(const std::vector<uint256>& ids) {
    rpcfn_type rpc_method = tableRPC["invalidateblock"]->actor;
    for (auto it = ids.rbegin(); it != ids.rend(); ++it) {
        JSONRPCRequest req;
+        req.URI = "/wallet/tester_wallet";
        req.params = UniValue(UniValue::VARR);
        req.params.push_back(it->GetHex());
        rpc_method(req);
@ -119,6 +125,7 @@ void rollbackBlock(const std::vector<uint256>& ids) {
 uint256 AbandonAClaim(const uint256& txid, bool isSupport = false) {
    rpcfn_type pre_rpc_method = tableRPC["getrawchangeaddress"]->actor;
    JSONRPCRequest pre_req;
+    pre_req.URI = "/wallet/tester_wallet";
    pre_req.params = UniValue(UniValue::VARR);
    pre_req.params.push_back("legacy");
    UniValue adr_hash = pre_rpc_method(pre_req);
@ -126,6 +133,7 @@ uint256 AbandonAClaim(const uint256& txid, bool isSupport = false) {
    // pass a txid as name for update
    rpcfn_type rpc_method = tableRPC[isSupport ? "abandonsupport" : "abandonclaim"]->actor;
    JSONRPCRequest req;
+    req.URI = "/wallet/tester_wallet";
    req.params = UniValue(UniValue::VARR);
    req.params.push_back(txid.GetHex());
    req.params.push_back(adr_hash.get_str());
Author	SHA1	Message	Date
Brannon King	558d834f4b	changed so each LDB key was in its own DB	2019-08-19 08:29:56 -06:00
Brannon King	83319b7f31	optimized a little	2019-08-02 17:27:28 -06:00
Brannon King	6b8935718e	first pass at not loading full claimtrie into RAM tweaks	2019-08-01 18:35:58 -06:00
Brannon King	05d89e91cf	fix unit test crash on OSX pulled in some fixes from v18	2019-08-01 15:44:05 -06:00