mirror of
https://github.com/monero-project/monero.git
synced 2024-11-18 10:01:02 +00:00
eee44e62bc
This would fail, as the post hard fork settings would yield different data, and the test expects pre hard fork data.
249 lines
9.6 KiB
C++
249 lines
9.6 KiB
C++
// Copyright (c) 2014-2015, 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
|
|
|
|
#include "gtest/gtest.h"
|
|
|
|
#include "cryptonote_core/cryptonote_basic_impl.h"
|
|
|
|
using namespace cryptonote;
|
|
|
|
namespace
|
|
{
|
|
//--------------------------------------------------------------------------------------------------------------------
|
|
class block_reward_and_already_generated_coins : public ::testing::Test
|
|
{
|
|
protected:
|
|
static const size_t current_block_size = CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V1 / 2;
|
|
|
|
bool m_block_not_too_big;
|
|
uint64_t m_block_reward;
|
|
};
|
|
|
|
#define TEST_ALREADY_GENERATED_COINS(already_generated_coins, expected_reward) \
|
|
m_block_not_too_big = get_block_reward(0, current_block_size, already_generated_coins, m_block_reward,1); \
|
|
ASSERT_TRUE(m_block_not_too_big); \
|
|
ASSERT_EQ(m_block_reward, expected_reward);
|
|
|
|
TEST_F(block_reward_and_already_generated_coins, handles_first_values)
|
|
{
|
|
// 17592186044415 from neozaru, confirmed by fluffypony
|
|
TEST_ALREADY_GENERATED_COINS(0, UINT64_C(17592186044415));
|
|
TEST_ALREADY_GENERATED_COINS(m_block_reward, UINT64_C(17592169267200));
|
|
TEST_ALREADY_GENERATED_COINS(UINT64_C(2756434948434199641), UINT64_C(14963444829249));
|
|
}
|
|
|
|
TEST_F(block_reward_and_already_generated_coins, correctly_steps_from_2_to_1)
|
|
{
|
|
TEST_ALREADY_GENERATED_COINS(MONEY_SUPPLY - ((2 << 20) + 1), FINAL_SUBSIDY_PER_MINUTE);
|
|
TEST_ALREADY_GENERATED_COINS(MONEY_SUPPLY - (2 << 20) , FINAL_SUBSIDY_PER_MINUTE);
|
|
TEST_ALREADY_GENERATED_COINS(MONEY_SUPPLY - ((2 << 20) - 1), FINAL_SUBSIDY_PER_MINUTE);
|
|
}
|
|
|
|
TEST_F(block_reward_and_already_generated_coins, handles_max)
|
|
{
|
|
TEST_ALREADY_GENERATED_COINS(MONEY_SUPPLY - ((1 << 20) + 1), FINAL_SUBSIDY_PER_MINUTE);
|
|
TEST_ALREADY_GENERATED_COINS(MONEY_SUPPLY - (1 << 20) , FINAL_SUBSIDY_PER_MINUTE);
|
|
TEST_ALREADY_GENERATED_COINS(MONEY_SUPPLY - ((1 << 20) - 1), FINAL_SUBSIDY_PER_MINUTE);
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------------------------
|
|
class block_reward_and_current_block_size : public ::testing::Test
|
|
{
|
|
protected:
|
|
virtual void SetUp()
|
|
{
|
|
m_block_not_too_big = get_block_reward(0, 0, already_generated_coins, m_standard_block_reward, 1);
|
|
ASSERT_TRUE(m_block_not_too_big);
|
|
ASSERT_LT(CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V1, m_standard_block_reward);
|
|
}
|
|
|
|
void do_test(size_t median_block_size, size_t current_block_size)
|
|
{
|
|
m_block_not_too_big = get_block_reward(median_block_size, current_block_size, already_generated_coins, m_block_reward, 1);
|
|
}
|
|
|
|
static const uint64_t already_generated_coins = 0;
|
|
|
|
bool m_block_not_too_big;
|
|
uint64_t m_block_reward;
|
|
uint64_t m_standard_block_reward;
|
|
};
|
|
|
|
TEST_F(block_reward_and_current_block_size, handles_block_size_less_relevance_level)
|
|
{
|
|
do_test(0, CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V1 - 1);
|
|
ASSERT_TRUE(m_block_not_too_big);
|
|
ASSERT_EQ(m_block_reward, m_standard_block_reward);
|
|
}
|
|
|
|
TEST_F(block_reward_and_current_block_size, handles_block_size_eq_relevance_level)
|
|
{
|
|
do_test(0, CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V1);
|
|
ASSERT_TRUE(m_block_not_too_big);
|
|
ASSERT_EQ(m_block_reward, m_standard_block_reward);
|
|
}
|
|
|
|
TEST_F(block_reward_and_current_block_size, handles_block_size_gt_relevance_level)
|
|
{
|
|
do_test(0, CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V1 + 1);
|
|
ASSERT_TRUE(m_block_not_too_big);
|
|
ASSERT_LT(m_block_reward, m_standard_block_reward);
|
|
}
|
|
|
|
TEST_F(block_reward_and_current_block_size, handles_block_size_less_2_relevance_level)
|
|
{
|
|
do_test(0, 2 * CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V1 - 1);
|
|
ASSERT_TRUE(m_block_not_too_big);
|
|
ASSERT_LT(m_block_reward, m_standard_block_reward);
|
|
ASSERT_LT(0, m_block_reward);
|
|
}
|
|
|
|
TEST_F(block_reward_and_current_block_size, handles_block_size_eq_2_relevance_level)
|
|
{
|
|
do_test(0, 2 * CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V1);
|
|
ASSERT_TRUE(m_block_not_too_big);
|
|
ASSERT_EQ(0, m_block_reward);
|
|
}
|
|
|
|
TEST_F(block_reward_and_current_block_size, handles_block_size_gt_2_relevance_level)
|
|
{
|
|
do_test(0, 2 * CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V1 + 1);
|
|
ASSERT_FALSE(m_block_not_too_big);
|
|
}
|
|
|
|
TEST_F(block_reward_and_current_block_size, fails_on_huge_median_size)
|
|
{
|
|
#if !defined(NDEBUG)
|
|
size_t huge_size = std::numeric_limits<uint32_t>::max() + UINT64_C(2);
|
|
ASSERT_DEATH(do_test(huge_size, huge_size + 1), "");
|
|
#endif
|
|
}
|
|
|
|
TEST_F(block_reward_and_current_block_size, fails_on_huge_block_size)
|
|
{
|
|
#if !defined(NDEBUG)
|
|
size_t huge_size = std::numeric_limits<uint32_t>::max() + UINT64_C(2);
|
|
ASSERT_DEATH(do_test(huge_size - 2, huge_size), "");
|
|
#endif
|
|
}
|
|
|
|
//--------------------------------------------------------------------------------------------------------------------
|
|
class block_reward_and_last_block_sizes : public ::testing::Test
|
|
{
|
|
protected:
|
|
virtual void SetUp()
|
|
{
|
|
m_last_block_sizes.push_back(3 * CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V1);
|
|
m_last_block_sizes.push_back(5 * CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V1);
|
|
m_last_block_sizes.push_back(7 * CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V1);
|
|
m_last_block_sizes.push_back(11 * CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V1);
|
|
m_last_block_sizes.push_back(13 * CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V1);
|
|
|
|
m_last_block_sizes_median = 7 * CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V1;
|
|
|
|
m_block_not_too_big = get_block_reward(epee::misc_utils::median(m_last_block_sizes), 0, already_generated_coins, m_standard_block_reward, 1);
|
|
ASSERT_TRUE(m_block_not_too_big);
|
|
ASSERT_LT(CRYPTONOTE_BLOCK_GRANTED_FULL_REWARD_ZONE_V1, m_standard_block_reward);
|
|
}
|
|
|
|
void do_test(size_t current_block_size)
|
|
{
|
|
m_block_not_too_big = get_block_reward(epee::misc_utils::median(m_last_block_sizes), current_block_size, already_generated_coins, m_block_reward, 1);
|
|
}
|
|
|
|
static const uint64_t already_generated_coins = 0;
|
|
|
|
std::vector<size_t> m_last_block_sizes;
|
|
uint64_t m_last_block_sizes_median;
|
|
bool m_block_not_too_big;
|
|
uint64_t m_block_reward;
|
|
uint64_t m_standard_block_reward;
|
|
};
|
|
|
|
TEST_F(block_reward_and_last_block_sizes, handles_block_size_less_median)
|
|
{
|
|
do_test(m_last_block_sizes_median - 1);
|
|
ASSERT_TRUE(m_block_not_too_big);
|
|
ASSERT_EQ(m_block_reward, m_standard_block_reward);
|
|
}
|
|
|
|
TEST_F(block_reward_and_last_block_sizes, handles_block_size_eq_median)
|
|
{
|
|
do_test(m_last_block_sizes_median);
|
|
ASSERT_TRUE(m_block_not_too_big);
|
|
ASSERT_EQ(m_block_reward, m_standard_block_reward);
|
|
}
|
|
|
|
TEST_F(block_reward_and_last_block_sizes, handles_block_size_gt_median)
|
|
{
|
|
do_test(m_last_block_sizes_median + 1);
|
|
ASSERT_TRUE(m_block_not_too_big);
|
|
ASSERT_LT(m_block_reward, m_standard_block_reward);
|
|
}
|
|
|
|
TEST_F(block_reward_and_last_block_sizes, handles_block_size_less_2_medians)
|
|
{
|
|
do_test(2 * m_last_block_sizes_median - 1);
|
|
ASSERT_TRUE(m_block_not_too_big);
|
|
ASSERT_LT(m_block_reward, m_standard_block_reward);
|
|
ASSERT_LT(0, m_block_reward);
|
|
}
|
|
|
|
TEST_F(block_reward_and_last_block_sizes, handles_block_size_eq_2_medians)
|
|
{
|
|
do_test(2 * m_last_block_sizes_median);
|
|
ASSERT_TRUE(m_block_not_too_big);
|
|
ASSERT_EQ(0, m_block_reward);
|
|
}
|
|
|
|
TEST_F(block_reward_and_last_block_sizes, handles_block_size_gt_2_medians)
|
|
{
|
|
do_test(2 * m_last_block_sizes_median + 1);
|
|
ASSERT_FALSE(m_block_not_too_big);
|
|
}
|
|
|
|
TEST_F(block_reward_and_last_block_sizes, calculates_correctly)
|
|
{
|
|
ASSERT_EQ(0, m_last_block_sizes_median % 8);
|
|
|
|
do_test(m_last_block_sizes_median * 9 / 8);
|
|
ASSERT_TRUE(m_block_not_too_big);
|
|
ASSERT_EQ(m_block_reward, m_standard_block_reward * 63 / 64);
|
|
|
|
// 3/2 = 12/8
|
|
do_test(m_last_block_sizes_median * 3 / 2);
|
|
ASSERT_TRUE(m_block_not_too_big);
|
|
ASSERT_EQ(m_block_reward, m_standard_block_reward * 3 / 4);
|
|
|
|
do_test(m_last_block_sizes_median * 15 / 8);
|
|
ASSERT_TRUE(m_block_not_too_big);
|
|
ASSERT_EQ(m_block_reward, m_standard_block_reward * 15 / 64);
|
|
}
|
|
}
|