2014-03-18 10:11:00 +01:00
|
|
|
// Copyright (c) 2011-2014 The Bitcoin Core developers
|
|
|
|
// Distributed under the MIT/X11 software license, see the accompanying
|
|
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
|
2011-09-06 22:09:04 +02:00
|
|
|
//
|
|
|
|
// Unit tests for denial-of-service detection/prevention code
|
|
|
|
//
|
2012-05-16 21:57:04 +02:00
|
|
|
|
2011-09-06 22:09:04 +02:00
|
|
|
|
2013-04-13 07:13:08 +02:00
|
|
|
|
|
|
|
#include "keystore.h"
|
2011-10-12 01:50:06 +02:00
|
|
|
#include "main.h"
|
|
|
|
#include "net.h"
|
2014-03-10 16:46:53 +01:00
|
|
|
#include "pow.h"
|
2014-08-27 17:22:33 +02:00
|
|
|
#include "script/sign.h"
|
2013-04-13 07:13:08 +02:00
|
|
|
#include "serialize.h"
|
Split up util.cpp/h
Split up util.cpp/h into:
- string utilities (hex, base32, base64): no internal dependencies, no dependency on boost (apart from foreach)
- money utilities (parsesmoney, formatmoney)
- time utilities (gettime*, sleep, format date):
- and the rest (logging, argument parsing, config file parsing)
The latter is basically the environment and OS handling,
and is stripped of all utility functions, so we may want to
rename it to something else than util.cpp/h for clarity (Matt suggested
osinterface).
Breaks dependency of sha256.cpp on all the things pulled in by util.
2014-08-21 16:11:09 +02:00
|
|
|
#include "util.h"
|
2011-09-06 22:09:04 +02:00
|
|
|
|
2012-01-03 23:33:31 +01:00
|
|
|
#include <stdint.h>
|
|
|
|
|
2013-04-13 07:13:08 +02:00
|
|
|
#include <boost/assign/list_of.hpp> // for 'map_list_of()'
|
|
|
|
#include <boost/date_time/posix_time/posix_time_types.hpp>
|
|
|
|
#include <boost/foreach.hpp>
|
|
|
|
#include <boost/test/unit_test.hpp>
|
|
|
|
|
2012-02-29 16:14:18 +01:00
|
|
|
// Tests this internal-to-main.cpp method:
|
2013-08-02 07:14:44 +02:00
|
|
|
extern bool AddOrphanTx(const CTransaction& tx);
|
2012-04-23 20:14:03 +02:00
|
|
|
extern unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans);
|
2013-08-02 07:14:44 +02:00
|
|
|
extern std::map<uint256, CTransaction> mapOrphanTransactions;
|
|
|
|
extern std::map<uint256, std::set<uint256> > mapOrphanTransactionsByPrev;
|
2012-02-29 16:14:18 +01:00
|
|
|
|
2012-01-03 23:33:31 +01:00
|
|
|
CService ip(uint32_t i)
|
|
|
|
{
|
|
|
|
struct in_addr s;
|
|
|
|
s.s_addr = i;
|
2013-05-07 15:16:25 +02:00
|
|
|
return CService(CNetAddr(s), Params().GetDefaultPort());
|
2012-01-03 23:33:31 +01:00
|
|
|
}
|
2011-09-06 22:09:04 +02:00
|
|
|
|
|
|
|
BOOST_AUTO_TEST_SUITE(DoS_tests)
|
|
|
|
|
|
|
|
BOOST_AUTO_TEST_CASE(DoS_banning)
|
|
|
|
{
|
|
|
|
CNode::ClearBanned();
|
2012-01-03 23:33:31 +01:00
|
|
|
CAddress addr1(ip(0xa0b0c001));
|
2012-02-12 13:45:24 +01:00
|
|
|
CNode dummyNode1(INVALID_SOCKET, addr1, "", true);
|
2013-11-18 01:25:17 +01:00
|
|
|
dummyNode1.nVersion = 1;
|
|
|
|
Misbehaving(dummyNode1.GetId(), 100); // Should get banned
|
|
|
|
SendMessages(&dummyNode1, false);
|
2012-01-03 23:33:31 +01:00
|
|
|
BOOST_CHECK(CNode::IsBanned(addr1));
|
2012-07-26 02:48:39 +02:00
|
|
|
BOOST_CHECK(!CNode::IsBanned(ip(0xa0b0c001|0x0000ff00))); // Different IP, not banned
|
2011-09-06 22:09:04 +02:00
|
|
|
|
2012-01-03 23:33:31 +01:00
|
|
|
CAddress addr2(ip(0xa0b0c002));
|
2012-02-12 13:45:24 +01:00
|
|
|
CNode dummyNode2(INVALID_SOCKET, addr2, "", true);
|
2013-11-18 01:25:17 +01:00
|
|
|
dummyNode2.nVersion = 1;
|
|
|
|
Misbehaving(dummyNode2.GetId(), 50);
|
|
|
|
SendMessages(&dummyNode2, false);
|
2012-01-03 23:33:31 +01:00
|
|
|
BOOST_CHECK(!CNode::IsBanned(addr2)); // 2 not banned yet...
|
|
|
|
BOOST_CHECK(CNode::IsBanned(addr1)); // ... but 1 still should be
|
2013-11-18 01:25:17 +01:00
|
|
|
Misbehaving(dummyNode2.GetId(), 50);
|
|
|
|
SendMessages(&dummyNode2, false);
|
2012-01-03 23:33:31 +01:00
|
|
|
BOOST_CHECK(CNode::IsBanned(addr2));
|
2012-10-05 19:22:21 +02:00
|
|
|
}
|
2011-09-06 22:09:04 +02:00
|
|
|
|
|
|
|
BOOST_AUTO_TEST_CASE(DoS_banscore)
|
|
|
|
{
|
|
|
|
CNode::ClearBanned();
|
|
|
|
mapArgs["-banscore"] = "111"; // because 11 is my favorite number
|
2012-01-03 23:33:31 +01:00
|
|
|
CAddress addr1(ip(0xa0b0c001));
|
2012-02-12 13:45:24 +01:00
|
|
|
CNode dummyNode1(INVALID_SOCKET, addr1, "", true);
|
2013-11-18 01:25:17 +01:00
|
|
|
dummyNode1.nVersion = 1;
|
|
|
|
Misbehaving(dummyNode1.GetId(), 100);
|
|
|
|
SendMessages(&dummyNode1, false);
|
2012-01-03 23:33:31 +01:00
|
|
|
BOOST_CHECK(!CNode::IsBanned(addr1));
|
2013-11-18 01:25:17 +01:00
|
|
|
Misbehaving(dummyNode1.GetId(), 10);
|
|
|
|
SendMessages(&dummyNode1, false);
|
2012-01-03 23:33:31 +01:00
|
|
|
BOOST_CHECK(!CNode::IsBanned(addr1));
|
2013-11-18 01:25:17 +01:00
|
|
|
Misbehaving(dummyNode1.GetId(), 1);
|
|
|
|
SendMessages(&dummyNode1, false);
|
2012-01-03 23:33:31 +01:00
|
|
|
BOOST_CHECK(CNode::IsBanned(addr1));
|
2012-05-16 21:57:04 +02:00
|
|
|
mapArgs.erase("-banscore");
|
2011-09-06 22:09:04 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
BOOST_AUTO_TEST_CASE(DoS_bantime)
|
|
|
|
{
|
|
|
|
CNode::ClearBanned();
|
2013-04-13 07:13:08 +02:00
|
|
|
int64_t nStartTime = GetTime();
|
2011-09-06 22:09:04 +02:00
|
|
|
SetMockTime(nStartTime); // Overrides future calls to GetTime()
|
|
|
|
|
2012-01-03 23:33:31 +01:00
|
|
|
CAddress addr(ip(0xa0b0c001));
|
2012-02-12 13:45:24 +01:00
|
|
|
CNode dummyNode(INVALID_SOCKET, addr, "", true);
|
2013-11-18 01:25:17 +01:00
|
|
|
dummyNode.nVersion = 1;
|
2011-09-06 22:09:04 +02:00
|
|
|
|
2013-11-18 01:25:17 +01:00
|
|
|
Misbehaving(dummyNode.GetId(), 100);
|
|
|
|
SendMessages(&dummyNode, false);
|
2012-01-03 23:33:31 +01:00
|
|
|
BOOST_CHECK(CNode::IsBanned(addr));
|
2011-09-06 22:09:04 +02:00
|
|
|
|
|
|
|
SetMockTime(nStartTime+60*60);
|
2012-01-03 23:33:31 +01:00
|
|
|
BOOST_CHECK(CNode::IsBanned(addr));
|
2011-09-06 22:09:04 +02:00
|
|
|
|
|
|
|
SetMockTime(nStartTime+60*60*24+1);
|
2012-01-03 23:33:31 +01:00
|
|
|
BOOST_CHECK(!CNode::IsBanned(addr));
|
|
|
|
}
|
2011-09-06 22:09:04 +02:00
|
|
|
|
2013-04-13 07:13:08 +02:00
|
|
|
static bool CheckNBits(unsigned int nbits1, int64_t time1, unsigned int nbits2, int64_t time2)\
|
2011-09-08 18:51:43 +02:00
|
|
|
{
|
|
|
|
if (time1 > time2)
|
|
|
|
return CheckNBits(nbits2, time2, nbits1, time1);
|
2013-04-13 07:13:08 +02:00
|
|
|
int64_t deltaTime = time2-time1;
|
2011-09-08 18:51:43 +02:00
|
|
|
|
2014-06-20 20:55:42 +02:00
|
|
|
return CheckMinWork(nbits2, nbits1, deltaTime);
|
2011-09-08 18:51:43 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
BOOST_AUTO_TEST_CASE(DoS_checknbits)
|
|
|
|
{
|
|
|
|
using namespace boost::assign; // for 'map_list_of()'
|
|
|
|
|
2012-10-05 19:22:21 +02:00
|
|
|
// Timestamps,nBits from the bitcoin block chain.
|
2011-09-08 18:51:43 +02:00
|
|
|
// These are the block-chain checkpoint blocks
|
2013-04-13 07:13:08 +02:00
|
|
|
typedef std::map<int64_t, unsigned int> BlockData;
|
2011-09-08 18:51:43 +02:00
|
|
|
BlockData chainData =
|
|
|
|
map_list_of(1239852051,486604799)(1262749024,486594666)
|
|
|
|
(1279305360,469854461)(1280200847,469830746)(1281678674,469809688)
|
|
|
|
(1296207707,453179945)(1302624061,453036989)(1309640330,437004818)
|
|
|
|
(1313172719,436789733);
|
|
|
|
|
|
|
|
// Make sure CheckNBits considers every combination of block-chain-lock-in-points
|
|
|
|
// "sane":
|
|
|
|
BOOST_FOREACH(const BlockData::value_type& i, chainData)
|
|
|
|
{
|
|
|
|
BOOST_FOREACH(const BlockData::value_type& j, chainData)
|
|
|
|
{
|
|
|
|
BOOST_CHECK(CheckNBits(i.second, i.first, j.second, j.first));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Test a couple of insane combinations:
|
|
|
|
BlockData::value_type firstcheck = *(chainData.begin());
|
|
|
|
BlockData::value_type lastcheck = *(chainData.rbegin());
|
|
|
|
|
|
|
|
// First checkpoint difficulty at or a while after the last checkpoint time should fail when
|
|
|
|
// compared to last checkpoint
|
|
|
|
BOOST_CHECK(!CheckNBits(firstcheck.second, lastcheck.first+60*10, lastcheck.second, lastcheck.first));
|
|
|
|
BOOST_CHECK(!CheckNBits(firstcheck.second, lastcheck.first+60*60*24*14, lastcheck.second, lastcheck.first));
|
|
|
|
|
|
|
|
// ... but OK if enough time passed for difficulty to adjust downward:
|
|
|
|
BOOST_CHECK(CheckNBits(firstcheck.second, lastcheck.first+60*60*24*365*4, lastcheck.second, lastcheck.first));
|
|
|
|
}
|
|
|
|
|
2012-02-29 16:14:18 +01:00
|
|
|
CTransaction RandomOrphan()
|
|
|
|
{
|
2013-08-02 07:14:44 +02:00
|
|
|
std::map<uint256, CTransaction>::iterator it;
|
2012-05-17 18:13:14 +02:00
|
|
|
it = mapOrphanTransactions.lower_bound(GetRandHash());
|
2012-02-29 16:14:18 +01:00
|
|
|
if (it == mapOrphanTransactions.end())
|
|
|
|
it = mapOrphanTransactions.begin();
|
2013-08-02 07:14:44 +02:00
|
|
|
return it->second;
|
2012-02-29 16:14:18 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
BOOST_AUTO_TEST_CASE(DoS_mapOrphans)
|
|
|
|
{
|
|
|
|
CKey key;
|
|
|
|
key.MakeNewKey(true);
|
|
|
|
CBasicKeyStore keystore;
|
|
|
|
keystore.AddKey(key);
|
|
|
|
|
|
|
|
// 50 orphan transactions:
|
|
|
|
for (int i = 0; i < 50; i++)
|
|
|
|
{
|
2014-06-07 13:53:27 +02:00
|
|
|
CMutableTransaction tx;
|
2012-02-29 16:14:18 +01:00
|
|
|
tx.vin.resize(1);
|
|
|
|
tx.vin[0].prevout.n = 0;
|
2012-05-17 18:13:14 +02:00
|
|
|
tx.vin[0].prevout.hash = GetRandHash();
|
2012-02-29 16:14:18 +01:00
|
|
|
tx.vin[0].scriptSig << OP_1;
|
|
|
|
tx.vout.resize(1);
|
|
|
|
tx.vout[0].nValue = 1*CENT;
|
2012-05-14 23:44:52 +02:00
|
|
|
tx.vout[0].scriptPubKey.SetDestination(key.GetPubKey().GetID());
|
2012-02-29 16:14:18 +01:00
|
|
|
|
2013-08-02 07:14:44 +02:00
|
|
|
AddOrphanTx(tx);
|
2012-02-29 16:14:18 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// ... and 50 that depend on other orphans:
|
|
|
|
for (int i = 0; i < 50; i++)
|
|
|
|
{
|
|
|
|
CTransaction txPrev = RandomOrphan();
|
|
|
|
|
2014-06-07 13:53:27 +02:00
|
|
|
CMutableTransaction tx;
|
2012-02-29 16:14:18 +01:00
|
|
|
tx.vin.resize(1);
|
|
|
|
tx.vin[0].prevout.n = 0;
|
|
|
|
tx.vin[0].prevout.hash = txPrev.GetHash();
|
|
|
|
tx.vout.resize(1);
|
|
|
|
tx.vout[0].nValue = 1*CENT;
|
2012-05-14 23:44:52 +02:00
|
|
|
tx.vout[0].scriptPubKey.SetDestination(key.GetPubKey().GetID());
|
2012-02-29 16:14:18 +01:00
|
|
|
SignSignature(keystore, txPrev, tx, 0);
|
|
|
|
|
2013-08-02 07:14:44 +02:00
|
|
|
AddOrphanTx(tx);
|
2012-02-29 16:14:18 +01:00
|
|
|
}
|
|
|
|
|
2012-05-15 21:53:30 +02:00
|
|
|
// This really-big orphan should be ignored:
|
|
|
|
for (int i = 0; i < 10; i++)
|
|
|
|
{
|
|
|
|
CTransaction txPrev = RandomOrphan();
|
|
|
|
|
2014-06-07 13:53:27 +02:00
|
|
|
CMutableTransaction tx;
|
2012-05-15 21:53:30 +02:00
|
|
|
tx.vout.resize(1);
|
|
|
|
tx.vout[0].nValue = 1*CENT;
|
2012-05-14 23:44:52 +02:00
|
|
|
tx.vout[0].scriptPubKey.SetDestination(key.GetPubKey().GetID());
|
2012-05-15 21:53:30 +02:00
|
|
|
tx.vin.resize(500);
|
2012-05-24 18:18:50 +02:00
|
|
|
for (unsigned int j = 0; j < tx.vin.size(); j++)
|
2012-05-15 21:53:30 +02:00
|
|
|
{
|
|
|
|
tx.vin[j].prevout.n = j;
|
|
|
|
tx.vin[j].prevout.hash = txPrev.GetHash();
|
|
|
|
}
|
|
|
|
SignSignature(keystore, txPrev, tx, 0);
|
|
|
|
// Re-use same signature for other inputs
|
|
|
|
// (they don't have to be valid for this test)
|
2012-05-24 18:18:50 +02:00
|
|
|
for (unsigned int j = 1; j < tx.vin.size(); j++)
|
2012-05-15 21:53:30 +02:00
|
|
|
tx.vin[j].scriptSig = tx.vin[0].scriptSig;
|
|
|
|
|
2013-08-02 07:14:44 +02:00
|
|
|
BOOST_CHECK(!AddOrphanTx(tx));
|
2012-05-15 21:53:30 +02:00
|
|
|
}
|
|
|
|
|
2012-02-29 16:14:18 +01:00
|
|
|
// Test LimitOrphanTxSize() function:
|
|
|
|
LimitOrphanTxSize(40);
|
|
|
|
BOOST_CHECK(mapOrphanTransactions.size() <= 40);
|
|
|
|
LimitOrphanTxSize(10);
|
|
|
|
BOOST_CHECK(mapOrphanTransactions.size() <= 10);
|
|
|
|
LimitOrphanTxSize(0);
|
|
|
|
BOOST_CHECK(mapOrphanTransactions.empty());
|
|
|
|
BOOST_CHECK(mapOrphanTransactionsByPrev.empty());
|
|
|
|
}
|
|
|
|
|
2011-09-06 22:09:04 +02:00
|
|
|
BOOST_AUTO_TEST_SUITE_END()
|