mirror of
https://github.com/monero-project/monero.git
synced 2024-10-01 11:49:47 -04:00
Store points in the tree in compressed encoding (32 bytes)
This commit is contained in:
parent
95114f9253
commit
34eafa85f3
@ -216,6 +216,7 @@ namespace
|
|||||||
*
|
*
|
||||||
* spent_keys input hash -
|
* spent_keys input hash -
|
||||||
*
|
*
|
||||||
|
* TODO: don't store leaf tuples, store reference to outputs
|
||||||
* locked_leaves block ID [{output ID, leaf tuple}...]
|
* locked_leaves block ID [{output ID, leaf tuple}...]
|
||||||
* leaves leaf_idx {leaf tuple}
|
* leaves leaf_idx {leaf tuple}
|
||||||
* layers layer_idx [{child_chunk_idx, child_chunk_hash}...]
|
* layers layer_idx [{child_chunk_idx, child_chunk_hash}...]
|
||||||
@ -392,11 +393,9 @@ typedef struct outtx {
|
|||||||
uint64_t local_index;
|
uint64_t local_index;
|
||||||
} outtx;
|
} outtx;
|
||||||
|
|
||||||
template<typename C>
|
|
||||||
struct layer_val {
|
struct layer_val {
|
||||||
uint64_t child_chunk_idx;
|
uint64_t child_chunk_idx;
|
||||||
// TODO: use compressed 32 byte point; also need a from_bytes implemented on rust side
|
std::array<uint8_t, 32UL> child_chunk_hash;
|
||||||
typename C::Point child_chunk_hash;
|
|
||||||
};
|
};
|
||||||
|
|
||||||
std::atomic<uint64_t> mdb_txn_safe::num_active_txns{0};
|
std::atomic<uint64_t> mdb_txn_safe::num_active_txns{0};
|
||||||
@ -1471,9 +1470,9 @@ void BlockchainLMDB::grow_layer(const C &curve,
|
|||||||
if (ext.update_existing_last_hash)
|
if (ext.update_existing_last_hash)
|
||||||
{
|
{
|
||||||
// We updated the last hash, so update it
|
// We updated the last hash, so update it
|
||||||
layer_val<C> lv;
|
layer_val lv;
|
||||||
lv.child_chunk_idx = ext.start_idx;
|
lv.child_chunk_idx = ext.start_idx;
|
||||||
lv.child_chunk_hash = ext.hashes.front();
|
lv.child_chunk_hash = curve.to_bytes(ext.hashes.front());
|
||||||
MDB_val_set(v, lv);
|
MDB_val_set(v, lv);
|
||||||
|
|
||||||
// We expect to overwrite the existing hash
|
// We expect to overwrite the existing hash
|
||||||
@ -1486,9 +1485,9 @@ void BlockchainLMDB::grow_layer(const C &curve,
|
|||||||
// Now add all the new hashes found in the extension
|
// Now add all the new hashes found in the extension
|
||||||
for (uint64_t i = ext.update_existing_last_hash ? 1 : 0; i < ext.hashes.size(); ++i)
|
for (uint64_t i = ext.update_existing_last_hash ? 1 : 0; i < ext.hashes.size(); ++i)
|
||||||
{
|
{
|
||||||
layer_val<C> lv;
|
layer_val lv;
|
||||||
lv.child_chunk_idx = i + ext.start_idx;
|
lv.child_chunk_idx = i + ext.start_idx;
|
||||||
lv.child_chunk_hash = ext.hashes[i];
|
lv.child_chunk_hash = curve.to_bytes(ext.hashes[i]);
|
||||||
MDB_val_set(v, lv);
|
MDB_val_set(v, lv);
|
||||||
|
|
||||||
// TODO: according to the docs, MDB_APPENDDUP isn't supposed to perform any key comparisons to maximize efficiency.
|
// TODO: according to the docs, MDB_APPENDDUP isn't supposed to perform any key comparisons to maximize efficiency.
|
||||||
@ -1570,14 +1569,14 @@ void BlockchainLMDB::trim_tree(const uint64_t trim_n_leaf_tuples)
|
|||||||
{
|
{
|
||||||
CHECK_AND_ASSERT_THROW_MES(c2_idx < c2_layer_reductions.size(), "unexpected c2 layer reduction");
|
CHECK_AND_ASSERT_THROW_MES(c2_idx < c2_layer_reductions.size(), "unexpected c2 layer reduction");
|
||||||
const auto &c2_reduction = c2_layer_reductions[c2_idx];
|
const auto &c2_reduction = c2_layer_reductions[c2_idx];
|
||||||
trim_layer(c2_reduction, i);
|
this->trim_layer(m_curve_trees->m_c2, c2_reduction, i);
|
||||||
++c2_idx;
|
++c2_idx;
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
CHECK_AND_ASSERT_THROW_MES(c1_idx < c1_layer_reductions.size(), "unexpected c1 layer reduction");
|
CHECK_AND_ASSERT_THROW_MES(c1_idx < c1_layer_reductions.size(), "unexpected c1 layer reduction");
|
||||||
const auto &c1_reduction = c1_layer_reductions[c1_idx];
|
const auto &c1_reduction = c1_layer_reductions[c1_idx];
|
||||||
trim_layer(c1_reduction, i);
|
this->trim_layer(m_curve_trees->m_c1, c1_reduction, i);
|
||||||
++c1_idx;
|
++c1_idx;
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -1614,7 +1613,8 @@ void BlockchainLMDB::trim_tree(const uint64_t trim_n_leaf_tuples)
|
|||||||
}
|
}
|
||||||
|
|
||||||
template<typename C>
|
template<typename C>
|
||||||
void BlockchainLMDB::trim_layer(const fcmp::curve_trees::LayerReduction<C> &layer_reduction,
|
void BlockchainLMDB::trim_layer(const C &curve,
|
||||||
|
const fcmp::curve_trees::LayerReduction<C> &layer_reduction,
|
||||||
const uint64_t layer_idx)
|
const uint64_t layer_idx)
|
||||||
{
|
{
|
||||||
LOG_PRINT_L3("BlockchainLMDB::" << __func__);
|
LOG_PRINT_L3("BlockchainLMDB::" << __func__);
|
||||||
@ -1639,7 +1639,7 @@ void BlockchainLMDB::trim_layer(const fcmp::curve_trees::LayerReduction<C> &laye
|
|||||||
if (result != MDB_SUCCESS)
|
if (result != MDB_SUCCESS)
|
||||||
throw0(DB_ERROR(lmdb_error("Failed to get last elem: ", result).c_str()));
|
throw0(DB_ERROR(lmdb_error("Failed to get last elem: ", result).c_str()));
|
||||||
|
|
||||||
const auto *lv = (layer_val<C> *)v.mv_data;
|
const auto *lv = (layer_val *)v.mv_data;
|
||||||
old_n_elems_in_layer = (1 + lv->child_chunk_idx);
|
old_n_elems_in_layer = (1 + lv->child_chunk_idx);
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -1669,9 +1669,9 @@ void BlockchainLMDB::trim_layer(const fcmp::curve_trees::LayerReduction<C> &laye
|
|||||||
// Update the last element if needed
|
// Update the last element if needed
|
||||||
if (layer_reduction.update_existing_last_hash)
|
if (layer_reduction.update_existing_last_hash)
|
||||||
{
|
{
|
||||||
layer_val<C> lv;
|
layer_val lv;
|
||||||
lv.child_chunk_idx = layer_reduction.new_total_parents - 1;
|
lv.child_chunk_idx = layer_reduction.new_total_parents - 1;
|
||||||
lv.child_chunk_hash = layer_reduction.new_last_hash;
|
lv.child_chunk_hash = curve.to_bytes(layer_reduction.new_last_hash);
|
||||||
MDB_val_set(v, lv);
|
MDB_val_set(v, lv);
|
||||||
|
|
||||||
// We expect to overwrite the existing hash
|
// We expect to overwrite the existing hash
|
||||||
@ -1724,17 +1724,8 @@ std::array<uint8_t, 32UL> BlockchainLMDB::get_tree_root() const
|
|||||||
int result = mdb_cursor_get(m_cur_layers, &k, &v, MDB_LAST);
|
int result = mdb_cursor_get(m_cur_layers, &k, &v, MDB_LAST);
|
||||||
if (result == MDB_SUCCESS)
|
if (result == MDB_SUCCESS)
|
||||||
{
|
{
|
||||||
const uint64_t layer_idx = *(uint64_t*)k.mv_data;
|
auto *lv = (layer_val *)v.mv_data;
|
||||||
if ((layer_idx % 2) == 0)
|
root = std::move(lv->child_chunk_hash);
|
||||||
{
|
|
||||||
const auto *lv = (layer_val<fcmp::curve_trees::Selene> *)v.mv_data;
|
|
||||||
root = m_curve_trees->m_c2.to_bytes(lv->child_chunk_hash);
|
|
||||||
}
|
|
||||||
else
|
|
||||||
{
|
|
||||||
const auto *lv = (layer_val<fcmp::curve_trees::Helios> *)v.mv_data;
|
|
||||||
root = m_curve_trees->m_c1.to_bytes(lv->child_chunk_hash);
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
else if (result != MDB_NOTFOUND)
|
else if (result != MDB_NOTFOUND)
|
||||||
throw0(DB_ERROR(lmdb_error("Failed to get last leaf: ", result).c_str()));
|
throw0(DB_ERROR(lmdb_error("Failed to get last leaf: ", result).c_str()));
|
||||||
@ -1776,18 +1767,19 @@ fcmp::curve_trees::CurveTreesV1::LastHashes BlockchainLMDB::get_tree_last_hashes
|
|||||||
if (result != MDB_SUCCESS)
|
if (result != MDB_SUCCESS)
|
||||||
throw0(DB_ERROR(lmdb_error("Failed to get last record in layer: ", result).c_str()));
|
throw0(DB_ERROR(lmdb_error("Failed to get last record in layer: ", result).c_str()));
|
||||||
|
|
||||||
|
const auto *lv = (layer_val *)v.mv_data;
|
||||||
|
MDEBUG("Reading last hash at layer_idx: " << layer_idx << " , lv->child_chunk_idx: " << lv->child_chunk_idx);
|
||||||
|
|
||||||
const bool use_c2 = (layer_idx % 2) == 0;
|
const bool use_c2 = (layer_idx % 2) == 0;
|
||||||
if (use_c2)
|
if (use_c2)
|
||||||
{
|
{
|
||||||
const auto *lv = (layer_val<fcmp::curve_trees::Selene> *)v.mv_data;
|
auto point = m_curve_trees->m_c2.from_bytes(lv->child_chunk_hash);
|
||||||
MDEBUG("Selene, layer_idx: " << layer_idx << " , lv->child_chunk_idx: " << lv->child_chunk_idx);
|
c2_last_hashes.emplace_back(std::move(point));
|
||||||
c2_last_hashes.emplace_back(std::move(lv->child_chunk_hash));
|
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
const auto *lv = (layer_val<fcmp::curve_trees::Helios> *)v.mv_data;
|
auto point = m_curve_trees->m_c1.from_bytes(lv->child_chunk_hash);
|
||||||
MDEBUG("Helios, layer_idx: " << layer_idx << " , lv->child_chunk_idx: " << lv->child_chunk_idx);
|
c1_last_hashes.emplace_back(std::move(point));
|
||||||
c1_last_hashes.emplace_back(std::move(lv->child_chunk_hash));
|
|
||||||
}
|
}
|
||||||
|
|
||||||
++layer_idx;
|
++layer_idx;
|
||||||
@ -1884,16 +1876,17 @@ fcmp::curve_trees::CurveTreesV1::LastChunkChildrenToTrim BlockchainLMDB::get_las
|
|||||||
if (result != MDB_SUCCESS)
|
if (result != MDB_SUCCESS)
|
||||||
throw0(DB_ERROR(lmdb_error("Failed to get layer elem: ", result).c_str()));
|
throw0(DB_ERROR(lmdb_error("Failed to get layer elem: ", result).c_str()));
|
||||||
|
|
||||||
|
const auto *lv = (layer_val *)v.mv_data;
|
||||||
if (parent_is_c1)
|
if (parent_is_c1)
|
||||||
{
|
{
|
||||||
const auto *lv = (layer_val<fcmp::curve_trees::Selene> *)v.mv_data;
|
const auto point = m_curve_trees->m_c2.from_bytes(lv->child_chunk_hash);
|
||||||
auto child_scalar = m_curve_trees->m_c2.point_to_cycle_scalar(lv->child_chunk_hash);
|
auto child_scalar = m_curve_trees->m_c2.point_to_cycle_scalar(point);
|
||||||
c1_children.emplace_back(std::move(child_scalar));
|
c1_children.emplace_back(std::move(child_scalar));
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
const auto *lv = (layer_val<fcmp::curve_trees::Helios> *)v.mv_data;
|
const auto point = m_curve_trees->m_c1.from_bytes(lv->child_chunk_hash);
|
||||||
auto child_scalar = m_curve_trees->m_c1.point_to_cycle_scalar(lv->child_chunk_hash);
|
auto child_scalar = m_curve_trees->m_c1.point_to_cycle_scalar(point);
|
||||||
c2_children.emplace_back(std::move(child_scalar));
|
c2_children.emplace_back(std::move(child_scalar));
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -1941,15 +1934,16 @@ fcmp::curve_trees::CurveTreesV1::LastHashes BlockchainLMDB::get_last_hashes_to_t
|
|||||||
if (result != MDB_SUCCESS)
|
if (result != MDB_SUCCESS)
|
||||||
throw0(DB_ERROR(lmdb_error("Failed to get layer elem: ", result).c_str()));
|
throw0(DB_ERROR(lmdb_error("Failed to get layer elem: ", result).c_str()));
|
||||||
|
|
||||||
|
const auto *lv = (layer_val *)v.mv_data;
|
||||||
if ((layer_idx % 2) == 0)
|
if ((layer_idx % 2) == 0)
|
||||||
{
|
{
|
||||||
const auto *lv = (layer_val<fcmp::curve_trees::Selene> *)v.mv_data;
|
auto point = m_curve_trees->m_c2.from_bytes(lv->child_chunk_hash);
|
||||||
last_hashes_out.c2_last_hashes.push_back(lv->child_chunk_hash);
|
last_hashes_out.c2_last_hashes.emplace_back(std::move(point));
|
||||||
}
|
}
|
||||||
else
|
else
|
||||||
{
|
{
|
||||||
const auto *lv = (layer_val<fcmp::curve_trees::Helios> *)v.mv_data;
|
auto point = m_curve_trees->m_c1.from_bytes(lv->child_chunk_hash);
|
||||||
last_hashes_out.c1_last_hashes.push_back(lv->child_chunk_hash);
|
last_hashes_out.c1_last_hashes.emplace_back(std::move(point));
|
||||||
}
|
}
|
||||||
|
|
||||||
++layer_idx;
|
++layer_idx;
|
||||||
@ -2050,11 +2044,11 @@ bool BlockchainLMDB::audit_tree(const uint64_t expected_n_leaf_tuples) const
|
|||||||
<< m_curve_trees->m_c2.to_string(m_curve_trees->m_c2.m_hash_init_point) << " (" << leaves.size() << " leaves)");
|
<< m_curve_trees->m_c2.to_string(m_curve_trees->m_c2.m_hash_init_point) << " (" << leaves.size() << " leaves)");
|
||||||
|
|
||||||
// Now compare to value from the db
|
// Now compare to value from the db
|
||||||
const auto *lv = (layer_val<fcmp::curve_trees::Selene> *)v_parent.mv_data;
|
const auto *lv = (layer_val *)v_parent.mv_data;
|
||||||
MDEBUG("Actual leaf chunk hash " << m_curve_trees->m_c2.to_string(lv->child_chunk_hash));
|
MDEBUG("Actual leaf chunk hash " << epee::string_tools::pod_to_hex(lv->child_chunk_hash));
|
||||||
|
|
||||||
const auto expected_bytes = m_curve_trees->m_c2.to_bytes(chunk_hash);
|
const auto expected_bytes = m_curve_trees->m_c2.to_bytes(chunk_hash);
|
||||||
const auto actual_bytes = m_curve_trees->m_c2.to_bytes(lv->child_chunk_hash);
|
const auto actual_bytes = lv->child_chunk_hash;
|
||||||
CHECK_AND_ASSERT_MES(expected_bytes == actual_bytes, false, "unexpected leaf chunk hash");
|
CHECK_AND_ASSERT_MES(expected_bytes == actual_bytes, false, "unexpected leaf chunk hash");
|
||||||
|
|
||||||
++child_chunk_idx;
|
++child_chunk_idx;
|
||||||
@ -2133,8 +2127,10 @@ bool BlockchainLMDB::audit_layer(const C_CHILD &c_child,
|
|||||||
if (result != MDB_SUCCESS)
|
if (result != MDB_SUCCESS)
|
||||||
throw0(DB_ERROR(lmdb_error("Failed to get child: ", result).c_str()));
|
throw0(DB_ERROR(lmdb_error("Failed to get child: ", result).c_str()));
|
||||||
|
|
||||||
const auto *child = (layer_val<C_CHILD>*)v_child.mv_data;
|
const auto *lv = (layer_val *)v_child.mv_data;
|
||||||
child_chunk.push_back(child->child_chunk_hash);
|
auto child_point = c_child.from_bytes(lv->child_chunk_hash);
|
||||||
|
|
||||||
|
child_chunk.emplace_back(std::move(child_point));
|
||||||
|
|
||||||
if (child_chunk.size() == chunk_width)
|
if (child_chunk.size() == chunk_width)
|
||||||
break;
|
break;
|
||||||
@ -2192,10 +2188,10 @@ bool BlockchainLMDB::audit_layer(const C_CHILD &c_child,
|
|||||||
MDEBUG("chunk_hash " << c_parent.to_string(chunk_hash) << " , hash init point: "
|
MDEBUG("chunk_hash " << c_parent.to_string(chunk_hash) << " , hash init point: "
|
||||||
<< c_parent.to_string(c_parent.m_hash_init_point) << " (" << child_scalars.size() << " children)");
|
<< c_parent.to_string(c_parent.m_hash_init_point) << " (" << child_scalars.size() << " children)");
|
||||||
|
|
||||||
const auto *lv = (layer_val<C_PARENT> *)v_parent.mv_data;
|
const auto *lv = (layer_val *)v_parent.mv_data;
|
||||||
MDEBUG("Actual chunk hash " << c_parent.to_string(lv->child_chunk_hash));
|
MDEBUG("Actual chunk hash " << epee::string_tools::pod_to_hex(lv->child_chunk_hash));
|
||||||
|
|
||||||
const auto actual_bytes = c_parent.to_bytes(lv->child_chunk_hash);
|
const auto actual_bytes = lv->child_chunk_hash;
|
||||||
const auto expected_bytes = c_parent.to_bytes(chunk_hash);
|
const auto expected_bytes = c_parent.to_bytes(chunk_hash);
|
||||||
if (actual_bytes != expected_bytes)
|
if (actual_bytes != expected_bytes)
|
||||||
throw0(DB_ERROR(("unexpected hash at child_chunk_idx " + std::to_string(child_chunk_idx)).c_str()));
|
throw0(DB_ERROR(("unexpected hash at child_chunk_idx " + std::to_string(child_chunk_idx)).c_str()));
|
||||||
|
@ -425,7 +425,9 @@ private:
|
|||||||
const uint64_t layer_idx);
|
const uint64_t layer_idx);
|
||||||
|
|
||||||
template<typename C>
|
template<typename C>
|
||||||
void trim_layer(const fcmp::curve_trees::LayerReduction<C> &layer_reduction, const uint64_t layer_idx);
|
void trim_layer(const C &curve,
|
||||||
|
const fcmp::curve_trees::LayerReduction<C> &layer_reduction,
|
||||||
|
const uint64_t layer_idx);
|
||||||
|
|
||||||
uint64_t get_num_leaf_tuples() const;
|
uint64_t get_num_leaf_tuples() const;
|
||||||
|
|
||||||
|
@ -913,7 +913,6 @@ typename CurveTrees<C1, C2>::TreeReduction CurveTrees<C1, C2>::get_tree_reductio
|
|||||||
++c1_idx;
|
++c1_idx;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
use_c2 = !use_c2;
|
use_c2 = !use_c2;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -37,7 +37,6 @@
|
|||||||
#include <vector>
|
#include <vector>
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
namespace fcmp
|
namespace fcmp
|
||||||
{
|
{
|
||||||
namespace curve_trees
|
namespace curve_trees
|
||||||
|
@ -100,6 +100,10 @@ uint8_t *helios_point_to_bytes(HeliosPoint helios_point);
|
|||||||
|
|
||||||
uint8_t *selene_point_to_bytes(SelenePoint selene_point);
|
uint8_t *selene_point_to_bytes(SelenePoint selene_point);
|
||||||
|
|
||||||
|
HeliosPoint helios_point_from_bytes(const uint8_t *helios_point_bytes);
|
||||||
|
|
||||||
|
SelenePoint selene_point_from_bytes(const uint8_t *selene_point_bytes);
|
||||||
|
|
||||||
SeleneScalar ed25519_point_to_selene_scalar(const uint8_t *ed25519_point);
|
SeleneScalar ed25519_point_to_selene_scalar(const uint8_t *ed25519_point);
|
||||||
|
|
||||||
HeliosScalar selene_point_to_helios_scalar(SelenePoint selene_point);
|
HeliosScalar selene_point_to_helios_scalar(SelenePoint selene_point);
|
||||||
|
@ -187,6 +187,16 @@ std::array<uint8_t, 32UL> Selene::to_bytes(const Selene::Point &point) const
|
|||||||
return res;
|
return res;
|
||||||
}
|
}
|
||||||
//----------------------------------------------------------------------------------------------------------------------
|
//----------------------------------------------------------------------------------------------------------------------
|
||||||
|
Helios::Point Helios::from_bytes(const std::array<uint8_t, 32UL> &bytes) const
|
||||||
|
{
|
||||||
|
return fcmp_rust::helios_point_from_bytes(bytes.data());
|
||||||
|
}
|
||||||
|
//----------------------------------------------------------------------------------------------------------------------
|
||||||
|
Selene::Point Selene::from_bytes(const std::array<uint8_t, 32UL> &bytes) const
|
||||||
|
{
|
||||||
|
return fcmp_rust::selene_point_from_bytes(bytes.data());
|
||||||
|
}
|
||||||
|
//----------------------------------------------------------------------------------------------------------------------
|
||||||
std::string Helios::to_string(const typename Helios::Scalar &scalar) const
|
std::string Helios::to_string(const typename Helios::Scalar &scalar) const
|
||||||
{
|
{
|
||||||
return epee::string_tools::pod_to_hex(this->to_bytes(scalar));
|
return epee::string_tools::pod_to_hex(this->to_bytes(scalar));
|
||||||
|
@ -94,6 +94,8 @@ public:
|
|||||||
virtual std::array<uint8_t, 32UL> to_bytes(const typename C::Scalar &scalar) const = 0;
|
virtual std::array<uint8_t, 32UL> to_bytes(const typename C::Scalar &scalar) const = 0;
|
||||||
virtual std::array<uint8_t, 32UL> to_bytes(const typename C::Point &point) const = 0;
|
virtual std::array<uint8_t, 32UL> to_bytes(const typename C::Point &point) const = 0;
|
||||||
|
|
||||||
|
virtual typename C::Point from_bytes(const std::array<uint8_t, 32UL> &bytes) const = 0;
|
||||||
|
|
||||||
virtual std::string to_string(const typename C::Scalar &scalar) const = 0;
|
virtual std::string to_string(const typename C::Scalar &scalar) const = 0;
|
||||||
virtual std::string to_string(const typename C::Point &point) const = 0;
|
virtual std::string to_string(const typename C::Point &point) const = 0;
|
||||||
|
|
||||||
@ -139,6 +141,8 @@ public:
|
|||||||
std::array<uint8_t, 32UL> to_bytes(const Scalar &scalar) const override;
|
std::array<uint8_t, 32UL> to_bytes(const Scalar &scalar) const override;
|
||||||
std::array<uint8_t, 32UL> to_bytes(const Point &point) const override;
|
std::array<uint8_t, 32UL> to_bytes(const Point &point) const override;
|
||||||
|
|
||||||
|
Point from_bytes(const std::array<uint8_t, 32UL> &bytes) const override;
|
||||||
|
|
||||||
std::string to_string(const Scalar &scalar) const override;
|
std::string to_string(const Scalar &scalar) const override;
|
||||||
std::string to_string(const Point &point) const override;
|
std::string to_string(const Point &point) const override;
|
||||||
};
|
};
|
||||||
@ -179,6 +183,8 @@ public:
|
|||||||
std::array<uint8_t, 32UL> to_bytes(const Scalar &scalar) const override;
|
std::array<uint8_t, 32UL> to_bytes(const Scalar &scalar) const override;
|
||||||
std::array<uint8_t, 32UL> to_bytes(const Point &point) const override;
|
std::array<uint8_t, 32UL> to_bytes(const Point &point) const override;
|
||||||
|
|
||||||
|
Point from_bytes(const std::array<uint8_t, 32UL> &bytes) const override;
|
||||||
|
|
||||||
std::string to_string(const Scalar &scalar) const override;
|
std::string to_string(const Scalar &scalar) const override;
|
||||||
std::string to_string(const Point &point) const override;
|
std::string to_string(const Point &point) const override;
|
||||||
};
|
};
|
||||||
|
Loading…
Reference in New Issue
Block a user