mirror of https://github.com/lukechilds/komodo.git
Gavin Andresen
13 years ago
13 changed files with 247 additions and 31 deletions
@ -0,0 +1,65 @@ |
|||||
|
// Copyright (c) 2011 The Bitcoin developers
|
||||
|
// Distributed under the MIT/X11 software license, see the accompanying
|
||||
|
// file license.txt or http://www.opensource.org/licenses/mit-license.php.
|
||||
|
|
||||
|
#include <boost/assign/list_of.hpp> // for 'map_list_of()' |
||||
|
#include <boost/foreach.hpp> |
||||
|
|
||||
|
#include "headers.h" |
||||
|
#include "checkpoints.h" |
||||
|
|
||||
|
namespace Checkpoints |
||||
|
{ |
||||
|
typedef std::map<int, uint256> MapCheckpoints; |
||||
|
|
||||
|
//
|
||||
|
// What makes a good checkpoint block?
|
||||
|
// + Is surrounded by blocks with reasonable timestamps
|
||||
|
// (no blocks before with a timestamp after, none after with
|
||||
|
// timestamp before)
|
||||
|
// + Contains no strange transactions
|
||||
|
//
|
||||
|
static MapCheckpoints mapCheckpoints = |
||||
|
boost::assign::map_list_of |
||||
|
( 11111, uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d")) |
||||
|
( 33333, uint256("0x000000002dd5588a74784eaa7ab0507a18ad16a236e7b1ce69f00d7ddfb5d0a6")) |
||||
|
( 68555, uint256("0x00000000001e1b4903550a0b96e9a9405c8a95f387162e4944e8d9fbe501cd6a")) |
||||
|
( 70567, uint256("0x00000000006a49b14bcf27462068f1264c961f11fa2e0eddd2be0791e1d4124a")) |
||||
|
( 74000, uint256("0x0000000000573993a3c9e41ce34471c079dcf5f52a0e824a81e7f953b8661a20")) |
||||
|
(105000, uint256("0x00000000000291ce28027faea320c8d2b054b2e0fe44a773f3eefb151d6bdc97")) |
||||
|
(118000, uint256("0x000000000000774a7f8a7a12dc906ddb9e17e75d684f15e00f8767f9e8f36553")) |
||||
|
(134444, uint256("0x00000000000005b12ffd4cd315cd34ffd4a594f430ac814c91184a0d42d2b0fe")) |
||||
|
(140700, uint256("0x000000000000033b512028abb90e1626d8b346fd0ed598ac0a3c371138dce2bd")) |
||||
|
; |
||||
|
|
||||
|
bool CheckBlock(int nHeight, const uint256& hash) |
||||
|
{ |
||||
|
if (fTestNet) return true; // Testnet has no checkpoints
|
||||
|
|
||||
|
MapCheckpoints::const_iterator i = mapCheckpoints.find(nHeight); |
||||
|
if (i == mapCheckpoints.end()) return true; |
||||
|
return hash == i->second; |
||||
|
} |
||||
|
|
||||
|
int GetTotalBlocksEstimate() |
||||
|
{ |
||||
|
if (fTestNet) return 0; |
||||
|
|
||||
|
return mapCheckpoints.rbegin()->first; |
||||
|
} |
||||
|
|
||||
|
CBlockIndex* GetLastCheckpoint(const std::map<uint256, CBlockIndex*>& mapBlockIndex) |
||||
|
{ |
||||
|
if (fTestNet) return NULL; |
||||
|
|
||||
|
int64 nResult; |
||||
|
BOOST_REVERSE_FOREACH(const MapCheckpoints::value_type& i, mapCheckpoints) |
||||
|
{ |
||||
|
const uint256& hash = i.second; |
||||
|
std::map<uint256, CBlockIndex*>::const_iterator t = mapBlockIndex.find(hash); |
||||
|
if (t != mapBlockIndex.end()) |
||||
|
return t->second; |
||||
|
} |
||||
|
return NULL; |
||||
|
} |
||||
|
} |
@ -0,0 +1,29 @@ |
|||||
|
// Copyright (c) 2011 The Bitcoin developers
|
||||
|
// Distributed under the MIT/X11 software license, see the accompanying
|
||||
|
// file license.txt or http://www.opensource.org/licenses/mit-license.php.
|
||||
|
#ifndef BITCOIN_CHECKPOINT_H |
||||
|
#define BITCOIN_CHECKPOINT_H |
||||
|
|
||||
|
#include <map> |
||||
|
#include "util.h" |
||||
|
|
||||
|
class uint256; |
||||
|
class CBlockIndex; |
||||
|
|
||||
|
//
|
||||
|
// Block-chain checkpoints are compiled-in sanity checks.
|
||||
|
// They are updated every release or three.
|
||||
|
//
|
||||
|
namespace Checkpoints |
||||
|
{ |
||||
|
// Returns true if block passes checkpoint checks
|
||||
|
bool CheckBlock(int nHeight, const uint256& hash); |
||||
|
|
||||
|
// Return conservative estimate of total number of blocks, 0 if unknown
|
||||
|
int GetTotalBlocksEstimate(); |
||||
|
|
||||
|
// Returns last CBlockIndex* in mapBlockIndex that is a checkpoint
|
||||
|
CBlockIndex* GetLastCheckpoint(const std::map<uint256, CBlockIndex*>& mapBlockIndex); |
||||
|
} |
||||
|
|
||||
|
#endif |
@ -0,0 +1,34 @@ |
|||||
|
//
|
||||
|
// Unit tests for block-chain checkpoints
|
||||
|
//
|
||||
|
#include <boost/assign/list_of.hpp> // for 'map_list_of()' |
||||
|
#include <boost/test/unit_test.hpp> |
||||
|
#include <boost/foreach.hpp> |
||||
|
|
||||
|
#include "../checkpoints.h" |
||||
|
#include "../util.h" |
||||
|
|
||||
|
using namespace std; |
||||
|
|
||||
|
BOOST_AUTO_TEST_SUITE(Checkpoints_tests) |
||||
|
|
||||
|
BOOST_AUTO_TEST_CASE(sanity) |
||||
|
{ |
||||
|
uint256 p11111 = uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d"); |
||||
|
uint256 p140700 = uint256("0x000000000000033b512028abb90e1626d8b346fd0ed598ac0a3c371138dce2bd"); |
||||
|
BOOST_CHECK(Checkpoints::CheckBlock(11111, p11111)); |
||||
|
BOOST_CHECK(Checkpoints::CheckBlock(140700, p140700)); |
||||
|
|
||||
|
|
||||
|
// Wrong hashes at checkpoints should fail:
|
||||
|
BOOST_CHECK(!Checkpoints::CheckBlock(11111, p140700)); |
||||
|
BOOST_CHECK(!Checkpoints::CheckBlock(140700, p11111)); |
||||
|
|
||||
|
// ... but any hash not at a checkpoint should succeed:
|
||||
|
BOOST_CHECK(Checkpoints::CheckBlock(11111+1, p140700)); |
||||
|
BOOST_CHECK(Checkpoints::CheckBlock(140700+1, p11111)); |
||||
|
|
||||
|
BOOST_CHECK(Checkpoints::GetTotalBlocksEstimate() >= 140700); |
||||
|
} |
||||
|
|
||||
|
BOOST_AUTO_TEST_SUITE_END() |
Loading…
Reference in new issue