|
|
|
|
// Copyright (c) 2014-2022, 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.
|
|
|
|
|
#pragma once
|
|
|
|
|
|
|
|
|
|
#include <atomic>
|
|
|
|
|
|
|
|
|
|
#include "blockchain_db/blockchain_db.h"
|
|
|
|
|
#include "cryptonote_basic/blobdatatype.h" // for type blobdata
|
|
|
|
|
#include "ringct/rctTypes.h"
|
|
|
|
|
#include <boost/thread/tss.hpp>
|
|
|
|
|
|
|
|
|
|
#include <lmdb.h>
|
|
|
|
|
|
** CHANGES ARE EXPERIMENTAL (FOR TESTING ONLY)
Bockchain:
1. Optim: Multi-thread long-hash computation when encountering groups of blocks.
2. Optim: Cache verified txs and return result from cache instead of re-checking whenever possible.
3. Optim: Preload output-keys when encoutering groups of blocks. Sort by amount and global-index before bulk querying database and multi-thread when possible.
4. Optim: Disable double spend check on block verification, double spend is already detected when trying to add blocks.
5. Optim: Multi-thread signature computation whenever possible.
6. Patch: Disable locking (recursive mutex) on called functions from check_tx_inputs which causes slowdowns (only seems to happen on ubuntu/VMs??? Reason: TBD)
7. Optim: Removed looped full-tx hash computation when retrieving transactions from pool (???).
8. Optim: Cache difficulty/timestamps (735 blocks) for next-difficulty calculations so that only 2 db reads per new block is needed when a new block arrives (instead of 1470 reads).
Berkeley-DB:
1. Fix: 32-bit data errors causing wrong output global indices and failure to send blocks to peers (etc).
2. Fix: Unable to pop blocks on reorganize due to transaction errors.
3. Patch: Large number of transaction aborts when running multi-threaded bulk queries.
4. Patch: Insufficient locks error when running full sync.
5. Patch: Incorrect db stats when returning from an immediate exit from "pop block" operation.
6. Optim: Add bulk queries to get output global indices.
7. Optim: Modified output_keys table to store public_key+unlock_time+height for single transaction lookup (vs 3)
8. Optim: Used output_keys table retrieve public_keys instead of going through output_amounts->output_txs+output_indices->txs->output:public_key
9. Optim: Added thread-safe buffers used when multi-threading bulk queries.
10. Optim: Added support for nosync/write_nosync options for improved performance (*see --db-sync-mode option for details)
11. Mod: Added checkpoint thread and auto-remove-logs option.
12. *Now usable on 32-bit systems like RPI2.
LMDB:
1. Optim: Added custom comparison for 256-bit key tables (minor speed-up, TBD: get actual effect)
2. Optim: Modified output_keys table to store public_key+unlock_time+height for single transaction lookup (vs 3)
3. Optim: Used output_keys table retrieve public_keys instead of going through output_amounts->output_txs+output_indices->txs->output:public_key
4. Optim: Added support for sync/writemap options for improved performance (*see --db-sync-mode option for details)
5. Mod: Auto resize to +1GB instead of multiplier x1.5
ETC:
1. Minor optimizations for slow-hash for ARM (RPI2). Incomplete.
2. Fix: 32-bit saturation bug when computing next difficulty on large blocks.
[PENDING ISSUES]
1. Berkely db has a very slow "pop-block" operation. This is very noticeable on the RPI2 as it sometimes takes > 10 MINUTES to pop a block during reorganization.
This does not happen very often however, most reorgs seem to take a few seconds but it possibly depends on the number of outputs present. TBD.
2. Berkeley db, possible bug "unable to allocate memory". TBD.
[NEW OPTIONS] (*Currently all enabled for testing purposes)
1. --fast-block-sync arg=[0:1] (default: 1)
a. 0 = Compute long hash per block (may take a while depending on CPU)
b. 1 = Skip long-hash and verify blocks based on embedded known good block hashes (faster, minimal CPU dependence)
2. --db-sync-mode arg=[[safe|fast|fastest]:[sync|async]:[nblocks_per_sync]] (default: fastest:async:1000)
a. safe = fdatasync/fsync (or equivalent) per stored block. Very slow, but safest option to protect against power-out/crash conditions.
b. fast/fastest = Enables asynchronous fdatasync/fsync (or equivalent). Useful for battery operated devices or STABLE systems with UPS and/or systems with battery backed write cache/solid state cache.
Fast - Write meta-data but defer data flush.
Fastest - Defer meta-data and data flush.
Sync - Flush data after nblocks_per_sync and wait.
Async - Flush data after nblocks_per_sync but do not wait for the operation to finish.
3. --prep-blocks-threads arg=[n] (default: 4 or system max threads, whichever is lower)
Max number of threads to use when computing long-hash in groups.
4. --show-time-stats arg=[0:1] (default: 1)
Show benchmark related time stats.
5. --db-auto-remove-logs arg=[0:1] (default: 1)
For berkeley-db only. Auto remove logs if enabled.
**Note: lmdb and berkeley-db have changes to the tables and are not compatible with official git head version.
At the moment, you need a full resync to use this optimized version.
[PERFORMANCE COMPARISON]
**Some figures are approximations only.
Using a baseline machine of an i7-2600K+SSD+(with full pow computation):
1. The optimized lmdb/blockhain core can process blocks up to 585K for ~1.25 hours + download time, so it usually takes 2.5 hours to sync the full chain.
2. The current head with memory can process blocks up to 585K for ~4.2 hours + download time, so it usually takes 5.5 hours to sync the full chain.
3. The current head with lmdb can process blocks up to 585K for ~32 hours + download time and usually takes 36 hours to sync the full chain.
Averate procesing times (with full pow computation):
lmdb-optimized:
1. tx_ave = 2.5 ms / tx
2. block_ave = 5.87 ms / block
memory-official-repo:
1. tx_ave = 8.85 ms / tx
2. block_ave = 19.68 ms / block
lmdb-official-repo (0f4a036437fd41a5498ee5e74e2422ea6177aa3e)
1. tx_ave = 47.8 ms / tx
2. block_ave = 64.2 ms / block
**Note: The following data denotes processing times only (does not include p2p download time)
lmdb-optimized processing times (with full pow computation):
1. Desktop, Quad-core / 8-threads 2600k (8Mb) - 1.25 hours processing time (--db-sync-mode=fastest:async:1000).
2. Laptop, Dual-core / 4-threads U4200 (3Mb) - 4.90 hours processing time (--db-sync-mode=fastest:async:1000).
3. Embedded, Quad-core / 4-threads Z3735F (2x1Mb) - 12.0 hours processing time (--db-sync-mode=fastest:async:1000).
lmdb-optimized processing times (with per-block-checkpoint)
1. Desktop, Quad-core / 8-threads 2600k (8Mb) - 10 minutes processing time (--db-sync-mode=fastest:async:1000).
berkeley-db optimized processing times (with full pow computation)
1. Desktop, Quad-core / 8-threads 2600k (8Mb) - 1.8 hours processing time (--db-sync-mode=fastest:async:1000).
2. RPI2. Improved from estimated 3 months(???) into 2.5 days (*Need 2AMP supply + Clock:1Ghz + [usb+ssd] to achieve this speed) (--db-sync-mode=fastest:async:1000).
berkeley-db optimized processing times (with per-block-checkpoint)
1. RPI2. 12-15 hours (*Need 2AMP supply + Clock:1Ghz + [usb+ssd] to achieve this speed) (--db-sync-mode=fastest:async:1000).
9 years ago
|
|
|
#define ENABLE_AUTO_RESIZE
|
|
|
|
|
|
|
|
|
|
namespace cryptonote
|
|
|
|
|
{
|
|
|
|
|
|
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
|
|
|
typedef struct txindex {
|
|
|
|
|
crypto::hash key;
|
|
|
|
|
tx_data_t data;
|
|
|
|
|
} txindex;
|
|
|
|
|
|
|
|
|
|
typedef struct mdb_txn_cursors
|
|
|
|
|
{
|
|
|
|
|
MDB_cursor *m_txc_blocks;
|
|
|
|
|
MDB_cursor *m_txc_block_heights;
|
|
|
|
|
MDB_cursor *m_txc_block_info;
|
|
|
|
|
|
|
|
|
|
MDB_cursor *m_txc_output_txs;
|
|
|
|
|
MDB_cursor *m_txc_output_amounts;
|
|
|
|
|
|
|
|
|
|
MDB_cursor *m_txc_txs;
|
|
|
|
|
MDB_cursor *m_txc_txs_pruned;
|
|
|
|
|
MDB_cursor *m_txc_txs_prunable;
|
|
|
|
|
MDB_cursor *m_txc_txs_prunable_hash;
|
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
|
|
|
MDB_cursor *m_txc_txs_prunable_tip;
|
|
|
|
|
MDB_cursor *m_txc_tx_indices;
|
|
|
|
|
MDB_cursor *m_txc_tx_outputs;
|
|
|
|
|
|
|
|
|
|
MDB_cursor *m_txc_spent_keys;
|
|
|
|
|
|
|
|
|
|
MDB_cursor *m_txc_txpool_meta;
|
|
|
|
|
MDB_cursor *m_txc_txpool_blob;
|
|
|
|
|
|
|
|
|
|
MDB_cursor *m_txc_alt_blocks;
|
|
|
|
|
|
|
|
|
|
MDB_cursor *m_txc_hf_versions;
|
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
|
|
|
|
|
|
|
|
MDB_cursor *m_txc_properties;
|
|
|
|
|
} mdb_txn_cursors;
|
|
|
|
|
|
|
|
|
|
#define m_cur_blocks m_cursors->m_txc_blocks
|
|
|
|
|
#define m_cur_block_heights m_cursors->m_txc_block_heights
|
|
|
|
|
#define m_cur_block_info m_cursors->m_txc_block_info
|
|
|
|
|
#define m_cur_output_txs m_cursors->m_txc_output_txs
|
|
|
|
|
#define m_cur_output_amounts m_cursors->m_txc_output_amounts
|
|
|
|
|
#define m_cur_txs m_cursors->m_txc_txs
|
|
|
|
|
#define m_cur_txs_pruned m_cursors->m_txc_txs_pruned
|
|
|
|
|
#define m_cur_txs_prunable m_cursors->m_txc_txs_prunable
|
|
|
|
|
#define m_cur_txs_prunable_hash m_cursors->m_txc_txs_prunable_hash
|
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 m_cur_txs_prunable_tip m_cursors->m_txc_txs_prunable_tip
|
|
|
|
|
#define m_cur_tx_indices m_cursors->m_txc_tx_indices
|
|
|
|
|
#define m_cur_tx_outputs m_cursors->m_txc_tx_outputs
|
|
|
|
|
#define m_cur_spent_keys m_cursors->m_txc_spent_keys
|
|
|
|
|
#define m_cur_txpool_meta m_cursors->m_txc_txpool_meta
|
|
|
|
|
#define m_cur_txpool_blob m_cursors->m_txc_txpool_blob
|
|
|
|
|
#define m_cur_alt_blocks m_cursors->m_txc_alt_blocks
|
|
|
|
|
#define m_cur_hf_versions m_cursors->m_txc_hf_versions
|
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 m_cur_properties m_cursors->m_txc_properties
|
|
|
|
|
|
|
|
|
|
typedef struct mdb_rflags
|
|
|
|
|
{
|
|
|
|
|
bool m_rf_txn;
|
|
|
|
|
bool m_rf_blocks;
|
|
|
|
|
bool m_rf_block_heights;
|
|
|
|
|
bool m_rf_block_info;
|
|
|
|
|
bool m_rf_output_txs;
|
|
|
|
|
bool m_rf_output_amounts;
|
|
|
|
|
bool m_rf_txs;
|
|
|
|
|
bool m_rf_txs_pruned;
|
|
|
|
|
bool m_rf_txs_prunable;
|
|
|
|
|
bool m_rf_txs_prunable_hash;
|
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
|
|
|
bool m_rf_txs_prunable_tip;
|
|
|
|
|
bool m_rf_tx_indices;
|
|
|
|
|
bool m_rf_tx_outputs;
|
|
|
|
|
bool m_rf_spent_keys;
|
|
|
|
|
bool m_rf_txpool_meta;
|
|
|
|
|
bool m_rf_txpool_blob;
|
|
|
|
|
bool m_rf_alt_blocks;
|
|
|
|
|
bool m_rf_hf_versions;
|
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
|
|
|
bool m_rf_properties;
|
|
|
|
|
} mdb_rflags;
|
|
|
|
|
|
|
|
|
|
typedef struct mdb_threadinfo
|
|
|
|
|
{
|
|
|
|
|
MDB_txn *m_ti_rtxn; // per-thread read txn
|
|
|
|
|
mdb_txn_cursors m_ti_rcursors; // per-thread read cursors
|
|
|
|
|
mdb_rflags m_ti_rflags; // per-thread read state
|
|
|
|
|
|
|
|
|
|
~mdb_threadinfo();
|
|
|
|
|
} mdb_threadinfo;
|
|
|
|
|
|
|
|
|
|
struct mdb_txn_safe
|
|
|
|
|
{
|
|
|
|
|
mdb_txn_safe(const bool check=true);
|
|
|
|
|
~mdb_txn_safe();
|
|
|
|
|
|
|
|
|
|
void commit(std::string message = "");
|
|
|
|
|
|
|
|
|
|
// This should only be needed for batch transaction which must be ensured to
|
|
|
|
|
// be aborted before mdb_env_close, not after. So we can't rely on
|
|
|
|
|
// BlockchainLMDB destructor to call mdb_txn_safe destructor, as that's too late
|
|
|
|
|
// to properly abort, since mdb_env_close would have been called earlier.
|
|
|
|
|
void abort();
|
|
|
|
|
void uncheck();
|
|
|
|
|
|
|
|
|
|
operator MDB_txn*()
|
|
|
|
|
{
|
|
|
|
|
return m_txn;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
operator MDB_txn**()
|
|
|
|
|
{
|
|
|
|
|
return &m_txn;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
uint64_t num_active_tx() const;
|
|
|
|
|
|
|
|
|
|
static void prevent_new_txns();
|
|
|
|
|
static void wait_no_active_txns();
|
|
|
|
|
static void allow_new_txns();
|
|
|
|
|
static void increment_txns(int);
|
|
|
|
|
|
|
|
|
|
mdb_threadinfo* m_tinfo;
|
|
|
|
|
MDB_txn* m_txn;
|
|
|
|
|
bool m_batch_txn = false;
|
|
|
|
|
bool m_check;
|
|
|
|
|
static std::atomic<uint64_t> num_active_txns;
|
|
|
|
|
|
|
|
|
|
// could use a mutex here, but this should be sufficient.
|
|
|
|
|
static std::atomic_flag creation_gate;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
// If m_batch_active is set, a batch transaction exists beyond this class, such
|
|
|
|
|
// as a batch import with verification enabled, or possibly (later) a batch
|
|
|
|
|
// network sync.
|
|
|
|
|
//
|
|
|
|
|
// For some of the lookup methods, such as get_block_timestamp(), tx_exists(),
|
|
|
|
|
// and get_tx(), when m_batch_active is set, the lookup uses the batch
|
|
|
|
|
// transaction. This isn't only because the transaction is available, but it's
|
|
|
|
|
// necessary so that lookups include the database updates only present in the
|
|
|
|
|
// current batch write.
|
|
|
|
|
//
|
|
|
|
|
// A regular network sync without batch writes is expected to open a new read
|
|
|
|
|
// transaction, as those lookups are part of the validation done prior to the
|
|
|
|
|
// write for block and tx data, so no write transaction is open at the time.
|
|
|
|
|
class BlockchainLMDB : public BlockchainDB
|
|
|
|
|
{
|
|
|
|
|
public:
|
|
|
|
|
BlockchainLMDB(bool batch_transactions=true);
|
|
|
|
|
~BlockchainLMDB();
|
|
|
|
|
|
|
|
|
|
virtual void open(const std::string& filename, const int mdb_flags=0);
|
|
|
|
|
|
|
|
|
|
virtual void close();
|
|
|
|
|
|
|
|
|
|
virtual void sync();
|
|
|
|
|
|
|
|
|
|
virtual void safesyncmode(const bool onoff);
|
|
|
|
|
|
|
|
|
|
virtual void reset();
|
|
|
|
|
|
|
|
|
|
virtual std::vector<std::string> get_filenames() const;
|
|
|
|
|
|
|
|
|
|
virtual bool remove_data_file(const std::string& folder) const;
|
|
|
|
|
|
|
|
|
|
virtual std::string get_db_name() const;
|
|
|
|
|
|
|
|
|
|
virtual bool lock();
|
|
|
|
|
|
|
|
|
|
virtual void unlock();
|
|
|
|
|
|
|
|
|
|
virtual bool block_exists(const crypto::hash& h, uint64_t *height = NULL) const;
|
|
|
|
|
|
|
|
|
|
virtual uint64_t get_block_height(const crypto::hash& h) const;
|
|
|
|
|
|
|
|
|
|
virtual block_header get_block_header(const crypto::hash& h) const;
|
|
|
|
|
|
|
|
|
|
virtual cryptonote::blobdata get_block_blob(const crypto::hash& h) const;
|
|
|
|
|
|
|
|
|
|
virtual cryptonote::blobdata get_block_blob_from_height(const uint64_t& height) const;
|
|
|
|
|
|
|
|
|
|
virtual std::vector<uint64_t> get_block_cumulative_rct_outputs(const std::vector<uint64_t> &heights) const;
|
|
|
|
|
|
|
|
|
|
virtual uint64_t get_block_timestamp(const uint64_t& height) const;
|
|
|
|
|
|
|
|
|
|
virtual uint64_t get_top_block_timestamp() const;
|
|
|
|
|
|
|
|
|
|
virtual size_t get_block_weight(const uint64_t& height) const;
|
|
|
|
|
|
|
|
|
|
virtual std::vector<uint64_t> get_block_weights(uint64_t start_height, size_t count) const;
|
|
|
|
|
|
|
|
|
|
virtual difficulty_type get_block_cumulative_difficulty(const uint64_t& height) const;
|
|
|
|
|
|
|
|
|
|
virtual difficulty_type get_block_difficulty(const uint64_t& height) const;
|
|
|
|
|
|
|
|
|
|
virtual void correct_block_cumulative_difficulties(const uint64_t& start_height, const std::vector<difficulty_type>& new_cumulative_difficulties);
|
|
|
|
|
|
|
|
|
|
virtual uint64_t get_block_already_generated_coins(const uint64_t& height) const;
|
|
|
|
|
|
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
|
|
|
virtual uint64_t get_block_long_term_weight(const uint64_t& height) const;
|
|
|
|
|
|
|
|
|
|
virtual std::vector<uint64_t> get_long_term_block_weights(uint64_t start_height, size_t count) const;
|
|
|
|
|
|
|
|
|
|
virtual crypto::hash get_block_hash_from_height(const uint64_t& height) const;
|
|
|
|
|
|
|
|
|
|
virtual std::vector<block> get_blocks_range(const uint64_t& h1, const uint64_t& h2) const;
|
|
|
|
|
|
|
|
|
|
virtual std::vector<crypto::hash> get_hashes_range(const uint64_t& h1, const uint64_t& h2) const;
|
|
|
|
|
|
|
|
|
|
virtual crypto::hash top_block_hash(uint64_t *block_height = NULL) const;
|
|
|
|
|
|
|
|
|
|
virtual block get_top_block() const;
|
|
|
|
|
|
|
|
|
|
virtual uint64_t height() const;
|
|
|
|
|
|
|
|
|
|
virtual bool tx_exists(const crypto::hash& h) const;
|
|
|
|
|
virtual bool tx_exists(const crypto::hash& h, uint64_t& tx_index) const;
|
|
|
|
|
|
|
|
|
|
virtual uint64_t get_tx_unlock_time(const crypto::hash& h) const;
|
|
|
|
|
|
|
|
|
|
virtual bool get_tx_blob(const crypto::hash& h, cryptonote::blobdata &tx) const;
|
|
|
|
|
virtual bool get_pruned_tx_blob(const crypto::hash& h, cryptonote::blobdata &tx) const;
|
|
|
|
|
virtual bool get_pruned_tx_blobs_from(const crypto::hash& h, size_t count, std::vector<cryptonote::blobdata> &bd) const;
|
|
|
|
|
virtual bool get_blocks_from(uint64_t start_height, size_t min_block_count, size_t max_block_count, size_t max_tx_count, size_t max_size, std::vector<std::pair<std::pair<cryptonote::blobdata, crypto::hash>, std::vector<std::pair<crypto::hash, cryptonote::blobdata>>>>& blocks, bool pruned, bool skip_coinbase, bool get_miner_tx_hash) const;
|
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
|
|
|
virtual bool get_prunable_tx_blob(const crypto::hash& h, cryptonote::blobdata &tx) const;
|
|
|
|
|
virtual bool get_prunable_tx_hash(const crypto::hash& tx_hash, crypto::hash &prunable_hash) const;
|
|
|
|
|
|
|
|
|
|
virtual uint64_t get_tx_count() const;
|
|
|
|
|
|
|
|
|
|
virtual std::vector<transaction> get_tx_list(const std::vector<crypto::hash>& hlist) const;
|
|
|
|
|
|
|
|
|
|
virtual uint64_t get_tx_block_height(const crypto::hash& h) const;
|
|
|
|
|
|
|
|
|
|
virtual uint64_t get_num_outputs(const uint64_t& amount) const;
|
|
|
|
|
|
|
|
|
|
virtual output_data_t get_output_key(const uint64_t& amount, const uint64_t& index, bool include_commitmemt) const;
|
|
|
|
|
virtual void get_output_key(const epee::span<const uint64_t> &amounts, const std::vector<uint64_t> &offsets, std::vector<output_data_t> &outputs, bool allow_partial = false) const;
|
|
|
|
|
|
|
|
|
|
virtual tx_out_index get_output_tx_and_index_from_global(const uint64_t& index) const;
|
** CHANGES ARE EXPERIMENTAL (FOR TESTING ONLY)
Bockchain:
1. Optim: Multi-thread long-hash computation when encountering groups of blocks.
2. Optim: Cache verified txs and return result from cache instead of re-checking whenever possible.
3. Optim: Preload output-keys when encoutering groups of blocks. Sort by amount and global-index before bulk querying database and multi-thread when possible.
4. Optim: Disable double spend check on block verification, double spend is already detected when trying to add blocks.
5. Optim: Multi-thread signature computation whenever possible.
6. Patch: Disable locking (recursive mutex) on called functions from check_tx_inputs which causes slowdowns (only seems to happen on ubuntu/VMs??? Reason: TBD)
7. Optim: Removed looped full-tx hash computation when retrieving transactions from pool (???).
8. Optim: Cache difficulty/timestamps (735 blocks) for next-difficulty calculations so that only 2 db reads per new block is needed when a new block arrives (instead of 1470 reads).
Berkeley-DB:
1. Fix: 32-bit data errors causing wrong output global indices and failure to send blocks to peers (etc).
2. Fix: Unable to pop blocks on reorganize due to transaction errors.
3. Patch: Large number of transaction aborts when running multi-threaded bulk queries.
4. Patch: Insufficient locks error when running full sync.
5. Patch: Incorrect db stats when returning from an immediate exit from "pop block" operation.
6. Optim: Add bulk queries to get output global indices.
7. Optim: Modified output_keys table to store public_key+unlock_time+height for single transaction lookup (vs 3)
8. Optim: Used output_keys table retrieve public_keys instead of going through output_amounts->output_txs+output_indices->txs->output:public_key
9. Optim: Added thread-safe buffers used when multi-threading bulk queries.
10. Optim: Added support for nosync/write_nosync options for improved performance (*see --db-sync-mode option for details)
11. Mod: Added checkpoint thread and auto-remove-logs option.
12. *Now usable on 32-bit systems like RPI2.
LMDB:
1. Optim: Added custom comparison for 256-bit key tables (minor speed-up, TBD: get actual effect)
2. Optim: Modified output_keys table to store public_key+unlock_time+height for single transaction lookup (vs 3)
3. Optim: Used output_keys table retrieve public_keys instead of going through output_amounts->output_txs+output_indices->txs->output:public_key
4. Optim: Added support for sync/writemap options for improved performance (*see --db-sync-mode option for details)
5. Mod: Auto resize to +1GB instead of multiplier x1.5
ETC:
1. Minor optimizations for slow-hash for ARM (RPI2). Incomplete.
2. Fix: 32-bit saturation bug when computing next difficulty on large blocks.
[PENDING ISSUES]
1. Berkely db has a very slow "pop-block" operation. This is very noticeable on the RPI2 as it sometimes takes > 10 MINUTES to pop a block during reorganization.
This does not happen very often however, most reorgs seem to take a few seconds but it possibly depends on the number of outputs present. TBD.
2. Berkeley db, possible bug "unable to allocate memory". TBD.
[NEW OPTIONS] (*Currently all enabled for testing purposes)
1. --fast-block-sync arg=[0:1] (default: 1)
a. 0 = Compute long hash per block (may take a while depending on CPU)
b. 1 = Skip long-hash and verify blocks based on embedded known good block hashes (faster, minimal CPU dependence)
2. --db-sync-mode arg=[[safe|fast|fastest]:[sync|async]:[nblocks_per_sync]] (default: fastest:async:1000)
a. safe = fdatasync/fsync (or equivalent) per stored block. Very slow, but safest option to protect against power-out/crash conditions.
b. fast/fastest = Enables asynchronous fdatasync/fsync (or equivalent). Useful for battery operated devices or STABLE systems with UPS and/or systems with battery backed write cache/solid state cache.
Fast - Write meta-data but defer data flush.
Fastest - Defer meta-data and data flush.
Sync - Flush data after nblocks_per_sync and wait.
Async - Flush data after nblocks_per_sync but do not wait for the operation to finish.
3. --prep-blocks-threads arg=[n] (default: 4 or system max threads, whichever is lower)
Max number of threads to use when computing long-hash in groups.
4. --show-time-stats arg=[0:1] (default: 1)
Show benchmark related time stats.
5. --db-auto-remove-logs arg=[0:1] (default: 1)
For berkeley-db only. Auto remove logs if enabled.
**Note: lmdb and berkeley-db have changes to the tables and are not compatible with official git head version.
At the moment, you need a full resync to use this optimized version.
[PERFORMANCE COMPARISON]
**Some figures are approximations only.
Using a baseline machine of an i7-2600K+SSD+(with full pow computation):
1. The optimized lmdb/blockhain core can process blocks up to 585K for ~1.25 hours + download time, so it usually takes 2.5 hours to sync the full chain.
2. The current head with memory can process blocks up to 585K for ~4.2 hours + download time, so it usually takes 5.5 hours to sync the full chain.
3. The current head with lmdb can process blocks up to 585K for ~32 hours + download time and usually takes 36 hours to sync the full chain.
Averate procesing times (with full pow computation):
lmdb-optimized:
1. tx_ave = 2.5 ms / tx
2. block_ave = 5.87 ms / block
memory-official-repo:
1. tx_ave = 8.85 ms / tx
2. block_ave = 19.68 ms / block
lmdb-official-repo (0f4a036437fd41a5498ee5e74e2422ea6177aa3e)
1. tx_ave = 47.8 ms / tx
2. block_ave = 64.2 ms / block
**Note: The following data denotes processing times only (does not include p2p download time)
lmdb-optimized processing times (with full pow computation):
1. Desktop, Quad-core / 8-threads 2600k (8Mb) - 1.25 hours processing time (--db-sync-mode=fastest:async:1000).
2. Laptop, Dual-core / 4-threads U4200 (3Mb) - 4.90 hours processing time (--db-sync-mode=fastest:async:1000).
3. Embedded, Quad-core / 4-threads Z3735F (2x1Mb) - 12.0 hours processing time (--db-sync-mode=fastest:async:1000).
lmdb-optimized processing times (with per-block-checkpoint)
1. Desktop, Quad-core / 8-threads 2600k (8Mb) - 10 minutes processing time (--db-sync-mode=fastest:async:1000).
berkeley-db optimized processing times (with full pow computation)
1. Desktop, Quad-core / 8-threads 2600k (8Mb) - 1.8 hours processing time (--db-sync-mode=fastest:async:1000).
2. RPI2. Improved from estimated 3 months(???) into 2.5 days (*Need 2AMP supply + Clock:1Ghz + [usb+ssd] to achieve this speed) (--db-sync-mode=fastest:async:1000).
berkeley-db optimized processing times (with per-block-checkpoint)
1. RPI2. 12-15 hours (*Need 2AMP supply + Clock:1Ghz + [usb+ssd] to achieve this speed) (--db-sync-mode=fastest:async:1000).
9 years ago
|
|
|
virtual void get_output_tx_and_index_from_global(const std::vector<uint64_t> &global_indices,
|
|
|
|
|
std::vector<tx_out_index> &tx_out_indices) const;
|
|
|
|
|
|
|
|
|
|
virtual tx_out_index get_output_tx_and_index(const uint64_t& amount, const uint64_t& index) const;
|
|
|
|
|
virtual void get_output_tx_and_index(const uint64_t& amount, const std::vector<uint64_t> &offsets, std::vector<tx_out_index> &indices) const;
|
|
|
|
|
|
|
|
|
|
virtual std::vector<std::vector<uint64_t>> get_tx_amount_output_indices(const uint64_t tx_id, size_t n_txes) const;
|
|
|
|
|
|
|
|
|
|
virtual bool has_key_image(const crypto::key_image& img) const;
|
|
|
|
|
|
|
|
|
|
virtual void add_txpool_tx(const crypto::hash &txid, const cryptonote::blobdata_ref &blob, const txpool_tx_meta_t& meta);
|
|
|
|
|
virtual void update_txpool_tx(const crypto::hash &txid, const txpool_tx_meta_t& meta);
|
|
|
|
|
virtual uint64_t get_txpool_tx_count(relay_category category = relay_category::broadcasted) const;
|
|
|
|
|
virtual bool txpool_has_tx(const crypto::hash &txid, relay_category tx_category) const;
|
|
|
|
|
virtual void remove_txpool_tx(const crypto::hash& txid);
|
|
|
|
|
virtual bool get_txpool_tx_meta(const crypto::hash& txid, txpool_tx_meta_t &meta) const;
|
|
|
|
|
virtual bool get_txpool_tx_blob(const crypto::hash& txid, cryptonote::blobdata& bd, relay_category tx_category) const;
|
|
|
|
|
virtual cryptonote::blobdata get_txpool_tx_blob(const crypto::hash& txid, relay_category tx_category) const;
|
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
|
|
|
virtual uint32_t get_blockchain_pruning_seed() const;
|
|
|
|
|
virtual bool prune_blockchain(uint32_t pruning_seed = 0);
|
|
|
|
|
virtual bool update_pruning();
|
|
|
|
|
virtual bool check_pruning();
|
|
|
|
|
|
|
|
|
|
virtual void add_alt_block(const crypto::hash &blkid, const cryptonote::alt_block_data_t &data, const cryptonote::blobdata_ref &blob);
|
|
|
|
|
virtual bool get_alt_block(const crypto::hash &blkid, alt_block_data_t *data, cryptonote::blobdata *blob);
|
|
|
|
|
virtual void remove_alt_block(const crypto::hash &blkid);
|
|
|
|
|
virtual uint64_t get_alt_block_count();
|
|
|
|
|
virtual void drop_alt_blocks();
|
|
|
|
|
|
|
|
|
|
virtual bool for_all_txpool_txes(std::function<bool(const crypto::hash&, const txpool_tx_meta_t&, const cryptonote::blobdata_ref*)> f, bool include_blob = false, relay_category category = relay_category::broadcasted) const;
|
|
|
|
|
|
|
|
|
|
virtual bool for_all_key_images(std::function<bool(const crypto::key_image&)>) const;
|
|
|
|
|
virtual bool for_blocks_range(const uint64_t& h1, const uint64_t& h2, std::function<bool(uint64_t, const crypto::hash&, const cryptonote::block&)>) const;
|
|
|
|
|
virtual bool for_all_transactions(std::function<bool(const crypto::hash&, const cryptonote::transaction&)>, bool pruned) const;
|
|
|
|
|
virtual bool for_all_outputs(std::function<bool(uint64_t amount, const crypto::hash &tx_hash, uint64_t height, size_t tx_idx)> f) const;
|
|
|
|
|
virtual bool for_all_outputs(uint64_t amount, const std::function<bool(uint64_t height)> &f) const;
|
|
|
|
|
virtual bool for_all_alt_blocks(std::function<bool(const crypto::hash &blkid, const alt_block_data_t &data, const cryptonote::blobdata_ref *blob)> f, bool include_blob = false) const;
|
|
|
|
|
|
|
|
|
|
virtual uint64_t add_block( const std::pair<block, blobdata>& blk
|
|
|
|
|
, size_t block_weight
|
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
|
|
|
, uint64_t long_term_block_weight
|
|
|
|
|
, const difficulty_type& cumulative_difficulty
|
|
|
|
|
, const uint64_t& coins_generated
|
|
|
|
|
, const std::vector<std::pair<transaction, blobdata>>& txs
|
|
|
|
|
);
|
|
|
|
|
|
|
|
|
|
virtual void set_batch_transactions(bool batch_transactions);
|
|
|
|
|
virtual bool batch_start(uint64_t batch_num_blocks=0, uint64_t batch_bytes=0);
|
|
|
|
|
virtual void batch_commit();
|
|
|
|
|
virtual void batch_stop();
|
|
|
|
|
virtual void batch_abort();
|
|
|
|
|
|
|
|
|
|
virtual void block_wtxn_start();
|
|
|
|
|
virtual void block_wtxn_stop();
|
|
|
|
|
virtual void block_wtxn_abort();
|
|
|
|
|
virtual bool block_rtxn_start() const;
|
|
|
|
|
virtual void block_rtxn_stop() const;
|
|
|
|
|
virtual void block_rtxn_abort() const;
|
|
|
|
|
|
|
|
|
|
bool block_rtxn_start(MDB_txn **mtxn, mdb_txn_cursors **mcur) const;
|
|
|
|
|
|
|
|
|
|
virtual void pop_block(block& blk, std::vector<transaction>& txs);
|
|
|
|
|
|
** CHANGES ARE EXPERIMENTAL (FOR TESTING ONLY)
Bockchain:
1. Optim: Multi-thread long-hash computation when encountering groups of blocks.
2. Optim: Cache verified txs and return result from cache instead of re-checking whenever possible.
3. Optim: Preload output-keys when encoutering groups of blocks. Sort by amount and global-index before bulk querying database and multi-thread when possible.
4. Optim: Disable double spend check on block verification, double spend is already detected when trying to add blocks.
5. Optim: Multi-thread signature computation whenever possible.
6. Patch: Disable locking (recursive mutex) on called functions from check_tx_inputs which causes slowdowns (only seems to happen on ubuntu/VMs??? Reason: TBD)
7. Optim: Removed looped full-tx hash computation when retrieving transactions from pool (???).
8. Optim: Cache difficulty/timestamps (735 blocks) for next-difficulty calculations so that only 2 db reads per new block is needed when a new block arrives (instead of 1470 reads).
Berkeley-DB:
1. Fix: 32-bit data errors causing wrong output global indices and failure to send blocks to peers (etc).
2. Fix: Unable to pop blocks on reorganize due to transaction errors.
3. Patch: Large number of transaction aborts when running multi-threaded bulk queries.
4. Patch: Insufficient locks error when running full sync.
5. Patch: Incorrect db stats when returning from an immediate exit from "pop block" operation.
6. Optim: Add bulk queries to get output global indices.
7. Optim: Modified output_keys table to store public_key+unlock_time+height for single transaction lookup (vs 3)
8. Optim: Used output_keys table retrieve public_keys instead of going through output_amounts->output_txs+output_indices->txs->output:public_key
9. Optim: Added thread-safe buffers used when multi-threading bulk queries.
10. Optim: Added support for nosync/write_nosync options for improved performance (*see --db-sync-mode option for details)
11. Mod: Added checkpoint thread and auto-remove-logs option.
12. *Now usable on 32-bit systems like RPI2.
LMDB:
1. Optim: Added custom comparison for 256-bit key tables (minor speed-up, TBD: get actual effect)
2. Optim: Modified output_keys table to store public_key+unlock_time+height for single transaction lookup (vs 3)
3. Optim: Used output_keys table retrieve public_keys instead of going through output_amounts->output_txs+output_indices->txs->output:public_key
4. Optim: Added support for sync/writemap options for improved performance (*see --db-sync-mode option for details)
5. Mod: Auto resize to +1GB instead of multiplier x1.5
ETC:
1. Minor optimizations for slow-hash for ARM (RPI2). Incomplete.
2. Fix: 32-bit saturation bug when computing next difficulty on large blocks.
[PENDING ISSUES]
1. Berkely db has a very slow "pop-block" operation. This is very noticeable on the RPI2 as it sometimes takes > 10 MINUTES to pop a block during reorganization.
This does not happen very often however, most reorgs seem to take a few seconds but it possibly depends on the number of outputs present. TBD.
2. Berkeley db, possible bug "unable to allocate memory". TBD.
[NEW OPTIONS] (*Currently all enabled for testing purposes)
1. --fast-block-sync arg=[0:1] (default: 1)
a. 0 = Compute long hash per block (may take a while depending on CPU)
b. 1 = Skip long-hash and verify blocks based on embedded known good block hashes (faster, minimal CPU dependence)
2. --db-sync-mode arg=[[safe|fast|fastest]:[sync|async]:[nblocks_per_sync]] (default: fastest:async:1000)
a. safe = fdatasync/fsync (or equivalent) per stored block. Very slow, but safest option to protect against power-out/crash conditions.
b. fast/fastest = Enables asynchronous fdatasync/fsync (or equivalent). Useful for battery operated devices or STABLE systems with UPS and/or systems with battery backed write cache/solid state cache.
Fast - Write meta-data but defer data flush.
Fastest - Defer meta-data and data flush.
Sync - Flush data after nblocks_per_sync and wait.
Async - Flush data after nblocks_per_sync but do not wait for the operation to finish.
3. --prep-blocks-threads arg=[n] (default: 4 or system max threads, whichever is lower)
Max number of threads to use when computing long-hash in groups.
4. --show-time-stats arg=[0:1] (default: 1)
Show benchmark related time stats.
5. --db-auto-remove-logs arg=[0:1] (default: 1)
For berkeley-db only. Auto remove logs if enabled.
**Note: lmdb and berkeley-db have changes to the tables and are not compatible with official git head version.
At the moment, you need a full resync to use this optimized version.
[PERFORMANCE COMPARISON]
**Some figures are approximations only.
Using a baseline machine of an i7-2600K+SSD+(with full pow computation):
1. The optimized lmdb/blockhain core can process blocks up to 585K for ~1.25 hours + download time, so it usually takes 2.5 hours to sync the full chain.
2. The current head with memory can process blocks up to 585K for ~4.2 hours + download time, so it usually takes 5.5 hours to sync the full chain.
3. The current head with lmdb can process blocks up to 585K for ~32 hours + download time and usually takes 36 hours to sync the full chain.
Averate procesing times (with full pow computation):
lmdb-optimized:
1. tx_ave = 2.5 ms / tx
2. block_ave = 5.87 ms / block
memory-official-repo:
1. tx_ave = 8.85 ms / tx
2. block_ave = 19.68 ms / block
lmdb-official-repo (0f4a036437fd41a5498ee5e74e2422ea6177aa3e)
1. tx_ave = 47.8 ms / tx
2. block_ave = 64.2 ms / block
**Note: The following data denotes processing times only (does not include p2p download time)
lmdb-optimized processing times (with full pow computation):
1. Desktop, Quad-core / 8-threads 2600k (8Mb) - 1.25 hours processing time (--db-sync-mode=fastest:async:1000).
2. Laptop, Dual-core / 4-threads U4200 (3Mb) - 4.90 hours processing time (--db-sync-mode=fastest:async:1000).
3. Embedded, Quad-core / 4-threads Z3735F (2x1Mb) - 12.0 hours processing time (--db-sync-mode=fastest:async:1000).
lmdb-optimized processing times (with per-block-checkpoint)
1. Desktop, Quad-core / 8-threads 2600k (8Mb) - 10 minutes processing time (--db-sync-mode=fastest:async:1000).
berkeley-db optimized processing times (with full pow computation)
1. Desktop, Quad-core / 8-threads 2600k (8Mb) - 1.8 hours processing time (--db-sync-mode=fastest:async:1000).
2. RPI2. Improved from estimated 3 months(???) into 2.5 days (*Need 2AMP supply + Clock:1Ghz + [usb+ssd] to achieve this speed) (--db-sync-mode=fastest:async:1000).
berkeley-db optimized processing times (with per-block-checkpoint)
1. RPI2. 12-15 hours (*Need 2AMP supply + Clock:1Ghz + [usb+ssd] to achieve this speed) (--db-sync-mode=fastest:async:1000).
9 years ago
|
|
|
virtual bool can_thread_bulk_indices() const { return true; }
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
|
* @brief return a histogram of outputs on the blockchain
|
|
|
|
|
*
|
|
|
|
|
* @param amounts optional set of amounts to lookup
|
|
|
|
|
* @param unlocked whether to restrict count to unlocked outputs
|
|
|
|
|
* @param recent_cutoff timestamp to determine which outputs are recent
|
|
|
|
|
* @param min_count return only amounts with at least that many instances
|
|
|
|
|
*
|
|
|
|
|
* @return a set of amount/instances
|
|
|
|
|
*/
|
|
|
|
|
std::map<uint64_t, std::tuple<uint64_t, uint64_t, uint64_t>> get_output_histogram(const std::vector<uint64_t> &amounts, bool unlocked, uint64_t recent_cutoff, uint64_t min_count) const;
|
|
|
|
|
|
|
|
|
|
bool get_output_distribution(uint64_t amount, uint64_t from_height, uint64_t to_height, std::vector<uint64_t> &distribution, uint64_t &base) const;
|
|
|
|
|
|
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
|
|
|
// helper functions
|
|
|
|
|
static int compare_uint64(const MDB_val *a, const MDB_val *b);
|
|
|
|
|
static int compare_hash32(const MDB_val *a, const MDB_val *b);
|
|
|
|
|
static int compare_string(const MDB_val *a, const MDB_val *b);
|
|
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
void check_mmap_support();
|
|
|
|
|
void do_resize(uint64_t size_increase=0);
|
|
|
|
|
|
|
|
|
|
bool need_resize(uint64_t threshold_size=0) const;
|
|
|
|
|
void check_and_resize_for_batch(uint64_t batch_num_blocks, uint64_t batch_bytes);
|
|
|
|
|
uint64_t get_estimated_batch_size(uint64_t batch_num_blocks, uint64_t batch_bytes) const;
|
|
|
|
|
|
|
|
|
|
virtual void add_block( const block& blk
|
|
|
|
|
, size_t block_weight
|
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
|
|
|
, uint64_t long_term_block_weight
|
|
|
|
|
, const difficulty_type& cumulative_difficulty
|
|
|
|
|
, const uint64_t& coins_generated
|
|
|
|
|
, uint64_t num_rct_outs
|
|
|
|
|
, const crypto::hash& block_hash
|
|
|
|
|
);
|
|
|
|
|
|
|
|
|
|
virtual void remove_block();
|
|
|
|
|
|
|
|
|
|
virtual uint64_t add_transaction_data(const crypto::hash& blk_hash, const std::pair<transaction, blobdata_ref>& tx, const crypto::hash& tx_hash, const crypto::hash& tx_prunable_hash);
|
|
|
|
|
|
|
|
|
|
virtual void remove_transaction_data(const crypto::hash& tx_hash, const transaction& tx);
|
|
|
|
|
|
|
|
|
|
virtual uint64_t add_output(const crypto::hash& tx_hash,
|
|
|
|
|
const tx_out& tx_output,
|
|
|
|
|
const uint64_t& local_index,
|
|
|
|
|
const uint64_t unlock_time,
|
|
|
|
|
const rct::key *commitment
|
|
|
|
|
);
|
|
|
|
|
|
|
|
|
|
virtual void add_tx_amount_output_indices(const uint64_t tx_id,
|
|
|
|
|
const std::vector<uint64_t>& amount_output_indices
|
|
|
|
|
);
|
|
|
|
|
|
|
|
|
|
void remove_tx_outputs(const uint64_t tx_id, const transaction& tx);
|
|
|
|
|
|
|
|
|
|
void remove_output(const uint64_t amount, const uint64_t& out_index);
|
|
|
|
|
|
|
|
|
|
virtual void prune_outputs(uint64_t amount);
|
|
|
|
|
|
|
|
|
|
virtual void add_spent_key(const crypto::key_image& k_image);
|
|
|
|
|
|
|
|
|
|
virtual void remove_spent_key(const crypto::key_image& k_image);
|
|
|
|
|
|
|
|
|
|
uint64_t num_outputs() const;
|
|
|
|
|
|
|
|
|
|
// Hard fork
|
|
|
|
|
virtual void set_hard_fork_version(uint64_t height, uint8_t version);
|
|
|
|
|
virtual uint8_t get_hard_fork_version(uint64_t height) const;
|
|
|
|
|
virtual void check_hard_fork_info();
|
|
|
|
|
virtual void drop_hard_fork_info();
|
|
|
|
|
|
|
|
|
|
inline void check_open() const;
|
|
|
|
|
|
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
|
|
|
bool prune_worker(int mode, uint32_t pruning_seed);
|
|
|
|
|
|
|
|
|
|
virtual bool is_read_only() const;
|
|
|
|
|
|
|
|
|
|
virtual uint64_t get_database_size() const;
|
|
|
|
|
|
|
|
|
|
std::vector<uint64_t> get_block_info_64bit_fields(uint64_t start_height, size_t count, off_t offset) const;
|
|
|
|
|
|
|
|
|
|
uint64_t get_max_block_size();
|
|
|
|
|
void add_max_block_size(uint64_t sz);
|
|
|
|
|
|
|
|
|
|
// fix up anything that may be wrong due to past bugs
|
|
|
|
|
virtual void fixup();
|
|
|
|
|
|
|
|
|
|
// migrate from older DB version to current
|
|
|
|
|
void migrate(const uint32_t oldversion);
|
|
|
|
|
|
|
|
|
|
// migrate from DB version 0 to 1
|
|
|
|
|
void migrate_0_1();
|
|
|
|
|
|
|
|
|
|
// migrate from DB version 1 to 2
|
|
|
|
|
void migrate_1_2();
|
|
|
|
|
|
|
|
|
|
// migrate from DB version 2 to 3
|
|
|
|
|
void migrate_2_3();
|
|
|
|
|
|
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
|
|
|
// migrate from DB version 3 to 4
|
|
|
|
|
void migrate_3_4();
|
|
|
|
|
|
|
|
|
|
// migrate from DB version 4 to 5
|
|
|
|
|
void migrate_4_5();
|
|
|
|
|
|
|
|
|
|
void cleanup_batch();
|
|
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
MDB_env* m_env;
|
|
|
|
|
|
|
|
|
|
MDB_dbi m_blocks;
|
|
|
|
|
MDB_dbi m_block_heights;
|
|
|
|
|
MDB_dbi m_block_info;
|
|
|
|
|
|
|
|
|
|
MDB_dbi m_txs;
|
|
|
|
|
MDB_dbi m_txs_pruned;
|
|
|
|
|
MDB_dbi m_txs_prunable;
|
|
|
|
|
MDB_dbi m_txs_prunable_hash;
|
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
|
|
|
MDB_dbi m_txs_prunable_tip;
|
|
|
|
|
MDB_dbi m_tx_indices;
|
|
|
|
|
MDB_dbi m_tx_outputs;
|
|
|
|
|
|
|
|
|
|
MDB_dbi m_output_txs;
|
|
|
|
|
MDB_dbi m_output_amounts;
|
|
|
|
|
|
|
|
|
|
MDB_dbi m_spent_keys;
|
|
|
|
|
|
|
|
|
|
MDB_dbi m_txpool_meta;
|
|
|
|
|
MDB_dbi m_txpool_blob;
|
|
|
|
|
|
|
|
|
|
MDB_dbi m_alt_blocks;
|
|
|
|
|
|
|
|
|
|
MDB_dbi m_hf_starting_heights;
|
|
|
|
|
MDB_dbi m_hf_versions;
|
|
|
|
|
|
|
|
|
|
MDB_dbi m_properties;
|
|
|
|
|
|
|
|
|
|
mutable uint64_t m_cum_size; // used in batch size estimation
|
|
|
|
|
mutable unsigned int m_cum_count;
|
|
|
|
|
std::string m_folder;
|
|
|
|
|
mdb_txn_safe* m_write_txn; // may point to either a short-lived txn or a batch txn
|
|
|
|
|
mdb_txn_safe* m_write_batch_txn; // persist batch txn outside of BlockchainLMDB
|
|
|
|
|
boost::thread::id m_writer;
|
|
|
|
|
|
|
|
|
|
bool m_batch_transactions; // support for batch transactions
|
|
|
|
|
bool m_batch_active; // whether batch transaction is in progress
|
|
|
|
|
|
|
|
|
|
mdb_txn_cursors m_wcursors;
|
|
|
|
|
mutable boost::thread_specific_ptr<mdb_threadinfo> m_tinfo;
|
|
|
|
|
|
** CHANGES ARE EXPERIMENTAL (FOR TESTING ONLY)
Bockchain:
1. Optim: Multi-thread long-hash computation when encountering groups of blocks.
2. Optim: Cache verified txs and return result from cache instead of re-checking whenever possible.
3. Optim: Preload output-keys when encoutering groups of blocks. Sort by amount and global-index before bulk querying database and multi-thread when possible.
4. Optim: Disable double spend check on block verification, double spend is already detected when trying to add blocks.
5. Optim: Multi-thread signature computation whenever possible.
6. Patch: Disable locking (recursive mutex) on called functions from check_tx_inputs which causes slowdowns (only seems to happen on ubuntu/VMs??? Reason: TBD)
7. Optim: Removed looped full-tx hash computation when retrieving transactions from pool (???).
8. Optim: Cache difficulty/timestamps (735 blocks) for next-difficulty calculations so that only 2 db reads per new block is needed when a new block arrives (instead of 1470 reads).
Berkeley-DB:
1. Fix: 32-bit data errors causing wrong output global indices and failure to send blocks to peers (etc).
2. Fix: Unable to pop blocks on reorganize due to transaction errors.
3. Patch: Large number of transaction aborts when running multi-threaded bulk queries.
4. Patch: Insufficient locks error when running full sync.
5. Patch: Incorrect db stats when returning from an immediate exit from "pop block" operation.
6. Optim: Add bulk queries to get output global indices.
7. Optim: Modified output_keys table to store public_key+unlock_time+height for single transaction lookup (vs 3)
8. Optim: Used output_keys table retrieve public_keys instead of going through output_amounts->output_txs+output_indices->txs->output:public_key
9. Optim: Added thread-safe buffers used when multi-threading bulk queries.
10. Optim: Added support for nosync/write_nosync options for improved performance (*see --db-sync-mode option for details)
11. Mod: Added checkpoint thread and auto-remove-logs option.
12. *Now usable on 32-bit systems like RPI2.
LMDB:
1. Optim: Added custom comparison for 256-bit key tables (minor speed-up, TBD: get actual effect)
2. Optim: Modified output_keys table to store public_key+unlock_time+height for single transaction lookup (vs 3)
3. Optim: Used output_keys table retrieve public_keys instead of going through output_amounts->output_txs+output_indices->txs->output:public_key
4. Optim: Added support for sync/writemap options for improved performance (*see --db-sync-mode option for details)
5. Mod: Auto resize to +1GB instead of multiplier x1.5
ETC:
1. Minor optimizations for slow-hash for ARM (RPI2). Incomplete.
2. Fix: 32-bit saturation bug when computing next difficulty on large blocks.
[PENDING ISSUES]
1. Berkely db has a very slow "pop-block" operation. This is very noticeable on the RPI2 as it sometimes takes > 10 MINUTES to pop a block during reorganization.
This does not happen very often however, most reorgs seem to take a few seconds but it possibly depends on the number of outputs present. TBD.
2. Berkeley db, possible bug "unable to allocate memory". TBD.
[NEW OPTIONS] (*Currently all enabled for testing purposes)
1. --fast-block-sync arg=[0:1] (default: 1)
a. 0 = Compute long hash per block (may take a while depending on CPU)
b. 1 = Skip long-hash and verify blocks based on embedded known good block hashes (faster, minimal CPU dependence)
2. --db-sync-mode arg=[[safe|fast|fastest]:[sync|async]:[nblocks_per_sync]] (default: fastest:async:1000)
a. safe = fdatasync/fsync (or equivalent) per stored block. Very slow, but safest option to protect against power-out/crash conditions.
b. fast/fastest = Enables asynchronous fdatasync/fsync (or equivalent). Useful for battery operated devices or STABLE systems with UPS and/or systems with battery backed write cache/solid state cache.
Fast - Write meta-data but defer data flush.
Fastest - Defer meta-data and data flush.
Sync - Flush data after nblocks_per_sync and wait.
Async - Flush data after nblocks_per_sync but do not wait for the operation to finish.
3. --prep-blocks-threads arg=[n] (default: 4 or system max threads, whichever is lower)
Max number of threads to use when computing long-hash in groups.
4. --show-time-stats arg=[0:1] (default: 1)
Show benchmark related time stats.
5. --db-auto-remove-logs arg=[0:1] (default: 1)
For berkeley-db only. Auto remove logs if enabled.
**Note: lmdb and berkeley-db have changes to the tables and are not compatible with official git head version.
At the moment, you need a full resync to use this optimized version.
[PERFORMANCE COMPARISON]
**Some figures are approximations only.
Using a baseline machine of an i7-2600K+SSD+(with full pow computation):
1. The optimized lmdb/blockhain core can process blocks up to 585K for ~1.25 hours + download time, so it usually takes 2.5 hours to sync the full chain.
2. The current head with memory can process blocks up to 585K for ~4.2 hours + download time, so it usually takes 5.5 hours to sync the full chain.
3. The current head with lmdb can process blocks up to 585K for ~32 hours + download time and usually takes 36 hours to sync the full chain.
Averate procesing times (with full pow computation):
lmdb-optimized:
1. tx_ave = 2.5 ms / tx
2. block_ave = 5.87 ms / block
memory-official-repo:
1. tx_ave = 8.85 ms / tx
2. block_ave = 19.68 ms / block
lmdb-official-repo (0f4a036437fd41a5498ee5e74e2422ea6177aa3e)
1. tx_ave = 47.8 ms / tx
2. block_ave = 64.2 ms / block
**Note: The following data denotes processing times only (does not include p2p download time)
lmdb-optimized processing times (with full pow computation):
1. Desktop, Quad-core / 8-threads 2600k (8Mb) - 1.25 hours processing time (--db-sync-mode=fastest:async:1000).
2. Laptop, Dual-core / 4-threads U4200 (3Mb) - 4.90 hours processing time (--db-sync-mode=fastest:async:1000).
3. Embedded, Quad-core / 4-threads Z3735F (2x1Mb) - 12.0 hours processing time (--db-sync-mode=fastest:async:1000).
lmdb-optimized processing times (with per-block-checkpoint)
1. Desktop, Quad-core / 8-threads 2600k (8Mb) - 10 minutes processing time (--db-sync-mode=fastest:async:1000).
berkeley-db optimized processing times (with full pow computation)
1. Desktop, Quad-core / 8-threads 2600k (8Mb) - 1.8 hours processing time (--db-sync-mode=fastest:async:1000).
2. RPI2. Improved from estimated 3 months(???) into 2.5 days (*Need 2AMP supply + Clock:1Ghz + [usb+ssd] to achieve this speed) (--db-sync-mode=fastest:async:1000).
berkeley-db optimized processing times (with per-block-checkpoint)
1. RPI2. 12-15 hours (*Need 2AMP supply + Clock:1Ghz + [usb+ssd] to achieve this speed) (--db-sync-mode=fastest:async:1000).
9 years ago
|
|
|
#if defined(__arm__)
|
|
|
|
|
// force a value so it can compile with 32-bit ARM
|
|
|
|
|
constexpr static uint64_t DEFAULT_MAPSIZE = 1LL << 31;
|
|
|
|
|
#else
|
|
|
|
|
#if defined(ENABLE_AUTO_RESIZE)
|
|
|
|
|
constexpr static uint64_t DEFAULT_MAPSIZE = 1LL << 30;
|
|
|
|
|
#else
|
|
|
|
|
constexpr static uint64_t DEFAULT_MAPSIZE = 1LL << 33;
|
|
|
|
|
#endif
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
constexpr static float RESIZE_PERCENT = 0.9f;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
} // namespace cryptonote
|
