// Copyright (c) 2014-2020, The Monero Project
//
// 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
# pragma once
# include <stdexcept>
# include <string>
# include <boost/uuid/uuid.hpp>
# define CRYPTONOTE_DNS_TIMEOUT_MS 20000
# define CRYPTONOTE_MAX_BLOCK_NUMBER 500000000
# define CRYPTONOTE_MAX_TX_SIZE 1000000
# define CRYPTONOTE_MAX_TX_PER_BLOCK 0x10000000
# define CRYPTONOTE_PUBLIC_ADDRESS_TEXTBLOB_VER 0
# define CRYPTONOTE_MINED_MONEY_UNLOCK_WINDOW_V2 288
# define CRYPTONOTE_MINED_MONEY_UNLOCK_WINDOW 60
# define CURRENT_TRANSACTION_VERSION 2
# define CURRENT_BLOCK_MAJOR_VERSION 7
# define CURRENT_BLOCK_MINOR_VERSION 7
# define BLOCK_HEADER_MINER_SIG 18
# define CRYPTONOTE_BLOCK_FUTURE_TIME_LIMIT_V2 300*2
# define CRYPTONOTE_BLOCK_FUTURE_TIME_LIMIT 60*60*2
# define CRYPTONOTE_DEFAULT_TX_SPENDABLE_AGE 4
# define BLOCKCHAIN_TIMESTAMP_CHECK_WINDOW_V2 11
# define BLOCKCHAIN_TIMESTAMP_CHECK_WINDOW 60
// MONEY_SUPPLY - total number coins to be generated
# define MONEY_SUPPLY ((uint64_t)(-1))
# define EMISSION_SPEED_FACTOR_PER_MINUTE (24)
# define FINAL_SUBSIDY_PER_MINUTE ((uint64_t)(0))
# define CRYPTONOTE_REWARD_BLOCKS_WINDOW 100
# define CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V2 60000 //size of block (bytes) after which reward for block calculated using block size
# define CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V1 20000 //size of block (bytes) after which reward for block calculated using block size - before first fork
# define CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V5 300000 //size of block (bytes) after which reward for block calculated using block size - second change, from v5
ArticMine's new block weight algorithm
This curbs runaway growth while still allowing substantial
spikes in block weight
Original specification from ArticMine:
here is the scaling proposal
Define: LongTermBlockWeight
Before fork:
LongTermBlockWeight = BlockWeight
At or after fork:
LongTermBlockWeight = min(BlockWeight, 1.4*LongTermEffectiveMedianBlockWeight)
Note: To avoid possible consensus issues over rounding the LongTermBlockWeight for a given block should be calculated to the nearest byte, and stored as a integer in the block itself. The stored LongTermBlockWeight is then used for future calculations of the LongTermEffectiveMedianBlockWeight and not recalculated each time.
Define: LongTermEffectiveMedianBlockWeight
LongTermEffectiveMedianBlockWeight = max(300000, MedianOverPrevious100000Blocks(LongTermBlockWeight))
Change Definition of EffectiveMedianBlockWeight
From (current definition)
EffectiveMedianBlockWeight = max(300000, MedianOverPrevious100Blocks(BlockWeight))
To (proposed definition)
EffectiveMedianBlockWeight = min(max(300000, MedianOverPrevious100Blocks(BlockWeight)), 50*LongTermEffectiveMedianBlockWeight)
Notes:
1) There are no other changes to the existing penalty formula, median calculation, fees etc.
2) There is the requirement to store the LongTermBlockWeight of a block unencrypted in the block itself. This is to avoid possible consensus issues over rounding and also to prevent the calculations from becoming unwieldy as we move away from the fork.
3) When the EffectiveMedianBlockWeight cap is reached it is still possible to mine blocks up to 2x the EffectiveMedianBlockWeight by paying the corresponding penalty.
Note: the long term block weight is stored in the database, but not in the actual block itself,
since it requires recalculating anyway for verification.
5 years ago
# define CRYPTONOTE_LONG_TERM_BLOCK_WEIGHT_WINDOW_SIZE 100000 // size in blocks of the long term block weight median window
# define CRYPTONOTE_SHORT_TERM_BLOCK_WEIGHT_SURGE_FACTOR 50
# define CRYPTONOTE_COINBASE_BLOB_RESERVED_SIZE 600
# define CRYPTONOTE_DISPLAY_DECIMAL_POINT 11
// COIN - number of smallest units in one coin
# define COIN ((uint64_t)100000000000) // pow(10, 11)
# define FEE_PER_KB_OLD ((uint64_t)10000000000) // pow(10, 10)
# define FEE_PER_KB ((uint64_t)2000000000) // 2 * pow(10, 9)
# define FEE_PER_BYTE ((uint64_t)300000)
# define DYNAMIC_FEE_PER_KB_BASE_FEE ((uint64_t)2000000000) // 2 * pow(10,9)
# define DYNAMIC_FEE_PER_KB_BASE_BLOCK_REWARD ((uint64_t)10000000000000) // 10 * pow(10,12)
# define DYNAMIC_FEE_PER_KB_BASE_FEE_V5 ((uint64_t)2000000000 * (uint64_t)CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V2 / CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V5)
# define DYNAMIC_FEE_REFERENCE_TRANSACTION_WEIGHT ((uint64_t)3000)
# define ORPHANED_BLOCKS_MAX_COUNT 100
# define DIFFICULTY_TARGET_V2 300
# define DIFFICULTY_TARGET_V1 300
# define DIFFICULTY_WINDOW_V3 144
# define DIFFICULTY_WINDOW_V2 60
# define DIFFICULTY_WINDOW 720 // blocks
# define DIFFICULTY_LAG 15 // !!!
# define DIFFICULTY_CUT 60 // timestamps to cut after sorting
# define DIFFICULTY_BLOCKS_COUNT_V3 DIFFICULTY_WINDOW_V3 + 1 // added +1 to make N=N
# define DIFFICULTY_BLOCKS_COUNT_V2 DIFFICULTY_WINDOW_V2 + 1 // added +1 to make N=N
# define DIFFICULTY_BLOCKS_COUNT DIFFICULTY_WINDOW + DIFFICULTY_LAG
# define DIFFICULTY_RESET_HEIGHT 331170 // ~July 4, 2021 Pool Independence Day
# define DIFFICULTY_RESET_LEVEL 100000000 // 100 mill
# define CRYPTONOTE_LOCKED_TX_ALLOWED_DELTA_SECONDS_V1 DIFFICULTY_TARGET_V1 * CRYPTONOTE_LOCKED_TX_ALLOWED_DELTA_BLOCKS
# define CRYPTONOTE_LOCKED_TX_ALLOWED_DELTA_SECONDS_V2 DIFFICULTY_TARGET_V2 * CRYPTONOTE_LOCKED_TX_ALLOWED_DELTA_BLOCKS
# define CRYPTONOTE_LOCKED_TX_ALLOWED_DELTA_BLOCKS 1
# define DIFFICULTY_BLOCKS_ESTIMATE_TIMESPAN DIFFICULTY_TARGET_V1 //just alias; used by tests
# define BLOCKS_IDS_SYNCHRONIZING_DEFAULT_COUNT 10000 //by default, blocks ids count in synchronizing
# define BLOCKS_IDS_SYNCHRONIZING_MAX_COUNT 25000 //max blocks ids count in synchronizing
# define BLOCKS_SYNCHRONIZING_DEFAULT_COUNT_PRE_V4 100 //by default, blocks count in blocks downloading
# define BLOCKS_SYNCHRONIZING_DEFAULT_COUNT 20 //by default, blocks count in blocks downloading
# define BLOCKS_SYNCHRONIZING_MAX_COUNT 2048 //must be a power of 2, greater than 128, equal to SEEDHASH_EPOCH_BLOCKS
# define CRYPTONOTE_MEMPOOL_TX_LIVETIME (86400*3) //seconds, three days
# define CRYPTONOTE_MEMPOOL_TX_FROM_ALT_BLOCK_LIVETIME 604800 //seconds, one week
# define CRYPTONOTE_DANDELIONPP_STEMS 2 // number of outgoing stem connections per epoch
# define CRYPTONOTE_DANDELIONPP_FLUFF_PROBABILITY 20 // out of 100
# define CRYPTONOTE_DANDELIONPP_MIN_EPOCH 10 // minutes
# define CRYPTONOTE_DANDELIONPP_EPOCH_RANGE 30 // seconds
# define CRYPTONOTE_DANDELIONPP_FLUSH_AVERAGE 5 // seconds average for poisson distributed fluff flush
# define CRYPTONOTE_DANDELIONPP_EMBARGO_AVERAGE 39 // seconds (see tx_pool.cpp for more info)
// see src/cryptonote_protocol/levin_notify.cpp
# define CRYPTONOTE_NOISE_MIN_EPOCH 5 // minutes
# define CRYPTONOTE_NOISE_EPOCH_RANGE 30 // seconds
# define CRYPTONOTE_NOISE_MIN_DELAY 10 // seconds
# define CRYPTONOTE_NOISE_DELAY_RANGE 5 // seconds
# define CRYPTONOTE_NOISE_BYTES 3*1024 // 3 KiB
# define CRYPTONOTE_NOISE_CHANNELS 2 // Max outgoing connections per zone used for noise/covert sending
// Both below are in seconds. The idea is to delay forwarding from i2p/tor
// to ipv4/6, such that 2+ incoming connections _could_ have sent the tx
# define CRYPTONOTE_FORWARD_DELAY_BASE (CRYPTONOTE_NOISE_MIN_DELAY + CRYPTONOTE_NOISE_DELAY_RANGE)
# define CRYPTONOTE_FORWARD_DELAY_AVERAGE (CRYPTONOTE_FORWARD_DELAY_BASE + (CRYPTONOTE_FORWARD_DELAY_BASE / 2))
# define CRYPTONOTE_MAX_FRAGMENTS 20 // ~20 * NOISE_BYTES max payload size for covert/noise send
# define COMMAND_RPC_GET_BLOCKS_FAST_MAX_BLOCK_COUNT 1000
# define COMMAND_RPC_GET_BLOCKS_FAST_MAX_TX_COUNT 20000
# define P2P_LOCAL_WHITE_PEERLIST_LIMIT 1000
# define P2P_LOCAL_GRAY_PEERLIST_LIMIT 5000
# define P2P_DEFAULT_CONNECTIONS_COUNT 12
# define P2P_DEFAULT_HANDSHAKE_INTERVAL 60 //secondes
# define P2P_DEFAULT_PACKET_MAX_SIZE 50000000 //50000000 bytes maximum packet size
# define P2P_DEFAULT_PEERS_IN_HANDSHAKE 250
# define P2P_MAX_PEERS_IN_HANDSHAKE 250
# define P2P_DEFAULT_CONNECTION_TIMEOUT 5000 //5 seconds
# define P2P_DEFAULT_SOCKS_CONNECT_TIMEOUT 45 // seconds
# define P2P_DEFAULT_PING_CONNECTION_TIMEOUT 2000 //2 seconds
# define P2P_DEFAULT_INVOKE_TIMEOUT 60*2*1000 //2 minutes
# define P2P_DEFAULT_HANDSHAKE_INVOKE_TIMEOUT 5000 //5 seconds
# define P2P_DEFAULT_WHITELIST_CONNECTIONS_PERCENT 70
# define P2P_DEFAULT_ANCHOR_CONNECTIONS_COUNT 2
# define P2P_DEFAULT_SYNC_SEARCH_CONNECTIONS_COUNT 2
# define P2P_DEFAULT_LIMIT_RATE_UP 2048 // kB/s
# define P2P_DEFAULT_LIMIT_RATE_DOWN 8192 // kB/s
# define P2P_FAILED_ADDR_FORGET_SECONDS (60*60) //1 hour
# define P2P_IP_BLOCKTIME (60*60*24) //24 hour
# define P2P_IP_FAILS_BEFORE_BLOCK 10
# define P2P_IDLE_CONNECTION_KILL_INTERVAL (5*60) //5 minutes
# define P2P_SUPPORT_FLAG_FLUFFY_BLOCKS 0x01
# define P2P_SUPPORT_FLAGS P2P_SUPPORT_FLAG_FLUFFY_BLOCKS
# define RPC_IP_FAILS_BEFORE_BLOCK 3
# define CRYPTONOTE_NAME "wownero"
# define CRYPTONOTE_BLOCKCHAINDATA_FILENAME "data.mdb"
# define CRYPTONOTE_BLOCKCHAINDATA_LOCK_FILENAME "lock.mdb"
# define P2P_NET_DATA_FILENAME "p2pstate.bin"
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.
6 years ago
# define RPC_PAYMENTS_DATA_FILENAME "rpcpayments.bin"
# define MINER_CONFIG_FILE_NAME "miner_conf.json"
# define THREAD_STACK_SIZE 5 * 1024 * 1024
# define HF_VERSION_DYNAMIC_FEE 4
# define HF_VERSION_MIN_MIXIN_4 6
# define HF_VERSION_MIN_MIXIN_7 7
# define HF_VERSION_MIN_MIXIN_21 9
# define HF_VERSION_ENFORCE_RCT 6
# define HF_VERSION_PER_BYTE_FEE 12
# define HF_VERSION_SMALLER_BP 13
# define HF_VERSION_LONG_TERM_BLOCK_WEIGHT 13
# define HF_VERSION_MIN_2_OUTPUTS 15
# define HF_VERSION_MIN_V2_COINBASE_TX 15
# define HF_VERSION_SAME_MIXIN 15
# define HF_VERSION_REJECT_SIGS_IN_COINBASE 15
# define HF_VERSION_ENFORCE_MIN_AGE 15
# define HF_VERSION_EFFECTIVE_SHORT_TERM_MEDIAN_IN_PENALTY 15
# define HF_VERSION_EXACT_COINBASE 16
# define HF_VERSION_CLSAG 16
# define HF_VERSION_DETERMINISTIC_UNLOCK_TIME 16
# define HF_VERSION_DYNAMIC_UNLOCK 16
# define HF_VERSION_FIXED_UNLOCK 18
# define PER_KB_FEE_QUANTIZATION_DECIMALS 8
# define HASH_OF_HASHES_STEP 512
# define DEFAULT_TXPOOL_MAX_WEIGHT 648000000ull // 3 days at 300000, in bytes
# define BULLETPROOF_MAX_OUTPUTS 16
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.
6 years ago
# define CRYPTONOTE_PRUNING_STRIPE_SIZE 4096 // the smaller, the smoother the increase
# define CRYPTONOTE_PRUNING_LOG_STRIPES 3 // the higher, the more space saved
# define CRYPTONOTE_PRUNING_TIP_BLOCKS 5500 // the smaller, the more space saved
//#define CRYPTONOTE_PRUNING_DEBUG_SPOOF_SEED
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.
6 years ago
# define RPC_CREDITS_PER_HASH_SCALE ((float)(1<<24))
# define DNS_BLOCKLIST_LIFETIME (86400 * 8)
// New constants are intended to go here
namespace config
{
uint64_t const DEFAULT_FEE_ATOMIC_XMR_PER_KB = 500 ; // Just a placeholder! Change me!
uint8_t const FEE_CALCULATION_MAX_RETRIES = 10 ;
uint64_t const DEFAULT_DUST_THRESHOLD = ( ( uint64_t ) 2000000000 ) ; // 2 * pow(10, 9)
uint64_t const BASE_REWARD_CLAMP_THRESHOLD = ( ( uint64_t ) 100000000 ) ; // pow(10, 8)
uint64_t const CRYPTONOTE_PUBLIC_ADDRESS_BASE58_PREFIX = 4146 ;
uint64_t const CRYPTONOTE_PUBLIC_INTEGRATED_ADDRESS_BASE58_PREFIX = 6810 ;
uint64_t const CRYPTONOTE_PUBLIC_SUBADDRESS_BASE58_PREFIX = 12208 ;
uint16_t const P2P_DEFAULT_PORT = 34567 ;
uint16_t const RPC_DEFAULT_PORT = 34568 ;
uint16_t const ZMQ_RPC_DEFAULT_PORT = 34569 ;
boost : : uuids : : uuid const NETWORK_ID = { {
0x11 , 0x33 , 0xFF , 0x77 , 0x61 , 0x04 , 0x41 , 0x61 , 0x17 , 0x31 , 0x00 , 0x82 , 0x16 , 0xA1 , 0xA1 , 0x10
} } ; // Bender's nightmare
std : : string const GENESIS_TX = " 013c01ff0001ffffffffff1f029b2e4c0281c0b02e7c53291a94d1d0cbff8883f8024f5142ee494ffbbd08807121012a1a936be5d91c01ee876e38c13fab0ee11cbe86011a2bf7740fb5ebd39d267d " ;
uint32_t const GENESIS_NONCE = 70 ;
// Hash domain separators
const char HASH_KEY_BULLETPROOF_EXPONENT [ ] = " bulletproof " ;
const char HASH_KEY_BULLETPROOF_PLUS_EXPONENT [ ] = " bulletproof_plus " ;
const char HASH_KEY_BULLETPROOF_PLUS_TRANSCRIPT [ ] = " bulletproof_plus_transcript " ;
const char HASH_KEY_RINGDB [ ] = " ringdsb " ;
const char HASH_KEY_SUBADDRESS [ ] = " SubAddr " ;
const unsigned char HASH_KEY_ENCRYPTED_PAYMENT_ID = 0x8d ;
const unsigned char HASH_KEY_WALLET = 0x8c ;
const unsigned char HASH_KEY_WALLET_CACHE = 0x8d ;
const unsigned char HASH_KEY_RPC_PAYMENT_NONCE = 0x58 ;
const unsigned char HASH_KEY_MEMORY = ' k ' ;
const unsigned char HASH_KEY_MULTISIG [ ] = { ' M ' , ' u ' , ' l ' , ' t ' , ' i ' , ' s ' , ' i ' , ' g ' , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 , 0x00 } ;
const unsigned char HASH_KEY_TXPROOF_V2 [ ] = " TXPROOF_V2 " ;
const unsigned char HASH_KEY_CLSAG_ROUND [ ] = " CLSAG_round " ;
const unsigned char HASH_KEY_CLSAG_AGG_0 [ ] = " CLSAG_agg_0 " ;
const unsigned char HASH_KEY_CLSAG_AGG_1 [ ] = " CLSAG_agg_1 " ;
const char HASH_KEY_MESSAGE_SIGNING [ ] = " MoneroMessageSignature " ;
namespace testnet
{
uint64_t const CRYPTONOTE_PUBLIC_ADDRESS_BASE58_PREFIX = 53 ;
uint64_t const CRYPTONOTE_PUBLIC_INTEGRATED_ADDRESS_BASE58_PREFIX = 54 ;
uint64_t const CRYPTONOTE_PUBLIC_SUBADDRESS_BASE58_PREFIX = 63 ;
uint16_t const P2P_DEFAULT_PORT = 11180 ;
uint16_t const RPC_DEFAULT_PORT = 11181 ;
uint16_t const ZMQ_RPC_DEFAULT_PORT = 11182 ;
boost : : uuids : : uuid const NETWORK_ID = { {
0x11 , 0x33 , 0xFF , 0x77 , 0x61 , 0x04 , 0x41 , 0x61 , 0x17 , 0x31 , 0x00 , 0x82 , 0x16 , 0xA1 , 0xA1 , 0x11
} } ; // Bender's daydream
std : : string const GENESIS_TX = " 013c01ff0001ffffffffff1f029b2e4c0281c0b02e7c53291a94d1d0cbff8883f8024f5142ee494ffbbd088071210160eb755f618a2336055dee60f307fe0ded81c5b37b53d310175ca9ee69b0c8ad " ;
uint32_t const GENESIS_NONCE = 70 ;
}
namespace stagenet
{
uint64_t const CRYPTONOTE_PUBLIC_ADDRESS_BASE58_PREFIX = 24 ;
uint64_t const CRYPTONOTE_PUBLIC_INTEGRATED_ADDRESS_BASE58_PREFIX = 25 ;
uint64_t const CRYPTONOTE_PUBLIC_SUBADDRESS_BASE58_PREFIX = 36 ;
uint16_t const P2P_DEFAULT_PORT = 38080 ;
uint16_t const RPC_DEFAULT_PORT = 38081 ;
uint16_t const ZMQ_RPC_DEFAULT_PORT = 38082 ;
boost : : uuids : : uuid const NETWORK_ID = { {
0x12 , 0x30 , 0xF1 , 0x71 , 0x61 , 0x04 , 0x41 , 0x61 , 0x17 , 0x31 , 0x00 , 0x82 , 0x16 , 0xA1 , 0xA1 , 0x12
} } ; // Bender's daydream
std : : string const GENESIS_TX = " 013c01ff0001ffffffffffff0302df5d56da0c7d643ddd1ce61901c7bdc5fb1738bfe39fbe69c28a3a7032729c0f2101168d0c4ca86fb55a4cf6a36d31431be1c53a3bd7411bb24e8832410289fa6f3b " ;
uint32_t const GENESIS_NONCE = 10002 ;
}
}
namespace cryptonote
{
enum network_type : uint8_t
{
MAINNET = 0 ,
TESTNET ,
STAGENET ,
FAKECHAIN ,
UNDEFINED = 255
} ;
struct config_t
{
uint64_t const CRYPTONOTE_PUBLIC_ADDRESS_BASE58_PREFIX ;
uint64_t const CRYPTONOTE_PUBLIC_INTEGRATED_ADDRESS_BASE58_PREFIX ;
uint64_t const CRYPTONOTE_PUBLIC_SUBADDRESS_BASE58_PREFIX ;
uint16_t const P2P_DEFAULT_PORT ;
uint16_t const RPC_DEFAULT_PORT ;
uint16_t const ZMQ_RPC_DEFAULT_PORT ;
boost : : uuids : : uuid const NETWORK_ID ;
std : : string const GENESIS_TX ;
uint32_t const GENESIS_NONCE ;
} ;
inline const config_t & get_config ( network_type nettype )
{
static const config_t mainnet = {
: : config : : CRYPTONOTE_PUBLIC_ADDRESS_BASE58_PREFIX ,
: : config : : CRYPTONOTE_PUBLIC_INTEGRATED_ADDRESS_BASE58_PREFIX ,
: : config : : CRYPTONOTE_PUBLIC_SUBADDRESS_BASE58_PREFIX ,
: : config : : P2P_DEFAULT_PORT ,
: : config : : RPC_DEFAULT_PORT ,
: : config : : ZMQ_RPC_DEFAULT_PORT ,
: : config : : NETWORK_ID ,
: : config : : GENESIS_TX ,
: : config : : GENESIS_NONCE
} ;
static const config_t testnet = {
: : config : : testnet : : CRYPTONOTE_PUBLIC_ADDRESS_BASE58_PREFIX ,
: : config : : testnet : : CRYPTONOTE_PUBLIC_INTEGRATED_ADDRESS_BASE58_PREFIX ,
: : config : : testnet : : CRYPTONOTE_PUBLIC_SUBADDRESS_BASE58_PREFIX ,
: : config : : testnet : : P2P_DEFAULT_PORT ,
: : config : : testnet : : RPC_DEFAULT_PORT ,
: : config : : testnet : : ZMQ_RPC_DEFAULT_PORT ,
: : config : : testnet : : NETWORK_ID ,
: : config : : testnet : : GENESIS_TX ,
: : config : : testnet : : GENESIS_NONCE
} ;
static const config_t stagenet = {
: : config : : stagenet : : CRYPTONOTE_PUBLIC_ADDRESS_BASE58_PREFIX ,
: : config : : stagenet : : CRYPTONOTE_PUBLIC_INTEGRATED_ADDRESS_BASE58_PREFIX ,
: : config : : stagenet : : CRYPTONOTE_PUBLIC_SUBADDRESS_BASE58_PREFIX ,
: : config : : stagenet : : P2P_DEFAULT_PORT ,
: : config : : stagenet : : RPC_DEFAULT_PORT ,
: : config : : stagenet : : ZMQ_RPC_DEFAULT_PORT ,
: : config : : stagenet : : NETWORK_ID ,
: : config : : stagenet : : GENESIS_TX ,
: : config : : stagenet : : GENESIS_NONCE
} ;
switch ( nettype )
{
case MAINNET : return mainnet ;
case TESTNET : return testnet ;
case STAGENET : return stagenet ;
case FAKECHAIN : return mainnet ;
default : throw std : : runtime_error ( " Invalid network type " ) ;
}
} ;
}
