2020-05-07 02:36:54 +00:00
// Copyright (c) 2014-2020, The Monero Project
2014-07-23 13:03:52 +00: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 22:07:58 +00:00
# pragma once
# include <list>
# include "serialization/keyvalue_serialization.h"
2017-01-26 15:07:23 +00:00
# include "cryptonote_basic/cryptonote_basic.h"
2017-11-25 22:25:05 +00:00
# include "cryptonote_basic/blobdatatype.h"
2019-01-31 10:44:08 +00:00
2014-03-03 22:07:58 +00:00
namespace cryptonote
{
# define BC_COMMANDS_POOL_BASE 2000
2014-07-18 23:33:03 +00:00
/************************************************************************/
/* P2P connection info, serializable to json */
/************************************************************************/
struct connection_info
{
bool incoming ;
2015-04-01 17:00:45 +00:00
bool localhost ;
bool local_ip ;
epee: add SSL support
RPC connections now have optional tranparent SSL.
An optional private key and certificate file can be passed,
using the --{rpc,daemon}-ssl-private-key and
--{rpc,daemon}-ssl-certificate options. Those have as
argument a path to a PEM format private private key and
certificate, respectively.
If not given, a temporary self signed certificate will be used.
SSL can be enabled or disabled using --{rpc}-ssl, which
accepts autodetect (default), disabled or enabled.
Access can be restricted to particular certificates using the
--rpc-ssl-allowed-certificates, which takes a list of
paths to PEM encoded certificates. This can allow a wallet to
connect to only the daemon they think they're connected to,
by forcing SSL and listing the paths to the known good
certificates.
To generate long term certificates:
openssl genrsa -out /tmp/KEY 4096
openssl req -new -key /tmp/KEY -out /tmp/REQ
openssl x509 -req -days 999999 -sha256 -in /tmp/REQ -signkey /tmp/KEY -out /tmp/CERT
/tmp/KEY is the private key, and /tmp/CERT is the certificate,
both in PEM format. /tmp/REQ can be removed. Adjust the last
command to set expiration date, etc, as needed. It doesn't
make a whole lot of sense for monero anyway, since most servers
will run with one time temporary self signed certificates anyway.
SSL support is transparent, so all communication is done on the
existing ports, with SSL autodetection. This means you can start
using an SSL daemon now, but you should not enforce SSL yet or
nothing will talk to you.
2018-06-14 22:44:48 +00:00
bool ssl ;
2014-07-18 23:33:03 +00:00
2017-05-27 10:35:54 +00:00
std : : string address ;
std : : string host ;
2014-07-18 23:33:03 +00:00
std : : string ip ;
std : : string port ;
2019-02-24 08:47:49 +00:00
uint16_t rpc_port ;
daemon, wallet: new pay for RPC use system
Daemons intended for public use can be set up to require payment
in the form of hashes in exchange for RPC service. This enables
public daemons to receive payment for their work over a large
number of calls. This system behaves similarly to a pool, so
payment takes the form of valid blocks every so often, yielding
a large one off payment, rather than constant micropayments.
This system can also be used by third parties as a "paywall"
layer, where users of a service can pay for use by mining Monero
to the service provider's address. An example of this for web
site access is Primo, a Monero mining based website "paywall":
https://github.com/selene-kovri/primo
This has some advantages:
- incentive to run a node providing RPC services, thereby promoting the availability of third party nodes for those who can't run their own
- incentive to run your own node instead of using a third party's, thereby promoting decentralization
- decentralized: payment is done between a client and server, with no third party needed
- private: since the system is "pay as you go", you don't need to identify yourself to claim a long lived balance
- no payment occurs on the blockchain, so there is no extra transactional load
- one may mine with a beefy server, and use those credits from a phone, by reusing the client ID (at the cost of some privacy)
- no barrier to entry: anyone may run a RPC node, and your expected revenue depends on how much work you do
- Sybil resistant: if you run 1000 idle RPC nodes, you don't magically get more revenue
- no large credit balance maintained on servers, so they have no incentive to exit scam
- you can use any/many node(s), since there's little cost in switching servers
- market based prices: competition between servers to lower costs
- incentive for a distributed third party node system: if some public nodes are overused/slow, traffic can move to others
- increases network security
- helps counteract mining pools' share of the network hash rate
- zero incentive for a payer to "double spend" since a reorg does not give any money back to the miner
And some disadvantages:
- low power clients will have difficulty mining (but one can optionally mine in advance and/or with a faster machine)
- payment is "random", so a server might go a long time without a block before getting one
- a public node's overall expected payment may be small
Public nodes are expected to compete to find a suitable level for
cost of service.
The daemon can be set up this way to require payment for RPC services:
monerod --rpc-payment-address 4xxxxxx \
--rpc-payment-credits 250 --rpc-payment-difficulty 1000
These values are an example only.
The --rpc-payment-difficulty switch selects how hard each "share" should
be, similar to a mining pool. The higher the difficulty, the fewer
shares a client will find.
The --rpc-payment-credits switch selects how many credits are awarded
for each share a client finds.
Considering both options, clients will be awarded credits/difficulty
credits for every hash they calculate. For example, in the command line
above, 0.25 credits per hash. A client mining at 100 H/s will therefore
get an average of 25 credits per second.
For reference, in the current implementation, a credit is enough to
sync 20 blocks, so a 100 H/s client that's just starting to use Monero
and uses this daemon will be able to sync 500 blocks per second.
The wallet can be set to automatically mine if connected to a daemon
which requires payment for RPC usage. It will try to keep a balance
of 50000 credits, stopping mining when it's at this level, and starting
again as credits are spent. With the example above, a new client will
mine this much credits in about half an hour, and this target is enough
to sync 500000 blocks (currently about a third of the monero blockchain).
There are three new settings in the wallet:
- credits-target: this is the amount of credits a wallet will try to
reach before stopping mining. The default of 0 means 50000 credits.
- auto-mine-for-rpc-payment-threshold: this controls the minimum
credit rate which the wallet considers worth mining for. If the
daemon credits less than this ratio, the wallet will consider mining
to be not worth it. In the example above, the rate is 0.25
- persistent-rpc-client-id: if set, this allows the wallet to reuse
a client id across runs. This means a public node can tell a wallet
that's connecting is the same as one that connected previously, but
allows a wallet to keep their credit balance from one run to the
other. Since the wallet only mines to keep a small credit balance,
this is not normally worth doing. However, someone may want to mine
on a fast server, and use that credit balance on a low power device
such as a phone. If left unset, a new client ID is generated at
each wallet start, for privacy reasons.
To mine and use a credit balance on two different devices, you can
use the --rpc-client-secret-key switch. A wallet's client secret key
can be found using the new rpc_payments command in the wallet.
Note: anyone knowing your RPC client secret key is able to use your
credit balance.
The wallet has a few new commands too:
- start_mining_for_rpc: start mining to acquire more credits,
regardless of the auto mining settings
- stop_mining_for_rpc: stop mining to acquire more credits
- rpc_payments: display information about current credits with
the currently selected daemon
The node has an extra command:
- rpc_payments: display information about clients and their
balances
The node will forget about any balance for clients which have
been inactive for 6 months. Balances carry over on node restart.
2018-02-11 15:15:56 +00:00
uint32_t rpc_credits_per_hash ;
2014-07-18 23:33:03 +00:00
std : : string peer_id ;
uint64_t recv_count ;
2014-07-23 09:59:31 +00:00
uint64_t recv_idle_time ;
2014-07-18 23:33:03 +00:00
uint64_t send_count ;
2014-07-23 09:59:31 +00:00
uint64_t send_idle_time ;
2014-07-18 23:33:03 +00:00
std : : string state ;
2014-07-23 09:59:31 +00:00
uint64_t live_time ;
2014-07-18 23:33:03 +00:00
2015-04-01 17:00:45 +00:00
uint64_t avg_download ;
uint64_t current_download ;
uint64_t avg_upload ;
uint64_t current_upload ;
2016-10-26 19:00:08 +00:00
uint32_t support_flags ;
2015-04-01 17:00:45 +00:00
2017-11-17 23:52:50 +00:00
std : : string connection_id ;
2017-07-02 21:41:15 +00:00
2017-08-12 09:59:54 +00:00
uint64_t height ;
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-29 22:30:51 +00:00
uint32_t pruning_seed ;
2019-05-31 09:09:24 +00:00
uint8_t address_type ;
2014-07-18 23:33:03 +00:00
BEGIN_KV_SERIALIZE_MAP ( )
KV_SERIALIZE ( incoming )
2015-04-01 17:00:45 +00:00
KV_SERIALIZE ( localhost )
KV_SERIALIZE ( local_ip )
2017-05-27 10:35:54 +00:00
KV_SERIALIZE ( address )
KV_SERIALIZE ( host )
2014-07-18 23:33:03 +00:00
KV_SERIALIZE ( ip )
KV_SERIALIZE ( port )
2019-02-24 08:47:49 +00:00
KV_SERIALIZE ( rpc_port )
daemon, wallet: new pay for RPC use system
Daemons intended for public use can be set up to require payment
in the form of hashes in exchange for RPC service. This enables
public daemons to receive payment for their work over a large
number of calls. This system behaves similarly to a pool, so
payment takes the form of valid blocks every so often, yielding
a large one off payment, rather than constant micropayments.
This system can also be used by third parties as a "paywall"
layer, where users of a service can pay for use by mining Monero
to the service provider's address. An example of this for web
site access is Primo, a Monero mining based website "paywall":
https://github.com/selene-kovri/primo
This has some advantages:
- incentive to run a node providing RPC services, thereby promoting the availability of third party nodes for those who can't run their own
- incentive to run your own node instead of using a third party's, thereby promoting decentralization
- decentralized: payment is done between a client and server, with no third party needed
- private: since the system is "pay as you go", you don't need to identify yourself to claim a long lived balance
- no payment occurs on the blockchain, so there is no extra transactional load
- one may mine with a beefy server, and use those credits from a phone, by reusing the client ID (at the cost of some privacy)
- no barrier to entry: anyone may run a RPC node, and your expected revenue depends on how much work you do
- Sybil resistant: if you run 1000 idle RPC nodes, you don't magically get more revenue
- no large credit balance maintained on servers, so they have no incentive to exit scam
- you can use any/many node(s), since there's little cost in switching servers
- market based prices: competition between servers to lower costs
- incentive for a distributed third party node system: if some public nodes are overused/slow, traffic can move to others
- increases network security
- helps counteract mining pools' share of the network hash rate
- zero incentive for a payer to "double spend" since a reorg does not give any money back to the miner
And some disadvantages:
- low power clients will have difficulty mining (but one can optionally mine in advance and/or with a faster machine)
- payment is "random", so a server might go a long time without a block before getting one
- a public node's overall expected payment may be small
Public nodes are expected to compete to find a suitable level for
cost of service.
The daemon can be set up this way to require payment for RPC services:
monerod --rpc-payment-address 4xxxxxx \
--rpc-payment-credits 250 --rpc-payment-difficulty 1000
These values are an example only.
The --rpc-payment-difficulty switch selects how hard each "share" should
be, similar to a mining pool. The higher the difficulty, the fewer
shares a client will find.
The --rpc-payment-credits switch selects how many credits are awarded
for each share a client finds.
Considering both options, clients will be awarded credits/difficulty
credits for every hash they calculate. For example, in the command line
above, 0.25 credits per hash. A client mining at 100 H/s will therefore
get an average of 25 credits per second.
For reference, in the current implementation, a credit is enough to
sync 20 blocks, so a 100 H/s client that's just starting to use Monero
and uses this daemon will be able to sync 500 blocks per second.
The wallet can be set to automatically mine if connected to a daemon
which requires payment for RPC usage. It will try to keep a balance
of 50000 credits, stopping mining when it's at this level, and starting
again as credits are spent. With the example above, a new client will
mine this much credits in about half an hour, and this target is enough
to sync 500000 blocks (currently about a third of the monero blockchain).
There are three new settings in the wallet:
- credits-target: this is the amount of credits a wallet will try to
reach before stopping mining. The default of 0 means 50000 credits.
- auto-mine-for-rpc-payment-threshold: this controls the minimum
credit rate which the wallet considers worth mining for. If the
daemon credits less than this ratio, the wallet will consider mining
to be not worth it. In the example above, the rate is 0.25
- persistent-rpc-client-id: if set, this allows the wallet to reuse
a client id across runs. This means a public node can tell a wallet
that's connecting is the same as one that connected previously, but
allows a wallet to keep their credit balance from one run to the
other. Since the wallet only mines to keep a small credit balance,
this is not normally worth doing. However, someone may want to mine
on a fast server, and use that credit balance on a low power device
such as a phone. If left unset, a new client ID is generated at
each wallet start, for privacy reasons.
To mine and use a credit balance on two different devices, you can
use the --rpc-client-secret-key switch. A wallet's client secret key
can be found using the new rpc_payments command in the wallet.
Note: anyone knowing your RPC client secret key is able to use your
credit balance.
The wallet has a few new commands too:
- start_mining_for_rpc: start mining to acquire more credits,
regardless of the auto mining settings
- stop_mining_for_rpc: stop mining to acquire more credits
- rpc_payments: display information about current credits with
the currently selected daemon
The node has an extra command:
- rpc_payments: display information about clients and their
balances
The node will forget about any balance for clients which have
been inactive for 6 months. Balances carry over on node restart.
2018-02-11 15:15:56 +00:00
KV_SERIALIZE ( rpc_credits_per_hash )
2014-07-18 23:33:03 +00:00
KV_SERIALIZE ( peer_id )
KV_SERIALIZE ( recv_count )
KV_SERIALIZE ( recv_idle_time )
KV_SERIALIZE ( send_count )
KV_SERIALIZE ( send_idle_time )
KV_SERIALIZE ( state )
KV_SERIALIZE ( live_time )
2015-04-01 17:00:45 +00:00
KV_SERIALIZE ( avg_download )
KV_SERIALIZE ( current_download )
KV_SERIALIZE ( avg_upload )
KV_SERIALIZE ( current_upload )
2016-10-26 19:00:08 +00:00
KV_SERIALIZE ( support_flags )
2017-11-17 23:52:50 +00:00
KV_SERIALIZE ( connection_id )
2017-08-12 09:59:54 +00:00
KV_SERIALIZE ( height )
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-29 22:30:51 +00:00
KV_SERIALIZE ( pruning_seed )
2019-05-31 09:09:24 +00:00
KV_SERIALIZE ( address_type )
2014-07-18 23:33:03 +00:00
END_KV_SERIALIZE_MAP ( )
} ;
2014-03-03 22:07:58 +00:00
/************************************************************************/
/* */
/************************************************************************/
2019-09-16 12:18:34 +00:00
struct tx_blob_entry
{
blobdata blob ;
crypto : : hash prunable_hash ;
BEGIN_KV_SERIALIZE_MAP ( )
KV_SERIALIZE ( blob )
KV_SERIALIZE_VAL_POD_AS_BLOB ( prunable_hash )
END_KV_SERIALIZE_MAP ( )
tx_blob_entry ( const blobdata & bd = { } , const crypto : : hash & h = crypto : : null_hash ) : blob ( bd ) , prunable_hash ( h ) { }
} ;
2014-03-03 22:07:58 +00:00
struct block_complete_entry
{
2019-09-16 12:18:34 +00:00
bool pruned ;
2014-03-03 22:07:58 +00:00
blobdata block ;
2019-09-16 12:18:34 +00:00
uint64_t block_weight ;
std : : vector < tx_blob_entry > txs ;
2014-03-03 22:07:58 +00:00
BEGIN_KV_SERIALIZE_MAP ( )
2019-09-16 12:18:34 +00:00
KV_SERIALIZE_OPT ( pruned , false )
2014-03-03 22:07:58 +00:00
KV_SERIALIZE ( block )
2019-09-16 12:18:34 +00:00
KV_SERIALIZE_OPT ( block_weight , ( uint64_t ) 0 )
if ( this_ref . pruned )
{
KV_SERIALIZE ( txs )
}
else
{
std : : vector < blobdata > txs ;
if ( is_store )
{
txs . reserve ( this_ref . txs . size ( ) ) ;
for ( const auto & e : this_ref . txs ) txs . push_back ( e . blob ) ;
}
epee : : serialization : : selector < is_store > : : serialize ( txs , stg , hparent_section , " txs " ) ;
if ( ! is_store )
{
block_complete_entry & self = const_cast < block_complete_entry & > ( this_ref ) ;
self . txs . clear ( ) ;
self . txs . reserve ( txs . size ( ) ) ;
for ( auto & e : txs ) self . txs . push_back ( { std : : move ( e ) , crypto : : null_hash } ) ;
}
}
2014-03-03 22:07:58 +00:00
END_KV_SERIALIZE_MAP ( )
2019-09-16 12:18:34 +00:00
2019-10-11 10:37:39 +00:00
block_complete_entry ( ) : pruned ( false ) , block_weight ( 0 ) { }
2014-03-03 22:07:58 +00:00
} ;
/************************************************************************/
/* */
/************************************************************************/
struct NOTIFY_NEW_BLOCK
{
const static int ID = BC_COMMANDS_POOL_BASE + 1 ;
2019-01-18 01:05:58 +00:00
struct request_t
2014-03-03 22:07:58 +00:00
{
block_complete_entry b ;
uint64_t current_blockchain_height ;
BEGIN_KV_SERIALIZE_MAP ( )
KV_SERIALIZE ( b )
KV_SERIALIZE ( current_blockchain_height )
END_KV_SERIALIZE_MAP ( )
} ;
2019-01-18 01:05:58 +00:00
typedef epee : : misc_utils : : struct_init < request_t > request ;
2014-03-03 22:07:58 +00:00
} ;
/************************************************************************/
/* */
/************************************************************************/
struct NOTIFY_NEW_TRANSACTIONS
{
const static int ID = BC_COMMANDS_POOL_BASE + 2 ;
2019-01-18 01:05:58 +00:00
struct request_t
2014-03-03 22:07:58 +00:00
{
2018-04-15 23:16:02 +00:00
std : : vector < blobdata > txs ;
2018-11-02 22:27:25 +00:00
std : : string _ ; // padding
2019-11-13 14:12:32 +00:00
bool dandelionpp_fluff ; //zero initialization defaults to stem mode
2014-03-03 22:07:58 +00:00
BEGIN_KV_SERIALIZE_MAP ( )
KV_SERIALIZE ( txs )
2018-11-02 22:27:25 +00:00
KV_SERIALIZE ( _ )
2019-11-13 14:12:32 +00:00
KV_SERIALIZE_OPT ( dandelionpp_fluff , true ) // backwards compatible mode is fluff
2014-03-03 22:07:58 +00:00
END_KV_SERIALIZE_MAP ( )
} ;
2019-01-18 01:05:58 +00:00
typedef epee : : misc_utils : : struct_init < request_t > request ;
2014-03-03 22:07:58 +00:00
} ;
/************************************************************************/
/* */
/************************************************************************/
struct NOTIFY_REQUEST_GET_OBJECTS
{
const static int ID = BC_COMMANDS_POOL_BASE + 3 ;
2019-01-18 01:05:58 +00:00
struct request_t
2014-03-03 22:07:58 +00:00
{
2019-05-31 00:59:19 +00:00
std : : vector < crypto : : hash > blocks ;
2019-09-16 12:18:34 +00:00
bool prune ;
2014-03-03 22:07:58 +00:00
BEGIN_KV_SERIALIZE_MAP ( )
KV_SERIALIZE_CONTAINER_POD_AS_BLOB ( blocks )
2019-09-16 12:18:34 +00:00
KV_SERIALIZE_OPT ( prune , false )
2014-03-03 22:07:58 +00:00
END_KV_SERIALIZE_MAP ( )
} ;
2019-01-18 01:05:58 +00:00
typedef epee : : misc_utils : : struct_init < request_t > request ;
2014-03-03 22:07:58 +00:00
} ;
struct NOTIFY_RESPONSE_GET_OBJECTS
{
const static int ID = BC_COMMANDS_POOL_BASE + 4 ;
2019-01-18 01:05:58 +00:00
struct request_t
2014-03-03 22:07:58 +00:00
{
2018-04-15 23:16:02 +00:00
std : : vector < block_complete_entry > blocks ;
std : : vector < crypto : : hash > missed_ids ;
2014-03-03 22:07:58 +00:00
uint64_t current_blockchain_height ;
BEGIN_KV_SERIALIZE_MAP ( )
KV_SERIALIZE ( blocks )
KV_SERIALIZE_CONTAINER_POD_AS_BLOB ( missed_ids )
KV_SERIALIZE ( current_blockchain_height )
END_KV_SERIALIZE_MAP ( )
} ;
2019-01-18 01:05:58 +00:00
typedef epee : : misc_utils : : struct_init < request_t > request ;
2014-03-03 22:07:58 +00:00
} ;
struct CORE_SYNC_DATA
{
uint64_t current_height ;
2017-08-12 14:24:39 +00:00
uint64_t cumulative_difficulty ;
2019-01-31 10:44:08 +00:00
uint64_t cumulative_difficulty_top64 ;
2014-03-03 22:07:58 +00:00
crypto : : hash top_id ;
2017-08-09 08:31:00 +00:00
uint8_t top_version ;
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-29 22:30:51 +00:00
uint32_t pruning_seed ;
2014-03-03 22:07:58 +00:00
BEGIN_KV_SERIALIZE_MAP ( )
KV_SERIALIZE ( current_height )
2017-08-12 14:24:39 +00:00
KV_SERIALIZE ( cumulative_difficulty )
2019-12-04 21:19:40 +00:00
if ( is_store )
KV_SERIALIZE ( cumulative_difficulty_top64 )
else
KV_SERIALIZE_OPT ( cumulative_difficulty_top64 , ( uint64_t ) 0 )
2014-03-03 22:07:58 +00:00
KV_SERIALIZE_VAL_POD_AS_BLOB ( top_id )
2017-08-09 08:31:00 +00:00
KV_SERIALIZE_OPT ( top_version , ( uint8_t ) 0 )
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-29 22:30:51 +00:00
KV_SERIALIZE_OPT ( pruning_seed , ( uint32_t ) 0 )
2014-03-03 22:07:58 +00:00
END_KV_SERIALIZE_MAP ( )
} ;
struct NOTIFY_REQUEST_CHAIN
{
const static int ID = BC_COMMANDS_POOL_BASE + 6 ;
2019-01-18 01:05:58 +00:00
struct request_t
2014-03-03 22:07:58 +00:00
{
std : : list < crypto : : hash > block_ids ; /*IDs of the first 10 blocks are sequential, next goes with pow(2,n) offset, like 2, 4, 8, 16, 32, 64 and so on, and the last one is always genesis block */
2019-09-16 12:18:34 +00:00
bool prune ;
2014-03-03 22:07:58 +00:00
BEGIN_KV_SERIALIZE_MAP ( )
KV_SERIALIZE_CONTAINER_POD_AS_BLOB ( block_ids )
2019-09-16 12:18:34 +00:00
KV_SERIALIZE_OPT ( prune , false )
2014-03-03 22:07:58 +00:00
END_KV_SERIALIZE_MAP ( )
} ;
2019-01-18 01:05:58 +00:00
typedef epee : : misc_utils : : struct_init < request_t > request ;
2014-03-03 22:07:58 +00:00
} ;
struct NOTIFY_RESPONSE_CHAIN_ENTRY
{
const static int ID = BC_COMMANDS_POOL_BASE + 7 ;
2019-01-18 01:05:58 +00:00
struct request_t
2014-03-03 22:07:58 +00:00
{
uint64_t start_height ;
uint64_t total_height ;
2017-08-12 14:24:39 +00:00
uint64_t cumulative_difficulty ;
2019-01-31 10:44:08 +00:00
uint64_t cumulative_difficulty_top64 ;
2018-04-15 23:16:02 +00:00
std : : vector < crypto : : hash > m_block_ids ;
2019-09-16 12:18:34 +00:00
std : : vector < uint64_t > m_block_weights ;
2020-12-11 18:16:10 +00:00
cryptonote : : blobdata first_block ;
2014-03-03 22:07:58 +00:00
BEGIN_KV_SERIALIZE_MAP ( )
KV_SERIALIZE ( start_height )
KV_SERIALIZE ( total_height )
2017-08-12 14:24:39 +00:00
KV_SERIALIZE ( cumulative_difficulty )
2019-12-04 21:19:40 +00:00
if ( is_store )
KV_SERIALIZE ( cumulative_difficulty_top64 )
else
KV_SERIALIZE_OPT ( cumulative_difficulty_top64 , ( uint64_t ) 0 )
2014-03-03 22:07:58 +00:00
KV_SERIALIZE_CONTAINER_POD_AS_BLOB ( m_block_ids )
2019-09-16 12:18:34 +00:00
KV_SERIALIZE_CONTAINER_POD_AS_BLOB ( m_block_weights )
2020-12-11 18:16:10 +00:00
KV_SERIALIZE ( first_block )
2014-03-03 22:07:58 +00:00
END_KV_SERIALIZE_MAP ( )
} ;
2019-01-18 01:05:58 +00:00
typedef epee : : misc_utils : : struct_init < request_t > request ;
2014-03-03 22:07:58 +00:00
} ;
2016-10-26 19:00:08 +00:00
/************************************************************************/
/* */
/************************************************************************/
struct NOTIFY_NEW_FLUFFY_BLOCK
{
const static int ID = BC_COMMANDS_POOL_BASE + 8 ;
2019-01-18 01:05:58 +00:00
struct request_t
2016-10-26 19:00:08 +00:00
{
block_complete_entry b ;
uint64_t current_blockchain_height ;
BEGIN_KV_SERIALIZE_MAP ( )
KV_SERIALIZE ( b )
KV_SERIALIZE ( current_blockchain_height )
END_KV_SERIALIZE_MAP ( )
} ;
2019-01-18 01:05:58 +00:00
typedef epee : : misc_utils : : struct_init < request_t > request ;
2016-10-26 19:00:08 +00:00
} ;
/************************************************************************/
/* */
/************************************************************************/
struct NOTIFY_REQUEST_FLUFFY_MISSING_TX
{
const static int ID = BC_COMMANDS_POOL_BASE + 9 ;
2014-03-03 22:07:58 +00:00
2019-01-18 01:05:58 +00:00
struct request_t
2016-10-26 19:00:08 +00:00
{
2017-02-11 19:38:18 +00:00
crypto : : hash block_hash ;
2016-10-26 19:00:08 +00:00
uint64_t current_blockchain_height ;
2018-01-11 17:31:47 +00:00
std : : vector < uint64_t > missing_tx_indices ;
2016-10-26 19:00:08 +00:00
BEGIN_KV_SERIALIZE_MAP ( )
2017-02-11 19:38:18 +00:00
KV_SERIALIZE_VAL_POD_AS_BLOB ( block_hash )
KV_SERIALIZE ( current_blockchain_height )
KV_SERIALIZE_CONTAINER_POD_AS_BLOB ( missing_tx_indices )
2016-10-26 19:00:08 +00:00
END_KV_SERIALIZE_MAP ( )
} ;
2019-01-18 01:05:58 +00:00
typedef epee : : misc_utils : : struct_init < request_t > request ;
2016-10-26 19:00:08 +00:00
} ;
2019-11-27 00:09:25 +00:00
/************************************************************************/
/* */
/************************************************************************/
struct NOTIFY_GET_TXPOOL_COMPLEMENT
{
const static int ID = BC_COMMANDS_POOL_BASE + 10 ;
struct request_t
{
std : : vector < crypto : : hash > hashes ;
BEGIN_KV_SERIALIZE_MAP ( )
KV_SERIALIZE_CONTAINER_POD_AS_BLOB ( hashes )
END_KV_SERIALIZE_MAP ( )
} ;
typedef epee : : misc_utils : : struct_init < request_t > request ;
} ;
2016-10-26 19:00:08 +00:00
2014-03-03 22:07:58 +00:00
}
