2018-01-07 05:05:16 +00:00
|
|
|
# Copyright (c) 2014-2018, The Monero Project
|
2014-10-21 17:01:56 +00:00
|
|
|
#
|
|
|
|
# All rights reserved.
|
|
|
|
#
|
|
|
|
# Redistribution and use in source and binary forms, with or without modification, are
|
|
|
|
# permitted provided that the following conditions are met:
|
|
|
|
#
|
|
|
|
# 1. Redistributions of source code must retain the above copyright notice, this list of
|
|
|
|
# conditions and the following disclaimer.
|
|
|
|
#
|
|
|
|
# 2. Redistributions in binary form must reproduce the above copyright notice, this list
|
|
|
|
# of conditions and the following disclaimer in the documentation and/or other
|
|
|
|
# materials provided with the distribution.
|
|
|
|
#
|
|
|
|
# 3. Neither the name of the copyright holder nor the names of its contributors may be
|
|
|
|
# used to endorse or promote products derived from this software without specific
|
|
|
|
# prior written permission.
|
|
|
|
#
|
|
|
|
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
|
|
|
|
# EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
|
|
# MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
|
|
|
|
# THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
|
|
# PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
|
|
# INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
|
|
|
|
# STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
|
|
|
|
# THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
|
|
|
set(unit_tests_sources
|
2018-07-08 20:12:33 +00:00
|
|
|
account.cpp
|
2017-09-13 08:22:16 +00:00
|
|
|
apply_permutation.cpp
|
2014-10-21 17:01:56 +00:00
|
|
|
address_from_url.cpp
|
2015-12-24 16:05:19 +00:00
|
|
|
ban.cpp
|
2014-10-21 17:01:56 +00:00
|
|
|
base58.cpp
|
2015-05-31 11:40:18 +00:00
|
|
|
blockchain_db.cpp
|
2017-07-02 21:41:15 +00:00
|
|
|
block_queue.cpp
|
2014-10-21 17:01:56 +00:00
|
|
|
block_reward.cpp
|
2017-11-30 19:59:10 +00:00
|
|
|
bulletproofs.cpp
|
2015-12-26 11:41:50 +00:00
|
|
|
canonical_amounts.cpp
|
2017-12-07 13:27:11 +00:00
|
|
|
chacha.cpp
|
2014-10-21 17:01:56 +00:00
|
|
|
checkpoints.cpp
|
2016-11-26 02:07:45 +00:00
|
|
|
command_line.cpp
|
2017-02-27 18:33:16 +00:00
|
|
|
crypto.cpp
|
2014-10-21 17:01:56 +00:00
|
|
|
decompose_amount_into_digits.cpp
|
2018-04-12 12:49:05 +00:00
|
|
|
device.cpp
|
2014-10-21 17:01:56 +00:00
|
|
|
dns_resolver.cpp
|
|
|
|
epee_boosted_tcp_server.cpp
|
|
|
|
epee_levin_protocol_handler_async.cpp
|
2017-03-19 02:05:14 +00:00
|
|
|
epee_utils.cpp
|
2018-09-11 01:25:15 +00:00
|
|
|
expect.cpp
|
2016-10-27 22:43:44 +00:00
|
|
|
fee.cpp
|
2018-08-02 02:10:09 +00:00
|
|
|
json_serialization.cpp
|
2014-10-21 17:01:56 +00:00
|
|
|
get_xtype_from_string.cpp
|
2017-09-11 13:38:37 +00:00
|
|
|
hashchain.cpp
|
2017-02-05 22:48:03 +00:00
|
|
|
http.cpp
|
2018-08-17 16:47:28 +00:00
|
|
|
keccak.cpp
|
2018-04-27 09:20:09 +00:00
|
|
|
logging.cpp
|
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.
2019-01-21 17:18:50 +00:00
|
|
|
long_term_block_weight.cpp
|
2014-10-21 17:01:56 +00:00
|
|
|
main.cpp
|
2017-10-26 09:16:48 +00:00
|
|
|
memwipe.cpp
|
2018-08-02 11:44:31 +00:00
|
|
|
mlocker.cpp
|
2014-10-21 17:01:56 +00:00
|
|
|
mnemonics.cpp
|
|
|
|
mul_div.cpp
|
2018-01-18 12:01:45 +00:00
|
|
|
multiexp.cpp
|
2017-06-29 10:48:34 +00:00
|
|
|
multisig.cpp
|
2018-12-16 17:57:44 +00:00
|
|
|
net.cpp
|
2018-10-01 09:13:22 +00:00
|
|
|
notify.cpp
|
2018-11-06 14:23:26 +00:00
|
|
|
output_distribution.cpp
|
2014-10-21 17:01:56 +00:00
|
|
|
parse_amount.cpp
|
Pruning
The blockchain prunes seven eighths of prunable tx data.
This saves about two thirds of the blockchain size, while
keeping the node useful as a sync source for an eighth
of the blockchain.
No other data is currently pruned.
There are three ways to prune a blockchain:
- run monerod with --prune-blockchain
- run "prune_blockchain" in the monerod console
- run the monero-blockchain-prune utility
The first two will prune in place. Due to how LMDB works, this
will not reduce the blockchain size on disk. Instead, it will
mark parts of the file as free, so that future data will use
that free space, causing the file to not grow until free space
grows scarce.
The third way will create a second database, a pruned copy of
the original one. Since this is a new file, this one will be
smaller than the original one.
Once the database is pruned, it will stay pruned as it syncs.
That is, there is no need to use --prune-blockchain again, etc.
2018-04-29 22:30:51 +00:00
|
|
|
pruning.cpp
|
2018-07-04 21:17:20 +00:00
|
|
|
random.cpp
|
2014-10-21 17:01:56 +00:00
|
|
|
serialization.cpp
|
2017-10-05 15:35:10 +00:00
|
|
|
sha256.cpp
|
2014-10-21 17:01:56 +00:00
|
|
|
slow_memmem.cpp
|
2017-10-17 16:56:57 +00:00
|
|
|
subaddress.cpp
|
2017-01-26 15:07:23 +00:00
|
|
|
test_tx_utils.cpp
|
2014-10-21 17:01:56 +00:00
|
|
|
test_peerlist.cpp
|
2015-09-01 08:40:33 +00:00
|
|
|
test_protocol_pack.cpp
|
2018-04-23 17:56:23 +00:00
|
|
|
threadpool.cpp
|
2016-03-29 16:56:42 +00:00
|
|
|
hardfork.cpp
|
2016-05-01 10:32:10 +00:00
|
|
|
unbound.cpp
|
2016-11-28 17:53:20 +00:00
|
|
|
uri.cpp
|
2016-05-14 09:30:11 +00:00
|
|
|
varint.cpp
|
2016-07-12 21:01:13 +00:00
|
|
|
ringct.cpp
|
2017-02-16 22:30:01 +00:00
|
|
|
output_selection.cpp
|
2018-04-09 17:42:22 +00:00
|
|
|
vercmp.cpp
|
2018-07-06 23:03:15 +00:00
|
|
|
ringdb.cpp
|
2018-08-25 11:16:01 +00:00
|
|
|
wipeable_string.cpp
|
2018-03-27 11:35:27 +00:00
|
|
|
is_hdd.cpp
|
|
|
|
aligned.cpp)
|
2014-10-21 17:01:56 +00:00
|
|
|
|
|
|
|
set(unit_tests_headers
|
|
|
|
unit_tests_utils.h)
|
|
|
|
|
|
|
|
add_executable(unit_tests
|
|
|
|
${unit_tests_sources}
|
|
|
|
${unit_tests_headers})
|
|
|
|
target_link_libraries(unit_tests
|
2016-09-17 17:59:29 +00:00
|
|
|
PRIVATE
|
2016-05-14 09:30:11 +00:00
|
|
|
ringct
|
2017-07-02 21:41:15 +00:00
|
|
|
cryptonote_protocol
|
2014-10-21 17:01:56 +00:00
|
|
|
cryptonote_core
|
2015-03-16 07:12:54 +00:00
|
|
|
blockchain_db
|
2014-10-21 17:01:56 +00:00
|
|
|
rpc
|
2018-12-16 17:57:44 +00:00
|
|
|
net
|
2018-08-02 02:10:09 +00:00
|
|
|
serialization
|
2014-10-21 17:01:56 +00:00
|
|
|
wallet
|
2015-01-05 19:30:17 +00:00
|
|
|
p2p
|
2017-09-13 23:28:23 +00:00
|
|
|
version
|
2017-02-12 22:53:13 +00:00
|
|
|
${Boost_CHRONO_LIBRARY}
|
|
|
|
${Boost_THREAD_LIBRARY}
|
2016-08-29 17:56:34 +00:00
|
|
|
${GTEST_LIBRARIES}
|
2016-09-17 17:59:29 +00:00
|
|
|
${CMAKE_THREAD_LIBS_INIT}
|
2014-10-21 17:01:56 +00:00
|
|
|
${EXTRA_LIBRARIES})
|
|
|
|
set_property(TARGET unit_tests
|
|
|
|
PROPERTY
|
|
|
|
FOLDER "tests")
|
|
|
|
|
|
|
|
if (NOT MSVC)
|
|
|
|
set_property(TARGET unit_tests
|
|
|
|
APPEND_STRING
|
|
|
|
PROPERTY
|
|
|
|
COMPILE_FLAGS " -Wno-undef -Wno-sign-compare")
|
|
|
|
endif ()
|
|
|
|
|
2018-05-15 19:38:27 +00:00
|
|
|
SET_PROPERTY(SOURCE main.cpp PROPERTY COMPILE_FLAGS -DDEFAULT_DATA_DIR="\\"${CMAKE_SOURCE_DIR}/tests/data\\"")
|
|
|
|
|
2017-10-26 09:16:48 +00:00
|
|
|
SET_PROPERTY(SOURCE memwipe.cpp PROPERTY COMPILE_FLAGS -Ofast)
|
|
|
|
|
2014-10-21 17:01:56 +00:00
|
|
|
add_test(
|
|
|
|
NAME unit_tests
|
2018-10-17 21:12:11 +00:00
|
|
|
COMMAND unit_tests --data-dir "${TEST_DATA_DIR}")
|
2018-10-01 09:13:22 +00:00
|
|
|
|
|
|
|
add_executable(test_notifier test_notifier.cpp)
|
|
|
|
target_link_libraries(test_notifier ${EXTRA_LIBRARIES})
|
|
|
|
set_property(TARGET test_notifier PROPERTY FOLDER "tests")
|