2019-04-12 06:36:43 +02:00
|
|
|
// Copyright (c) 2014-2019, The Monero Project
|
2014-07-23 15:03:52 +02:00
|
|
|
//
|
|
|
|
|
// All rights reserved.
|
|
|
|
|
//
|
|
|
|
|
// Redistribution and use in source and binary forms, with or without modification, are
|
|
|
|
|
// permitted provided that the following conditions are met:
|
|
|
|
|
//
|
|
|
|
|
// 1. Redistributions of source code must retain the above copyright notice, this list of
|
|
|
|
|
// conditions and the following disclaimer.
|
|
|
|
|
//
|
|
|
|
|
// 2. Redistributions in binary form must reproduce the above copyright notice, this list
|
|
|
|
|
// of conditions and the following disclaimer in the documentation and/or other
|
|
|
|
|
// materials provided with the distribution.
|
|
|
|
|
//
|
|
|
|
|
// 3. Neither the name of the copyright holder nor the names of its contributors may be
|
|
|
|
|
// used to endorse or promote products derived from this software without specific
|
|
|
|
|
// prior written permission.
|
|
|
|
|
//
|
|
|
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
|
|
|
|
|
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
|
|
|
// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
|
|
|
|
|
// THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
|
|
|
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
|
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
|
|
|
// STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
|
|
|
|
|
// THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
//
|
|
|
|
|
// Parts of this file are originally copyright (c) 2012-2013 The Cryptonote developers
|
2014-03-03 23:07:58 +01:00
|
|
|
|
|
|
|
|
#pragma once
|
2017-11-25 23:25:05 +01:00
|
|
|
#include "blobdatatype.h"
|
2017-01-26 16:07:23 +01:00
|
|
|
#include "cryptonote_basic_impl.h"
|
2018-08-03 12:21:08 +02:00
|
|
|
#include "tx_extra.h"
|
2014-03-03 23:07:58 +01:00
|
|
|
#include "account.h"
|
2017-02-19 03:42:10 +01:00
|
|
|
#include "subaddress_index.h"
|
2014-03-03 23:07:58 +01:00
|
|
|
#include "include_base_utils.h"
|
|
|
|
|
#include "crypto/crypto.h"
|
|
|
|
|
#include "crypto/hash.h"
|
2017-02-19 03:42:10 +01:00
|
|
|
#include <unordered_map>
|
2014-03-03 23:07:58 +01:00
|
|
|
|
2017-11-25 15:50:15 +01:00
|
|
|
namespace epee
|
|
|
|
|
{
|
|
|
|
|
class wipeable_string;
|
|
|
|
|
}
|
|
|
|
|
|
2019-05-31 03:06:42 +02:00
|
|
|
namespace service_nodes { struct quorum_vote_t; }
|
2018-08-15 03:47:45 +02:00
|
|
|
|
2014-03-03 23:07:58 +01:00
|
|
|
namespace cryptonote
|
|
|
|
|
{
|
2018-08-15 03:47:45 +02:00
|
|
|
struct tx_verification_context;
|
|
|
|
|
struct vote_verification_context;
|
2014-03-03 23:07:58 +01:00
|
|
|
//---------------------------------------------------------------
|
|
|
|
|
void get_transaction_prefix_hash(const transaction_prefix& tx, crypto::hash& h);
|
|
|
|
|
crypto::hash get_transaction_prefix_hash(const transaction_prefix& tx);
|
2018-09-16 20:30:39 +02:00
|
|
|
bool parse_and_validate_tx_prefix_from_blob(const blobdata& tx_blob, transaction_prefix& tx);
|
2014-03-03 23:07:58 +01:00
|
|
|
bool parse_and_validate_tx_from_blob(const blobdata& tx_blob, transaction& tx, crypto::hash& tx_hash, crypto::hash& tx_prefix_hash);
|
2018-11-13 00:22:20 +01:00
|
|
|
bool parse_and_validate_tx_from_blob(const blobdata& tx_blob, transaction& tx, crypto::hash& tx_hash);
|
2014-04-02 18:00:17 +02:00
|
|
|
bool parse_and_validate_tx_from_blob(const blobdata& tx_blob, transaction& tx);
|
2017-02-27 21:24:39 +01:00
|
|
|
bool parse_and_validate_tx_base_from_blob(const blobdata& tx_blob, transaction& tx);
|
Pruning
The blockchain prunes seven eighths of prunable tx data.
This saves about two thirds of the blockchain size, while
keeping the node useful as a sync source for an eighth
of the blockchain.
No other data is currently pruned.
There are three ways to prune a blockchain:
- run monerod with --prune-blockchain
- run "prune_blockchain" in the monerod console
- run the monero-blockchain-prune utility
The first two will prune in place. Due to how LMDB works, this
will not reduce the blockchain size on disk. Instead, it will
mark parts of the file as free, so that future data will use
that free space, causing the file to not grow until free space
grows scarce.
The third way will create a second database, a pruned copy of
the original one. Since this is a new file, this one will be
smaller than the original one.
Once the database is pruned, it will stay pruned as it syncs.
That is, there is no need to use --prune-blockchain again, etc.
2018-04-30 00:30:51 +02:00
|
|
|
bool is_v1_tx(const blobdata_ref& tx_blob);
|
|
|
|
|
bool is_v1_tx(const blobdata& tx_blob);
|
2014-03-03 23:07:58 +01:00
|
|
|
|
2019-06-13 02:58:42 +02:00
|
|
|
// skip_fields: How many fields of type <T> to skip
|
2014-05-03 18:19:43 +02:00
|
|
|
template<typename T>
|
2019-06-13 02:58:42 +02:00
|
|
|
bool find_tx_extra_field_by_type(const std::vector<tx_extra_field>& tx_extra_fields, T& field, size_t skip_fields = 0)
|
2014-05-03 18:19:43 +02:00
|
|
|
{
|
2019-06-13 02:58:42 +02:00
|
|
|
if (skip_fields >= tx_extra_fields.size())
|
2014-05-03 18:19:43 +02:00
|
|
|
return false;
|
|
|
|
|
|
2019-06-13 02:58:42 +02:00
|
|
|
for (tx_extra_field const &check_field : tx_extra_fields)
|
|
|
|
|
{
|
|
|
|
|
if (typeid(T) != check_field.type()) continue;
|
|
|
|
|
|
|
|
|
|
if (skip_fields == 0)
|
|
|
|
|
{
|
|
|
|
|
field = boost::get<T>(check_field);
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
skip_fields--;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return false;
|
2014-05-03 18:19:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool parse_tx_extra(const std::vector<uint8_t>& tx_extra, std::vector<tx_extra_field>& tx_extra_fields);
|
2018-08-03 12:21:08 +02:00
|
|
|
bool sort_tx_extra(const std::vector<uint8_t>& tx_extra, std::vector<uint8_t> &sorted_tx_extra, bool allow_partial = false);
|
2016-12-09 19:21:21 +01:00
|
|
|
crypto::public_key get_tx_pub_key_from_extra(const std::vector<uint8_t>& tx_extra, size_t pk_index = 0);
|
|
|
|
|
crypto::public_key get_tx_pub_key_from_extra(const transaction_prefix& tx, size_t pk_index = 0);
|
|
|
|
|
crypto::public_key get_tx_pub_key_from_extra(const transaction& tx, size_t pk_index = 0);
|
Service Node Deregister Part 5 (#89)
* Retrieve quorum list from height, reviewed
* Setup data structures for de/register TX
* Submit and validate partial/full deregisters
* Add P2P relaying of partial deregistration votes
* Code review adjustments for deregistration part 1
- Fix check_tx_semantic
- Remove signature_pod as votes are now stored as blobs. Serialization
overrides don't intefere with crypto::signature anymore.
* deregistration_vote_pool - changed sign/verify interface and removed repeated code
* Misc review, fix sign/verify api, vote threshold
* Deregister/tx edge case handling for combinatoric votes
* core, service_node_list: separated address from service node pubkey
* Retrieve quorum list from height, reviewed
* Setup data structures for de/register TX
* Submit and validate partial/full deregisters
* Add P2P relaying of partial deregistration votes
* Code review adjustments for deregistration part 1
- Fix check_tx_semantic
- Remove signature_pod as votes are now stored as blobs. Serialization
overrides don't intefere with crypto::signature anymore.
* deregistration_vote_pool - changed sign/verify interface and removed repeated code
* Misc review, fix sign/verify api, vote threshold
* Deregister/tx edge case handling for combinatoric votes
* Store service node lists for the duration of deregister lifetimes
* Quorum min/max bug, sort node list, fix node to test list
* Change quorum to store acc pub address, fix oob bug
* Code review for expiring votes, acc keys to pub_key, improve err msgs
* Add early out for is_deregistration_tx and protect against quorum changes
* Remove debug code, fix segfault
* Remove irrelevant check for tx v3 in blockchain, fix >= height for pruning quorum states
Incorrect assumption that a transaction can be kept in the chain if it could
eventually become invalid, because if it were the chain would be split and
eventually these transaction would be dropped. But also that we should not
override the pre-existing logic which handles this case anyway.
2018-07-18 04:42:47 +02:00
|
|
|
void add_tx_pub_key_to_extra(transaction& tx, const crypto::public_key& tx_pub_key);
|
|
|
|
|
void add_tx_pub_key_to_extra(transaction_prefix& tx, const crypto::public_key& tx_pub_key);
|
|
|
|
|
void add_tx_pub_key_to_extra(std::vector<uint8_t>& tx_extra, const crypto::public_key& tx_pub_key);
|
2019-01-25 04:15:52 +01:00
|
|
|
|
Relax deregistration rules
The replaces the deregistration mechanism with a new state change
mechanism (beginning at the v12 fork) which can change a service node's
network status via three potential values (and is extensible in the
future to handle more):
- deregistered -- this is the same as the existing deregistration; the
SN is instantly removed from the SN list.
- decommissioned -- this is a sort of temporary deregistration: your SN
remains in the service node list, but is removed from the rewards list
and from any network duties.
- recommissioned -- this tx is sent by a quorum if they observe a
decommissioned SN sending uptime proofs again. Upon reception, the SN
is reactivated and put on the end of the reward list.
Since this is broadening the quorum use, this also renames the relevant
quorum to a "obligations" quorum (since it validates SN obligations),
while the transactions are "state_change" transactions (since they
change the state of a registered SN).
The new parameters added to service_node_rules.h control how this works:
// Service node decommissioning: as service nodes stay up they earn "credits" (measured in blocks)
// towards a future outage. A new service node starts out with INITIAL_CREDIT, and then builds up
// CREDIT_PER_DAY for each day the service node remains active up to a maximum of
// DECOMMISSION_MAX_CREDIT.
//
// If a service node stops sending uptime proofs, a quorum will consider whether the service node
// has built up enough credits (at least MINIMUM): if so, instead of submitting a deregistration,
// it instead submits a decommission. This removes the service node from the list of active
// service nodes both for rewards and for any active network duties. If the service node comes
// back online (i.e. starts sending the required performance proofs again) before the credits run
// out then a quorum will reinstate the service node using a recommission transaction, which adds
// the service node back to the bottom of the service node reward list, and resets its accumulated
// credits to 0. If it does not come back online within the required number of blocks (i.e. the
// accumulated credit at the point of decommissioning) then a quorum will send a permanent
// deregistration transaction to the network, starting a 30-day deregistration count down.
This commit currently includes values (which are not necessarily
finalized):
- 8 hours (240 blocks) of credit required for activation of a
decommission (rather than a deregister)
- 0 initial credits at registration
- a maximum of 24 hours (720 blocks) of credits
- credits accumulate at a rate that you hit 24 hours of credits after 30
days of operation.
Miscellaneous other details of this PR:
- a new TX extra tag is used for the state change (including
deregistrations). The old extra tag has no version or type tag, so
couldn't be reused. The data in the new tag is slightly more
efficiently packed than the old deregistration transaction, so it gets
used for deregistrations (starting at the v12 fork) as well.
- Correct validator/worker selection required generalizing the shuffle
function to be able to shuffle just part of a vector. This lets us
stick any down service nodes at the end of the potential list, then
select validators by only shuffling the part of the index vector that
contains active service indices. Once the validators are selected, the
remainder of the list (this time including decommissioned SN indices) is
shuffled to select quorum workers to check, thus allowing decommisioned
nodes to be randomly included in the nodes to check without being
selected as a validator.
- Swarm recalculation was not quite right: swarms were recalculated on
SN registrations, even if those registrations were include shared node
registrations, but *not* recalculated on stakes. Starting with the
upgrade this behaviour is fixed (swarms aren't actually used currently
and aren't consensus-relevant so recalculating early won't hurt
anything).
- Details on decomm/dereg are added to RPC info and print_sn/print_sn_status
- Slightly improves the % of reward output in the print_sn output by
rounding it to two digits, and reserves space in the output string to
avoid excessive reallocations.
- Adds various debugging at higher debug levels to quorum voting (into
all of voting itself, vote transmission, and vote reception).
- Reset service node list internal data structure version to 0. The SN
list has to be rescanned anyway at upgrade (its size has changed), so we
might as well reset the version and remove the version-dependent
serialization code. (Note that the affected code here is for SN states
in lmdb storage, not for SN-to-SN communication serialization).
2019-06-18 23:57:02 +02:00
|
|
|
bool add_service_node_state_change_to_tx_extra(std::vector<uint8_t>& tx_extra, const tx_extra_service_node_state_change& state_change, uint8_t hf_version);
|
|
|
|
|
bool get_service_node_state_change_from_tx_extra(const std::vector<uint8_t>& tx_extra, tx_extra_service_node_state_change& state_change, uint8_t hf_version);
|
Service Node Deregister Part 5 (#89)
* Retrieve quorum list from height, reviewed
* Setup data structures for de/register TX
* Submit and validate partial/full deregisters
* Add P2P relaying of partial deregistration votes
* Code review adjustments for deregistration part 1
- Fix check_tx_semantic
- Remove signature_pod as votes are now stored as blobs. Serialization
overrides don't intefere with crypto::signature anymore.
* deregistration_vote_pool - changed sign/verify interface and removed repeated code
* Misc review, fix sign/verify api, vote threshold
* Deregister/tx edge case handling for combinatoric votes
* core, service_node_list: separated address from service node pubkey
* Retrieve quorum list from height, reviewed
* Setup data structures for de/register TX
* Submit and validate partial/full deregisters
* Add P2P relaying of partial deregistration votes
* Code review adjustments for deregistration part 1
- Fix check_tx_semantic
- Remove signature_pod as votes are now stored as blobs. Serialization
overrides don't intefere with crypto::signature anymore.
* deregistration_vote_pool - changed sign/verify interface and removed repeated code
* Misc review, fix sign/verify api, vote threshold
* Deregister/tx edge case handling for combinatoric votes
* Store service node lists for the duration of deregister lifetimes
* Quorum min/max bug, sort node list, fix node to test list
* Change quorum to store acc pub address, fix oob bug
* Code review for expiring votes, acc keys to pub_key, improve err msgs
* Add early out for is_deregistration_tx and protect against quorum changes
* Remove debug code, fix segfault
* Remove irrelevant check for tx v3 in blockchain, fix >= height for pruning quorum states
Incorrect assumption that a transaction can be kept in the chain if it could
eventually become invalid, because if it were the chain would be split and
eventually these transaction would be dropped. But also that we should not
override the pre-existing logic which handles this case anyway.
2018-07-18 04:42:47 +02:00
|
|
|
bool get_service_node_register_from_tx_extra(const std::vector<uint8_t>& tx_extra, tx_extra_service_node_register& registration);
|
Relax deregistration rules
The replaces the deregistration mechanism with a new state change
mechanism (beginning at the v12 fork) which can change a service node's
network status via three potential values (and is extensible in the
future to handle more):
- deregistered -- this is the same as the existing deregistration; the
SN is instantly removed from the SN list.
- decommissioned -- this is a sort of temporary deregistration: your SN
remains in the service node list, but is removed from the rewards list
and from any network duties.
- recommissioned -- this tx is sent by a quorum if they observe a
decommissioned SN sending uptime proofs again. Upon reception, the SN
is reactivated and put on the end of the reward list.
Since this is broadening the quorum use, this also renames the relevant
quorum to a "obligations" quorum (since it validates SN obligations),
while the transactions are "state_change" transactions (since they
change the state of a registered SN).
The new parameters added to service_node_rules.h control how this works:
// Service node decommissioning: as service nodes stay up they earn "credits" (measured in blocks)
// towards a future outage. A new service node starts out with INITIAL_CREDIT, and then builds up
// CREDIT_PER_DAY for each day the service node remains active up to a maximum of
// DECOMMISSION_MAX_CREDIT.
//
// If a service node stops sending uptime proofs, a quorum will consider whether the service node
// has built up enough credits (at least MINIMUM): if so, instead of submitting a deregistration,
// it instead submits a decommission. This removes the service node from the list of active
// service nodes both for rewards and for any active network duties. If the service node comes
// back online (i.e. starts sending the required performance proofs again) before the credits run
// out then a quorum will reinstate the service node using a recommission transaction, which adds
// the service node back to the bottom of the service node reward list, and resets its accumulated
// credits to 0. If it does not come back online within the required number of blocks (i.e. the
// accumulated credit at the point of decommissioning) then a quorum will send a permanent
// deregistration transaction to the network, starting a 30-day deregistration count down.
This commit currently includes values (which are not necessarily
finalized):
- 8 hours (240 blocks) of credit required for activation of a
decommission (rather than a deregister)
- 0 initial credits at registration
- a maximum of 24 hours (720 blocks) of credits
- credits accumulate at a rate that you hit 24 hours of credits after 30
days of operation.
Miscellaneous other details of this PR:
- a new TX extra tag is used for the state change (including
deregistrations). The old extra tag has no version or type tag, so
couldn't be reused. The data in the new tag is slightly more
efficiently packed than the old deregistration transaction, so it gets
used for deregistrations (starting at the v12 fork) as well.
- Correct validator/worker selection required generalizing the shuffle
function to be able to shuffle just part of a vector. This lets us
stick any down service nodes at the end of the potential list, then
select validators by only shuffling the part of the index vector that
contains active service indices. Once the validators are selected, the
remainder of the list (this time including decommissioned SN indices) is
shuffled to select quorum workers to check, thus allowing decommisioned
nodes to be randomly included in the nodes to check without being
selected as a validator.
- Swarm recalculation was not quite right: swarms were recalculated on
SN registrations, even if those registrations were include shared node
registrations, but *not* recalculated on stakes. Starting with the
upgrade this behaviour is fixed (swarms aren't actually used currently
and aren't consensus-relevant so recalculating early won't hurt
anything).
- Details on decomm/dereg are added to RPC info and print_sn/print_sn_status
- Slightly improves the % of reward output in the print_sn output by
rounding it to two digits, and reserves space in the output string to
avoid excessive reallocations.
- Adds various debugging at higher debug levels to quorum voting (into
all of voting itself, vote transmission, and vote reception).
- Reset service node list internal data structure version to 0. The SN
list has to be rescanned anyway at upgrade (its size has changed), so we
might as well reset the version and remove the version-dependent
serialization code. (Note that the affected code here is for SN states
in lmdb storage, not for SN-to-SN communication serialization).
2019-06-18 23:57:02 +02:00
|
|
|
|
2018-07-28 08:27:04 +02:00
|
|
|
bool get_service_node_pubkey_from_tx_extra(const std::vector<uint8_t>& tx_extra, crypto::public_key& pubkey);
|
|
|
|
|
bool get_service_node_contributor_from_tx_extra(const std::vector<uint8_t>& tx_extra, cryptonote::account_public_address& address);
|
2018-08-18 06:36:16 +02:00
|
|
|
bool add_service_node_register_to_tx_extra(std::vector<uint8_t>& tx_extra, const std::vector<cryptonote::account_public_address>& addresses, uint64_t portions_for_operator, const std::vector<uint64_t>& portions, uint64_t expiration_timestamp, const crypto::signature& signature);
|
2019-01-25 04:15:52 +01:00
|
|
|
|
2018-08-03 10:34:49 +02:00
|
|
|
bool get_tx_secret_key_from_tx_extra(const std::vector<uint8_t>& tx_extra, crypto::secret_key& key);
|
|
|
|
|
void add_tx_secret_key_to_tx_extra(std::vector<uint8_t>& tx_extra, const crypto::secret_key& key);
|
2019-01-25 04:15:52 +01:00
|
|
|
bool get_tx_key_image_proofs_from_tx_extra(const std::vector<uint8_t>& tx_extra, tx_extra_tx_key_image_proofs &proofs);
|
|
|
|
|
bool add_tx_key_image_proofs_to_tx_extra (std::vector<uint8_t>& tx_extra, const tx_extra_tx_key_image_proofs& proofs);
|
|
|
|
|
bool get_tx_key_image_unlock_from_tx_extra(const std::vector<uint8_t>& tx_extra, tx_extra_tx_key_image_unlock &unlock);
|
|
|
|
|
bool add_tx_key_image_unlock_to_tx_extra(std::vector<uint8_t>& tx_extra, const tx_extra_tx_key_image_unlock& unlock);
|
|
|
|
|
|
2018-07-18 08:51:26 +02:00
|
|
|
void add_service_node_winner_to_tx_extra(std::vector<uint8_t>& tx_extra, const crypto::public_key& winner);
|
2018-07-28 08:27:04 +02:00
|
|
|
void add_service_node_pubkey_to_tx_extra(std::vector<uint8_t>& tx_extra, const crypto::public_key& pubkey);
|
|
|
|
|
void add_service_node_contributor_to_tx_extra(std::vector<uint8_t>& tx_extra, const cryptonote::account_public_address& address);
|
2018-07-18 08:51:26 +02:00
|
|
|
crypto::public_key get_service_node_winner_from_tx_extra(const std::vector<uint8_t>& tx_extra);
|
2019-01-25 04:15:52 +01:00
|
|
|
|
2017-02-19 03:42:10 +01:00
|
|
|
std::vector<crypto::public_key> get_additional_tx_pub_keys_from_extra(const std::vector<uint8_t>& tx_extra);
|
|
|
|
|
std::vector<crypto::public_key> get_additional_tx_pub_keys_from_extra(const transaction_prefix& tx);
|
|
|
|
|
bool add_additional_tx_pub_keys_to_extra(std::vector<uint8_t>& tx_extra, const std::vector<crypto::public_key>& additional_pub_keys);
|
2014-05-03 18:19:43 +02:00
|
|
|
bool add_extra_nonce_to_tx_extra(std::vector<uint8_t>& tx_extra, const blobdata& extra_nonce);
|
2018-06-29 06:47:00 +02:00
|
|
|
bool add_viewkey_to_tx_extra(std::vector<uint8_t>& tx_extra, const crypto::secret_key& viewkey);
|
|
|
|
|
crypto::secret_key get_viewkey_from_tx_extra(const std::vector<uint8_t>& tx_extra);
|
2015-08-13 00:05:53 +02:00
|
|
|
bool remove_field_from_tx_extra(std::vector<uint8_t>& tx_extra, const std::type_info &type);
|
2015-08-09 11:09:39 +02:00
|
|
|
void set_payment_id_to_tx_extra_nonce(blobdata& extra_nonce, const crypto::hash& payment_id);
|
|
|
|
|
void set_encrypted_payment_id_to_tx_extra_nonce(blobdata& extra_nonce, const crypto::hash8& payment_id);
|
|
|
|
|
bool get_payment_id_from_tx_extra_nonce(const blobdata& extra_nonce, crypto::hash& payment_id);
|
|
|
|
|
bool get_encrypted_payment_id_from_tx_extra_nonce(const blobdata& extra_nonce, crypto::hash8& payment_id);
|
2017-02-19 03:42:10 +01:00
|
|
|
bool is_out_to_acc(const account_keys& acc, const txout_to_key& out_key, const crypto::public_key& tx_pub_key, const std::vector<crypto::public_key>& additional_tx_public_keys, size_t output_index);
|
|
|
|
|
struct subaddress_receive_info
|
|
|
|
|
{
|
|
|
|
|
subaddress_index index;
|
|
|
|
|
crypto::key_derivation derivation;
|
|
|
|
|
};
|
2018-02-20 17:01:27 +01:00
|
|
|
boost::optional<subaddress_receive_info> is_out_to_acc_precomp(const std::unordered_map<crypto::public_key, subaddress_index>& subaddresses, const crypto::public_key& out_key, const crypto::key_derivation& derivation, const std::vector<crypto::key_derivation>& additional_derivations, size_t output_index, hw::device &hwdev);
|
2017-02-19 03:42:10 +01:00
|
|
|
bool lookup_acc_outs(const account_keys& acc, const transaction& tx, const crypto::public_key& tx_pub_key, const std::vector<crypto::public_key>& additional_tx_public_keys, std::vector<size_t>& outs, uint64_t& money_transfered);
|
2014-03-03 23:07:58 +01:00
|
|
|
bool lookup_acc_outs(const account_keys& acc, const transaction& tx, std::vector<size_t>& outs, uint64_t& money_transfered);
|
|
|
|
|
bool get_tx_fee(const transaction& tx, uint64_t & fee);
|
|
|
|
|
uint64_t get_tx_fee(const transaction& tx);
|
2018-02-20 17:01:27 +01:00
|
|
|
bool generate_key_image_helper(const account_keys& ack, const std::unordered_map<crypto::public_key, subaddress_index>& subaddresses, const crypto::public_key& out_key, const crypto::public_key& tx_public_key, const std::vector<crypto::public_key>& additional_tx_public_keys, size_t real_output_index, keypair& in_ephemeral, crypto::key_image& ki, hw::device &hwdev);
|
|
|
|
|
bool generate_key_image_helper_precomp(const account_keys& ack, const crypto::public_key& out_key, const crypto::key_derivation& recv_derivation, size_t real_output_index, const subaddress_index& received_index, keypair& in_ephemeral, crypto::key_image& ki, hw::device &hwdev);
|
2014-03-03 23:07:58 +01:00
|
|
|
void get_blob_hash(const blobdata& blob, crypto::hash& res);
|
2018-11-11 14:39:00 +01:00
|
|
|
void get_blob_hash(const epee::span<const char>& blob, crypto::hash& res);
|
2014-03-03 23:07:58 +01:00
|
|
|
crypto::hash get_blob_hash(const blobdata& blob);
|
2018-11-11 14:39:00 +01:00
|
|
|
crypto::hash get_blob_hash(const epee::span<const char>& blob);
|
2014-03-03 23:07:58 +01:00
|
|
|
std::string short_hash_str(const crypto::hash& h);
|
|
|
|
|
|
2018-08-18 06:36:16 +02:00
|
|
|
bool get_registration_hash(const std::vector<cryptonote::account_public_address>& addresses, uint64_t operator_portions, const std::vector<uint64_t>& portions, uint64_t expiration_timestamp, crypto::hash& hash);
|
2018-07-21 03:27:13 +02:00
|
|
|
|
2014-03-03 23:07:58 +01:00
|
|
|
crypto::hash get_transaction_hash(const transaction& t);
|
|
|
|
|
bool get_transaction_hash(const transaction& t, crypto::hash& res);
|
|
|
|
|
bool get_transaction_hash(const transaction& t, crypto::hash& res, size_t& blob_size);
|
2016-08-09 22:34:09 +02:00
|
|
|
bool get_transaction_hash(const transaction& t, crypto::hash& res, size_t* blob_size);
|
2018-11-11 14:39:00 +01:00
|
|
|
bool calculate_transaction_prunable_hash(const transaction& t, const cryptonote::blobdata *blob, crypto::hash& res);
|
|
|
|
|
crypto::hash get_transaction_prunable_hash(const transaction& t, const cryptonote::blobdata *blob = NULL);
|
2017-03-22 19:01:09 +01:00
|
|
|
bool calculate_transaction_hash(const transaction& t, crypto::hash& res, size_t* blob_size);
|
2017-10-01 12:24:33 +02:00
|
|
|
crypto::hash get_pruned_transaction_hash(const transaction& t, const crypto::hash &pruned_data_hash);
|
|
|
|
|
|
2014-03-03 23:07:58 +01:00
|
|
|
blobdata get_block_hashing_blob(const block& b);
|
2018-12-13 20:47:47 +01:00
|
|
|
bool calculate_block_hash(const block& b, crypto::hash& res, const blobdata *blob = NULL);
|
2014-03-03 23:07:58 +01:00
|
|
|
bool get_block_hash(const block& b, crypto::hash& res);
|
|
|
|
|
crypto::hash get_block_hash(const block& b);
|
2018-12-13 20:47:47 +01:00
|
|
|
bool parse_and_validate_block_from_blob(const blobdata& b_blob, block& b, crypto::hash *block_hash);
|
2014-03-03 23:07:58 +01:00
|
|
|
bool parse_and_validate_block_from_blob(const blobdata& b_blob, block& b);
|
2018-12-13 20:47:47 +01:00
|
|
|
bool parse_and_validate_block_from_blob(const blobdata& b_blob, block& b, crypto::hash &block_hash);
|
2014-03-03 23:07:58 +01:00
|
|
|
bool get_inputs_money_amount(const transaction& tx, uint64_t& money);
|
|
|
|
|
uint64_t get_outs_money_amount(const transaction& tx);
|
|
|
|
|
bool check_inputs_types_supported(const transaction& tx);
|
|
|
|
|
bool check_outs_valid(const transaction& tx);
|
|
|
|
|
bool parse_amount(uint64_t& amount, const std::string& str_amount);
|
2018-07-18 23:24:53 +02:00
|
|
|
uint64_t get_transaction_weight(const transaction &tx);
|
|
|
|
|
uint64_t get_transaction_weight(const transaction &tx, size_t blob_size);
|
2014-03-03 23:07:58 +01:00
|
|
|
|
|
|
|
|
bool check_money_overflow(const transaction& tx);
|
|
|
|
|
bool check_outs_overflow(const transaction& tx);
|
|
|
|
|
bool check_inputs_overflow(const transaction& tx);
|
|
|
|
|
uint64_t get_block_height(const block& b);
|
|
|
|
|
std::vector<uint64_t> relative_output_offsets_to_absolute(const std::vector<uint64_t>& off);
|
|
|
|
|
std::vector<uint64_t> absolute_output_offsets_to_relative(const std::vector<uint64_t>& off);
|
2017-03-01 23:27:27 +01:00
|
|
|
void set_default_decimal_point(unsigned int decimal_point = CRYPTONOTE_DISPLAY_DECIMAL_POINT);
|
|
|
|
|
unsigned int get_default_decimal_point();
|
|
|
|
|
std::string get_unit(unsigned int decimal_point = -1);
|
|
|
|
|
std::string print_money(uint64_t amount, unsigned int decimal_point = -1);
|
2018-08-15 03:47:45 +02:00
|
|
|
|
|
|
|
|
char const *print_tx_verification_context (tx_verification_context const &tvc, transaction const *tx = nullptr);
|
2019-05-31 03:06:42 +02:00
|
|
|
char const *print_vote_verification_context(vote_verification_context const &vvc, service_nodes::quorum_vote_t const *vote = nullptr);
|
2014-03-03 23:07:58 +01:00
|
|
|
//---------------------------------------------------------------
|
|
|
|
|
template<class t_object>
|
2019-03-23 17:20:08 +01:00
|
|
|
bool t_serializable_object_from_blob(t_object& to, const blobdata& b_blob)
|
|
|
|
|
{
|
|
|
|
|
std::stringstream ss;
|
|
|
|
|
ss << b_blob;
|
|
|
|
|
binary_archive<false> ba(ss);
|
|
|
|
|
bool r = ::serialization::serialize(ba, to);
|
|
|
|
|
return r;
|
|
|
|
|
}
|
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
|
template<class t_object>
|
2014-03-03 23:07:58 +01:00
|
|
|
bool t_serializable_object_to_blob(const t_object& to, blobdata& b_blob)
|
|
|
|
|
{
|
|
|
|
|
std::stringstream ss;
|
|
|
|
|
binary_archive<true> ba(ss);
|
|
|
|
|
bool r = ::serialization::serialize(ba, const_cast<t_object&>(to));
|
|
|
|
|
b_blob = ss.str();
|
|
|
|
|
return r;
|
|
|
|
|
}
|
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
|
template<class t_object>
|
|
|
|
|
blobdata t_serializable_object_to_blob(const t_object& to)
|
|
|
|
|
{
|
|
|
|
|
blobdata b;
|
|
|
|
|
t_serializable_object_to_blob(to, b);
|
|
|
|
|
return b;
|
|
|
|
|
}
|
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
|
template<class t_object>
|
|
|
|
|
bool get_object_hash(const t_object& o, crypto::hash& res)
|
|
|
|
|
{
|
|
|
|
|
get_blob_hash(t_serializable_object_to_blob(o), res);
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
|
template<class t_object>
|
|
|
|
|
size_t get_object_blobsize(const t_object& o)
|
|
|
|
|
{
|
|
|
|
|
blobdata b = t_serializable_object_to_blob(o);
|
|
|
|
|
return b.size();
|
|
|
|
|
}
|
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
|
template<class t_object>
|
|
|
|
|
bool get_object_hash(const t_object& o, crypto::hash& res, size_t& blob_size)
|
|
|
|
|
{
|
|
|
|
|
blobdata bl = t_serializable_object_to_blob(o);
|
|
|
|
|
blob_size = bl.size();
|
|
|
|
|
get_blob_hash(bl, res);
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
|
template <typename T>
|
|
|
|
|
std::string obj_to_json_str(T& obj)
|
|
|
|
|
{
|
|
|
|
|
std::stringstream ss;
|
|
|
|
|
json_archive<true> ar(ss, true);
|
|
|
|
|
bool r = ::serialization::serialize(ar, obj);
|
|
|
|
|
CHECK_AND_ASSERT_MES(r, "", "obj_to_json_str failed: serialization::serialize returned false");
|
|
|
|
|
return ss.str();
|
|
|
|
|
}
|
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
|
// 62387455827 -> 455827 + 7000000 + 80000000 + 300000000 + 2000000000 + 60000000000, where 455827 <= dust_threshold
|
|
|
|
|
template<typename chunk_handler_t, typename dust_handler_t>
|
|
|
|
|
void decompose_amount_into_digits(uint64_t amount, uint64_t dust_threshold, const chunk_handler_t& chunk_handler, const dust_handler_t& dust_handler)
|
|
|
|
|
{
|
|
|
|
|
if (0 == amount)
|
|
|
|
|
{
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
bool is_dust_handled = false;
|
|
|
|
|
uint64_t dust = 0;
|
|
|
|
|
uint64_t order = 1;
|
|
|
|
|
while (0 != amount)
|
|
|
|
|
{
|
|
|
|
|
uint64_t chunk = (amount % 10) * order;
|
|
|
|
|
amount /= 10;
|
|
|
|
|
order *= 10;
|
|
|
|
|
|
|
|
|
|
if (dust + chunk <= dust_threshold)
|
|
|
|
|
{
|
|
|
|
|
dust += chunk;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
if (!is_dust_handled && 0 != dust)
|
|
|
|
|
{
|
|
|
|
|
dust_handler(dust);
|
|
|
|
|
is_dust_handled = true;
|
|
|
|
|
}
|
|
|
|
|
if (0 != chunk)
|
|
|
|
|
{
|
|
|
|
|
chunk_handler(chunk);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (!is_dust_handled && 0 != dust)
|
|
|
|
|
{
|
|
|
|
|
dust_handler(dust);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
//---------------------------------------------------------------
|
|
|
|
|
blobdata block_to_blob(const block& b);
|
|
|
|
|
bool block_to_blob(const block& b, blobdata& b_blob);
|
|
|
|
|
blobdata tx_to_blob(const transaction& b);
|
|
|
|
|
bool tx_to_blob(const transaction& b, blobdata& b_blob);
|
|
|
|
|
void get_tx_tree_hash(const std::vector<crypto::hash>& tx_hashes, crypto::hash& h);
|
|
|
|
|
crypto::hash get_tx_tree_hash(const std::vector<crypto::hash>& tx_hashes);
|
|
|
|
|
crypto::hash get_tx_tree_hash(const block& b);
|
2015-10-06 16:58:09 +02:00
|
|
|
bool is_valid_decomposed_amount(uint64_t amount);
|
2017-03-22 19:01:09 +01:00
|
|
|
void get_hash_stats(uint64_t &tx_hashes_calculated, uint64_t &tx_hashes_cached, uint64_t &block_hashes_calculated, uint64_t & block_hashes_cached);
|
2014-03-03 23:07:58 +01:00
|
|
|
|
2017-11-25 15:50:15 +01:00
|
|
|
crypto::secret_key encrypt_key(crypto::secret_key key, const epee::wipeable_string &passphrase);
|
|
|
|
|
crypto::secret_key decrypt_key(crypto::secret_key key, const epee::wipeable_string &passphrase);
|
2014-03-03 23:07:58 +01:00
|
|
|
#define CHECKED_GET_SPECIFIC_VARIANT(variant_var, specific_type, variable_name, fail_return_val) \
|
|
|
|
|
CHECK_AND_ASSERT_MES(variant_var.type() == typeid(specific_type), fail_return_val, "wrong variant type: " << variant_var.type().name() << ", expected " << typeid(specific_type).name()); \
|
|
|
|
|
specific_type& variable_name = boost::get<specific_type>(variant_var);
|
|
|
|
|
}
|
