nullifier_leaf.hpp

#pragma once
#include "barretenberg/crypto/pedersen_commitment/pedersen.hpp"
#include "barretenberg/serialize/msgpack.hpp"
 
namespace proof_system::plonk {
namespace stdlib {
namespace merkle_tree {
 
using namespace barretenberg;
typedef uint256_t index_t;
 
struct nullifier_leaf {
    fr value;
    index_t nextIndex;
    fr nextValue;
 
    // For serialization, update with any new fields
    MSGPACK_FIELDS(value, nextIndex, nextValue);
    bool operator==(nullifier_leaf const&) const = default;
 
    std::ostream& operator<<(std::ostream& os)
    {
        os << "value = " << value << "\nnextIdx = " << nextIndex << "\nnextVal = " << nextValue;
        return os;
    }
 
    barretenberg::fr hash() const { return stdlib::merkle_tree::hash_native({ value, nextIndex, nextValue }); }
};
 
class WrappedNullifierLeaf {
 
  public:
    // Initialize with a nullifier leaf
    WrappedNullifierLeaf(nullifier_leaf value)
        : data(value)
    {}
    // Initialize an empty leaf
    WrappedNullifierLeaf()
        : data(std::nullopt)
    {}
 
    bool operator==(WrappedNullifierLeaf const&) const = default;
 
    bool has_value() const { return data.has_value(); }
 
    nullifier_leaf unwrap() const { return data.value(); }
 
    void set(nullifier_leaf value) { data.emplace(value); }
 
    barretenberg::fr hash() const { return data.has_value() ? data.value().hash() : barretenberg::fr::zero(); }
 
    static WrappedNullifierLeaf zero() { return WrappedNullifierLeaf(); }
 
  private:
    // Underlying data
    std::optional<nullifier_leaf> data;
};
 
inline std::pair<size_t, bool> find_closest_leaf(std::vector<WrappedNullifierLeaf> const& leaves_, fr const& new_value)
{
    std::vector<uint256_t> diff;
    bool repeated = false;
    auto new_value_ = uint256_t(new_value);
 
    for (size_t i = 0; i < leaves_.size(); i++) {
 
        if (!leaves_[i].has_value()) {
            diff.push_back(new_value_);
            continue;
        }
 
        auto leaf_value_ = uint256_t(leaves_[i].unwrap().value);
        if (leaf_value_ > new_value_) {
            diff.push_back(leaf_value_);
        } else if (leaf_value_ == new_value_) {
            repeated = true;
            return std::make_pair(i, repeated);
        } else {
            diff.push_back(new_value_ - leaf_value_);
        }
    }
    auto it = std::min_element(diff.begin(), diff.end());
    return std::make_pair(static_cast<size_t>(it - diff.begin()), repeated);
}
 
} // namespace merkle_tree
} // namespace stdlib
} // namespace proof_system::plonk