world_state.hpp

Go to the documentation of this file.

#pragma once
 
#include "barretenberg/common/thread_pool.hpp"
#include "barretenberg/crypto/merkle_tree/append_only_tree/content_addressed_append_only_tree.hpp"
#include "barretenberg/crypto/merkle_tree/hash.hpp"
#include "barretenberg/crypto/merkle_tree/hash_path.hpp"
#include "barretenberg/crypto/merkle_tree/indexed_tree/content_addressed_indexed_tree.hpp"
#include "barretenberg/crypto/merkle_tree/indexed_tree/indexed_leaf.hpp"
#include "barretenberg/crypto/merkle_tree/node_store/cached_content_addressed_tree_store.hpp"
#include "barretenberg/crypto/merkle_tree/node_store/tree_meta.hpp"
#include "barretenberg/crypto/merkle_tree/response.hpp"
#include "barretenberg/crypto/merkle_tree/signal.hpp"
#include "barretenberg/crypto/merkle_tree/types.hpp"
#include "barretenberg/ecc/curves/bn254/fr.hpp"
#include "barretenberg/lmdblib/lmdb_environment.hpp"
#include "barretenberg/serialize/msgpack.hpp"
#include "barretenberg/world_state/fork.hpp"
#include "barretenberg/world_state/tree_with_store.hpp"
#include "barretenberg/world_state/types.hpp"
#include "barretenberg/world_state/world_state_stores.hpp"
#include <algorithm>
#include <cstdint>
#include <exception>
#include <iterator>
#include <memory>
#include <optional>
#include <stdexcept>
#include <type_traits>
#include <unordered_map>
#include <variant>
 
namespace bb::world_state {
 
using crypto::merkle_tree::index_t;
 
template <typename LeafValueType> struct BatchInsertionResult {
    std::vector<crypto::merkle_tree::LeafUpdateWitnessData<LeafValueType>> low_leaf_witness_data;
    std::vector<std::pair<LeafValueType, index_t>> sorted_leaves;
    crypto::merkle_tree::fr_sibling_path subtree_path;
 
    SERIALIZATION_FIELDS(low_leaf_witness_data, sorted_leaves, subtree_path);
};
 
template <typename LeafValueType> struct SequentialInsertionResult {
    std::vector<crypto::merkle_tree::LeafUpdateWitnessData<LeafValueType>> low_leaf_witness_data;
    std::vector<crypto::merkle_tree::LeafUpdateWitnessData<LeafValueType>> insertion_witness_data;
 
    SERIALIZATION_FIELDS(low_leaf_witness_data, insertion_witness_data);
};
 
const uint64_t DEFAULT_MIN_NUMBER_OF_READERS = 128;
 
class WorldState {
  public:
    WorldState(uint64_t thread_pool_size,
               const std::string& data_dir,
               uint64_t map_size,
               const std::unordered_map<MerkleTreeId, uint32_t>& tree_heights,
               const std::unordered_map<MerkleTreeId, index_t>& tree_prefill,
               uint32_t initial_header_generator_point,
               uint64_t genesis_timestamp = 0,
               bool ephemeral = false);
 
    WorldState(uint64_t thread_pool_size,
               const std::string& data_dir,
               const std::unordered_map<MerkleTreeId, uint64_t>& map_size,
               const std::unordered_map<MerkleTreeId, uint32_t>& tree_heights,
               const std::unordered_map<MerkleTreeId, index_t>& tree_prefill,
               uint32_t initial_header_generator_point,
               uint64_t genesis_timestamp = 0,
               bool ephemeral = false);
 
    WorldState(uint64_t thread_pool_size,
               const std::string& data_dir,
               uint64_t map_size,
               const std::unordered_map<MerkleTreeId, uint32_t>& tree_heights,
               const std::unordered_map<MerkleTreeId, index_t>& tree_prefill,
               const std::vector<PublicDataLeafValue>& prefilled_public_data,
               uint32_t initial_header_generator_point,
               uint64_t genesis_timestamp = 0,
               bool ephemeral = false);
 
    WorldState(uint64_t thread_pool_size,
               const std::string& data_dir,
               const std::unordered_map<MerkleTreeId, uint64_t>& map_size,
               const std::unordered_map<MerkleTreeId, uint32_t>& tree_heights,
               const std::unordered_map<MerkleTreeId, index_t>& tree_prefill,
               const std::vector<PublicDataLeafValue>& prefilled_public_data,
               uint32_t initial_header_generator_point,
               uint64_t genesis_timestamp = 0,
               bool ephemeral = false);
 
    void copy_stores(const std::string& dstPath, bool compact) const;
 
    crypto::merkle_tree::TreeMetaResponse get_tree_info(const WorldStateRevision& revision, MerkleTreeId tree_id) const;
 
    StateReference get_state_reference(const WorldStateRevision& revision) const;
 
    StateReference get_initial_state_reference() const;
 
    crypto::merkle_tree::fr_sibling_path get_sibling_path(const WorldStateRevision& revision,
                                                          MerkleTreeId tree_id,
                                                          index_t leaf_index) const;
 
    void get_block_numbers_for_leaf_indices(const WorldStateRevision& revision,
                                            MerkleTreeId tree_id,
                                            const std::vector<index_t>& leafIndices,
                                            std::vector<std::optional<block_number_t>>& blockNumbers) const;
 
    template <typename T>
    std::optional<crypto::merkle_tree::IndexedLeaf<T>> get_indexed_leaf(const WorldStateRevision& revision,
                                                                        MerkleTreeId tree_id,
                                                                        index_t leaf_index) const;
 
    template <typename T>
    std::optional<T> get_leaf(const WorldStateRevision& revision, MerkleTreeId tree_id, index_t leaf_index) const;
 
    crypto::merkle_tree::GetLowIndexedLeafResponse find_low_leaf_index(const WorldStateRevision& revision,
                                                                       MerkleTreeId tree_id,
                                                                       const bb::fr& leaf_key) const;
 
    template <typename T>
    void find_leaf_indices(const WorldStateRevision& revision,
                           MerkleTreeId tree_id,
                           const std::vector<T>& leaves,
                           std::vector<std::optional<index_t>>& indices,
                           index_t start_index = 0) const;
 
    template <typename T>
    void find_sibling_paths(const WorldStateRevision& revision,
                            MerkleTreeId tree_id,
                            const std::vector<T>& leaves,
                            std::vector<std::optional<SiblingPathAndIndex>>& paths) const;
 
    template <typename T>
    void append_leaves(MerkleTreeId tree_id, const std::vector<T>& leaves, Fork::Id fork_id = CANONICAL_FORK_ID);
 
    template <typename T>
    BatchInsertionResult<T> batch_insert_indexed_leaves(MerkleTreeId tree_id,
                                                        const std::vector<T>& leaves,
                                                        uint32_t subtree_depth,
                                                        Fork::Id fork_id = CANONICAL_FORK_ID);
 
    template <typename T>
    SequentialInsertionResult<T> insert_indexed_leaves(MerkleTreeId tree_id,
                                                       const std::vector<T>& leaves,
                                                       Fork::Id fork_id = CANONICAL_FORK_ID);
 
    void update_public_data(const crypto::merkle_tree::PublicDataLeafValue& new_value,
                            Fork::Id fork_id = CANONICAL_FORK_ID);
 
    void update_archive(const StateReference& block_state_ref,
                        const bb::fr& block_header_hash,
                        Fork::Id fork_id = CANONICAL_FORK_ID);
 
    std::pair<bool, std::string> commit(WorldStateStatusFull& status);
 
    void rollback();
 
    uint64_t create_fork(const std::optional<block_number_t>& blockNumber);
    void delete_fork(const uint64_t& forkId);
 
    WorldStateStatusSummary set_finalized_blocks(const block_number_t& toBlockNumber);
    WorldStateStatusFull unwind_blocks(const block_number_t& toBlockNumber);
    WorldStateStatusFull remove_historical_blocks(const block_number_t& toBlockNumber);
 
    void get_status_summary(WorldStateStatusSummary& status) const;
    WorldStateStatusFull sync_block(const StateReference& block_state_ref,
                                    const bb::fr& block_header_hash,
                                    const std::vector<bb::fr>& notes,
                                    const std::vector<bb::fr>& l1_to_l2_messages,
                                    const std::vector<crypto::merkle_tree::NullifierLeafValue>& nullifiers,
                                    const std::vector<crypto::merkle_tree::PublicDataLeafValue>& public_writes);
 
    uint32_t checkpoint(const uint64_t& forkId);
    void commit_checkpoint(const uint64_t& forkId);
    void revert_checkpoint(const uint64_t& forkId);
    void commit_all_checkpoints_to(const uint64_t& forkId, uint32_t depth);
    void revert_all_checkpoints_to(const uint64_t& forkId, uint32_t depth);
 
  private:
    std::shared_ptr<bb::ThreadPool> _workers;
    WorldStateStores::Ptr _persistentStores;
 
    std::unordered_map<MerkleTreeId, uint32_t> _tree_heights;
    std::unordered_map<MerkleTreeId, index_t> _initial_tree_size;
    mutable std::mutex mtx;
    std::unordered_map<uint64_t, Fork::SharedPtr> _forks;
    uint64_t _forkId = 0;
    uint32_t _initial_header_generator_point;
    uint64_t _genesis_timestamp;
 
    TreeStateReference get_tree_snapshot(MerkleTreeId id);
    void create_canonical_fork(const std::string& dataDir,
                               const std::unordered_map<MerkleTreeId, uint64_t>& dbSize,
                               const std::vector<PublicDataLeafValue>& prefilled_public_data,
                               uint64_t maxReaders,
                               bool ephemeral);
 
    Fork::SharedPtr retrieve_fork(const uint64_t& forkId) const;
    Fork::SharedPtr create_new_fork(const block_number_t& blockNumber);
    void remove_forks_for_block(const block_number_t& blockNumber);
 
    bool unwind_block(const block_number_t& blockNumber, WorldStateStatusFull& status);
    bool remove_historical_block(const block_number_t& blockNumber, WorldStateStatusFull& status);
    bool set_finalized_block(const block_number_t& blockNumber);
 
    void get_all_tree_info(const WorldStateRevision& revision, std::array<TreeMeta, NUM_TREES>& responses) const;
 
    void validate_trees_are_equally_synched();
 
    WorldStateStatusFull attempt_tree_resync();
 
    static bool block_state_matches_world_state(const StateReference& block_state_ref,
                                                const StateReference& tree_state_ref);
 
    bool is_archive_tip(const WorldStateRevision& revision, const bb::fr& block_header_hash) const;
 
    bool is_same_state_reference(const WorldStateRevision& revision, const StateReference& state_ref) const;
    static bb::fr compute_initial_block_header_hash(const StateReference& initial_state_ref,
                                                    uint32_t generator_point,
                                                    uint64_t genesis_timestamp = 0);
 
    static StateReference get_state_reference(const WorldStateRevision& revision,
                                              Fork::SharedPtr fork,
                                              bool initial_state = false);
 
    static bool determine_if_synched(std::array<TreeMeta, NUM_TREES>& metaResponses);
 
    static void get_status_summary_from_meta_responses(WorldStateStatusSummary& status,
                                                       std::array<TreeMeta, NUM_TREES>& metaResponses);
 
    static void populate_status_summary(WorldStateStatusFull& status);
 
    template <typename TreeType>
    void commit_tree(TreeDBStats& dbStats,
                     Signal& signal,
                     TreeType& tree,
                     std::atomic_bool& success,
                     std::string& message,
                     TreeMeta& meta);
 
    template <typename TreeType>
    void unwind_tree(TreeDBStats& dbStats,
                     Signal& signal,
                     TreeType& tree,
                     std::atomic_bool& success,
                     std::string& message,
                     TreeMeta& meta,
                     const block_number_t& blockNumber);
 
    template <typename TreeType>
    void remove_historic_block_for_tree(TreeDBStats& dbStats,
                                        Signal& signal,
                                        TreeType& tree,
                                        std::atomic_bool& success,
                                        std::string& message,
                                        TreeMeta& meta,
                                        const block_number_t& blockNumber);
};
 
template <typename TreeType>
void WorldState::commit_tree(TreeDBStats& dbStats,
                             Signal& signal,
                             TreeType& tree,
                             std::atomic_bool& success,
                             std::string& message,
                             TreeMeta& meta)
{
    tree.commit([&](TypedResponse<CommitResponse>& response) {
        bool expected = true;
        if (!response.success && success.compare_exchange_strong(expected, false)) {
            message = response.message;
        }
        dbStats = std::move(response.inner.stats);
        meta = std::move(response.inner.meta);
        signal.signal_decrement();
    });
}
 
template <typename TreeType>
void WorldState::unwind_tree(TreeDBStats& dbStats,
                             Signal& signal,
                             TreeType& tree,
                             std::atomic_bool& success,
                             std::string& message,
                             TreeMeta& meta,
                             const block_number_t& blockNumber)
{
    tree.unwind_block(blockNumber, [&](TypedResponse<UnwindResponse>& response) {
        bool expected = true;
        if (!response.success && success.compare_exchange_strong(expected, false)) {
            message = response.message;
        }
        dbStats = std::move(response.inner.stats);
        meta = std::move(response.inner.meta);
        signal.signal_decrement();
    });
}
 
template <typename TreeType>
void WorldState::remove_historic_block_for_tree(TreeDBStats& dbStats,
                                                Signal& signal,
                                                TreeType& tree,
                                                std::atomic_bool& success,
                                                std::string& message,
                                                TreeMeta& meta,
                                                const block_number_t& blockNumber)
{
    tree.remove_historic_block(blockNumber, [&](TypedResponse<RemoveHistoricResponse>& response) {
        bool expected = true;
        if (!response.success && success.compare_exchange_strong(expected, false)) {
            message = response.message;
        }
        dbStats = std::move(response.inner.stats);
        meta = std::move(response.inner.meta);
        signal.signal_decrement();
    });
}
 
template <typename T>
std::optional<crypto::merkle_tree::IndexedLeaf<T>> WorldState::get_indexed_leaf(const WorldStateRevision& rev,
                                                                                MerkleTreeId id,
                                                                                index_t leaf) const
{
    using Store = ContentAddressedCachedTreeStore<T>;
    using Tree = ContentAddressedIndexedTree<Store, aztec::MerkleHashPolicyForT<T>>;
 
    Fork::SharedPtr fork = retrieve_fork(rev.forkId);
    TypedResponse<GetIndexedLeafResponse<T>> local;
 
    if (auto* const wrapper = std::get_if<TreeWithStore<Tree>>(&fork->_trees.at(id))) {
 
        Signal signal;
        auto callback = [&](TypedResponse<GetIndexedLeafResponse<T>>& response) {
            local = std::move(response);
            signal.signal_level(0);
        };
 
        if (rev.is_historical()) {
            wrapper->tree->get_leaf(leaf, rev.blockNumber, rev.includeUncommitted, callback);
        } else {
            wrapper->tree->get_leaf(leaf, rev.includeUncommitted, callback);
        }
        signal.wait_for_level();
 
        if (!local.success) {
            throw std::runtime_error("Failed to find indexed leaf: " + local.message);
        }
 
        return local.inner.indexed_leaf;
    }
 
    throw std::runtime_error("Invalid tree type");
}
 
template <typename T>
std::optional<T> WorldState::get_leaf(const WorldStateRevision& revision,
                                      MerkleTreeId tree_id,
                                      index_t leaf_index) const
{
    using namespace crypto::merkle_tree;
 
    Fork::SharedPtr fork = retrieve_fork(revision.forkId);
 
    std::optional<T> leaf;
    bool success = true;
    std::string error_msg;
    Signal signal;
    if constexpr (std::is_same_v<bb::fr, T>) {
        const auto& wrapper = std::get<TreeWithStore<FrTree>>(fork->_trees.at(tree_id));
        auto callback = [&signal, &leaf, &success, &error_msg](const TypedResponse<GetLeafResponse>& response) {
            if (!response.success || !response.inner.leaf.has_value()) {
                // TODO(#17755): Permeate errors to TS? (native_world_state_instance.ts -> call() translates this to
                // null)
                success = false;
                error_msg = response.message;
            } else {
                leaf = response.inner.leaf;
            }
            signal.signal_level();
        };
 
        if (revision.is_historical()) {
            wrapper.tree->get_leaf(leaf_index, revision.blockNumber, revision.includeUncommitted, callback);
        } else {
            wrapper.tree->get_leaf(leaf_index, revision.includeUncommitted, callback);
        }
    } else {
        using Store = ContentAddressedCachedTreeStore<T>;
        using Tree = ContentAddressedIndexedTree<Store, aztec::MerkleHashPolicyForT<T>>;
 
        auto& wrapper = std::get<TreeWithStore<Tree>>(fork->_trees.at(tree_id));
        auto callback =
            [&signal, &leaf, &success, &error_msg](const TypedResponse<GetIndexedLeafResponse<T>>& response) {
                if (!response.success || !response.inner.indexed_leaf.has_value()) {
                    success = false;
                    error_msg = response.message;
                } else {
                    leaf = response.inner.indexed_leaf.value().leaf;
                }
                signal.signal_level();
            };
 
        if (revision.is_historical()) {
            wrapper.tree->get_leaf(leaf_index, revision.blockNumber, revision.includeUncommitted, callback);
        } else {
            wrapper.tree->get_leaf(leaf_index, revision.includeUncommitted, callback);
        }
    }
 
    signal.wait_for_level();
 
    return leaf;
}
 
template <typename T>
void WorldState::find_leaf_indices(const WorldStateRevision& rev,
                                   MerkleTreeId id,
                                   const std::vector<T>& leaves,
                                   std::vector<std::optional<index_t>>& indices,
                                   index_t start_index) const
{
    using namespace crypto::merkle_tree;
 
    Fork::SharedPtr fork = retrieve_fork(rev.forkId);
    TypedResponse<FindLeafIndexResponse> local;
 
    Signal signal;
    auto callback = [&](TypedResponse<FindLeafIndexResponse>& response) {
        local = std::move(response);
        signal.signal_level(0);
    };
    if constexpr (std::is_same_v<bb::fr, T>) {
        const auto& wrapper = std::get<TreeWithStore<FrTree>>(fork->_trees.at(id));
        if (rev.is_historical()) {
            wrapper.tree->find_leaf_indices_from(
                leaves, start_index, rev.blockNumber, rev.includeUncommitted, callback);
        } else {
            wrapper.tree->find_leaf_indices_from(leaves, start_index, rev.includeUncommitted, callback);
        }
 
    } else {
        using Store = ContentAddressedCachedTreeStore<T>;
        using Tree = ContentAddressedIndexedTree<Store, aztec::MerkleHashPolicyForT<T>>;
 
        auto& wrapper = std::get<TreeWithStore<Tree>>(fork->_trees.at(id));
        if (rev.is_historical()) {
            wrapper.tree->find_leaf_indices_from(
                leaves, start_index, rev.blockNumber, rev.includeUncommitted, callback);
        } else {
            wrapper.tree->find_leaf_indices_from(leaves, start_index, rev.includeUncommitted, callback);
        }
    }
 
    signal.wait_for_level(0);
 
    if (!local.success || local.inner.leaf_indices.size() != leaves.size()) {
        throw std::runtime_error(local.message);
    }
 
    indices = std::move(local.inner.leaf_indices);
}
 
template <typename T>
void WorldState::find_sibling_paths(const WorldStateRevision& rev,
                                    MerkleTreeId id,
                                    const std::vector<T>& leaves,
                                    std::vector<std::optional<SiblingPathAndIndex>>& paths) const
{
    using namespace crypto::merkle_tree;
 
    Fork::SharedPtr fork = retrieve_fork(rev.forkId);
    TypedResponse<FindLeafPathResponse> local;
 
    Signal signal;
    auto callback = [&](TypedResponse<FindLeafPathResponse>& response) {
        local = std::move(response);
        signal.signal_level(0);
    };
    if constexpr (std::is_same_v<bb::fr, T>) {
        const auto& wrapper = std::get<TreeWithStore<FrTree>>(fork->_trees.at(id));
        if (rev.is_historical()) {
            wrapper.tree->find_leaf_sibling_paths(leaves, rev.blockNumber, rev.includeUncommitted, callback);
        } else {
            wrapper.tree->find_leaf_sibling_paths(leaves, rev.includeUncommitted, callback);
        }
 
    } else {
        using Store = ContentAddressedCachedTreeStore<T>;
        using Tree = ContentAddressedIndexedTree<Store, aztec::MerkleHashPolicyForT<T>>;
 
        auto& wrapper = std::get<TreeWithStore<Tree>>(fork->_trees.at(id));
        if (rev.is_historical()) {
            wrapper.tree->find_leaf_sibling_paths(leaves, rev.blockNumber, rev.includeUncommitted, callback);
        } else {
            wrapper.tree->find_leaf_sibling_paths(leaves, rev.includeUncommitted, callback);
        }
    }
 
    signal.wait_for_level(0);
 
    if (!local.success || local.inner.leaf_paths.size() != leaves.size()) {
        throw std::runtime_error(local.message);
    }
 
    paths = std::move(local.inner.leaf_paths);
}
 
template <typename T> void WorldState::append_leaves(MerkleTreeId id, const std::vector<T>& leaves, Fork::Id fork_id)
{
    using namespace crypto::merkle_tree;
 
    Fork::SharedPtr fork = retrieve_fork(fork_id);
 
    Signal signal;
 
    bool success = true;
    std::string error_msg;
 
    if constexpr (std::is_same_v<bb::fr, T>) {
        auto& wrapper = std::get<TreeWithStore<FrTree>>(fork->_trees.at(id));
        auto callback = [&](const auto& resp) {
            if (!resp.success) {
                success = false;
                error_msg = resp.message;
            }
            signal.signal_level(0);
        };
        wrapper.tree->add_values(leaves, callback);
    } else {
        using Store = ContentAddressedCachedTreeStore<T>;
        using Tree = ContentAddressedIndexedTree<Store, aztec::MerkleHashPolicyForT<T>>;
        auto& wrapper = std::get<TreeWithStore<Tree>>(fork->_trees.at(id));
        typename Tree::AddCompletionCallback callback = [&](const auto& resp) {
            if (!resp.success) {
                success = false;
                error_msg = resp.message;
            }
            signal.signal_level(0);
        };
        wrapper.tree->add_or_update_values(leaves, 0, callback);
    }
 
    signal.wait_for_level(0);
 
    if (!success) {
        throw std::runtime_error(error_msg);
    }
}
 
template <typename T>
BatchInsertionResult<T> WorldState::batch_insert_indexed_leaves(MerkleTreeId id,
                                                                const std::vector<T>& leaves,
                                                                uint32_t subtree_depth,
                                                                Fork::Id fork_id)
{
    using namespace crypto::merkle_tree;
    using Store = ContentAddressedCachedTreeStore<T>;
    using Tree = ContentAddressedIndexedTree<Store, aztec::MerkleHashPolicyForT<T>>;
 
    Fork::SharedPtr fork = retrieve_fork(fork_id);
 
    Signal signal;
    BatchInsertionResult<T> result;
    const auto& wrapper = std::get<TreeWithStore<Tree>>(fork->_trees.at(id));
    bool success = true;
    std::string error_msg;
 
    wrapper.tree->add_or_update_values(
        leaves, subtree_depth, [&](const TypedResponse<AddIndexedDataResponse<T>>& response) {
            if (response.success) {
                result.low_leaf_witness_data = *response.inner.low_leaf_witness_data;
                result.sorted_leaves = *response.inner.sorted_leaves;
                result.subtree_path = response.inner.subtree_path;
            } else {
                success = false;
                error_msg = response.message;
            }
 
            signal.signal_level(0);
        });
 
    signal.wait_for_level();
 
    if (!success) {
        throw std::runtime_error(error_msg);
    }
 
    return result;
}
 
template <typename T>
SequentialInsertionResult<T> WorldState::insert_indexed_leaves(MerkleTreeId id,
                                                               const std::vector<T>& leaves,
                                                               Fork::Id fork_id)
{
    using namespace crypto::merkle_tree;
    using Store = ContentAddressedCachedTreeStore<T>;
    using Tree = ContentAddressedIndexedTree<Store, aztec::MerkleHashPolicyForT<T>>;
 
    Fork::SharedPtr fork = retrieve_fork(fork_id);
 
    Signal signal;
    SequentialInsertionResult<T> result;
    const auto& wrapper = std::get<TreeWithStore<Tree>>(fork->_trees.at(id));
    bool success = true;
    std::string error_msg;
 
    wrapper.tree->add_or_update_values_sequentially(
        leaves, [&](const TypedResponse<AddIndexedDataSequentiallyResponse<T>>& response) {
            if (response.success) {
                result.low_leaf_witness_data = *response.inner.low_leaf_witness_data;
                result.insertion_witness_data = *response.inner.insertion_witness_data;
            } else {
                success = false;
                error_msg = response.message;
            }
 
            signal.signal_level(0);
        });
 
    signal.wait_for_level();
 
    if (!success) {
        throw std::runtime_error(error_msg);
    }
 
    return result;
}
} // namespace bb::world_state
 
MSGPACK_ADD_ENUM(bb::world_state::MerkleTreeId)