aboutsummaryrefslogtreecommitdiff
path: root/src/checkpoints.cpp
diff options
context:
space:
mode:
authorJackson Palmer <[email protected]>2014-01-19 15:41:55 +1100
committerJackson Palmer <[email protected]>2014-01-19 15:41:55 +1100
commit68b0507f00ee29bcf29f3c992a882c712f990da6 (patch)
tree3140d6000b9018767e91069ccd83b0bad3e256f5 /src/checkpoints.cpp
downloaddiscoin-68b0507f00ee29bcf29f3c992a882c712f990da6.tar.xz
discoin-68b0507f00ee29bcf29f3c992a882c712f990da6.zip
Initial commit
Successfully building on Ubuntu + Windows.
Diffstat (limited to 'src/checkpoints.cpp')
-rw-r--r--src/checkpoints.cpp140
1 files changed, 140 insertions, 0 deletions
diff --git a/src/checkpoints.cpp b/src/checkpoints.cpp
new file mode 100644
index 000000000..73671ea9f
--- /dev/null
+++ b/src/checkpoints.cpp
@@ -0,0 +1,140 @@
+// Copyright (c) 2009-2012 The Bitcoin developers
+// Distributed under the MIT/X11 software license, see the accompanying
+// file COPYING or http://www.opensource.org/licenses/mit-license.php.
+
+#include <boost/assign/list_of.hpp> // for 'map_list_of()'
+#include <boost/foreach.hpp>
+
+#include "checkpoints.h"
+
+#include "main.h"
+#include "uint256.h"
+
+namespace Checkpoints
+{
+ typedef std::map<int, uint256> MapCheckpoints;
+
+ // How many times we expect transactions after the last checkpoint to
+ // be slower. This number is a compromise, as it can't be accurate for
+ // every system. When reindexing from a fast disk with a slow CPU, it
+ // can be up to 20, while when downloading from a slow network with a
+ // fast multicore CPU, it won't be much higher than 1.
+ static const double fSigcheckVerificationFactor = 5.0;
+
+ struct CCheckpointData {
+ const MapCheckpoints *mapCheckpoints;
+ int64 nTimeLastCheckpoint;
+ int64 nTransactionsLastCheckpoint;
+ double fTransactionsPerDay;
+ };
+
+ // 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
+ ( 0, uint256("0x1a91e3dace36e2be3bf030a65679fe821aa1d6ef92e7c9902eb318182c355691"))
+ ( 42279, uint256("0x8444c3ef39a46222e87584ef956ad2c9ef401578bd8b51e8e4b9a86ec3134d3a"))
+ ( 42400, uint256("0x557bb7c17ed9e6d4a6f9361cfddf7c1fc0bdc394af7019167442b41f507252b4"))
+ ;
+ static const CCheckpointData data = {
+ &mapCheckpoints,
+ 1388890893, // * UNIX timestamp of last checkpoint block
+ 2982687, // * total number of transactions between genesis and last checkpoint
+ // (the tx=... number in the SetBestChain debug.log lines)
+ 8000.0 // * estimated number of transactions per day after checkpoint
+ };
+
+ static MapCheckpoints mapCheckpointsTestnet =
+ boost::assign::map_list_of
+ ( 0, uint256("0x"))
+ ;
+ static const CCheckpointData dataTestnet = {
+ &mapCheckpointsTestnet,
+ 1369685559,
+ 37581,
+ 300
+ };
+
+ const CCheckpointData &Checkpoints() {
+ if (fTestNet)
+ return dataTestnet;
+ else
+ return data;
+ }
+
+ bool CheckBlock(int nHeight, const uint256& hash)
+ {
+ if (fTestNet) return true; // Testnet has no checkpoints
+ if (!GetBoolArg("-checkpoints", true))
+ return true;
+
+ const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;
+
+ MapCheckpoints::const_iterator i = checkpoints.find(nHeight);
+ if (i == checkpoints.end()) return true;
+ return hash == i->second;
+ }
+
+ // Guess how far we are in the verification process at the given block index
+ double GuessVerificationProgress(CBlockIndex *pindex) {
+ if (pindex==NULL)
+ return 0.0;
+
+ int64 nNow = time(NULL);
+
+ double fWorkBefore = 0.0; // Amount of work done before pindex
+ double fWorkAfter = 0.0; // Amount of work left after pindex (estimated)
+ // Work is defined as: 1.0 per transaction before the last checkoint, and
+ // fSigcheckVerificationFactor per transaction after.
+
+ const CCheckpointData &data = Checkpoints();
+
+ if (pindex->nChainTx <= data.nTransactionsLastCheckpoint) {
+ double nCheapBefore = pindex->nChainTx;
+ double nCheapAfter = data.nTransactionsLastCheckpoint - pindex->nChainTx;
+ double nExpensiveAfter = (nNow - data.nTimeLastCheckpoint)/86400.0*data.fTransactionsPerDay;
+ fWorkBefore = nCheapBefore;
+ fWorkAfter = nCheapAfter + nExpensiveAfter*fSigcheckVerificationFactor;
+ } else {
+ double nCheapBefore = data.nTransactionsLastCheckpoint;
+ double nExpensiveBefore = pindex->nChainTx - data.nTransactionsLastCheckpoint;
+ double nExpensiveAfter = (nNow - pindex->nTime)/86400.0*data.fTransactionsPerDay;
+ fWorkBefore = nCheapBefore + nExpensiveBefore*fSigcheckVerificationFactor;
+ fWorkAfter = nExpensiveAfter*fSigcheckVerificationFactor;
+ }
+
+ return fWorkBefore / (fWorkBefore + fWorkAfter);
+ }
+
+ int GetTotalBlocksEstimate()
+ {
+ if (fTestNet) return 0; // Testnet has no checkpoints
+ if (!GetBoolArg("-checkpoints", true))
+ return 0;
+
+ const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;
+
+ return checkpoints.rbegin()->first;
+ }
+
+ CBlockIndex* GetLastCheckpoint(const std::map<uint256, CBlockIndex*>& mapBlockIndex)
+ {
+ if (fTestNet) return NULL; // Testnet has no checkpoints
+ if (!GetBoolArg("-checkpoints", true))
+ return NULL;
+
+ const MapCheckpoints& checkpoints = *Checkpoints().mapCheckpoints;
+
+ BOOST_REVERSE_FOREACH(const MapCheckpoints::value_type& i, checkpoints)
+ {
+ const uint256& hash = i.second;
+ std::map<uint256, CBlockIndex*>::const_iterator t = mapBlockIndex.find(hash);
+ if (t != mapBlockIndex.end())
+ return t->second;
+ }
+ return NULL;
+ }
+}