src/miner.cpp

   1 // Copyright (c) 2009-2010 Satoshi Nakamoto
   2 // Copyright (c) 2009-2012 The Bitcoin developers
   3 // Copyright (c) 2013 The NovaCoin developers
   4 // Distributed under the MIT/X11 software license, see the accompanying
   5 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
   6
   7 #include "txdb.h"
   8 #include "miner.h"
   9 #include "kernel.h"
  10
  11 using namespace std;
  12
  13 //////////////////////////////////////////////////////////////////////////////
  14 //
  15 // BitcoinMiner
  16 //
  17
  18 string strMintMessage = "Stake miner suspended due to locked wallet.";
  19 string strMintWarning;
  20
  21 extern unsigned int nMinerSleep;
  22
  23 int static FormatHashBlocks(void* pbuffer, unsigned int len)
  24 {
  25     unsigned char* pdata = (unsigned char*)pbuffer;
  26     unsigned int blocks = 1 + ((len + 8) / 64);
  27     unsigned char* pend = pdata + 64 * blocks;
  28     memset(pdata + len, 0, 64 * blocks - len);
  29     pdata[len] = 0x80;
  30     unsigned int bits = len * 8;
  31     pend[-1] = (bits >> 0) & 0xff;
  32     pend[-2] = (bits >> 8) & 0xff;
  33     pend[-3] = (bits >> 16) & 0xff;
  34     pend[-4] = (bits >> 24) & 0xff;
  35     return blocks;
  36 }
  37
  38 static const unsigned int pSHA256InitState[8] =
  39 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
  40
  41 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
  42 {
  43     SHA256_CTX ctx;
  44     unsigned char data[64];
  45
  46     SHA256_Init(&ctx);
  47
  48     for (int i = 0; i < 16; i++)
  49         ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
  50
  51     for (int i = 0; i < 8; i++)
  52         ctx.h[i] = ((uint32_t*)pinit)[i];
  53
  54     SHA256_Update(&ctx, data, sizeof(data));
  55     for (int i = 0; i < 8; i++)
  56         ((uint32_t*)pstate)[i] = ctx.h[i];
  57 }
  58
  59 // Some explaining would be appreciated
  60 class COrphan
  61 {
  62 public:
  63     CTransaction* ptx;
  64     set<uint256> setDependsOn;
  65     double dPriority;
  66     double dFeePerKb;
  67
  68     COrphan(CTransaction* ptxIn)
  69     {
  70         ptx = ptxIn;
  71         dPriority = dFeePerKb = 0;
  72     }
  73
  74     void print() const
  75     {
  76         printf("COrphan(hash=%s, dPriority=%.1f, dFeePerKb=%.1f)\n",
  77                ptx->GetHash().ToString().substr(0,10).c_str(), dPriority, dFeePerKb);
  78         BOOST_FOREACH(uint256 hash, setDependsOn)
  79             printf("   setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
  80     }
  81 };
  82
  83
  84 uint64 nLastBlockTx = 0;
  85 uint64 nLastBlockSize = 0;
  86 int64 nLastCoinStakeSearchInterval = 0;
  87
  88 // We want to sort transactions by priority and fee, so:
  89 typedef boost::tuple<double, double, CTransaction*> TxPriority;
  90 class TxPriorityCompare
  91 {
  92     bool byFee;
  93 public:
  94     TxPriorityCompare(bool _byFee) : byFee(_byFee) { }
  95     bool operator()(const TxPriority& a, const TxPriority& b)
  96     {
  97         if (byFee)
  98         {
  99             if (a.get<1>() == b.get<1>())
 100                 return a.get<0>() < b.get<0>();
 101             return a.get<1>() < b.get<1>();
 102         }
 103         else
 104         {
 105             if (a.get<0>() == b.get<0>())
 106                 return a.get<1>() < b.get<1>();
 107             return a.get<0>() < b.get<0>();
 108         }
 109     }
 110 };
 111
 112 // CreateNewBlock: create new block (without proof-of-work/proof-of-stake)
 113 CBlock* CreateNewBlock(CWallet* pwallet, bool fProofOfStake)
 114 {
 115     // Create new block
 116     auto_ptr<CBlock> pblock(new CBlock());
 117     if (!pblock.get())
 118         return NULL;
 119
 120     // Create coinbase tx
 121     CTransaction txNew;
 122     txNew.vin.resize(1);
 123     txNew.vin[0].prevout.SetNull();
 124     txNew.vout.resize(1);
 125
 126     if (!fProofOfStake)
 127     {
 128         CReserveKey reservekey(pwallet);
 129         txNew.vout[0].scriptPubKey.SetDestination(reservekey.GetReservedKey().GetID());
 130     }
 131     else
 132         txNew.vout[0].SetEmpty();
 133
 134     // Add our coinbase tx as first transaction
 135     pblock->vtx.push_back(txNew);
 136
 137     // Largest block you're willing to create:
 138     unsigned int nBlockMaxSize = GetArg("-blockmaxsize", MAX_BLOCK_SIZE_GEN/2);
 139     // Limit to betweeen 1K and MAX_BLOCK_SIZE-1K for sanity:
 140     nBlockMaxSize = std::max((unsigned int)1000, std::min((unsigned int)(MAX_BLOCK_SIZE-1000), nBlockMaxSize));
 141
 142     // How much of the block should be dedicated to high-priority transactions,
 143     // included regardless of the fees they pay
 144     unsigned int nBlockPrioritySize = GetArg("-blockprioritysize", 27000);
 145     nBlockPrioritySize = std::min(nBlockMaxSize, nBlockPrioritySize);
 146
 147     // Minimum block size you want to create; block will be filled with free transactions
 148     // until there are no more or the block reaches this size:
 149     unsigned int nBlockMinSize = GetArg("-blockminsize", 0);
 150     nBlockMinSize = std::min(nBlockMaxSize, nBlockMinSize);
 151
 152     // Fee-per-kilobyte amount considered the same as "free"
 153     // Be careful setting this: if you set it to zero then
 154     // a transaction spammer can cheaply fill blocks using
 155     // 1-satoshi-fee transactions. It should be set above the real
 156     // cost to you of processing a transaction.
 157     int64 nMinTxFee = MIN_TX_FEE;
 158     if (mapArgs.count("-mintxfee"))
 159         ParseMoney(mapArgs["-mintxfee"], nMinTxFee);
 160
 161     CBlockIndex* pindexPrev = pindexBest;
 162
 163     pblock->nBits = GetNextTargetRequired(pindexPrev, fProofOfStake);
 164
 165     // Collect memory pool transactions into the block
 166     int64 nFees = 0;
 167     {
 168         LOCK2(cs_main, mempool.cs);
 169         CBlockIndex* pindexPrev = pindexBest;
 170         CTxDB txdb("r");
 171
 172         // Priority order to process transactions
 173         list<COrphan> vOrphan; // list memory doesn't move
 174         map<uint256, vector<COrphan*> > mapDependers;
 175
 176         // This vector will be sorted into a priority queue:
 177         vector<TxPriority> vecPriority;
 178         vecPriority.reserve(mempool.mapTx.size());
 179         for (map<uint256, CTransaction>::iterator mi = mempool.mapTx.begin(); mi != mempool.mapTx.end(); ++mi)
 180         {
 181             CTransaction& tx = (*mi).second;
 182             if (tx.IsCoinBase() || tx.IsCoinStake() || !tx.IsFinal())
 183                 continue;
 184
 185             COrphan* porphan = NULL;
 186             double dPriority = 0;
 187             int64 nTotalIn = 0;
 188             bool fMissingInputs = false;
 189             BOOST_FOREACH(const CTxIn& txin, tx.vin)
 190             {
 191                 // Read prev transaction
 192                 CTransaction txPrev;
 193                 CTxIndex txindex;
 194                 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
 195                 {
 196                     // This should never happen; all transactions in the memory
 197                     // pool should connect to either transactions in the chain
 198                     // or other transactions in the memory pool.
 199                     if (!mempool.mapTx.count(txin.prevout.hash))
 200                     {
 201                         printf("ERROR: mempool transaction missing input\n");
 202                         if (fDebug) assert("mempool transaction missing input" == 0);
 203                         fMissingInputs = true;
 204                         if (porphan)
 205                             vOrphan.pop_back();
 206                         break;
 207                     }
 208
 209                     // Has to wait for dependencies
 210                     if (!porphan)
 211                     {
 212                         // Use list for automatic deletion
 213                         vOrphan.push_back(COrphan(&tx));
 214                         porphan = &vOrphan.back();
 215                     }
 216                     mapDependers[txin.prevout.hash].push_back(porphan);
 217                     porphan->setDependsOn.insert(txin.prevout.hash);
 218                     nTotalIn += mempool.mapTx[txin.prevout.hash].vout[txin.prevout.n].nValue;
 219                     continue;
 220                 }
 221                 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
 222                 nTotalIn += nValueIn;
 223
 224                 int nConf = txindex.GetDepthInMainChain();
 225                 dPriority += (double)nValueIn * nConf;
 226             }
 227             if (fMissingInputs) continue;
 228
 229             // Priority is sum(valuein * age) / txsize
 230             unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
 231             dPriority /= nTxSize;
 232
 233             // This is a more accurate fee-per-kilobyte than is used by the client code, because the
 234             // client code rounds up the size to the nearest 1K. That's good, because it gives an
 235             // incentive to create smaller transactions.
 236             double dFeePerKb =  double(nTotalIn-tx.GetValueOut()) / (double(nTxSize)/1000.0);
 237
 238             if (porphan)
 239             {
 240                 porphan->dPriority = dPriority;
 241                 porphan->dFeePerKb = dFeePerKb;
 242             }
 243             else
 244                 vecPriority.push_back(TxPriority(dPriority, dFeePerKb, &(*mi).second));
 245         }
 246
 247         // Collect transactions into block
 248         map<uint256, CTxIndex> mapTestPool;
 249         uint64 nBlockSize = 1000;
 250         uint64 nBlockTx = 0;
 251         int nBlockSigOps = 100;
 252         bool fSortedByFee = (nBlockPrioritySize <= 0);
 253
 254         TxPriorityCompare comparer(fSortedByFee);
 255         std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
 256
 257         while (!vecPriority.empty())
 258         {
 259             // Take highest priority transaction off the priority queue:
 260             double dPriority = vecPriority.front().get<0>();
 261             double dFeePerKb = vecPriority.front().get<1>();
 262             CTransaction& tx = *(vecPriority.front().get<2>());
 263
 264             std::pop_heap(vecPriority.begin(), vecPriority.end(), comparer);
 265             vecPriority.pop_back();
 266
 267             // Size limits
 268             unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
 269             if (nBlockSize + nTxSize >= nBlockMaxSize)
 270                 continue;
 271
 272             // Legacy limits on sigOps:
 273             unsigned int nTxSigOps = tx.GetLegacySigOpCount();
 274             if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
 275                 continue;
 276
 277             // Timestamp limit
 278             if (tx.nTime > GetAdjustedTime() || (fProofOfStake && tx.nTime > pblock->vtx[0].nTime))
 279                 continue;
 280
 281             // Simplify transaction fee - allow free = false
 282             int64 nMinFee = tx.GetMinFee(nBlockSize, true, GMF_BLOCK, nTxSize);
 283
 284             // Skip free transactions if we're past the minimum block size:
 285             if (fSortedByFee && (dFeePerKb < nMinTxFee) && (nBlockSize + nTxSize >= nBlockMinSize))
 286                 continue;
 287
 288             // Prioritize by fee once past the priority size or we run out of high-priority
 289             // transactions:
 290             if (!fSortedByFee &&
 291                 ((nBlockSize + nTxSize >= nBlockPrioritySize) || (dPriority < COIN * 144 / 250)))
 292             {
 293                 fSortedByFee = true;
 294                 comparer = TxPriorityCompare(fSortedByFee);
 295                 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
 296             }
 297
 298             // Connecting shouldn't fail due to dependency on other memory pool transactions
 299             // because we're already processing them in order of dependency
 300             map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
 301             MapPrevTx mapInputs;
 302             bool fInvalid;
 303             if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
 304                 continue;
 305
 306             int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
 307             if (nTxFees < nMinFee)
 308                 continue;
 309
 310             nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
 311             if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
 312                 continue;
 313
 314             if (!tx.ConnectInputs(txdb, mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
 315                 continue;
 316             mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
 317             swap(mapTestPool, mapTestPoolTmp);
 318
 319             // Added
 320             pblock->vtx.push_back(tx);
 321             nBlockSize += nTxSize;
 322             ++nBlockTx;
 323             nBlockSigOps += nTxSigOps;
 324             nFees += nTxFees;
 325
 326             if (fDebug && GetBoolArg("-printpriority"))
 327             {
 328                 printf("priority %.1f feeperkb %.1f txid %s\n",
 329                        dPriority, dFeePerKb, tx.GetHash().ToString().c_str());
 330             }
 331
 332             // Add transactions that depend on this one to the priority queue
 333             uint256 hash = tx.GetHash();
 334             if (mapDependers.count(hash))
 335             {
 336                 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
 337                 {
 338                     if (!porphan->setDependsOn.empty())
 339                     {
 340                         porphan->setDependsOn.erase(hash);
 341                         if (porphan->setDependsOn.empty())
 342                         {
 343                             vecPriority.push_back(TxPriority(porphan->dPriority, porphan->dFeePerKb, porphan->ptx));
 344                             std::push_heap(vecPriority.begin(), vecPriority.end(), comparer);
 345                         }
 346                     }
 347                 }
 348             }
 349         }
 350
 351         nLastBlockTx = nBlockTx;
 352         nLastBlockSize = nBlockSize;
 353
 354         if (fDebug && GetBoolArg("-printpriority"))
 355             printf("CreateNewBlock(): total size %"PRI64u"\n", nBlockSize);
 356
 357         if (!fProofOfStake)
 358         {
 359             bool fProtocol048 = fTestNet || VALIDATION_SWITCH_TIME < pblock->nTime;
 360             pblock->vtx[0].vout[0].nValue = GetProofOfWorkReward(pblock->nBits, fProtocol048 ? nFees : 0);
 361         }
 362
 363         // Fill in header
 364         pblock->hashPrevBlock  = pindexPrev->GetBlockHash();
 365         pblock->nTime          = max(pindexPrev->GetMedianTimePast()+1, pblock->GetMaxTransactionTime());
 366         pblock->nTime          = max(pblock->GetBlockTime(), PastDrift(pindexPrev->GetBlockTime()));
 367         if (!fProofOfStake)
 368             pblock->UpdateTime(pindexPrev);
 369         pblock->nNonce         = 0;
 370     }
 371
 372     return pblock.release();
 373 }
 374
 375
 376 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
 377 {
 378     // Update nExtraNonce
 379     static uint256 hashPrevBlock;
 380     if (hashPrevBlock != pblock->hashPrevBlock)
 381     {
 382         nExtraNonce = 0;
 383         hashPrevBlock = pblock->hashPrevBlock;
 384     }
 385     ++nExtraNonce;
 386
 387     unsigned int nHeight = pindexPrev->nHeight+1; // Height first in coinbase required for block.version=2
 388     pblock->vtx[0].vin[0].scriptSig = (CScript() << nHeight << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
 389     assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
 390
 391     pblock->hashMerkleRoot = pblock->BuildMerkleTree();
 392 }
 393
 394
 395 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
 396 {
 397     //
 398     // Pre-build hash buffers
 399     //
 400     struct
 401     {
 402         struct unnamed2
 403         {
 404             int nVersion;
 405             uint256 hashPrevBlock;
 406             uint256 hashMerkleRoot;
 407             unsigned int nTime;
 408             unsigned int nBits;
 409             unsigned int nNonce;
 410         }
 411         block;
 412         unsigned char pchPadding0[64];
 413         uint256 hash1;
 414         unsigned char pchPadding1[64];
 415     }
 416     tmp;
 417     memset(&tmp, 0, sizeof(tmp));
 418
 419     tmp.block.nVersion       = pblock->nVersion;
 420     tmp.block.hashPrevBlock  = pblock->hashPrevBlock;
 421     tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
 422     tmp.block.nTime          = pblock->nTime;
 423     tmp.block.nBits          = pblock->nBits;
 424     tmp.block.nNonce         = pblock->nNonce;
 425
 426     FormatHashBlocks(&tmp.block, sizeof(tmp.block));
 427     FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
 428
 429     // Byte swap all the input buffer
 430     for (unsigned int i = 0; i < sizeof(tmp)/4; i++)
 431         ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
 432
 433     // Precalc the first half of the first hash, which stays constant
 434     SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
 435
 436     memcpy(pdata, &tmp.block, 128);
 437     memcpy(phash1, &tmp.hash1, 64);
 438 }
 439
 440
 441 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
 442 {
 443     uint256 hashBlock = pblock->GetHash();
 444     uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
 445
 446     if(!pblock->IsProofOfWork())
 447         return error("CheckWork() : %s is not a proof-of-work block", hashBlock.GetHex().c_str());
 448
 449     if (hashBlock > hashTarget)
 450         return error("CheckWork() : proof-of-work not meeting target");
 451
 452     //// debug print
 453     printf("CheckWork() : new proof-of-work block found  \n  hash: %s  \ntarget: %s\n", hashBlock.GetHex().c_str(), hashTarget.GetHex().c_str());
 454     pblock->print();
 455     printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
 456
 457     // Found a solution
 458     {
 459         LOCK(cs_main);
 460         if (pblock->hashPrevBlock != hashBestChain)
 461             return error("CheckWork() : generated block is stale");
 462
 463         // Remove key from key pool
 464         reservekey.KeepKey();
 465
 466         // Track how many getdata requests this block gets
 467         {
 468             LOCK(wallet.cs_wallet);
 469             wallet.mapRequestCount[hashBlock] = 0;
 470         }
 471
 472         // Process this block the same as if we had received it from another node
 473         if (!ProcessBlock(NULL, pblock))
 474             return error("CheckWork() : ProcessBlock, block not accepted");
 475     }
 476
 477     return true;
 478 }
 479
 480 bool CheckStake(CBlock* pblock, CWallet& wallet)
 481 {
 482     uint256 proofHash = 0, hashTarget = 0;
 483     uint256 hashBlock = pblock->GetHash();
 484
 485     if(!pblock->IsProofOfStake())
 486         return error("CheckStake() : %s is not a proof-of-stake block", hashBlock.GetHex().c_str());
 487
 488     // verify hash target and signature of coinstake tx
 489     if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, proofHash, hashTarget))
 490         return error("CheckStake() : proof-of-stake checking failed");
 491
 492     //// debug print
 493     printf("CheckStake() : new proof-of-stake block found  \n  hash: %s \nproofhash: %s  \ntarget: %s\n", hashBlock.GetHex().c_str(), proofHash.GetHex().c_str(), hashTarget.GetHex().c_str());
 494     pblock->print();
 495     printf("out %s\n", FormatMoney(pblock->vtx[1].GetValueOut()).c_str());
 496
 497     // Found a solution
 498     {
 499         LOCK(cs_main);
 500         if (pblock->hashPrevBlock != hashBestChain)
 501             return error("CheckStake() : generated block is stale");
 502
 503         // Track how many getdata requests this block gets
 504         {
 505             LOCK(wallet.cs_wallet);
 506             wallet.mapRequestCount[hashBlock] = 0;
 507         }
 508
 509         // Process this block the same as if we had received it from another node
 510         if (!ProcessBlock(NULL, pblock))
 511             return error("CheckStake() : ProcessBlock, block not accepted");
 512     }
 513
 514     return true;
 515 }
 516
 517 void StakeMiner(CWallet *pwallet)
 518 {
 519     SetThreadPriority(THREAD_PRIORITY_LOWEST);
 520
 521     // Make this thread recognisable as the mining thread
 522     RenameThread("novacoin-miner");
 523
 524     // Each thread has its own counter
 525     unsigned int nExtraNonce = 0;
 526
 527     while (true)
 528     {
 529         if (fShutdown)
 530             return;
 531
 532         while (pwallet->IsLocked())
 533         {
 534             strMintWarning = strMintMessage;
 535             Sleep(1000);
 536             if (fShutdown)
 537                 return;
 538         }
 539
 540         while (vNodes.empty() || IsInitialBlockDownload())
 541         {
 542             Sleep(1000);
 543             if (fShutdown)
 544                 return;
 545         }
 546
 547         strMintWarning = "";
 548
 549         //
 550         // Create new block
 551         //
 552         CBlockIndex* pindexPrev = pindexBest;
 553
 554         auto_ptr<CBlock> pblock(CreateNewBlock(pwallet, true));
 555         if (!pblock.get())
 556             return;
 557         IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
 558
 559         // Trying to sign a block
 560         if (pblock->SignBlock(*pwallet))
 561         {
 562             strMintWarning = _("Stake generation: new block found!");
 563             SetThreadPriority(THREAD_PRIORITY_NORMAL);
 564             CheckStake(pblock.get(), *pwallet);
 565             SetThreadPriority(THREAD_PRIORITY_LOWEST);
 566             Sleep(500);
 567         }
 568         else
 569             Sleep(nMinerSleep);
 570
 571         continue;
 572     }
 573 }