@ -15,11 +15,11 @@ namespace Checkpoints
@@ -15,11 +15,11 @@ namespace Checkpoints
typedef std : : map < int , uint256 > MapCheckpoints ;
// How many times we expect transactions after the last checkpoint to
// be slower. This number is conservative. On multi-core CPUs with
// parallel signature checking enabled, this number is way too high.
// We prefer a progressbar that's faster at the end than the other
// way around, though .
static const double fSigcheckVerificationFactor = 1 5.0;
// 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 ;
@ -48,10 +48,10 @@ namespace Checkpoints
@@ -48,10 +48,10 @@ namespace Checkpoints
;
static const CCheckpointData data = {
& mapCheckpoints ,
1357902690 , // * UNIX timestamp of last checkpoint block
11011160 , // * total number of transactions between genesis and last checkpoint
1363044259 , // * UNIX timestamp of last checkpoint block
14264869 , // * total number of transactions between genesis and last checkpoint
// (the tx=... number in the SetBestChain debug.log lines)
5 0000.0 // * estimated number of transactions per day after checkpoint
6 0000.0 // * estimated number of transactions per day after checkpoint
} ;
static MapCheckpoints mapCheckpointsTestnet =