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
|
|
|
|
|
|
|
|
#include <boost/variant.hpp>
|
|
|
|
#include <boost/functional/hash/hash.hpp>
|
|
|
|
#include <vector>
|
|
|
|
#include <cstring> // memcmp
|
|
|
|
#include <sstream>
|
2017-03-25 10:18:53 +01:00
|
|
|
#include <atomic>
|
2014-03-03 23:07:58 +01:00
|
|
|
#include "serialization/variant.h"
|
|
|
|
#include "serialization/vector.h"
|
|
|
|
#include "serialization/binary_archive.h"
|
|
|
|
#include "serialization/json_archive.h"
|
|
|
|
#include "serialization/debug_archive.h"
|
|
|
|
#include "serialization/crypto.h"
|
|
|
|
#include "serialization/keyvalue_serialization.h" // eepe named serialization
|
|
|
|
#include "cryptonote_config.h"
|
|
|
|
#include "crypto/crypto.h"
|
|
|
|
#include "crypto/hash.h"
|
|
|
|
#include "misc_language.h"
|
2016-06-16 00:37:13 +02:00
|
|
|
#include "ringct/rctTypes.h"
|
2018-03-05 08:16:30 +01:00
|
|
|
#include "device/device.hpp"
|
2014-03-03 23:07:58 +01:00
|
|
|
|
|
|
|
namespace cryptonote
|
|
|
|
{
|
|
|
|
typedef std::vector<crypto::signature> ring_signature;
|
|
|
|
|
|
|
|
|
|
|
|
/* outputs */
|
|
|
|
|
|
|
|
struct txout_to_script
|
|
|
|
{
|
|
|
|
std::vector<crypto::public_key> keys;
|
|
|
|
std::vector<uint8_t> script;
|
|
|
|
|
|
|
|
BEGIN_SERIALIZE_OBJECT()
|
|
|
|
FIELD(keys)
|
|
|
|
FIELD(script)
|
|
|
|
END_SERIALIZE()
|
|
|
|
};
|
|
|
|
|
|
|
|
struct txout_to_scripthash
|
|
|
|
{
|
|
|
|
crypto::hash hash;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct txout_to_key
|
|
|
|
{
|
|
|
|
txout_to_key() { }
|
|
|
|
txout_to_key(const crypto::public_key &_key) : key(_key) { }
|
|
|
|
crypto::public_key key;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/* inputs */
|
|
|
|
|
|
|
|
struct txin_gen
|
|
|
|
{
|
|
|
|
size_t height;
|
|
|
|
|
|
|
|
BEGIN_SERIALIZE_OBJECT()
|
|
|
|
VARINT_FIELD(height)
|
|
|
|
END_SERIALIZE()
|
|
|
|
};
|
|
|
|
|
|
|
|
struct txin_to_script
|
|
|
|
{
|
|
|
|
crypto::hash prev;
|
|
|
|
size_t prevout;
|
|
|
|
std::vector<uint8_t> sigset;
|
|
|
|
|
|
|
|
BEGIN_SERIALIZE_OBJECT()
|
|
|
|
FIELD(prev)
|
|
|
|
VARINT_FIELD(prevout)
|
|
|
|
FIELD(sigset)
|
|
|
|
END_SERIALIZE()
|
|
|
|
};
|
|
|
|
|
|
|
|
struct txin_to_scripthash
|
|
|
|
{
|
|
|
|
crypto::hash prev;
|
|
|
|
size_t prevout;
|
|
|
|
txout_to_script script;
|
|
|
|
std::vector<uint8_t> sigset;
|
|
|
|
|
|
|
|
BEGIN_SERIALIZE_OBJECT()
|
|
|
|
FIELD(prev)
|
|
|
|
VARINT_FIELD(prevout)
|
|
|
|
FIELD(script)
|
|
|
|
FIELD(sigset)
|
|
|
|
END_SERIALIZE()
|
|
|
|
};
|
|
|
|
|
|
|
|
struct txin_to_key
|
|
|
|
{
|
|
|
|
uint64_t amount;
|
|
|
|
std::vector<uint64_t> key_offsets;
|
|
|
|
crypto::key_image k_image; // double spending protection
|
|
|
|
|
|
|
|
BEGIN_SERIALIZE_OBJECT()
|
|
|
|
VARINT_FIELD(amount)
|
|
|
|
FIELD(key_offsets)
|
|
|
|
FIELD(k_image)
|
|
|
|
END_SERIALIZE()
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
typedef boost::variant<txin_gen, txin_to_script, txin_to_scripthash, txin_to_key> txin_v;
|
|
|
|
|
|
|
|
typedef boost::variant<txout_to_script, txout_to_scripthash, txout_to_key> txout_target_v;
|
|
|
|
|
|
|
|
//typedef std::pair<uint64_t, txout> out_t;
|
|
|
|
struct tx_out
|
|
|
|
{
|
|
|
|
uint64_t amount;
|
|
|
|
txout_target_v target;
|
|
|
|
|
|
|
|
BEGIN_SERIALIZE_OBJECT()
|
|
|
|
VARINT_FIELD(amount)
|
|
|
|
FIELD(target)
|
|
|
|
END_SERIALIZE()
|
|
|
|
|
|
|
|
|
|
|
|
};
|
|
|
|
|
2018-11-11 14:39:00 +01:00
|
|
|
template<typename T> static inline unsigned int getpos(T &ar) { return 0; }
|
|
|
|
template<> inline unsigned int getpos(binary_archive<true> &ar) { return ar.stream().tellp(); }
|
|
|
|
template<> inline unsigned int getpos(binary_archive<false> &ar) { return ar.stream().tellg(); }
|
|
|
|
|
2019-06-11 20:53:46 +02:00
|
|
|
enum class txversion : uint16_t {
|
|
|
|
v0 = 0,
|
|
|
|
v1,
|
|
|
|
v2_ringct,
|
|
|
|
v3_per_output_unlock_times,
|
|
|
|
v4_tx_types,
|
|
|
|
_count,
|
|
|
|
};
|
|
|
|
enum class txtype : uint16_t {
|
|
|
|
standard,
|
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
|
|
|
state_change,
|
2019-06-11 20:53:46 +02:00
|
|
|
key_image_unlock,
|
|
|
|
_count
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2014-03-03 23:07:58 +01:00
|
|
|
class transaction_prefix
|
|
|
|
{
|
|
|
|
|
|
|
|
public:
|
2019-06-11 20:53:46 +02:00
|
|
|
static char const *version_to_string(txversion v);
|
|
|
|
static char const *type_to_string(txtype type);
|
|
|
|
|
2019-06-26 06:00:05 +02:00
|
|
|
static txversion get_min_version_for_hf(uint8_t hf_version, cryptonote::network_type nettype = MAINNET, bool miner_tx = false);
|
|
|
|
static txversion get_max_version_for_hf(uint8_t hf_version, cryptonote::network_type nettype = MAINNET);
|
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
|
|
|
|
2014-03-03 23:07:58 +01:00
|
|
|
// tx information
|
2019-06-11 20:53:46 +02:00
|
|
|
txversion version;
|
|
|
|
txtype type;
|
2018-08-03 03:39:28 +02:00
|
|
|
|
|
|
|
// not used after version 2, but remains for compatibility
|
2014-03-03 23:07:58 +01:00
|
|
|
uint64_t unlock_time; //number of block (or time), used as a limitation like: spend this tx not early then block/time
|
|
|
|
|
|
|
|
std::vector<txin_v> vin;
|
|
|
|
std::vector<tx_out> vout;
|
|
|
|
//extra
|
|
|
|
std::vector<uint8_t> extra;
|
|
|
|
|
2018-08-03 03:39:28 +02:00
|
|
|
std::vector<uint64_t> output_unlock_times;
|
2019-01-25 04:15:52 +01:00
|
|
|
|
2014-03-03 23:07:58 +01:00
|
|
|
BEGIN_SERIALIZE()
|
2019-06-11 20:53:46 +02:00
|
|
|
ENUM_FIELD(version, version >= txversion::v1 && version < txversion::_count);
|
|
|
|
if (version >= txversion::v3_per_output_unlock_times)
|
2018-08-03 03:39:28 +02:00
|
|
|
{
|
|
|
|
FIELD(output_unlock_times)
|
2019-06-11 20:53:46 +02:00
|
|
|
if (version == txversion::v3_per_output_unlock_times) {
|
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 is_state_change = type == txtype::state_change;
|
|
|
|
FIELD(is_state_change)
|
|
|
|
type = is_state_change ? txtype::state_change : txtype::standard;
|
2019-06-11 20:53:46 +02:00
|
|
|
}
|
2018-08-03 03:39:28 +02:00
|
|
|
}
|
2014-03-03 23:07:58 +01:00
|
|
|
VARINT_FIELD(unlock_time)
|
|
|
|
FIELD(vin)
|
|
|
|
FIELD(vout)
|
2019-06-11 20:53:46 +02:00
|
|
|
if (version >= txversion::v3_per_output_unlock_times && vout.size() != output_unlock_times.size())
|
|
|
|
return false;
|
2014-03-03 23:07:58 +01:00
|
|
|
FIELD(extra)
|
2019-06-11 20:53:46 +02:00
|
|
|
if (version >= txversion::v4_tx_types)
|
|
|
|
ENUM_FIELD_N("type", type, type < txtype::_count);
|
2014-03-03 23:07:58 +01:00
|
|
|
END_SERIALIZE()
|
|
|
|
|
2018-11-30 15:54:46 +01:00
|
|
|
transaction_prefix(){ set_null(); }
|
|
|
|
void set_null()
|
|
|
|
{
|
2019-06-11 20:53:46 +02:00
|
|
|
version = txversion::v1;
|
2018-11-30 15:54:46 +01:00
|
|
|
unlock_time = 0;
|
|
|
|
vin.clear();
|
|
|
|
vout.clear();
|
|
|
|
extra.clear();
|
2018-12-19 02:25:48 +01:00
|
|
|
output_unlock_times.clear();
|
2019-06-11 20:53:46 +02:00
|
|
|
type = txtype::standard;
|
2018-12-19 02:25:48 +01:00
|
|
|
}
|
2019-01-25 04:15:52 +01:00
|
|
|
|
2018-08-05 05:08:51 +02:00
|
|
|
uint64_t get_unlock_time(size_t out_index) const
|
|
|
|
{
|
2019-06-11 20:53:46 +02:00
|
|
|
if (version >= txversion::v3_per_output_unlock_times)
|
2018-08-05 05:08:51 +02:00
|
|
|
{
|
|
|
|
if (out_index >= output_unlock_times.size())
|
|
|
|
{
|
|
|
|
LOG_ERROR("Tried to get unlock time of a v3 transaction with missing output unlock time");
|
|
|
|
return unlock_time;
|
|
|
|
}
|
|
|
|
return output_unlock_times[out_index];
|
|
|
|
}
|
|
|
|
return unlock_time;
|
|
|
|
}
|
2014-03-03 23:07:58 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
class transaction: public transaction_prefix
|
|
|
|
{
|
2017-03-25 10:18:53 +01:00
|
|
|
private:
|
|
|
|
// hash cash
|
|
|
|
mutable std::atomic<bool> hash_valid;
|
|
|
|
mutable std::atomic<bool> blob_size_valid;
|
|
|
|
|
2014-03-03 23:07:58 +01:00
|
|
|
public:
|
|
|
|
std::vector<std::vector<crypto::signature> > signatures; //count signatures always the same as inputs count
|
2016-06-16 00:37:13 +02:00
|
|
|
rct::rctSig rct_signatures;
|
2014-03-03 23:07:58 +01:00
|
|
|
|
2017-03-22 19:01:09 +01:00
|
|
|
// hash cash
|
|
|
|
mutable crypto::hash hash;
|
|
|
|
mutable size_t blob_size;
|
|
|
|
|
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 pruned;
|
|
|
|
|
2018-11-11 14:39:00 +01:00
|
|
|
std::atomic<unsigned int> unprunable_size;
|
|
|
|
std::atomic<unsigned int> prefix_size;
|
|
|
|
|
2014-03-03 23:07:58 +01:00
|
|
|
transaction();
|
2018-11-11 14:39:00 +01:00
|
|
|
transaction(const transaction &t): transaction_prefix(t), hash_valid(false), blob_size_valid(false), signatures(t.signatures), rct_signatures(t.rct_signatures), pruned(t.pruned), unprunable_size(t.unprunable_size.load()), prefix_size(t.prefix_size.load()) { if (t.is_hash_valid()) { hash = t.hash; set_hash_valid(true); } if (t.is_blob_size_valid()) { blob_size = t.blob_size; set_blob_size_valid(true); } }
|
|
|
|
transaction &operator=(const transaction &t) { transaction_prefix::operator=(t); set_hash_valid(false); set_blob_size_valid(false); signatures = t.signatures; rct_signatures = t.rct_signatures; if (t.is_hash_valid()) { hash = t.hash; set_hash_valid(true); } if (t.is_blob_size_valid()) { blob_size = t.blob_size; set_blob_size_valid(true); } pruned = t.pruned; unprunable_size = t.unprunable_size.load(); prefix_size = t.prefix_size.load(); return *this; }
|
2014-03-03 23:07:58 +01:00
|
|
|
virtual ~transaction();
|
|
|
|
void set_null();
|
2017-03-22 19:01:09 +01:00
|
|
|
void invalidate_hashes();
|
2017-03-25 10:18:53 +01:00
|
|
|
bool is_hash_valid() const { return hash_valid.load(std::memory_order_acquire); }
|
|
|
|
void set_hash_valid(bool v) const { hash_valid.store(v,std::memory_order_release); }
|
2017-04-03 23:19:57 +02:00
|
|
|
bool is_blob_size_valid() const { return blob_size_valid.load(std::memory_order_acquire); }
|
2017-03-25 10:18:53 +01:00
|
|
|
void set_blob_size_valid(bool v) const { blob_size_valid.store(v,std::memory_order_release); }
|
2018-12-05 21:34:10 +01:00
|
|
|
void set_hash(const crypto::hash &h) { hash = h; set_hash_valid(true); }
|
|
|
|
void set_blob_size(size_t sz) { blob_size = sz; set_blob_size_valid(true); }
|
2014-03-03 23:07:58 +01:00
|
|
|
|
|
|
|
BEGIN_SERIALIZE_OBJECT()
|
2017-03-22 19:01:09 +01:00
|
|
|
if (!typename Archive<W>::is_saving())
|
|
|
|
{
|
2017-03-25 10:18:53 +01:00
|
|
|
set_hash_valid(false);
|
|
|
|
set_blob_size_valid(false);
|
2017-03-22 19:01:09 +01:00
|
|
|
}
|
|
|
|
|
2018-11-11 14:39:00 +01:00
|
|
|
const unsigned int start_pos = getpos(ar);
|
|
|
|
|
2014-03-03 23:07:58 +01:00
|
|
|
FIELDS(*static_cast<transaction_prefix *>(this))
|
|
|
|
|
2018-11-11 14:39:00 +01:00
|
|
|
if (std::is_same<Archive<W>, binary_archive<W>>())
|
|
|
|
prefix_size = getpos(ar) - start_pos;
|
|
|
|
|
2019-06-11 20:53:46 +02:00
|
|
|
if (version == txversion::v1)
|
2014-03-03 23:07:58 +01:00
|
|
|
{
|
2018-11-11 14:39:00 +01:00
|
|
|
if (std::is_same<Archive<W>, binary_archive<W>>())
|
|
|
|
unprunable_size = getpos(ar) - start_pos;
|
|
|
|
|
2016-06-16 00:37:13 +02:00
|
|
|
ar.tag("signatures");
|
|
|
|
ar.begin_array();
|
|
|
|
PREPARE_CUSTOM_VECTOR_SERIALIZATION(vin.size(), signatures);
|
|
|
|
bool signatures_not_expected = signatures.empty();
|
|
|
|
if (!signatures_not_expected && vin.size() != signatures.size())
|
|
|
|
return false;
|
|
|
|
|
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
|
|
|
if (!pruned) for (size_t i = 0; i < vin.size(); ++i)
|
2014-03-03 23:07:58 +01:00
|
|
|
{
|
2016-06-16 00:37:13 +02:00
|
|
|
size_t signature_size = get_signature_size(vin[i]);
|
|
|
|
if (signatures_not_expected)
|
|
|
|
{
|
|
|
|
if (0 == signature_size)
|
|
|
|
continue;
|
|
|
|
else
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
PREPARE_CUSTOM_VECTOR_SERIALIZATION(signature_size, signatures[i]);
|
|
|
|
if (signature_size != signatures[i].size())
|
2014-03-03 23:07:58 +01:00
|
|
|
return false;
|
|
|
|
|
2016-06-16 00:37:13 +02:00
|
|
|
FIELDS(signatures[i]);
|
2014-03-03 23:07:58 +01:00
|
|
|
|
2016-06-16 00:37:13 +02:00
|
|
|
if (vin.size() - i > 1)
|
|
|
|
ar.delimit_array();
|
|
|
|
}
|
|
|
|
ar.end_array();
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2016-09-14 21:23:06 +02:00
|
|
|
ar.tag("rct_signatures");
|
|
|
|
if (!vin.empty())
|
2016-06-16 00:37:13 +02:00
|
|
|
{
|
2016-09-14 21:23:06 +02:00
|
|
|
ar.begin_object();
|
|
|
|
bool r = rct_signatures.serialize_rctsig_base(ar, vin.size(), vout.size());
|
|
|
|
if (!r || !ar.stream().good()) return false;
|
|
|
|
ar.end_object();
|
2018-11-11 14:39:00 +01:00
|
|
|
|
|
|
|
if (std::is_same<Archive<W>, binary_archive<W>>())
|
|
|
|
unprunable_size = getpos(ar) - start_pos;
|
|
|
|
|
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
|
|
|
if (!pruned && rct_signatures.type != rct::RCTTypeNull)
|
2016-07-10 13:57:22 +02:00
|
|
|
{
|
2016-09-14 21:23:06 +02:00
|
|
|
ar.tag("rctsig_prunable");
|
|
|
|
ar.begin_object();
|
|
|
|
r = rct_signatures.p.serialize_rctsig_prunable(ar, rct_signatures.type, vin.size(), vout.size(),
|
2017-12-12 12:08:11 +01:00
|
|
|
vin.size() > 0 && vin[0].type() == typeid(txin_to_key) ? boost::get<txin_to_key>(vin[0]).key_offsets.size() - 1 : 0);
|
2016-09-14 21:23:06 +02:00
|
|
|
if (!r || !ar.stream().good()) return false;
|
|
|
|
ar.end_object();
|
2016-07-10 13:57:22 +02:00
|
|
|
}
|
|
|
|
}
|
2014-03-03 23:07:58 +01:00
|
|
|
}
|
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
|
|
|
if (!typename Archive<W>::is_saving())
|
|
|
|
pruned = false;
|
2014-03-03 23:07:58 +01:00
|
|
|
END_SERIALIZE()
|
|
|
|
|
2017-02-27 21:24:39 +01:00
|
|
|
template<bool W, template <bool> class Archive>
|
|
|
|
bool serialize_base(Archive<W> &ar)
|
|
|
|
{
|
|
|
|
FIELDS(*static_cast<transaction_prefix *>(this))
|
|
|
|
|
2019-06-11 20:53:46 +02:00
|
|
|
if (version == txversion::v1)
|
2017-02-27 21:24:39 +01:00
|
|
|
{
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
ar.tag("rct_signatures");
|
|
|
|
if (!vin.empty())
|
|
|
|
{
|
|
|
|
ar.begin_object();
|
|
|
|
bool r = rct_signatures.serialize_rctsig_base(ar, vin.size(), vout.size());
|
|
|
|
if (!r || !ar.stream().good()) return false;
|
|
|
|
ar.end_object();
|
|
|
|
}
|
|
|
|
}
|
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
|
|
|
if (!typename Archive<W>::is_saving())
|
|
|
|
pruned = true;
|
2019-04-16 20:48:40 +02:00
|
|
|
return ar.stream().good();
|
2017-02-27 21:24:39 +01:00
|
|
|
}
|
|
|
|
|
2014-09-25 08:24:42 +02:00
|
|
|
private:
|
2014-03-03 23:07:58 +01:00
|
|
|
static size_t get_signature_size(const txin_v& tx_in);
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
inline
|
|
|
|
transaction::transaction()
|
|
|
|
{
|
|
|
|
set_null();
|
|
|
|
}
|
|
|
|
|
|
|
|
inline
|
|
|
|
transaction::~transaction()
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
inline
|
|
|
|
void transaction::set_null()
|
|
|
|
{
|
2018-11-30 15:54:46 +01:00
|
|
|
transaction_prefix::set_null();
|
2014-03-03 23:07:58 +01:00
|
|
|
signatures.clear();
|
Version 0.4.0 Release Candidate (#216)
* core: submit uptime proof immediately after registering
* Increase visibility of autostaking prompts
* quorum_cop: changed uptime proof prune timeout to 2 hours 10 minutes
* cleanup: removed scope limiting block
* check_tx_inputs: fix deregister double spend test to include deregisters from other heights
* config: new testnet network id, genesis tx, and version bump
* wallet2: fix testnet wallet blockheight approximation
* Fix change in address format in RPC which broke parsing and pooling contributors (#184)
* Fix service node endpoints for RPC to also use stdout (#185)
* fixed some further rct core tests (#180)
* Fix service node state by calling detached hooks on failure to switch to alt chain (#188)
* fixed block verification core tests (#186)
* fixed block verification core tests
* core tests: removed gen_block_miner_tx_out_is_small which is only relevant to hardfork version 1
* Don't consider expired deregistrations when filling block template
* Add unit tests for getting staking requirement (#191)
* First service node test (#190)
* core_tests: added service node tests
* core_tests: check balance after registration tx
* Fix underflow for popping rollback events (#189)
* Move deregistration age check into check_tx_inputs
* Zero initialise rct_signatures member txnFee is a uint64_t and has uninit values
* Enforce that deregisters must be 0 fee since we skip checks
* Add unit tests for vote validation (#193)
* Add unit tests for deregistration validation (#194)
* Mainnet checkpoint 86535, testnet 3591, 4166
* Bump version number
* Add print_sr for getting staking requirement (#198)
* Misc bugfixes (#203)
* removed unnecessary cast to double during txfee+coinbase calculation
* simplewallet: increased autostaking interval from 2 minutes to 40
* Fix casting issues from uint to int (#204)
* core_tests: check service node registration and expiration (#195)
* core_tests: check service node registration and deregistration
* core_tests for service nodes:
- include service nodes rewards when calculating account's balance
- check that service nodes rewards have been received
* fixed namespace error; reduced the scope of staking requirement constants
* On blockchain inc/dec mark deregisters relayble based on age (#201)
* Service nodes restore only 1 rollback bug (#206)
* Fix restore 1 rollback event, ensure prevent rollback is always added
* Remove adding prevent_rollback event at init
It gets called in on block added generic anyway.
* Log db exception, fix relation operators for vote/deregister lifetime (#207)
* Filter relayable deregisters w/ check_tx_inputs instead of blockchain callbacks
* Bump version to 0.3.7-beta
* fix build with GCC 8.1.0 (#211)
* Add temp hardfork rule in testnet for deregister lifetimes (#210)
* Update testnet, remove testnet forks, remove checkpoints, update blockheight estimate (#212)
* Don't ban peers for a bad vote, just drop their connection (#213)
* Update to version 0.3.0 release candidate (#215)
2018-09-07 07:14:28 +02:00
|
|
|
rct_signatures = {};
|
2016-08-12 19:45:07 +02:00
|
|
|
rct_signatures.type = rct::RCTTypeNull;
|
2017-03-25 10:18:53 +01:00
|
|
|
set_hash_valid(false);
|
|
|
|
set_blob_size_valid(false);
|
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
|
|
|
pruned = false;
|
2018-11-11 14:39:00 +01:00
|
|
|
unprunable_size = 0;
|
|
|
|
prefix_size = 0;
|
2017-03-22 19:01:09 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
inline
|
|
|
|
void transaction::invalidate_hashes()
|
|
|
|
{
|
2017-03-25 10:18:53 +01:00
|
|
|
set_hash_valid(false);
|
|
|
|
set_blob_size_valid(false);
|
2014-03-03 23:07:58 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
inline
|
|
|
|
size_t transaction::get_signature_size(const txin_v& tx_in)
|
|
|
|
{
|
|
|
|
struct txin_signature_size_visitor : public boost::static_visitor<size_t>
|
|
|
|
{
|
|
|
|
size_t operator()(const txin_gen& txin) const{return 0;}
|
|
|
|
size_t operator()(const txin_to_script& txin) const{return 0;}
|
|
|
|
size_t operator()(const txin_to_scripthash& txin) const{return 0;}
|
|
|
|
size_t operator()(const txin_to_key& txin) const {return txin.key_offsets.size();}
|
|
|
|
};
|
|
|
|
|
|
|
|
return boost::apply_visitor(txin_signature_size_visitor(), tx_in);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/************************************************************************/
|
|
|
|
/* */
|
|
|
|
/************************************************************************/
|
|
|
|
struct block_header
|
|
|
|
{
|
2019-02-21 05:40:44 +01:00
|
|
|
uint8_t major_version = cryptonote::network_version_7;
|
|
|
|
uint8_t minor_version = cryptonote::network_version_7; // now used as a voting mechanism, rather than how this particular block is built
|
2014-03-03 23:07:58 +01:00
|
|
|
uint64_t timestamp;
|
|
|
|
crypto::hash prev_id;
|
|
|
|
uint32_t nonce;
|
|
|
|
|
|
|
|
BEGIN_SERIALIZE()
|
2015-11-30 10:07:22 +01:00
|
|
|
VARINT_FIELD(major_version)
|
|
|
|
VARINT_FIELD(minor_version)
|
2014-03-03 23:07:58 +01:00
|
|
|
VARINT_FIELD(timestamp)
|
|
|
|
FIELD(prev_id)
|
|
|
|
FIELD(nonce)
|
|
|
|
END_SERIALIZE()
|
|
|
|
};
|
|
|
|
|
|
|
|
struct block: public block_header
|
|
|
|
{
|
2017-03-25 10:18:53 +01:00
|
|
|
private:
|
|
|
|
// hash cash
|
|
|
|
mutable std::atomic<bool> hash_valid;
|
|
|
|
|
|
|
|
public:
|
2017-03-22 19:01:09 +01:00
|
|
|
block(): block_header(), hash_valid(false) {}
|
2017-03-25 10:18:53 +01:00
|
|
|
block(const block &b): block_header(b), hash_valid(false), miner_tx(b.miner_tx), tx_hashes(b.tx_hashes) { if (b.is_hash_valid()) { hash = b.hash; set_hash_valid(true); } }
|
|
|
|
block &operator=(const block &b) { block_header::operator=(b); hash_valid = false; miner_tx = b.miner_tx; tx_hashes = b.tx_hashes; if (b.is_hash_valid()) { hash = b.hash; set_hash_valid(true); } return *this; }
|
|
|
|
void invalidate_hashes() { set_hash_valid(false); }
|
|
|
|
bool is_hash_valid() const { return hash_valid.load(std::memory_order_acquire); }
|
|
|
|
void set_hash_valid(bool v) const { hash_valid.store(v,std::memory_order_release); }
|
2017-03-22 19:01:09 +01:00
|
|
|
|
2014-03-03 23:07:58 +01:00
|
|
|
transaction miner_tx;
|
|
|
|
std::vector<crypto::hash> tx_hashes;
|
|
|
|
|
2017-03-22 19:01:09 +01:00
|
|
|
// hash cash
|
|
|
|
mutable crypto::hash hash;
|
|
|
|
|
2014-03-03 23:07:58 +01:00
|
|
|
BEGIN_SERIALIZE_OBJECT()
|
2017-03-22 19:01:09 +01:00
|
|
|
if (!typename Archive<W>::is_saving())
|
2017-03-25 10:18:53 +01:00
|
|
|
set_hash_valid(false);
|
2017-03-22 19:01:09 +01:00
|
|
|
|
2014-03-03 23:07:58 +01:00
|
|
|
FIELDS(*static_cast<block_header *>(this))
|
|
|
|
FIELD(miner_tx)
|
|
|
|
FIELD(tx_hashes)
|
2019-04-04 02:15:57 +02:00
|
|
|
if (tx_hashes.size() > CRYPTONOTE_MAX_TX_PER_BLOCK)
|
|
|
|
return false;
|
2014-03-03 23:07:58 +01:00
|
|
|
END_SERIALIZE()
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/************************************************************************/
|
|
|
|
/* */
|
|
|
|
/************************************************************************/
|
|
|
|
struct account_public_address
|
|
|
|
{
|
|
|
|
crypto::public_key m_spend_public_key;
|
|
|
|
crypto::public_key m_view_public_key;
|
|
|
|
|
|
|
|
BEGIN_SERIALIZE_OBJECT()
|
|
|
|
FIELD(m_spend_public_key)
|
|
|
|
FIELD(m_view_public_key)
|
|
|
|
END_SERIALIZE()
|
|
|
|
|
|
|
|
BEGIN_KV_SERIALIZE_MAP()
|
|
|
|
KV_SERIALIZE_VAL_POD_AS_BLOB_FORCE(m_spend_public_key)
|
|
|
|
KV_SERIALIZE_VAL_POD_AS_BLOB_FORCE(m_view_public_key)
|
|
|
|
END_KV_SERIALIZE_MAP()
|
2017-02-19 03:42:10 +01:00
|
|
|
|
|
|
|
bool operator==(const account_public_address& rhs) const
|
|
|
|
{
|
|
|
|
return m_spend_public_key == rhs.m_spend_public_key &&
|
|
|
|
m_view_public_key == rhs.m_view_public_key;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool operator!=(const account_public_address& rhs) const
|
|
|
|
{
|
|
|
|
return !(*this == rhs);
|
|
|
|
}
|
2014-03-03 23:07:58 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
struct keypair
|
|
|
|
{
|
|
|
|
crypto::public_key pub;
|
|
|
|
crypto::secret_key sec;
|
|
|
|
|
2018-02-20 17:01:27 +01:00
|
|
|
static inline keypair generate(hw::device &hwdev)
|
|
|
|
{
|
|
|
|
keypair k;
|
2018-03-05 08:16:30 +01:00
|
|
|
hwdev.generate_keys(k.pub, k.sec);
|
2018-02-20 17:01:27 +01:00
|
|
|
return k;
|
|
|
|
}
|
2014-03-03 23:07:58 +01:00
|
|
|
};
|
|
|
|
//---------------------------------------------------------------
|
2019-03-29 06:40:21 +01:00
|
|
|
inline static cryptonote::network_type validate_nettype(cryptonote::network_type nettype)
|
|
|
|
{
|
|
|
|
cryptonote::network_type result = nettype;
|
|
|
|
assert(result != UNDEFINED);
|
|
|
|
if (result == UNDEFINED)
|
|
|
|
{
|
|
|
|
LOG_ERROR("Min/Max version query network type unexpectedly set to UNDEFINED, defaulting to MAINNET");
|
|
|
|
result = MAINNET;
|
|
|
|
}
|
|
|
|
return result;
|
|
|
|
}
|
|
|
|
|
2019-06-26 06:00:05 +02:00
|
|
|
inline enum txversion transaction_prefix::get_max_version_for_hf(uint8_t hf_version, cryptonote::network_type nettype)
|
2019-01-25 04:15:52 +01:00
|
|
|
{
|
2019-03-29 06:40:21 +01:00
|
|
|
nettype = validate_nettype(nettype);
|
2019-01-25 04:15:52 +01:00
|
|
|
if (hf_version >= cryptonote::network_version_7 && hf_version <= cryptonote::network_version_8)
|
2019-06-11 20:53:46 +02:00
|
|
|
return txversion::v2_ringct;
|
2019-01-25 04:15:52 +01:00
|
|
|
|
|
|
|
if (hf_version >= cryptonote::network_version_9_service_nodes && hf_version <= cryptonote::network_version_10_bulletproofs)
|
2019-06-11 20:53:46 +02:00
|
|
|
return txversion::v3_per_output_unlock_times;
|
2014-03-03 23:07:58 +01:00
|
|
|
|
2019-06-11 20:53:46 +02:00
|
|
|
return txversion::v4_tx_types;
|
2019-01-25 04:15:52 +01:00
|
|
|
}
|
|
|
|
|
2019-06-26 06:00:05 +02:00
|
|
|
inline enum txversion transaction_prefix::get_min_version_for_hf(uint8_t hf_version, cryptonote::network_type nettype, bool miner_tx)
|
2019-01-25 04:15:52 +01:00
|
|
|
{
|
2019-03-29 06:40:21 +01:00
|
|
|
nettype = validate_nettype(nettype);
|
|
|
|
if (nettype == MAINNET) // NOTE(loki): Add an exception for mainnet as there are v2's on mainnet.
|
2019-02-22 01:26:07 +01:00
|
|
|
{
|
|
|
|
if (hf_version == cryptonote::network_version_10_bulletproofs)
|
2019-06-11 20:53:46 +02:00
|
|
|
return txversion::v2_ringct;
|
2019-06-26 05:36:58 +02:00
|
|
|
|
|
|
|
if (miner_tx && hf_version <= cryptonote::network_version_12_checkpointing) // NOTE: Merge mining
|
|
|
|
return txversion::v2_ringct;
|
2019-02-22 01:26:07 +01:00
|
|
|
}
|
|
|
|
|
2019-01-25 04:15:52 +01:00
|
|
|
if (hf_version >= cryptonote::network_version_7 && hf_version <= cryptonote::network_version_9_service_nodes)
|
2019-06-11 20:53:46 +02:00
|
|
|
return txversion::v2_ringct;
|
2019-01-25 04:15:52 +01:00
|
|
|
|
|
|
|
if (hf_version == cryptonote::network_version_10_bulletproofs)
|
2019-06-11 20:53:46 +02:00
|
|
|
return txversion::v3_per_output_unlock_times;
|
2019-01-25 04:15:52 +01:00
|
|
|
|
2019-06-11 20:53:46 +02:00
|
|
|
return txversion::v4_tx_types;
|
2019-01-25 04:15:52 +01:00
|
|
|
}
|
|
|
|
|
2019-06-11 20:53:46 +02:00
|
|
|
inline char const *transaction_prefix::version_to_string(txversion v)
|
2019-01-25 04:15:52 +01:00
|
|
|
{
|
2019-06-11 20:53:46 +02:00
|
|
|
switch(v)
|
2019-01-25 04:15:52 +01:00
|
|
|
{
|
2019-06-11 20:53:46 +02:00
|
|
|
case txversion::v1: return "1";
|
|
|
|
case txversion::v2_ringct: return "2_ringct";
|
|
|
|
case txversion::v3_per_output_unlock_times: return "3_per_output_unlock_times";
|
|
|
|
case txversion::v4_tx_types: return "4_tx_types";
|
|
|
|
default: assert(false); return "xx_unhandled_version";
|
2019-01-25 04:15:52 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-06-11 20:53:46 +02:00
|
|
|
inline char const *transaction_prefix::type_to_string(txtype type)
|
2019-01-25 04:15:52 +01:00
|
|
|
{
|
2019-06-11 20:53:46 +02:00
|
|
|
switch(type)
|
2019-01-25 04:15:52 +01:00
|
|
|
{
|
2019-06-11 20:53:46 +02:00
|
|
|
case txtype::standard: return "standard";
|
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
|
|
|
case txtype::state_change: return "state_change";
|
2019-06-11 20:53:46 +02:00
|
|
|
case txtype::key_image_unlock: return "key_image_unlock";
|
|
|
|
default: assert(false); return "xx_unhandled_type";
|
2019-01-25 04:15:52 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-06-11 20:53:46 +02:00
|
|
|
inline std::ostream &operator<<(std::ostream &os, txtype t) {
|
|
|
|
return os << transaction::type_to_string(t);
|
2019-01-25 04:15:52 +01:00
|
|
|
}
|
2019-06-11 20:53:46 +02:00
|
|
|
inline std::ostream &operator<<(std::ostream &os, txversion v) {
|
|
|
|
return os << transaction::version_to_string(v);
|
2019-01-25 04:15:52 +01:00
|
|
|
}
|
2014-03-03 23:07:58 +01:00
|
|
|
}
|
|
|
|
|
2017-02-19 03:42:10 +01:00
|
|
|
namespace std {
|
|
|
|
template <>
|
|
|
|
struct hash<cryptonote::account_public_address>
|
|
|
|
{
|
|
|
|
std::size_t operator()(const cryptonote::account_public_address& addr) const
|
|
|
|
{
|
|
|
|
// https://stackoverflow.com/a/17017281
|
|
|
|
size_t res = 17;
|
|
|
|
res = res * 31 + hash<crypto::public_key>()(addr.m_spend_public_key);
|
|
|
|
res = res * 31 + hash<crypto::public_key>()(addr.m_view_public_key);
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2014-03-03 23:07:58 +01:00
|
|
|
BLOB_SERIALIZER(cryptonote::txout_to_key);
|
|
|
|
BLOB_SERIALIZER(cryptonote::txout_to_scripthash);
|
|
|
|
|
|
|
|
VARIANT_TAG(binary_archive, cryptonote::txin_gen, 0xff);
|
|
|
|
VARIANT_TAG(binary_archive, cryptonote::txin_to_script, 0x0);
|
|
|
|
VARIANT_TAG(binary_archive, cryptonote::txin_to_scripthash, 0x1);
|
|
|
|
VARIANT_TAG(binary_archive, cryptonote::txin_to_key, 0x2);
|
|
|
|
VARIANT_TAG(binary_archive, cryptonote::txout_to_script, 0x0);
|
|
|
|
VARIANT_TAG(binary_archive, cryptonote::txout_to_scripthash, 0x1);
|
|
|
|
VARIANT_TAG(binary_archive, cryptonote::txout_to_key, 0x2);
|
|
|
|
VARIANT_TAG(binary_archive, cryptonote::transaction, 0xcc);
|
|
|
|
VARIANT_TAG(binary_archive, cryptonote::block, 0xbb);
|
|
|
|
|
|
|
|
VARIANT_TAG(json_archive, cryptonote::txin_gen, "gen");
|
|
|
|
VARIANT_TAG(json_archive, cryptonote::txin_to_script, "script");
|
|
|
|
VARIANT_TAG(json_archive, cryptonote::txin_to_scripthash, "scripthash");
|
|
|
|
VARIANT_TAG(json_archive, cryptonote::txin_to_key, "key");
|
|
|
|
VARIANT_TAG(json_archive, cryptonote::txout_to_script, "script");
|
|
|
|
VARIANT_TAG(json_archive, cryptonote::txout_to_scripthash, "scripthash");
|
|
|
|
VARIANT_TAG(json_archive, cryptonote::txout_to_key, "key");
|
|
|
|
VARIANT_TAG(json_archive, cryptonote::transaction, "tx");
|
|
|
|
VARIANT_TAG(json_archive, cryptonote::block, "block");
|
|
|
|
|
|
|
|
VARIANT_TAG(debug_archive, cryptonote::txin_gen, "gen");
|
|
|
|
VARIANT_TAG(debug_archive, cryptonote::txin_to_script, "script");
|
|
|
|
VARIANT_TAG(debug_archive, cryptonote::txin_to_scripthash, "scripthash");
|
|
|
|
VARIANT_TAG(debug_archive, cryptonote::txin_to_key, "key");
|
|
|
|
VARIANT_TAG(debug_archive, cryptonote::txout_to_script, "script");
|
|
|
|
VARIANT_TAG(debug_archive, cryptonote::txout_to_scripthash, "scripthash");
|
|
|
|
VARIANT_TAG(debug_archive, cryptonote::txout_to_key, "key");
|
|
|
|
VARIANT_TAG(debug_archive, cryptonote::transaction, "tx");
|
|
|
|
VARIANT_TAG(debug_archive, cryptonote::block, "block");
|