1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
7 #include "checkpoints.h"
11 #include "ui_interface.h"
13 #include "scrypt_mine.h"
14 #include <boost/algorithm/string/replace.hpp>
15 #include <boost/filesystem.hpp>
16 #include <boost/filesystem/fstream.hpp>
19 using namespace boost;
25 CCriticalSection cs_setpwalletRegistered;
26 set<CWallet*> setpwalletRegistered;
28 CCriticalSection cs_main;
31 unsigned int nTransactionsUpdated = 0;
33 map<uint256, CBlockIndex*> mapBlockIndex;
34 set<pair<COutPoint, unsigned int> > setStakeSeen;
36 CBigNum bnProofOfWorkLimit(~uint256(0) >> 20); // "standard" scrypt target limit for proof of work, results with 0,000244140625 proof-of-work difficulty
37 CBigNum bnProofOfStakeLegacyLimit(~uint256(0) >> 24); // proof of stake target limit from block #15000 and until 20 June 2013, results with 0,00390625 proof of stake difficulty
38 CBigNum bnProofOfStakeLimit(~uint256(0) >> 27); // proof of stake target limit since 20 June 2013, equal to 0.03125 proof of stake difficulty
39 CBigNum bnProofOfStakeHardLimit(~uint256(0) >> 30); // disabled temporarily, will be used in the future to fix minimal proof of stake difficulty at 0.25
41 CBigNum bnProofOfWorkLimitTestNet(~uint256(0) >> 16);
43 unsigned int nStakeMinAge = 60 * 60 * 24 * 30; // 30 days as minimum age for coin age
44 unsigned int nStakeMaxAge = 60 * 60 * 24 * 90; // 90 days as stake age of full weight
45 unsigned int nStakeTargetSpacing = 10 * 60; // 10-minute stakes spacing
46 unsigned int nModifierInterval = 6 * 60 * 60; // time to elapse before new modifier is computed
48 int nCoinbaseMaturity = 500;
49 CBlockIndex* pindexGenesisBlock = NULL;
51 CBigNum bnBestChainTrust = 0;
52 CBigNum bnBestInvalidTrust = 0;
53 uint256 hashBestChain = 0;
54 CBlockIndex* pindexBest = NULL;
55 int64 nTimeBestReceived = 0;
57 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
59 map<uint256, CBlock*> mapOrphanBlocks;
60 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
61 set<pair<COutPoint, unsigned int> > setStakeSeenOrphan;
62 map<uint256, uint256> mapProofOfStake;
64 map<uint256, CDataStream*> mapOrphanTransactions;
65 map<uint256, map<uint256, CDataStream*> > mapOrphanTransactionsByPrev;
67 // Constant stuff for coinbase transactions we create:
68 CScript COINBASE_FLAGS;
70 const string strMessageMagic = "NovaCoin Signed Message:\n";
76 int64 nTransactionFee = MIN_TX_FEE;
79 //////////////////////////////////////////////////////////////////////////////
81 // dispatching functions
84 // These functions dispatch to one or all registered wallets
87 void RegisterWallet(CWallet* pwalletIn)
90 LOCK(cs_setpwalletRegistered);
91 setpwalletRegistered.insert(pwalletIn);
95 void UnregisterWallet(CWallet* pwalletIn)
98 LOCK(cs_setpwalletRegistered);
99 setpwalletRegistered.erase(pwalletIn);
103 // check whether the passed transaction is from us
104 bool static IsFromMe(CTransaction& tx)
106 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
107 if (pwallet->IsFromMe(tx))
112 // get the wallet transaction with the given hash (if it exists)
113 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
115 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
116 if (pwallet->GetTransaction(hashTx,wtx))
121 // erases transaction with the given hash from all wallets
122 void static EraseFromWallets(uint256 hash)
124 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
125 pwallet->EraseFromWallet(hash);
128 // make sure all wallets know about the given transaction, in the given block
129 void SyncWithWallets(const CTransaction& tx, const CBlock* pblock, bool fUpdate, bool fConnect)
133 // ppcoin: wallets need to refund inputs when disconnecting coinstake
134 if (tx.IsCoinStake())
136 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
137 if (pwallet->IsFromMe(tx))
138 pwallet->DisableTransaction(tx);
143 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
144 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
147 // notify wallets about a new best chain
148 void static SetBestChain(const CBlockLocator& loc)
150 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
151 pwallet->SetBestChain(loc);
154 // notify wallets about an updated transaction
155 void static UpdatedTransaction(const uint256& hashTx)
157 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
158 pwallet->UpdatedTransaction(hashTx);
162 void static PrintWallets(const CBlock& block)
164 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
165 pwallet->PrintWallet(block);
168 // notify wallets about an incoming inventory (for request counts)
169 void static Inventory(const uint256& hash)
171 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
172 pwallet->Inventory(hash);
175 // ask wallets to resend their transactions
176 void ResendWalletTransactions()
178 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
179 pwallet->ResendWalletTransactions();
188 //////////////////////////////////////////////////////////////////////////////
190 // mapOrphanTransactions
193 bool AddOrphanTx(const CDataStream& vMsg)
196 CDataStream(vMsg) >> tx;
197 uint256 hash = tx.GetHash();
198 if (mapOrphanTransactions.count(hash))
201 CDataStream* pvMsg = new CDataStream(vMsg);
203 // Ignore big transactions, to avoid a
204 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
205 // large transaction with a missing parent then we assume
206 // it will rebroadcast it later, after the parent transaction(s)
207 // have been mined or received.
208 // 10,000 orphans, each of which is at most 5,000 bytes big is
209 // at most 500 megabytes of orphans:
210 if (pvMsg->size() > 5000)
212 printf("ignoring large orphan tx (size: %"PRIszu", hash: %s)\n", pvMsg->size(), hash.ToString().substr(0,10).c_str());
217 mapOrphanTransactions[hash] = pvMsg;
218 BOOST_FOREACH(const CTxIn& txin, tx.vin)
219 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(make_pair(hash, pvMsg));
221 printf("stored orphan tx %s (mapsz %"PRIszu")\n", hash.ToString().substr(0,10).c_str(),
222 mapOrphanTransactions.size());
226 void static EraseOrphanTx(uint256 hash)
228 if (!mapOrphanTransactions.count(hash))
230 const CDataStream* pvMsg = mapOrphanTransactions[hash];
232 CDataStream(*pvMsg) >> tx;
233 BOOST_FOREACH(const CTxIn& txin, tx.vin)
235 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
236 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
237 mapOrphanTransactionsByPrev.erase(txin.prevout.hash);
240 mapOrphanTransactions.erase(hash);
243 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
245 unsigned int nEvicted = 0;
246 while (mapOrphanTransactions.size() > nMaxOrphans)
248 // Evict a random orphan:
249 uint256 randomhash = GetRandHash();
250 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
251 if (it == mapOrphanTransactions.end())
252 it = mapOrphanTransactions.begin();
253 EraseOrphanTx(it->first);
265 //////////////////////////////////////////////////////////////////////////////
267 // CTransaction and CTxIndex
270 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
273 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
275 if (!ReadFromDisk(txindexRet.pos))
277 if (prevout.n >= vout.size())
285 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
288 return ReadFromDisk(txdb, prevout, txindex);
291 bool CTransaction::ReadFromDisk(COutPoint prevout)
295 return ReadFromDisk(txdb, prevout, txindex);
298 bool CTransaction::IsStandard() const
300 if (nVersion > CTransaction::CURRENT_VERSION)
303 BOOST_FOREACH(const CTxIn& txin, vin)
305 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
306 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
307 // ~65-byte public keys, plus a few script ops.
308 if (txin.scriptSig.size() > 500)
310 if (!txin.scriptSig.IsPushOnly())
313 BOOST_FOREACH(const CTxOut& txout, vout) {
314 if (!::IsStandard(txout.scriptPubKey))
316 if (txout.nValue == 0)
323 // Check transaction inputs, and make sure any
324 // pay-to-script-hash transactions are evaluating IsStandard scripts
326 // Why bother? To avoid denial-of-service attacks; an attacker
327 // can submit a standard HASH... OP_EQUAL transaction,
328 // which will get accepted into blocks. The redemption
329 // script can be anything; an attacker could use a very
330 // expensive-to-check-upon-redemption script like:
331 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
333 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
336 return true; // Coinbases don't use vin normally
338 for (unsigned int i = 0; i < vin.size(); i++)
340 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
342 vector<vector<unsigned char> > vSolutions;
343 txnouttype whichType;
344 // get the scriptPubKey corresponding to this input:
345 const CScript& prevScript = prev.scriptPubKey;
346 if (!Solver(prevScript, whichType, vSolutions))
348 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
349 if (nArgsExpected < 0)
352 // Transactions with extra stuff in their scriptSigs are
353 // non-standard. Note that this EvalScript() call will
354 // be quick, because if there are any operations
355 // beside "push data" in the scriptSig the
356 // IsStandard() call returns false
357 vector<vector<unsigned char> > stack;
358 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
361 if (whichType == TX_SCRIPTHASH)
365 CScript subscript(stack.back().begin(), stack.back().end());
366 vector<vector<unsigned char> > vSolutions2;
367 txnouttype whichType2;
368 if (!Solver(subscript, whichType2, vSolutions2))
370 if (whichType2 == TX_SCRIPTHASH)
374 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
377 nArgsExpected += tmpExpected;
380 if (stack.size() != (unsigned int)nArgsExpected)
388 CTransaction::GetLegacySigOpCount() const
390 unsigned int nSigOps = 0;
391 BOOST_FOREACH(const CTxIn& txin, vin)
393 nSigOps += txin.scriptSig.GetSigOpCount(false);
395 BOOST_FOREACH(const CTxOut& txout, vout)
397 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
403 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
415 // Load the block this tx is in
417 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
419 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
424 // Update the tx's hashBlock
425 hashBlock = pblock->GetHash();
427 // Locate the transaction
428 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
429 if (pblock->vtx[nIndex] == *(CTransaction*)this)
431 if (nIndex == (int)pblock->vtx.size())
433 vMerkleBranch.clear();
435 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
439 // Fill in merkle branch
440 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
443 // Is the tx in a block that's in the main chain
444 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
445 if (mi == mapBlockIndex.end())
447 CBlockIndex* pindex = (*mi).second;
448 if (!pindex || !pindex->IsInMainChain())
451 return pindexBest->nHeight - pindex->nHeight + 1;
460 bool CTransaction::CheckTransaction() const
462 // Basic checks that don't depend on any context
464 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
466 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
468 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
469 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
471 // Check for negative or overflow output values
473 for (unsigned int i = 0; i < vout.size(); i++)
475 const CTxOut& txout = vout[i];
476 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
477 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
479 // ppcoin: enforce minimum output amount
480 if ((!txout.IsEmpty()) && txout.nValue < MIN_TXOUT_AMOUNT)
481 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue below minimum"));
483 if (txout.nValue > MAX_MONEY)
484 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
485 nValueOut += txout.nValue;
486 if (!MoneyRange(nValueOut))
487 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
490 // Check for duplicate inputs
491 set<COutPoint> vInOutPoints;
492 BOOST_FOREACH(const CTxIn& txin, vin)
494 if (vInOutPoints.count(txin.prevout))
496 vInOutPoints.insert(txin.prevout);
501 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
502 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
506 BOOST_FOREACH(const CTxIn& txin, vin)
507 if (txin.prevout.IsNull())
508 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
514 int64 CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree,
515 enum GetMinFee_mode mode) const
517 // Base fee is either MIN_TX_FEE or MIN_RELAY_TX_FEE
518 int64 nBaseFee = (mode == GMF_RELAY) ? MIN_RELAY_TX_FEE : MIN_TX_FEE;
520 unsigned int nBytes = ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION);
521 unsigned int nNewBlockSize = nBlockSize + nBytes;
522 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
524 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if any output is less than 0.01
525 if (nMinFee < nBaseFee)
527 BOOST_FOREACH(const CTxOut& txout, vout)
528 if (txout.nValue < CENT)
532 // Raise the price as the block approaches full
533 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
535 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
537 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
540 if (!MoneyRange(nMinFee))
546 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
547 bool* pfMissingInputs)
550 *pfMissingInputs = false;
552 if (!tx.CheckTransaction())
553 return error("CTxMemPool::accept() : CheckTransaction failed");
555 // Coinbase is only valid in a block, not as a loose transaction
557 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
559 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
560 if (tx.IsCoinStake())
561 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
563 // To help v0.1.5 clients who would see it as a negative number
564 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
565 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
567 // Rather not work on nonstandard transactions (unless -testnet)
568 if (!fTestNet && !tx.IsStandard())
569 return error("CTxMemPool::accept() : nonstandard transaction type");
571 // Do we already have it?
572 uint256 hash = tx.GetHash();
575 if (mapTx.count(hash))
579 if (txdb.ContainsTx(hash))
582 // Check for conflicts with in-memory transactions
583 CTransaction* ptxOld = NULL;
584 for (unsigned int i = 0; i < tx.vin.size(); i++)
586 COutPoint outpoint = tx.vin[i].prevout;
587 if (mapNextTx.count(outpoint))
589 // Disable replacement feature for now
592 // Allow replacing with a newer version of the same transaction
595 ptxOld = mapNextTx[outpoint].ptx;
596 if (ptxOld->IsFinal())
598 if (!tx.IsNewerThan(*ptxOld))
600 for (unsigned int i = 0; i < tx.vin.size(); i++)
602 COutPoint outpoint = tx.vin[i].prevout;
603 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
613 map<uint256, CTxIndex> mapUnused;
614 bool fInvalid = false;
615 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
618 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
620 *pfMissingInputs = true;
624 // Check for non-standard pay-to-script-hash in inputs
625 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
626 return error("CTxMemPool::accept() : nonstandard transaction input");
628 // Note: if you modify this code to accept non-standard transactions, then
629 // you should add code here to check that the transaction does a
630 // reasonable number of ECDSA signature verifications.
632 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
633 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
635 // Don't accept it if it can't get into a block
636 int64 txMinFee = tx.GetMinFee(1000, false, GMF_RELAY);
637 if (nFees < txMinFee)
638 return error("CTxMemPool::accept() : not enough fees %s, %"PRI64d" < %"PRI64d,
639 hash.ToString().c_str(),
642 // Continuously rate-limit free transactions
643 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
644 // be annoying or make others' transactions take longer to confirm.
645 if (nFees < MIN_RELAY_TX_FEE)
647 static CCriticalSection cs;
648 static double dFreeCount;
649 static int64 nLastTime;
650 int64 nNow = GetTime();
654 // Use an exponentially decaying ~10-minute window:
655 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
657 // -limitfreerelay unit is thousand-bytes-per-minute
658 // At default rate it would take over a month to fill 1GB
659 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
660 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
662 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
667 // Check against previous transactions
668 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
669 if (!tx.ConnectInputs(txdb, mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
671 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
675 // Store transaction in memory
680 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
683 addUnchecked(hash, tx);
686 ///// are we sure this is ok when loading transactions or restoring block txes
687 // If updated, erase old tx from wallet
689 EraseFromWallets(ptxOld->GetHash());
691 printf("CTxMemPool::accept() : accepted %s (poolsz %"PRIszu")\n",
692 hash.ToString().substr(0,10).c_str(),
697 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
699 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
702 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
704 // Add to memory pool without checking anything. Don't call this directly,
705 // call CTxMemPool::accept to properly check the transaction first.
708 for (unsigned int i = 0; i < tx.vin.size(); i++)
709 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
710 nTransactionsUpdated++;
716 bool CTxMemPool::remove(CTransaction &tx)
718 // Remove transaction from memory pool
721 uint256 hash = tx.GetHash();
722 if (mapTx.count(hash))
724 BOOST_FOREACH(const CTxIn& txin, tx.vin)
725 mapNextTx.erase(txin.prevout);
727 nTransactionsUpdated++;
733 void CTxMemPool::clear()
738 ++nTransactionsUpdated;
741 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
746 vtxid.reserve(mapTx.size());
747 for (map<uint256, CTransaction>::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi)
748 vtxid.push_back((*mi).first);
754 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
756 if (hashBlock == 0 || nIndex == -1)
759 // Find the block it claims to be in
760 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
761 if (mi == mapBlockIndex.end())
763 CBlockIndex* pindex = (*mi).second;
764 if (!pindex || !pindex->IsInMainChain())
767 // Make sure the merkle branch connects to this block
768 if (!fMerkleVerified)
770 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
772 fMerkleVerified = true;
776 return pindexBest->nHeight - pindex->nHeight + 1;
780 int CMerkleTx::GetBlocksToMaturity() const
782 if (!(IsCoinBase() || IsCoinStake()))
784 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
788 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
792 if (!IsInMainChain() && !ClientConnectInputs())
794 return CTransaction::AcceptToMemoryPool(txdb, false);
798 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
802 bool CMerkleTx::AcceptToMemoryPool()
805 return AcceptToMemoryPool(txdb);
810 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
815 // Add previous supporting transactions first
816 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
818 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
820 uint256 hash = tx.GetHash();
821 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
822 tx.AcceptToMemoryPool(txdb, fCheckInputs);
825 return AcceptToMemoryPool(txdb, fCheckInputs);
830 bool CWalletTx::AcceptWalletTransaction()
833 return AcceptWalletTransaction(txdb);
836 int CTxIndex::GetDepthInMainChain() const
840 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
842 // Find the block in the index
843 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
844 if (mi == mapBlockIndex.end())
846 CBlockIndex* pindex = (*mi).second;
847 if (!pindex || !pindex->IsInMainChain())
849 return 1 + nBestHeight - pindex->nHeight;
852 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
853 bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock)
859 if (mempool.exists(hash))
861 tx = mempool.lookup(hash);
867 if (tx.ReadFromDisk(txdb, COutPoint(hash, 0), txindex))
870 if (block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
871 hashBlock = block.GetHash();
885 //////////////////////////////////////////////////////////////////////////////
887 // CBlock and CBlockIndex
890 static CBlockIndex* pblockindexFBBHLast;
891 CBlockIndex* FindBlockByHeight(int nHeight)
893 CBlockIndex *pblockindex;
894 if (nHeight < nBestHeight / 2)
895 pblockindex = pindexGenesisBlock;
897 pblockindex = pindexBest;
898 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
899 pblockindex = pblockindexFBBHLast;
900 while (pblockindex->nHeight > nHeight)
901 pblockindex = pblockindex->pprev;
902 while (pblockindex->nHeight < nHeight)
903 pblockindex = pblockindex->pnext;
904 pblockindexFBBHLast = pblockindex;
908 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
910 if (!fReadTransactions)
912 *this = pindex->GetBlockHeader();
915 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
917 if (GetHash() != pindex->GetBlockHash())
918 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
922 uint256 static GetOrphanRoot(const CBlock* pblock)
924 // Work back to the first block in the orphan chain
925 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
926 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
927 return pblock->GetHash();
930 // ppcoin: find block wanted by given orphan block
931 uint256 WantedByOrphan(const CBlock* pblockOrphan)
933 // Work back to the first block in the orphan chain
934 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
935 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
936 return pblockOrphan->hashPrevBlock;
939 // select stake target limit according to hard-coded conditions
940 CBigNum static GetProofOfStakeLimit(int nHeight, unsigned int nTime)
942 if(fTestNet) // separate proof of stake target limit for testnet
943 return bnProofOfStakeLimit;
944 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
945 return bnProofOfStakeLimit;
946 if(nHeight + 1 > 15000) // 24 bits since block 15000
947 return bnProofOfStakeLegacyLimit;
948 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
949 return bnProofOfStakeHardLimit;
951 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
954 // miner's coin base reward based on nBits
955 int64 GetProofOfWorkReward(unsigned int nBits)
957 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
960 bnTarget.SetCompact(nBits);
961 CBigNum bnTargetLimit = bnProofOfWorkLimit;
962 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
964 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
965 // A reasonably continuous curve is used to avoid shock to market
966 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
968 // Human readable form:
970 // nSubsidy = 100 / (diff ^ 1/6)
971 CBigNum bnLowerBound = CENT;
972 CBigNum bnUpperBound = bnSubsidyLimit;
973 while (bnLowerBound + CENT <= bnUpperBound)
975 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
976 if (fDebug && GetBoolArg("-printcreation"))
977 printf("GetProofOfWorkReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
978 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
979 bnUpperBound = bnMidValue;
981 bnLowerBound = bnMidValue;
984 int64 nSubsidy = bnUpperBound.getuint64();
985 nSubsidy = (nSubsidy / CENT) * CENT;
986 if (fDebug && GetBoolArg("-printcreation"))
987 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
989 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK);
992 // miner's coin stake reward based on nBits and coin age spent (coin-days)
993 int64 GetProofOfStakeReward(int64 nCoinAge, unsigned int nBits, unsigned int nTime)
995 int64 nRewardCoinYear;
997 if(fTestNet || nTime > STAKE_SWITCH_TIME)
999 // Stage 2 of emission process is PoS-based. It will be active on mainNet since 20 Jun 2013.
1001 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1003 bnTarget.SetCompact(nBits);
1004 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1005 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1007 // NovaCoin: reward for coin-year is cut in half every 64x multiply of PoS difficulty
1008 // A reasonably continuous curve is used to avoid shock to market
1009 // (nRewardCoinYearLimit / nRewardCoinYear) ** 6 == bnProofOfStakeLimit / bnTarget
1011 // Human readable form:
1013 // nRewardCoinYear = 1 / (posdiff ^ 1/6)
1015 CBigNum bnLowerBound = 1 * CENT; // Lower interest bound is 1% per year
1016 CBigNum bnUpperBound = bnRewardCoinYearLimit;
1017 while (bnLowerBound + CENT <= bnUpperBound)
1019 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1020 if (fDebug && GetBoolArg("-printcreation"))
1021 printf("GetProofOfStakeReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1022 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnTarget)
1023 bnUpperBound = bnMidValue;
1025 bnLowerBound = bnMidValue;
1028 nRewardCoinYear = bnUpperBound.getuint64();
1029 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1033 // Old creation amount per coin-year, 5% fixed stake mint rate
1034 nRewardCoinYear = 5 * CENT;
1037 int64 nSubsidy = nCoinAge * 33 / (365 * 33 + 8) * nRewardCoinYear;
1038 if (fDebug && GetBoolArg("-printcreation"))
1039 printf("GetProofOfStakeReward(): create=%s nCoinAge=%"PRI64d" nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1043 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
1045 // get proof of work blocks max spacing according to hard-coded conditions
1046 int64 static GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1048 if(nTime > TARGETS_SWITCH_TIME)
1049 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1052 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1054 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1058 // minimum amount of work that could possibly be required nTime after
1059 // minimum work required was nBase
1061 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
1063 CBigNum bnTargetLimit = bnProofOfWorkLimit;
1066 bnResult.SetCompact(nBase);
1068 while (nTime > 0 && bnResult < bnTargetLimit)
1070 // Maximum 200% adjustment per day...
1072 nTime -= 24 * 60 * 60;
1074 if (bnResult > bnTargetLimit)
1075 bnResult = bnTargetLimit;
1076 return bnResult.GetCompact();
1079 // ppcoin: find last block index up to pindex
1080 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1082 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1083 pindex = pindex->pprev;
1087 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1089 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1091 if (pindexLast == NULL)
1092 return bnTargetLimit.GetCompact(); // genesis block
1094 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1095 if (pindexPrev->pprev == NULL)
1096 return bnTargetLimit.GetCompact(); // first block
1097 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1098 if (pindexPrevPrev->pprev == NULL)
1099 return bnTargetLimit.GetCompact(); // second block
1101 int64 nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1103 // ppcoin: target change every block
1104 // ppcoin: retarget with exponential moving toward target spacing
1106 bnNew.SetCompact(pindexPrev->nBits);
1107 int64 nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1108 int64 nInterval = nTargetTimespan / nTargetSpacing;
1109 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1110 bnNew /= ((nInterval + 1) * nTargetSpacing);
1112 if (bnNew > bnTargetLimit)
1113 bnNew = bnTargetLimit;
1115 return bnNew.GetCompact();
1118 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1121 bnTarget.SetCompact(nBits);
1124 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1125 return error("CheckProofOfWork() : nBits below minimum work");
1127 // Check proof of work matches claimed amount
1128 if (hash > bnTarget.getuint256())
1129 return error("CheckProofOfWork() : hash doesn't match nBits");
1134 // Return maximum amount of blocks that other nodes claim to have
1135 int GetNumBlocksOfPeers()
1137 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1140 bool IsInitialBlockDownload()
1142 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1144 static int64 nLastUpdate;
1145 static CBlockIndex* pindexLastBest;
1146 if (pindexBest != pindexLastBest)
1148 pindexLastBest = pindexBest;
1149 nLastUpdate = GetTime();
1151 return (GetTime() - nLastUpdate < 10 &&
1152 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
1155 void static InvalidChainFound(CBlockIndex* pindexNew)
1157 if (pindexNew->bnChainTrust > bnBestInvalidTrust)
1159 bnBestInvalidTrust = pindexNew->bnChainTrust;
1160 CTxDB().WriteBestInvalidTrust(bnBestInvalidTrust);
1161 uiInterface.NotifyBlocksChanged();
1164 CBigNum bnBestInvalidBlockTrust = pindexNew->bnChainTrust - pindexNew->pprev->bnChainTrust;
1165 CBigNum bnBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->bnChainTrust - pindexBest->pprev->bnChainTrust) : pindexBest->bnChainTrust;
1167 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%s date=%s\n",
1168 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1169 pindexNew->bnChainTrust.ToString().c_str(), bnBestInvalidBlockTrust.ToString().c_str(),
1170 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1171 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%s date=%s\n",
1172 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1173 bnBestChainTrust.ToString().c_str(),
1174 bnBestBlockTrust.ToString().c_str(),
1175 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1179 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1181 nTime = max(GetBlockTime(), GetAdjustedTime());
1194 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1196 // Relinquish previous transactions' spent pointers
1199 BOOST_FOREACH(const CTxIn& txin, vin)
1201 COutPoint prevout = txin.prevout;
1203 // Get prev txindex from disk
1205 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1206 return error("DisconnectInputs() : ReadTxIndex failed");
1208 if (prevout.n >= txindex.vSpent.size())
1209 return error("DisconnectInputs() : prevout.n out of range");
1211 // Mark outpoint as not spent
1212 txindex.vSpent[prevout.n].SetNull();
1215 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1216 return error("DisconnectInputs() : UpdateTxIndex failed");
1220 // Remove transaction from index
1221 // This can fail if a duplicate of this transaction was in a chain that got
1222 // reorganized away. This is only possible if this transaction was completely
1223 // spent, so erasing it would be a no-op anyway.
1224 txdb.EraseTxIndex(*this);
1230 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1231 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1233 // FetchInputs can return false either because we just haven't seen some inputs
1234 // (in which case the transaction should be stored as an orphan)
1235 // or because the transaction is malformed (in which case the transaction should
1236 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1240 return true; // Coinbase transactions have no inputs to fetch.
1242 for (unsigned int i = 0; i < vin.size(); i++)
1244 COutPoint prevout = vin[i].prevout;
1245 if (inputsRet.count(prevout.hash))
1246 continue; // Got it already
1249 CTxIndex& txindex = inputsRet[prevout.hash].first;
1251 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1253 // Get txindex from current proposed changes
1254 txindex = mapTestPool.find(prevout.hash)->second;
1258 // Read txindex from txdb
1259 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1261 if (!fFound && (fBlock || fMiner))
1262 return fMiner ? false : error("FetchInputs() : %s prev tx %s index entry not found", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1265 CTransaction& txPrev = inputsRet[prevout.hash].second;
1266 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1268 // Get prev tx from single transactions in memory
1271 if (!mempool.exists(prevout.hash))
1272 return error("FetchInputs() : %s mempool Tx prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1273 txPrev = mempool.lookup(prevout.hash);
1276 txindex.vSpent.resize(txPrev.vout.size());
1280 // Get prev tx from disk
1281 if (!txPrev.ReadFromDisk(txindex.pos))
1282 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1286 // Make sure all prevout.n indexes are valid:
1287 for (unsigned int i = 0; i < vin.size(); i++)
1289 const COutPoint prevout = vin[i].prevout;
1290 assert(inputsRet.count(prevout.hash) != 0);
1291 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1292 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1293 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1295 // Revisit this if/when transaction replacement is implemented and allows
1298 return DoS(100, error("FetchInputs() : %s prevout.n out of range %d %"PRIszu" %"PRIszu" prev tx %s\n%s", GetHash().ToString().substr(0,10).c_str(), prevout.n, txPrev.vout.size(), txindex.vSpent.size(), prevout.hash.ToString().substr(0,10).c_str(), txPrev.ToString().c_str()));
1305 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1307 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1308 if (mi == inputs.end())
1309 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1311 const CTransaction& txPrev = (mi->second).second;
1312 if (input.prevout.n >= txPrev.vout.size())
1313 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1315 return txPrev.vout[input.prevout.n];
1318 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1324 for (unsigned int i = 0; i < vin.size(); i++)
1326 nResult += GetOutputFor(vin[i], inputs).nValue;
1332 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1337 unsigned int nSigOps = 0;
1338 for (unsigned int i = 0; i < vin.size(); i++)
1340 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1341 if (prevout.scriptPubKey.IsPayToScriptHash())
1342 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1347 bool CTransaction::ConnectInputs(CTxDB& txdb, MapPrevTx inputs,
1348 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1349 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1351 // Take over previous transactions' spent pointers
1352 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1353 // fMiner is true when called from the internal bitcoin miner
1354 // ... both are false when called from CTransaction::AcceptToMemoryPool
1359 for (unsigned int i = 0; i < vin.size(); i++)
1361 COutPoint prevout = vin[i].prevout;
1362 assert(inputs.count(prevout.hash) > 0);
1363 CTxIndex& txindex = inputs[prevout.hash].first;
1364 CTransaction& txPrev = inputs[prevout.hash].second;
1366 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1367 return DoS(100, error("ConnectInputs() : %s prevout.n out of range %d %"PRIszu" %"PRIszu" prev tx %s\n%s", GetHash().ToString().substr(0,10).c_str(), prevout.n, txPrev.vout.size(), txindex.vSpent.size(), prevout.hash.ToString().substr(0,10).c_str(), txPrev.ToString().c_str()));
1369 // If prev is coinbase or coinstake, check that it's matured
1370 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
1371 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < nCoinbaseMaturity; pindex = pindex->pprev)
1372 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1373 return error("ConnectInputs() : tried to spend %s at depth %d", txPrev.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - pindex->nHeight);
1375 // ppcoin: check transaction timestamp
1376 if (txPrev.nTime > nTime)
1377 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
1379 // Check for negative or overflow input values
1380 nValueIn += txPrev.vout[prevout.n].nValue;
1381 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1382 return DoS(100, error("ConnectInputs() : txin values out of range"));
1385 // The first loop above does all the inexpensive checks.
1386 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1387 // Helps prevent CPU exhaustion attacks.
1388 for (unsigned int i = 0; i < vin.size(); i++)
1390 COutPoint prevout = vin[i].prevout;
1391 assert(inputs.count(prevout.hash) > 0);
1392 CTxIndex& txindex = inputs[prevout.hash].first;
1393 CTransaction& txPrev = inputs[prevout.hash].second;
1395 // Check for conflicts (double-spend)
1396 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1397 // for an attacker to attempt to split the network.
1398 if (!txindex.vSpent[prevout.n].IsNull())
1399 return fMiner ? false : error("ConnectInputs() : %s prev tx already used at %s", GetHash().ToString().substr(0,10).c_str(), txindex.vSpent[prevout.n].ToString().c_str());
1401 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1402 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1403 // still computed and checked, and any change will be caught at the next checkpoint.
1404 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1407 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1409 // only during transition phase for P2SH: do not invoke anti-DoS code for
1410 // potentially old clients relaying bad P2SH transactions
1411 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1412 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1414 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1418 // Mark outpoints as spent
1419 txindex.vSpent[prevout.n] = posThisTx;
1422 if (fBlock || fMiner)
1424 mapTestPool[prevout.hash] = txindex;
1430 // ppcoin: coin stake tx earns reward instead of paying fee
1432 if (!GetCoinAge(txdb, nCoinAge))
1433 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1434 int64 nStakeReward = GetValueOut() - nValueIn;
1435 if (nStakeReward > GetProofOfStakeReward(nCoinAge, pindexBlock->nBits, nTime) - GetMinFee() + MIN_TX_FEE)
1436 return DoS(100, error("ConnectInputs() : %s stake reward exceeded", GetHash().ToString().substr(0,10).c_str()));
1440 if (nValueIn < GetValueOut())
1441 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1443 // Tally transaction fees
1444 int64 nTxFee = nValueIn - GetValueOut();
1446 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1447 // ppcoin: enforce transaction fees for every block
1448 if (nTxFee < GetMinFee())
1449 return fBlock? DoS(100, error("ConnectInputs() : %s not paying required fee=%s, paid=%s", GetHash().ToString().substr(0,10).c_str(), FormatMoney(GetMinFee()).c_str(), FormatMoney(nTxFee).c_str())) : false;
1452 if (!MoneyRange(nFees))
1453 return DoS(100, error("ConnectInputs() : nFees out of range"));
1461 bool CTransaction::ClientConnectInputs()
1466 // Take over previous transactions' spent pointers
1470 for (unsigned int i = 0; i < vin.size(); i++)
1472 // Get prev tx from single transactions in memory
1473 COutPoint prevout = vin[i].prevout;
1474 if (!mempool.exists(prevout.hash))
1476 CTransaction& txPrev = mempool.lookup(prevout.hash);
1478 if (prevout.n >= txPrev.vout.size())
1482 if (!VerifySignature(txPrev, *this, i, true, 0))
1483 return error("ConnectInputs() : VerifySignature failed");
1485 ///// this is redundant with the mempool.mapNextTx stuff,
1486 ///// not sure which I want to get rid of
1487 ///// this has to go away now that posNext is gone
1488 // // Check for conflicts
1489 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1490 // return error("ConnectInputs() : prev tx already used");
1492 // // Flag outpoints as used
1493 // txPrev.vout[prevout.n].posNext = posThisTx;
1495 nValueIn += txPrev.vout[prevout.n].nValue;
1497 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1498 return error("ClientConnectInputs() : txin values out of range");
1500 if (GetValueOut() > nValueIn)
1510 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1512 // Disconnect in reverse order
1513 for (int i = vtx.size()-1; i >= 0; i--)
1514 if (!vtx[i].DisconnectInputs(txdb))
1517 // Update block index on disk without changing it in memory.
1518 // The memory index structure will be changed after the db commits.
1521 CDiskBlockIndex blockindexPrev(pindex->pprev);
1522 blockindexPrev.hashNext = 0;
1523 if (!txdb.WriteBlockIndex(blockindexPrev))
1524 return error("DisconnectBlock() : WriteBlockIndex failed");
1527 // ppcoin: clean up wallet after disconnecting coinstake
1528 BOOST_FOREACH(CTransaction& tx, vtx)
1529 SyncWithWallets(tx, this, false, false);
1534 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex, bool fJustCheck)
1536 // Check it again in case a previous version let a bad block in
1537 if (!CheckBlock(!fJustCheck, !fJustCheck))
1540 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1541 // unless those are already completely spent.
1542 // If such overwrites are allowed, coinbases and transactions depending upon those
1543 // can be duplicated to remove the ability to spend the first instance -- even after
1544 // being sent to another address.
1545 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1546 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1547 // already refuses previously-known transaction ids entirely.
1548 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1549 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1550 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1551 // initial block download.
1552 bool fEnforceBIP30 = true; // Always active in NovaCoin
1553 bool fStrictPayToScriptHash = true; // Always active in NovaCoin
1555 //// issue here: it doesn't know the version
1556 unsigned int nTxPos;
1558 // FetchInputs treats CDiskTxPos(1,1,1) as a special "refer to memorypool" indicator
1559 // Since we're just checking the block and not actually connecting it, it might not (and probably shouldn't) be on the disk to get the transaction from
1562 nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1564 map<uint256, CTxIndex> mapQueuedChanges;
1567 int64 nValueOut = 0;
1568 unsigned int nSigOps = 0;
1569 BOOST_FOREACH(CTransaction& tx, vtx)
1571 uint256 hashTx = tx.GetHash();
1573 if (fEnforceBIP30) {
1574 CTxIndex txindexOld;
1575 if (txdb.ReadTxIndex(hashTx, txindexOld)) {
1576 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1582 nSigOps += tx.GetLegacySigOpCount();
1583 if (nSigOps > MAX_BLOCK_SIGOPS)
1584 return DoS(100, error("ConnectBlock() : too many sigops"));
1586 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1588 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1590 MapPrevTx mapInputs;
1591 if (tx.IsCoinBase())
1592 nValueOut += tx.GetValueOut();
1596 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1599 if (fStrictPayToScriptHash)
1601 // Add in sigops done by pay-to-script-hash inputs;
1602 // this is to prevent a "rogue miner" from creating
1603 // an incredibly-expensive-to-validate block.
1604 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1605 if (nSigOps > MAX_BLOCK_SIGOPS)
1606 return DoS(100, error("ConnectBlock() : too many sigops"));
1609 int64 nTxValueIn = tx.GetValueIn(mapInputs);
1610 int64 nTxValueOut = tx.GetValueOut();
1611 nValueIn += nTxValueIn;
1612 nValueOut += nTxValueOut;
1613 if (!tx.IsCoinStake())
1614 nFees += nTxValueIn - nTxValueOut;
1616 if (!tx.ConnectInputs(txdb, mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1620 mapQueuedChanges[hashTx] = CTxIndex(posThisTx, tx.vout.size());
1623 // ppcoin: track money supply and mint amount info
1624 pindex->nMint = nValueOut - nValueIn + nFees;
1625 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1626 if (!txdb.WriteBlockIndex(CDiskBlockIndex(pindex)))
1627 return error("Connect() : WriteBlockIndex for pindex failed");
1629 // ppcoin: fees are not collected by miners as in bitcoin
1630 // ppcoin: fees are destroyed to compensate the entire network
1631 if (fDebug && GetBoolArg("-printcreation"))
1632 printf("ConnectBlock() : destroy=%s nFees=%"PRI64d"\n", FormatMoney(nFees).c_str(), nFees);
1637 // Write queued txindex changes
1638 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1640 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1641 return error("ConnectBlock() : UpdateTxIndex failed");
1644 // Update block index on disk without changing it in memory.
1645 // The memory index structure will be changed after the db commits.
1648 CDiskBlockIndex blockindexPrev(pindex->pprev);
1649 blockindexPrev.hashNext = pindex->GetBlockHash();
1650 if (!txdb.WriteBlockIndex(blockindexPrev))
1651 return error("ConnectBlock() : WriteBlockIndex failed");
1654 // Watch for transactions paying to me
1655 BOOST_FOREACH(CTransaction& tx, vtx)
1656 SyncWithWallets(tx, this, true);
1661 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1663 printf("REORGANIZE\n");
1666 CBlockIndex* pfork = pindexBest;
1667 CBlockIndex* plonger = pindexNew;
1668 while (pfork != plonger)
1670 while (plonger->nHeight > pfork->nHeight)
1671 if (!(plonger = plonger->pprev))
1672 return error("Reorganize() : plonger->pprev is null");
1673 if (pfork == plonger)
1675 if (!(pfork = pfork->pprev))
1676 return error("Reorganize() : pfork->pprev is null");
1679 // List of what to disconnect
1680 vector<CBlockIndex*> vDisconnect;
1681 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1682 vDisconnect.push_back(pindex);
1684 // List of what to connect
1685 vector<CBlockIndex*> vConnect;
1686 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1687 vConnect.push_back(pindex);
1688 reverse(vConnect.begin(), vConnect.end());
1690 printf("REORGANIZE: Disconnect %"PRIszu" blocks; %s..%s\n", vDisconnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexBest->GetBlockHash().ToString().substr(0,20).c_str());
1691 printf("REORGANIZE: Connect %"PRIszu" blocks; %s..%s\n", vConnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->GetBlockHash().ToString().substr(0,20).c_str());
1693 // Disconnect shorter branch
1694 vector<CTransaction> vResurrect;
1695 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1698 if (!block.ReadFromDisk(pindex))
1699 return error("Reorganize() : ReadFromDisk for disconnect failed");
1700 if (!block.DisconnectBlock(txdb, pindex))
1701 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1703 // Queue memory transactions to resurrect
1704 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1705 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1706 vResurrect.push_back(tx);
1709 // Connect longer branch
1710 vector<CTransaction> vDelete;
1711 for (unsigned int i = 0; i < vConnect.size(); i++)
1713 CBlockIndex* pindex = vConnect[i];
1715 if (!block.ReadFromDisk(pindex))
1716 return error("Reorganize() : ReadFromDisk for connect failed");
1717 if (!block.ConnectBlock(txdb, pindex))
1720 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1723 // Queue memory transactions to delete
1724 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1725 vDelete.push_back(tx);
1727 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1728 return error("Reorganize() : WriteHashBestChain failed");
1730 // Make sure it's successfully written to disk before changing memory structure
1731 if (!txdb.TxnCommit())
1732 return error("Reorganize() : TxnCommit failed");
1734 // Disconnect shorter branch
1735 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1737 pindex->pprev->pnext = NULL;
1739 // Connect longer branch
1740 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1742 pindex->pprev->pnext = pindex;
1744 // Resurrect memory transactions that were in the disconnected branch
1745 BOOST_FOREACH(CTransaction& tx, vResurrect)
1746 tx.AcceptToMemoryPool(txdb, false);
1748 // Delete redundant memory transactions that are in the connected branch
1749 BOOST_FOREACH(CTransaction& tx, vDelete)
1752 printf("REORGANIZE: done\n");
1758 // Called from inside SetBestChain: attaches a block to the new best chain being built
1759 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1761 uint256 hash = GetHash();
1763 // Adding to current best branch
1764 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1767 InvalidChainFound(pindexNew);
1770 if (!txdb.TxnCommit())
1771 return error("SetBestChain() : TxnCommit failed");
1773 // Add to current best branch
1774 pindexNew->pprev->pnext = pindexNew;
1776 // Delete redundant memory transactions
1777 BOOST_FOREACH(CTransaction& tx, vtx)
1783 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1785 uint256 hash = GetHash();
1787 if (!txdb.TxnBegin())
1788 return error("SetBestChain() : TxnBegin failed");
1790 if (pindexGenesisBlock == NULL && hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1792 txdb.WriteHashBestChain(hash);
1793 if (!txdb.TxnCommit())
1794 return error("SetBestChain() : TxnCommit failed");
1795 pindexGenesisBlock = pindexNew;
1797 else if (hashPrevBlock == hashBestChain)
1799 if (!SetBestChainInner(txdb, pindexNew))
1800 return error("SetBestChain() : SetBestChainInner failed");
1804 // the first block in the new chain that will cause it to become the new best chain
1805 CBlockIndex *pindexIntermediate = pindexNew;
1807 // list of blocks that need to be connected afterwards
1808 std::vector<CBlockIndex*> vpindexSecondary;
1810 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1811 // Try to limit how much needs to be done inside
1812 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainTrust > pindexBest->bnChainTrust)
1814 vpindexSecondary.push_back(pindexIntermediate);
1815 pindexIntermediate = pindexIntermediate->pprev;
1818 if (!vpindexSecondary.empty())
1819 printf("Postponing %"PRIszu" reconnects\n", vpindexSecondary.size());
1821 // Switch to new best branch
1822 if (!Reorganize(txdb, pindexIntermediate))
1825 InvalidChainFound(pindexNew);
1826 return error("SetBestChain() : Reorganize failed");
1829 // Connect further blocks
1830 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1833 if (!block.ReadFromDisk(pindex))
1835 printf("SetBestChain() : ReadFromDisk failed\n");
1838 if (!txdb.TxnBegin()) {
1839 printf("SetBestChain() : TxnBegin 2 failed\n");
1842 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1843 if (!block.SetBestChainInner(txdb, pindex))
1848 // Update best block in wallet (so we can detect restored wallets)
1849 bool fIsInitialDownload = IsInitialBlockDownload();
1850 if (!fIsInitialDownload)
1852 const CBlockLocator locator(pindexNew);
1853 ::SetBestChain(locator);
1857 hashBestChain = hash;
1858 pindexBest = pindexNew;
1859 pblockindexFBBHLast = NULL;
1860 nBestHeight = pindexBest->nHeight;
1861 bnBestChainTrust = pindexNew->bnChainTrust;
1862 nTimeBestReceived = GetTime();
1863 nTransactionsUpdated++;
1865 CBigNum bnBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->bnChainTrust - pindexBest->pprev->bnChainTrust) : pindexBest->bnChainTrust;
1867 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%s date=%s\n",
1868 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainTrust.ToString().c_str(),
1869 bnBestBlockTrust.ToString().c_str(),
1870 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1872 // Check the version of the last 100 blocks to see if we need to upgrade:
1873 if (!fIsInitialDownload)
1876 const CBlockIndex* pindex = pindexBest;
1877 for (int i = 0; i < 100 && pindex != NULL; i++)
1879 if (pindex->nVersion > CBlock::CURRENT_VERSION)
1881 pindex = pindex->pprev;
1884 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
1885 if (nUpgraded > 100/2)
1886 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
1887 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
1890 std::string strCmd = GetArg("-blocknotify", "");
1892 if (!fIsInitialDownload && !strCmd.empty())
1894 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1895 boost::thread t(runCommand, strCmd); // thread runs free
1901 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
1902 // Only those coins meeting minimum age requirement counts. As those
1903 // transactions not in main chain are not currently indexed so we
1904 // might not find out about their coin age. Older transactions are
1905 // guaranteed to be in main chain by sync-checkpoint. This rule is
1906 // introduced to help nodes establish a consistent view of the coin
1907 // age (trust score) of competing branches.
1908 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64& nCoinAge) const
1910 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
1916 BOOST_FOREACH(const CTxIn& txin, vin)
1918 // First try finding the previous transaction in database
1919 CTransaction txPrev;
1921 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
1922 continue; // previous transaction not in main chain
1923 if (nTime < txPrev.nTime)
1924 return false; // Transaction timestamp violation
1926 // Read block header
1928 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
1929 return false; // unable to read block of previous transaction
1930 if (block.GetBlockTime() + nStakeMinAge > nTime)
1931 continue; // only count coins meeting min age requirement
1933 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
1934 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
1936 if (fDebug && GetBoolArg("-printcoinage"))
1937 printf("coin age nValueIn=%"PRI64d" nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
1940 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
1941 if (fDebug && GetBoolArg("-printcoinage"))
1942 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
1943 nCoinAge = bnCoinDay.getuint64();
1947 // ppcoin: total coin age spent in block, in the unit of coin-days.
1948 bool CBlock::GetCoinAge(uint64& nCoinAge) const
1953 BOOST_FOREACH(const CTransaction& tx, vtx)
1956 if (tx.GetCoinAge(txdb, nTxCoinAge))
1957 nCoinAge += nTxCoinAge;
1962 if (nCoinAge == 0) // block coin age minimum 1 coin-day
1964 if (fDebug && GetBoolArg("-printcoinage"))
1965 printf("block coin age total nCoinDays=%"PRI64d"\n", nCoinAge);
1969 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1971 // Check for duplicate
1972 uint256 hash = GetHash();
1973 if (mapBlockIndex.count(hash))
1974 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1976 // Construct new block index object
1977 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1979 return error("AddToBlockIndex() : new CBlockIndex failed");
1980 pindexNew->phashBlock = &hash;
1981 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1982 if (miPrev != mapBlockIndex.end())
1984 pindexNew->pprev = (*miPrev).second;
1985 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1988 // ppcoin: compute chain trust score
1989 pindexNew->bnChainTrust = (pindexNew->pprev ? pindexNew->pprev->bnChainTrust : 0) + pindexNew->GetBlockTrust();
1991 // ppcoin: compute stake entropy bit for stake modifier
1992 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nHeight)))
1993 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
1995 // ppcoin: record proof-of-stake hash value
1996 if (pindexNew->IsProofOfStake())
1998 if (!mapProofOfStake.count(hash))
1999 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2000 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2003 // ppcoin: compute stake modifier
2004 uint64 nStakeModifier = 0;
2005 bool fGeneratedStakeModifier = false;
2006 if (!ComputeNextStakeModifier(pindexNew->pprev, nStakeModifier, fGeneratedStakeModifier))
2007 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2008 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2009 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2010 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2011 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016"PRI64x, pindexNew->nHeight, nStakeModifier);
2013 // Add to mapBlockIndex
2014 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2015 if (pindexNew->IsProofOfStake())
2016 setStakeSeen.insert(make_pair(pindexNew->prevoutStake, pindexNew->nStakeTime));
2017 pindexNew->phashBlock = &((*mi).first);
2019 // Write to disk block index
2021 if (!txdb.TxnBegin())
2023 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
2024 if (!txdb.TxnCommit())
2028 if (pindexNew->bnChainTrust > bnBestChainTrust)
2029 if (!SetBestChain(txdb, pindexNew))
2034 if (pindexNew == pindexBest)
2036 // Notify UI to display prev block's coinbase if it was ours
2037 static uint256 hashPrevBestCoinBase;
2038 UpdatedTransaction(hashPrevBestCoinBase);
2039 hashPrevBestCoinBase = vtx[0].GetHash();
2042 uiInterface.NotifyBlocksChanged();
2049 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot) const
2051 // These are checks that are independent of context
2052 // that can be verified before saving an orphan block.
2055 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2056 return DoS(100, error("CheckBlock() : size limits failed"));
2058 // Special short-term limits to avoid 10,000 BDB lock limit:
2059 if (GetBlockTime() < LOCKS_SWITCH_TIME)
2061 // Rule is: #unique txids referenced <= 4,500
2062 // ... to prevent 10,000 BDB lock exhaustion on old clients
2063 set<uint256> setTxIn;
2064 for (size_t i = 0; i < vtx.size(); i++)
2066 setTxIn.insert(vtx[i].GetHash());
2067 if (i == 0) continue; // skip coinbase txin
2068 BOOST_FOREACH(const CTxIn& txin, vtx[i].vin)
2069 setTxIn.insert(txin.prevout.hash);
2071 size_t nTxids = setTxIn.size();
2073 return error("CheckBlock() : maxlocks violation");
2076 // Check proof of work matches claimed amount
2077 if (fCheckPOW && IsProofOfWork() && !CheckProofOfWork(GetHash(), nBits))
2078 return DoS(50, error("CheckBlock() : proof of work failed"));
2081 if (GetBlockTime() > GetAdjustedTime() + nMaxClockDrift)
2082 return error("CheckBlock() : block timestamp too far in the future");
2084 // First transaction must be coinbase, the rest must not be
2085 if (vtx.empty() || !vtx[0].IsCoinBase())
2086 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2087 for (unsigned int i = 1; i < vtx.size(); i++)
2088 if (vtx[i].IsCoinBase())
2089 return DoS(100, error("CheckBlock() : more than one coinbase"));
2091 // Check coinbase timestamp
2092 if (GetBlockTime() > (int64)vtx[0].nTime + nMaxClockDrift)
2093 return DoS(50, error("CheckBlock() : coinbase timestamp is too early"));
2095 if (IsProofOfStake())
2097 // ppcoin: coinbase output should be empty if proof-of-stake block
2098 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2099 return error("CheckBlock() : coinbase output not empty for proof-of-stake block");
2101 // Second transaction must be coinstake, the rest must not be
2102 if (vtx.empty() || !vtx[1].IsCoinStake())
2103 return DoS(100, error("CheckBlock() : second tx is not coinstake"));
2104 for (unsigned int i = 2; i < vtx.size(); i++)
2105 if (vtx[i].IsCoinStake())
2106 return DoS(100, error("CheckBlock() : more than one coinstake"));
2108 // Check coinstake timestamp
2109 if (!CheckCoinStakeTimestamp(GetBlockTime(), (int64)vtx[1].nTime))
2110 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%"PRI64d" nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2114 // Check coinbase reward
2115 if (vtx[0].GetValueOut() > (GetProofOfWorkReward(nBits) - vtx[0].GetMinFee() + MIN_TX_FEE))
2116 return DoS(50, error("CheckBlock() : coinbase reward exceeded %s > %s",
2117 FormatMoney(vtx[0].GetValueOut()).c_str(),
2118 FormatMoney(IsProofOfWork()? GetProofOfWorkReward(nBits) : 0).c_str()));
2121 // Check transactions
2122 BOOST_FOREACH(const CTransaction& tx, vtx)
2124 if (!tx.CheckTransaction())
2125 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2127 // ppcoin: check transaction timestamp
2128 if (GetBlockTime() < (int64)tx.nTime)
2129 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2132 // Check for duplicate txids. This is caught by ConnectInputs(),
2133 // but catching it earlier avoids a potential DoS attack:
2134 set<uint256> uniqueTx;
2135 BOOST_FOREACH(const CTransaction& tx, vtx)
2137 uniqueTx.insert(tx.GetHash());
2139 if (uniqueTx.size() != vtx.size())
2140 return DoS(100, error("CheckBlock() : duplicate transaction"));
2142 unsigned int nSigOps = 0;
2143 BOOST_FOREACH(const CTransaction& tx, vtx)
2145 nSigOps += tx.GetLegacySigOpCount();
2147 if (nSigOps > MAX_BLOCK_SIGOPS)
2148 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2150 // Check merkle root
2151 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2152 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2154 // NovaCoin: check proof-of-stake block signature
2155 if (IsProofOfStake() || (!fTestNet && GetBlockTime() < CHAINCHECKS_SWITCH_TIME))
2157 if (!CheckBlockSignature())
2158 return DoS(100, error("CheckBlock() : bad block signature"));
2164 bool CBlock::AcceptBlock()
2166 // Check for duplicate
2167 uint256 hash = GetHash();
2168 if (mapBlockIndex.count(hash))
2169 return error("AcceptBlock() : block already in mapBlockIndex");
2171 // Get prev block index
2172 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
2173 if (mi == mapBlockIndex.end())
2174 return DoS(10, error("AcceptBlock() : prev block not found"));
2175 CBlockIndex* pindexPrev = (*mi).second;
2176 int nHeight = pindexPrev->nHeight+1;
2178 // Check proof-of-work or proof-of-stake
2179 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2180 return DoS(100, error("AcceptBlock() : incorrect %s", IsProofOfWork() ? "proof-of-work" : "proof-of-stake"));
2182 // Check timestamp against prev
2183 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || GetBlockTime() + nMaxClockDrift < pindexPrev->GetBlockTime())
2184 return error("AcceptBlock() : block's timestamp is too early");
2186 // Check that all transactions are finalized
2187 BOOST_FOREACH(const CTransaction& tx, vtx)
2188 if (!tx.IsFinal(nHeight, GetBlockTime()))
2189 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2191 // Check that the block chain matches the known block chain up to a checkpoint
2192 if (!Checkpoints::CheckHardened(nHeight, hash))
2193 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2195 // ppcoin: check that the block satisfies synchronized checkpoint
2196 if (!Checkpoints::CheckSync(hash, pindexPrev))
2198 if(!GetBoolArg("-nosynccheckpoints", false))
2200 return error("AcceptBlock() : rejected by synchronized checkpoint");
2204 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2208 // Reject block.nVersion < 3 blocks since 95% threshold on mainNet and always on testNet:
2209 if (nVersion < 3 && ((!fTestNet && nHeight > 14060) || (fTestNet && nHeight > 0)))
2210 return error("CheckBlock() : rejected nVersion < 3 block");
2212 // Enforce rule that the coinbase starts with serialized block height
2213 CScript expect = CScript() << nHeight;
2214 if (!std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2215 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2217 // Write block to history file
2218 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2219 return error("AcceptBlock() : out of disk space");
2220 unsigned int nFile = -1;
2221 unsigned int nBlockPos = 0;
2222 if (!WriteToDisk(nFile, nBlockPos))
2223 return error("AcceptBlock() : WriteToDisk failed");
2224 if (!AddToBlockIndex(nFile, nBlockPos))
2225 return error("AcceptBlock() : AddToBlockIndex failed");
2227 // Relay inventory, but don't relay old inventory during initial block download
2228 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2229 if (hashBestChain == hash)
2232 BOOST_FOREACH(CNode* pnode, vNodes)
2233 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2234 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2237 // ppcoin: check pending sync-checkpoint
2238 Checkpoints::AcceptPendingSyncCheckpoint();
2243 CBigNum CBlockIndex::GetBlockTrust() const
2248 if (!fTestNet && GetBlockTime() < CHAINCHECKS_SWITCH_TIME)
2251 bnTarget.SetCompact(nBits);
2255 return (IsProofOfStake()? (CBigNum(1)<<256) / (bnTarget+1) : 1);
2259 if (pprev == NULL || pprev->nHeight < 10)
2262 const CBlockIndex* currentIndex = pprev;
2264 if(IsProofOfStake())
2266 bnTarget.SetCompact(nBits);
2270 if (!pprev->IsProofOfWork())
2271 return (CBigNum(1)<<256) / (3 * (bnTarget+1));
2275 // Check last 12 blocks type
2276 while (pprev->nHeight - currentIndex->nHeight < 12)
2278 if (currentIndex->IsProofOfWork())
2280 currentIndex = currentIndex->pprev;
2283 // Return 1/3 of score if less than 3 PoW blocks found
2285 return (CBigNum(1)<<256) / (3 * (bnTarget+1));
2287 return (CBigNum(1)<<256) / (bnTarget+1);
2291 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2292 return 1 + (2 * (pprev->bnChainTrust - pprev->pprev->bnChainTrust) / 3);
2296 // Check last 12 blocks type
2297 while (pprev->nHeight - currentIndex->nHeight < 12)
2299 if (currentIndex->IsProofOfStake())
2301 currentIndex = currentIndex->pprev;
2304 // Return 2/3 of previous block score if less than 7 PoS blocks found
2306 return 1 + (2 * (pprev->bnChainTrust - pprev->pprev->bnChainTrust) / 3);
2308 return (pprev->bnChainTrust - pprev->pprev->bnChainTrust);
2312 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2314 unsigned int nFound = 0;
2315 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2317 if (pstart->nVersion >= minVersion)
2319 pstart = pstart->pprev;
2321 return (nFound >= nRequired);
2324 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2326 // Check for duplicate
2327 uint256 hash = pblock->GetHash();
2328 if (mapBlockIndex.count(hash))
2329 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2330 if (mapOrphanBlocks.count(hash))
2331 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2333 // ppcoin: check proof-of-stake
2334 // Limited duplicity on stake: prevents block flood attack
2335 // Duplicate stake allowed only when there is orphan child block
2336 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2337 return error("ProcessBlock() : duplicate proof-of-stake (%s, %d) for block %s", pblock->GetProofOfStake().first.ToString().c_str(), pblock->GetProofOfStake().second, hash.ToString().c_str());
2339 // Preliminary checks
2340 if (!pblock->CheckBlock())
2341 return error("ProcessBlock() : CheckBlock FAILED");
2343 // ppcoin: verify hash target and signature of coinstake tx
2344 if (pblock->IsProofOfStake())
2346 uint256 hashProofOfStake = 0;
2347 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake))
2349 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2350 return false; // do not error here as we expect this during initial block download
2352 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2353 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2356 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2357 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2359 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2360 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2362 bnNewBlock.SetCompact(pblock->nBits);
2364 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, pblock->IsProofOfStake())->nBits, deltaTime));
2365 if (bnNewBlock > bnRequired)
2368 pfrom->Misbehaving(100);
2369 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2373 // ppcoin: ask for pending sync-checkpoint if any
2374 if (!IsInitialBlockDownload())
2375 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2377 // If don't already have its previous block, shunt it off to holding area until we get it
2378 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2380 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2381 CBlock* pblock2 = new CBlock(*pblock);
2382 // ppcoin: check proof-of-stake
2383 if (pblock2->IsProofOfStake())
2385 // Limited duplicity on stake: prevents block flood attack
2386 // Duplicate stake allowed only when there is orphan child block
2387 if (setStakeSeenOrphan.count(pblock2->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2388 return error("ProcessBlock() : duplicate proof-of-stake (%s, %d) for orphan block %s", pblock2->GetProofOfStake().first.ToString().c_str(), pblock2->GetProofOfStake().second, hash.ToString().c_str());
2390 setStakeSeenOrphan.insert(pblock2->GetProofOfStake());
2392 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2393 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2395 // Ask this guy to fill in what we're missing
2398 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2399 // ppcoin: getblocks may not obtain the ancestor block rejected
2400 // earlier by duplicate-stake check so we ask for it again directly
2401 if (!IsInitialBlockDownload())
2402 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2408 if (!pblock->AcceptBlock())
2409 return error("ProcessBlock() : AcceptBlock FAILED");
2411 // Recursively process any orphan blocks that depended on this one
2412 vector<uint256> vWorkQueue;
2413 vWorkQueue.push_back(hash);
2414 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2416 uint256 hashPrev = vWorkQueue[i];
2417 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2418 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2421 CBlock* pblockOrphan = (*mi).second;
2422 if (pblockOrphan->AcceptBlock())
2423 vWorkQueue.push_back(pblockOrphan->GetHash());
2424 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2425 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2426 delete pblockOrphan;
2428 mapOrphanBlocksByPrev.erase(hashPrev);
2431 printf("ProcessBlock: ACCEPTED\n");
2433 // ppcoin: if responsible for sync-checkpoint send it
2434 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2435 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2440 // ppcoin: sign block
2441 bool CBlock::SignBlock(const CKeyStore& keystore)
2443 vector<valtype> vSolutions;
2444 txnouttype whichType;
2446 if(!IsProofOfStake())
2448 for(unsigned int i = 0; i < vtx[0].vout.size(); i++)
2450 const CTxOut& txout = vtx[0].vout[i];
2452 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2455 if (whichType == TX_PUBKEY)
2458 valtype& vchPubKey = vSolutions[0];
2461 if (!keystore.GetKey(Hash160(vchPubKey), key))
2463 if (key.GetPubKey() != vchPubKey)
2465 if(!key.Sign(GetHash(), vchBlockSig))
2474 const CTxOut& txout = vtx[1].vout[1];
2476 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2479 if (whichType == TX_PUBKEY)
2482 valtype& vchPubKey = vSolutions[0];
2485 if (!keystore.GetKey(Hash160(vchPubKey), key))
2487 if (key.GetPubKey() != vchPubKey)
2490 return key.Sign(GetHash(), vchBlockSig);
2494 printf("Sign failed\n");
2498 // ppcoin: check block signature
2499 bool CBlock::CheckBlockSignature() const
2501 if (GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
2502 return vchBlockSig.empty();
2504 vector<valtype> vSolutions;
2505 txnouttype whichType;
2507 if(IsProofOfStake())
2509 const CTxOut& txout = vtx[1].vout[1];
2511 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2513 if (whichType == TX_PUBKEY)
2515 valtype& vchPubKey = vSolutions[0];
2517 if (!key.SetPubKey(vchPubKey))
2519 if (vchBlockSig.empty())
2521 return key.Verify(GetHash(), vchBlockSig);
2526 for(unsigned int i = 0; i < vtx[0].vout.size(); i++)
2528 const CTxOut& txout = vtx[0].vout[i];
2530 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2533 if (whichType == TX_PUBKEY)
2536 valtype& vchPubKey = vSolutions[0];
2538 if (!key.SetPubKey(vchPubKey))
2540 if (vchBlockSig.empty())
2542 if(!key.Verify(GetHash(), vchBlockSig))
2552 bool CheckDiskSpace(uint64 nAdditionalBytes)
2554 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2556 // Check for nMinDiskSpace bytes (currently 50MB)
2557 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2560 string strMessage = _("Warning: Disk space is low!");
2561 strMiscWarning = strMessage;
2562 printf("*** %s\n", strMessage.c_str());
2563 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2570 static filesystem::path BlockFilePath(unsigned int nFile)
2572 string strBlockFn = strprintf("blk%04u.dat", nFile);
2573 return GetDataDir() / strBlockFn;
2576 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
2578 if ((nFile < 1) || (nFile == (unsigned int) -1))
2580 FILE* file = fopen(BlockFilePath(nFile).string().c_str(), pszMode);
2583 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
2585 if (fseek(file, nBlockPos, SEEK_SET) != 0)
2594 static unsigned int nCurrentBlockFile = 1;
2596 FILE* AppendBlockFile(unsigned int& nFileRet)
2601 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
2604 if (fseek(file, 0, SEEK_END) != 0)
2606 // FAT32 file size max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
2607 if (ftell(file) < (long)(0x7F000000 - MAX_SIZE))
2609 nFileRet = nCurrentBlockFile;
2613 nCurrentBlockFile++;
2617 bool LoadBlockIndex(bool fAllowNew)
2621 pchMessageStart[0] = 0xcd;
2622 pchMessageStart[1] = 0xf2;
2623 pchMessageStart[2] = 0xc0;
2624 pchMessageStart[3] = 0xef;
2626 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2627 nStakeMinAge = 2 * 60 * 60; // test net min age is 2 hours
2628 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2629 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2630 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
2637 if (!txdb.LoadBlockIndex())
2642 // Init with genesis block
2644 if (mapBlockIndex.empty())
2653 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
2654 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2655 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2657 // vMerkleTree: 4cb33b3b6a
2661 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
2662 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2663 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2665 // vMerkleTree: 4cb33b3b6a
2667 const char* pszTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
2669 txNew.nTime = 1360105017;
2670 txNew.vin.resize(1);
2671 txNew.vout.resize(1);
2672 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
2673 txNew.vout[0].SetEmpty();
2675 block.vtx.push_back(txNew);
2676 block.hashPrevBlock = 0;
2677 block.hashMerkleRoot = block.BuildMerkleTree();
2679 block.nTime = 1360105017;
2680 block.nBits = bnProofOfWorkLimit.GetCompact();
2681 block.nNonce = !fTestNet ? 1575379 : 46534;
2684 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
2686 assert(block.GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
2687 assert(block.CheckBlock());
2689 // Start new block file
2691 unsigned int nBlockPos;
2692 if (!block.WriteToDisk(nFile, nBlockPos))
2693 return error("LoadBlockIndex() : writing genesis block to disk failed");
2694 if (!block.AddToBlockIndex(nFile, nBlockPos))
2695 return error("LoadBlockIndex() : genesis block not accepted");
2697 // ppcoin: initialize synchronized checkpoint
2698 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
2699 return error("LoadBlockIndex() : failed to init sync checkpoint");
2702 // ppcoin: if checkpoint master key changed must reset sync-checkpoint
2705 string strPubKey = "";
2706 if (!txdb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
2708 // write checkpoint master key to db
2710 if (!txdb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
2711 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
2712 if (!txdb.TxnCommit())
2713 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
2714 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
2715 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
2725 void PrintBlockTree()
2727 // pre-compute tree structure
2728 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2729 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2731 CBlockIndex* pindex = (*mi).second;
2732 mapNext[pindex->pprev].push_back(pindex);
2734 //while (rand() % 3 == 0)
2735 // mapNext[pindex->pprev].push_back(pindex);
2738 vector<pair<int, CBlockIndex*> > vStack;
2739 vStack.push_back(make_pair(0, pindexGenesisBlock));
2742 while (!vStack.empty())
2744 int nCol = vStack.back().first;
2745 CBlockIndex* pindex = vStack.back().second;
2748 // print split or gap
2749 if (nCol > nPrevCol)
2751 for (int i = 0; i < nCol-1; i++)
2755 else if (nCol < nPrevCol)
2757 for (int i = 0; i < nCol; i++)
2764 for (int i = 0; i < nCol; i++)
2769 block.ReadFromDisk(pindex);
2770 printf("%d (%u,%u) %s %08x %s mint %7s tx %"PRIszu"",
2774 block.GetHash().ToString().c_str(),
2776 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2777 FormatMoney(pindex->nMint).c_str(),
2780 PrintWallets(block);
2782 // put the main time-chain first
2783 vector<CBlockIndex*>& vNext = mapNext[pindex];
2784 for (unsigned int i = 0; i < vNext.size(); i++)
2786 if (vNext[i]->pnext)
2788 swap(vNext[0], vNext[i]);
2794 for (unsigned int i = 0; i < vNext.size(); i++)
2795 vStack.push_back(make_pair(nCol+i, vNext[i]));
2799 bool LoadExternalBlockFile(FILE* fileIn)
2801 int64 nStart = GetTimeMillis();
2807 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
2808 unsigned int nPos = 0;
2809 while (nPos != (unsigned int)-1 && blkdat.good() && !fRequestShutdown)
2811 unsigned char pchData[65536];
2813 fseek(blkdat, nPos, SEEK_SET);
2814 int nRead = fread(pchData, 1, sizeof(pchData), blkdat);
2817 nPos = (unsigned int)-1;
2820 void* nFind = memchr(pchData, pchMessageStart[0], nRead+1-sizeof(pchMessageStart));
2823 if (memcmp(nFind, pchMessageStart, sizeof(pchMessageStart))==0)
2825 nPos += ((unsigned char*)nFind - pchData) + sizeof(pchMessageStart);
2828 nPos += ((unsigned char*)nFind - pchData) + 1;
2831 nPos += sizeof(pchData) - sizeof(pchMessageStart) + 1;
2832 } while(!fRequestShutdown);
2833 if (nPos == (unsigned int)-1)
2835 fseek(blkdat, nPos, SEEK_SET);
2838 if (nSize > 0 && nSize <= MAX_BLOCK_SIZE)
2842 if (ProcessBlock(NULL,&block))
2850 catch (std::exception &e) {
2851 printf("%s() : Deserialize or I/O error caught during load\n",
2852 __PRETTY_FUNCTION__);
2855 printf("Loaded %i blocks from external file in %"PRI64d"ms\n", nLoaded, GetTimeMillis() - nStart);
2867 //////////////////////////////////////////////////////////////////////////////
2872 extern map<uint256, CAlert> mapAlerts;
2873 extern CCriticalSection cs_mapAlerts;
2875 static string strMintMessage = "Info: Minting suspended due to locked wallet.";
2876 static string strMintWarning;
2878 string GetWarnings(string strFor)
2881 string strStatusBar;
2884 if (GetBoolArg("-testsafemode"))
2887 // ppcoin: wallet lock warning for minting
2888 if (strMintWarning != "")
2891 strStatusBar = strMintWarning;
2894 // Misc warnings like out of disk space and clock is wrong
2895 if (strMiscWarning != "")
2898 strStatusBar = strMiscWarning;
2901 // ppcoin: should not enter safe mode for longer invalid chain
2902 // ppcoin: if sync-checkpoint is too old do not enter safe mode
2903 if (Checkpoints::IsSyncCheckpointTooOld(60 * 60 * 24 * 10) && !fTestNet && !IsInitialBlockDownload())
2906 strStatusBar = "WARNING: Checkpoint is too old. Wait for block chain to download, or notify developers.";
2909 // ppcoin: if detected invalid checkpoint enter safe mode
2910 if (Checkpoints::hashInvalidCheckpoint != 0)
2913 strStatusBar = strRPC = "WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.";
2919 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2921 const CAlert& alert = item.second;
2922 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2924 nPriority = alert.nPriority;
2925 strStatusBar = alert.strStatusBar;
2926 if (nPriority > 1000)
2927 strRPC = strStatusBar; // ppcoin: safe mode for high alert
2932 if (strFor == "statusbar")
2933 return strStatusBar;
2934 else if (strFor == "rpc")
2936 assert(!"GetWarnings() : invalid parameter");
2947 //////////////////////////////////////////////////////////////////////////////
2953 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2959 bool txInMap = false;
2962 txInMap = (mempool.exists(inv.hash));
2965 mapOrphanTransactions.count(inv.hash) ||
2966 txdb.ContainsTx(inv.hash);
2970 return mapBlockIndex.count(inv.hash) ||
2971 mapOrphanBlocks.count(inv.hash);
2973 // Don't know what it is, just say we already got one
2980 // The message start string is designed to be unlikely to occur in normal data.
2981 // The characters are rarely used upper ASCII, not valid as UTF-8, and produce
2982 // a large 4-byte int at any alignment.
2983 unsigned char pchMessageStart[4] = { 0xe4, 0xe8, 0xe9, 0xe5 };
2985 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2987 static map<CService, CPubKey> mapReuseKey;
2988 RandAddSeedPerfmon();
2990 printf("received: %s (%"PRIszu" bytes)\n", strCommand.c_str(), vRecv.size());
2991 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2993 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3001 if (strCommand == "version")
3003 // Each connection can only send one version message
3004 if (pfrom->nVersion != 0)
3006 pfrom->Misbehaving(1);
3014 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3015 if (pfrom->nVersion < MIN_PROTO_VERSION)
3017 // Since February 20, 2012, the protocol is initiated at version 209,
3018 // and earlier versions are no longer supported
3019 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3020 pfrom->fDisconnect = true;
3024 if (pfrom->nVersion == 10300)
3025 pfrom->nVersion = 300;
3027 vRecv >> addrFrom >> nNonce;
3029 vRecv >> pfrom->strSubVer;
3031 vRecv >> pfrom->nStartingHeight;
3033 if (pfrom->fInbound && addrMe.IsRoutable())
3035 pfrom->addrLocal = addrMe;
3039 // Disconnect if we connected to ourself
3040 if (nNonce == nLocalHostNonce && nNonce > 1)
3042 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3043 pfrom->fDisconnect = true;
3047 // ppcoin: record my external IP reported by peer
3048 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3049 addrSeenByPeer = addrMe;
3051 // Be shy and don't send version until we hear
3052 if (pfrom->fInbound)
3053 pfrom->PushVersion();
3055 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3057 AddTimeData(pfrom->addr, nTime);
3060 pfrom->PushMessage("verack");
3061 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3063 if (!pfrom->fInbound)
3065 // Advertise our address
3066 if (!fNoListen && !IsInitialBlockDownload())
3068 CAddress addr = GetLocalAddress(&pfrom->addr);
3069 if (addr.IsRoutable())
3070 pfrom->PushAddress(addr);
3073 // Get recent addresses
3074 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3076 pfrom->PushMessage("getaddr");
3077 pfrom->fGetAddr = true;
3079 addrman.Good(pfrom->addr);
3081 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3083 addrman.Add(addrFrom, addrFrom);
3084 addrman.Good(addrFrom);
3088 // Ask the first connected node for block updates
3089 static int nAskedForBlocks = 0;
3090 if (!pfrom->fClient && !pfrom->fOneShot &&
3091 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3092 (pfrom->nVersion < NOBLKS_VERSION_START ||
3093 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3094 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3097 pfrom->PushGetBlocks(pindexBest, uint256(0));
3103 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3104 item.second.RelayTo(pfrom);
3107 // ppcoin: relay sync-checkpoint
3109 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3110 if (!Checkpoints::checkpointMessage.IsNull())
3111 Checkpoints::checkpointMessage.RelayTo(pfrom);
3114 pfrom->fSuccessfullyConnected = true;
3116 printf("receive version message: version %d, blocks=%d, us=%s, them=%s, peer=%s\n", pfrom->nVersion, pfrom->nStartingHeight, addrMe.ToString().c_str(), addrFrom.ToString().c_str(), pfrom->addr.ToString().c_str());
3118 cPeerBlockCounts.input(pfrom->nStartingHeight);
3120 // ppcoin: ask for pending sync-checkpoint if any
3121 if (!IsInitialBlockDownload())
3122 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3126 else if (pfrom->nVersion == 0)
3128 // Must have a version message before anything else
3129 pfrom->Misbehaving(1);
3134 else if (strCommand == "verack")
3136 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3140 else if (strCommand == "addr")
3142 vector<CAddress> vAddr;
3145 // Don't want addr from older versions unless seeding
3146 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3148 if (vAddr.size() > 1000)
3150 pfrom->Misbehaving(20);
3151 return error("message addr size() = %"PRIszu"", vAddr.size());
3154 // Store the new addresses
3155 vector<CAddress> vAddrOk;
3156 int64 nNow = GetAdjustedTime();
3157 int64 nSince = nNow - 10 * 60;
3158 BOOST_FOREACH(CAddress& addr, vAddr)
3162 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3163 addr.nTime = nNow - 5 * 24 * 60 * 60;
3164 pfrom->AddAddressKnown(addr);
3165 bool fReachable = IsReachable(addr);
3166 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3168 // Relay to a limited number of other nodes
3171 // Use deterministic randomness to send to the same nodes for 24 hours
3172 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3173 static uint256 hashSalt;
3175 hashSalt = GetRandHash();
3176 uint64 hashAddr = addr.GetHash();
3177 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
3178 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3179 multimap<uint256, CNode*> mapMix;
3180 BOOST_FOREACH(CNode* pnode, vNodes)
3182 if (pnode->nVersion < CADDR_TIME_VERSION)
3184 unsigned int nPointer;
3185 memcpy(&nPointer, &pnode, sizeof(nPointer));
3186 uint256 hashKey = hashRand ^ nPointer;
3187 hashKey = Hash(BEGIN(hashKey), END(hashKey));
3188 mapMix.insert(make_pair(hashKey, pnode));
3190 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3191 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3192 ((*mi).second)->PushAddress(addr);
3195 // Do not store addresses outside our network
3197 vAddrOk.push_back(addr);
3199 addrman.Add(vAddrOk, pfrom->addr, 2 * 60 * 60);
3200 if (vAddr.size() < 1000)
3201 pfrom->fGetAddr = false;
3202 if (pfrom->fOneShot)
3203 pfrom->fDisconnect = true;
3207 else if (strCommand == "inv")
3211 if (vInv.size() > MAX_INV_SZ)
3213 pfrom->Misbehaving(20);
3214 return error("message inv size() = %"PRIszu"", vInv.size());
3217 // find last block in inv vector
3218 unsigned int nLastBlock = (unsigned int)(-1);
3219 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++) {
3220 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
3221 nLastBlock = vInv.size() - 1 - nInv;
3226 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
3228 const CInv &inv = vInv[nInv];
3232 pfrom->AddInventoryKnown(inv);
3234 bool fAlreadyHave = AlreadyHave(txdb, inv);
3236 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3240 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
3241 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
3242 } else if (nInv == nLastBlock) {
3243 // In case we are on a very long side-chain, it is possible that we already have
3244 // the last block in an inv bundle sent in response to getblocks. Try to detect
3245 // this situation and push another getblocks to continue.
3246 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
3248 printf("force request: %s\n", inv.ToString().c_str());
3251 // Track requests for our stuff
3252 Inventory(inv.hash);
3257 else if (strCommand == "getdata")
3261 if (vInv.size() > MAX_INV_SZ)
3263 pfrom->Misbehaving(20);
3264 return error("message getdata size() = %"PRIszu"", vInv.size());
3267 if (fDebugNet || (vInv.size() != 1))
3268 printf("received getdata (%"PRIszu" invsz)\n", vInv.size());
3270 BOOST_FOREACH(const CInv& inv, vInv)
3274 if (fDebugNet || (vInv.size() == 1))
3275 printf("received getdata for: %s\n", inv.ToString().c_str());
3277 if (inv.type == MSG_BLOCK)
3279 // Send block from disk
3280 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
3281 if (mi != mapBlockIndex.end())
3284 block.ReadFromDisk((*mi).second);
3285 pfrom->PushMessage("block", block);
3287 // Trigger them to send a getblocks request for the next batch of inventory
3288 if (inv.hash == pfrom->hashContinue)
3290 // ppcoin: send latest proof-of-work block to allow the
3291 // download node to accept as orphan (proof-of-stake
3292 // block might be rejected by stake connection check)
3294 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3295 pfrom->PushMessage("inv", vInv);
3296 pfrom->hashContinue = 0;
3300 else if (inv.IsKnownType())
3302 // Send stream from relay memory
3303 bool pushed = false;
3306 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
3307 if (mi != mapRelay.end()) {
3308 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3312 if (!pushed && inv.type == MSG_TX) {
3314 if (mempool.exists(inv.hash)) {
3315 CTransaction tx = mempool.lookup(inv.hash);
3316 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3319 pfrom->PushMessage("tx", ss);
3324 // Track requests for our stuff
3325 Inventory(inv.hash);
3330 else if (strCommand == "getblocks")
3332 CBlockLocator locator;
3334 vRecv >> locator >> hashStop;
3336 // Find the last block the caller has in the main chain
3337 CBlockIndex* pindex = locator.GetBlockIndex();
3339 // Send the rest of the chain
3341 pindex = pindex->pnext;
3343 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3344 for (; pindex; pindex = pindex->pnext)
3346 if (pindex->GetBlockHash() == hashStop)
3348 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3349 // ppcoin: tell downloading node about the latest block if it's
3350 // without risk being rejected due to stake connection check
3351 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3352 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3355 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3358 // When this block is requested, we'll send an inv that'll make them
3359 // getblocks the next batch of inventory.
3360 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3361 pfrom->hashContinue = pindex->GetBlockHash();
3366 else if (strCommand == "checkpoint")
3368 CSyncCheckpoint checkpoint;
3369 vRecv >> checkpoint;
3371 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3374 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3376 BOOST_FOREACH(CNode* pnode, vNodes)
3377 checkpoint.RelayTo(pnode);
3381 else if (strCommand == "getheaders")
3383 CBlockLocator locator;
3385 vRecv >> locator >> hashStop;
3387 CBlockIndex* pindex = NULL;
3388 if (locator.IsNull())
3390 // If locator is null, return the hashStop block
3391 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
3392 if (mi == mapBlockIndex.end())
3394 pindex = (*mi).second;
3398 // Find the last block the caller has in the main chain
3399 pindex = locator.GetBlockIndex();
3401 pindex = pindex->pnext;
3404 vector<CBlock> vHeaders;
3406 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3407 for (; pindex; pindex = pindex->pnext)
3409 vHeaders.push_back(pindex->GetBlockHeader());
3410 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3413 pfrom->PushMessage("headers", vHeaders);
3417 else if (strCommand == "tx")
3419 vector<uint256> vWorkQueue;
3420 vector<uint256> vEraseQueue;
3421 CDataStream vMsg(vRecv);
3426 CInv inv(MSG_TX, tx.GetHash());
3427 pfrom->AddInventoryKnown(inv);
3429 bool fMissingInputs = false;
3430 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
3432 SyncWithWallets(tx, NULL, true);
3433 RelayMessage(inv, vMsg);
3434 mapAlreadyAskedFor.erase(inv);
3435 vWorkQueue.push_back(inv.hash);
3436 vEraseQueue.push_back(inv.hash);
3438 // Recursively process any orphan transactions that depended on this one
3439 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3441 uint256 hashPrev = vWorkQueue[i];
3442 for (map<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3443 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3446 const CDataStream& vMsg = *((*mi).second);
3448 CDataStream(vMsg) >> tx;
3449 CInv inv(MSG_TX, tx.GetHash());
3450 bool fMissingInputs2 = false;
3452 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
3454 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
3455 SyncWithWallets(tx, NULL, true);
3456 RelayMessage(inv, vMsg);
3457 mapAlreadyAskedFor.erase(inv);
3458 vWorkQueue.push_back(inv.hash);
3459 vEraseQueue.push_back(inv.hash);
3461 else if (!fMissingInputs2)
3464 vEraseQueue.push_back(inv.hash);
3465 printf(" removed invalid orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
3470 BOOST_FOREACH(uint256 hash, vEraseQueue)
3471 EraseOrphanTx(hash);
3473 else if (fMissingInputs)
3477 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3478 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3480 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3482 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3486 else if (strCommand == "block")
3491 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
3494 CInv inv(MSG_BLOCK, block.GetHash());
3495 pfrom->AddInventoryKnown(inv);
3497 if (ProcessBlock(pfrom, &block))
3498 mapAlreadyAskedFor.erase(inv);
3499 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3503 else if (strCommand == "getaddr")
3505 pfrom->vAddrToSend.clear();
3506 vector<CAddress> vAddr = addrman.GetAddr();
3507 BOOST_FOREACH(const CAddress &addr, vAddr)
3508 pfrom->PushAddress(addr);
3512 else if (strCommand == "mempool")
3514 std::vector<uint256> vtxid;
3515 mempool.queryHashes(vtxid);
3517 for (unsigned int i = 0; i < vtxid.size(); i++) {
3518 CInv inv(MSG_TX, vtxid[i]);
3519 vInv.push_back(inv);
3520 if (i == (MAX_INV_SZ - 1))
3523 if (vInv.size() > 0)
3524 pfrom->PushMessage("inv", vInv);
3528 else if (strCommand == "checkorder")
3533 if (!GetBoolArg("-allowreceivebyip"))
3535 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
3542 /// we have a chance to check the order here
3544 // Keep giving the same key to the same ip until they use it
3545 if (!mapReuseKey.count(pfrom->addr))
3546 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3548 // Send back approval of order and pubkey to use
3549 CScript scriptPubKey;
3550 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3551 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
3555 else if (strCommand == "reply")
3560 CRequestTracker tracker;
3562 LOCK(pfrom->cs_mapRequests);
3563 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
3564 if (mi != pfrom->mapRequests.end())
3566 tracker = (*mi).second;
3567 pfrom->mapRequests.erase(mi);
3570 if (!tracker.IsNull())
3571 tracker.fn(tracker.param1, vRecv);
3575 else if (strCommand == "ping")
3577 if (pfrom->nVersion > BIP0031_VERSION)
3581 // Echo the message back with the nonce. This allows for two useful features:
3583 // 1) A remote node can quickly check if the connection is operational
3584 // 2) Remote nodes can measure the latency of the network thread. If this node
3585 // is overloaded it won't respond to pings quickly and the remote node can
3586 // avoid sending us more work, like chain download requests.
3588 // The nonce stops the remote getting confused between different pings: without
3589 // it, if the remote node sends a ping once per second and this node takes 5
3590 // seconds to respond to each, the 5th ping the remote sends would appear to
3591 // return very quickly.
3592 pfrom->PushMessage("pong", nonce);
3597 else if (strCommand == "alert")
3602 uint256 alertHash = alert.GetHash();
3603 if (pfrom->setKnown.count(alertHash) == 0)
3605 if (alert.ProcessAlert())
3608 pfrom->setKnown.insert(alertHash);
3611 BOOST_FOREACH(CNode* pnode, vNodes)
3612 alert.RelayTo(pnode);
3616 // Small DoS penalty so peers that send us lots of
3617 // duplicate/expired/invalid-signature/whatever alerts
3618 // eventually get banned.
3619 // This isn't a Misbehaving(100) (immediate ban) because the
3620 // peer might be an older or different implementation with
3621 // a different signature key, etc.
3622 pfrom->Misbehaving(10);
3630 // Ignore unknown commands for extensibility
3634 // Update the last seen time for this node's address
3635 if (pfrom->fNetworkNode)
3636 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3637 AddressCurrentlyConnected(pfrom->addr);
3643 bool ProcessMessages(CNode* pfrom)
3645 CDataStream& vRecv = pfrom->vRecv;
3649 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3653 // (4) message start
3662 // Don't bother if send buffer is too full to respond anyway
3663 if (pfrom->vSend.size() >= SendBufferSize())
3666 // Scan for message start
3667 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
3668 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3669 if (vRecv.end() - pstart < nHeaderSize)
3671 if ((int)vRecv.size() > nHeaderSize)
3673 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
3674 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
3678 if (pstart - vRecv.begin() > 0)
3679 printf("\n\nPROCESSMESSAGE SKIPPED %"PRIpdd" BYTES\n\n", pstart - vRecv.begin());
3680 vRecv.erase(vRecv.begin(), pstart);
3683 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
3688 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
3691 string strCommand = hdr.GetCommand();
3694 unsigned int nMessageSize = hdr.nMessageSize;
3695 if (nMessageSize > MAX_SIZE)
3697 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
3700 if (nMessageSize > vRecv.size())
3702 // Rewind and wait for rest of message
3703 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
3708 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
3709 unsigned int nChecksum = 0;
3710 memcpy(&nChecksum, &hash, sizeof(nChecksum));
3711 if (nChecksum != hdr.nChecksum)
3713 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
3714 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
3718 // Copy message to its own buffer
3719 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
3720 vRecv.ignore(nMessageSize);
3728 fRet = ProcessMessage(pfrom, strCommand, vMsg);
3733 catch (std::ios_base::failure& e)
3735 if (strstr(e.what(), "end of data"))
3737 // Allow exceptions from under-length message on vRecv
3738 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught, normally caused by a message being shorter than its stated length\n", strCommand.c_str(), nMessageSize, e.what());
3740 else if (strstr(e.what(), "size too large"))
3742 // Allow exceptions from over-long size
3743 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
3747 PrintExceptionContinue(&e, "ProcessMessages()");
3750 catch (std::exception& e) {
3751 PrintExceptionContinue(&e, "ProcessMessages()");
3753 PrintExceptionContinue(NULL, "ProcessMessages()");
3757 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
3765 bool SendMessages(CNode* pto, bool fSendTrickle)
3767 TRY_LOCK(cs_main, lockMain);
3769 // Don't send anything until we get their version message
3770 if (pto->nVersion == 0)
3773 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
3775 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
3777 if (pto->nVersion > BIP0031_VERSION)
3778 pto->PushMessage("ping", nonce);
3780 pto->PushMessage("ping");
3783 // Resend wallet transactions that haven't gotten in a block yet
3784 ResendWalletTransactions();
3786 // Address refresh broadcast
3787 static int64 nLastRebroadcast;
3788 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
3792 BOOST_FOREACH(CNode* pnode, vNodes)
3794 // Periodically clear setAddrKnown to allow refresh broadcasts
3795 if (nLastRebroadcast)
3796 pnode->setAddrKnown.clear();
3798 // Rebroadcast our address
3801 CAddress addr = GetLocalAddress(&pnode->addr);
3802 if (addr.IsRoutable())
3803 pnode->PushAddress(addr);
3807 nLastRebroadcast = GetTime();
3815 vector<CAddress> vAddr;
3816 vAddr.reserve(pto->vAddrToSend.size());
3817 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
3819 // returns true if wasn't already contained in the set
3820 if (pto->setAddrKnown.insert(addr).second)
3822 vAddr.push_back(addr);
3823 // receiver rejects addr messages larger than 1000
3824 if (vAddr.size() >= 1000)
3826 pto->PushMessage("addr", vAddr);
3831 pto->vAddrToSend.clear();
3833 pto->PushMessage("addr", vAddr);
3838 // Message: inventory
3841 vector<CInv> vInvWait;
3843 LOCK(pto->cs_inventory);
3844 vInv.reserve(pto->vInventoryToSend.size());
3845 vInvWait.reserve(pto->vInventoryToSend.size());
3846 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
3848 if (pto->setInventoryKnown.count(inv))
3851 // trickle out tx inv to protect privacy
3852 if (inv.type == MSG_TX && !fSendTrickle)
3854 // 1/4 of tx invs blast to all immediately
3855 static uint256 hashSalt;
3857 hashSalt = GetRandHash();
3858 uint256 hashRand = inv.hash ^ hashSalt;
3859 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3860 bool fTrickleWait = ((hashRand & 3) != 0);
3862 // always trickle our own transactions
3866 if (GetTransaction(inv.hash, wtx))
3868 fTrickleWait = true;
3873 vInvWait.push_back(inv);
3878 // returns true if wasn't already contained in the set
3879 if (pto->setInventoryKnown.insert(inv).second)
3881 vInv.push_back(inv);
3882 if (vInv.size() >= 1000)
3884 pto->PushMessage("inv", vInv);
3889 pto->vInventoryToSend = vInvWait;
3892 pto->PushMessage("inv", vInv);
3898 vector<CInv> vGetData;
3899 int64 nNow = GetTime() * 1000000;
3901 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
3903 const CInv& inv = (*pto->mapAskFor.begin()).second;
3904 if (!AlreadyHave(txdb, inv))
3907 printf("sending getdata: %s\n", inv.ToString().c_str());
3908 vGetData.push_back(inv);
3909 if (vGetData.size() >= 1000)
3911 pto->PushMessage("getdata", vGetData);
3914 mapAlreadyAskedFor[inv] = nNow;
3916 pto->mapAskFor.erase(pto->mapAskFor.begin());
3918 if (!vGetData.empty())
3919 pto->PushMessage("getdata", vGetData);
3938 //////////////////////////////////////////////////////////////////////////////
3943 int static FormatHashBlocks(void* pbuffer, unsigned int len)
3945 unsigned char* pdata = (unsigned char*)pbuffer;
3946 unsigned int blocks = 1 + ((len + 8) / 64);
3947 unsigned char* pend = pdata + 64 * blocks;
3948 memset(pdata + len, 0, 64 * blocks - len);
3950 unsigned int bits = len * 8;
3951 pend[-1] = (bits >> 0) & 0xff;
3952 pend[-2] = (bits >> 8) & 0xff;
3953 pend[-3] = (bits >> 16) & 0xff;
3954 pend[-4] = (bits >> 24) & 0xff;
3958 static const unsigned int pSHA256InitState[8] =
3959 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
3961 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
3964 unsigned char data[64];
3968 for (int i = 0; i < 16; i++)
3969 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
3971 for (int i = 0; i < 8; i++)
3972 ctx.h[i] = ((uint32_t*)pinit)[i];
3974 SHA256_Update(&ctx, data, sizeof(data));
3975 for (int i = 0; i < 8; i++)
3976 ((uint32_t*)pstate)[i] = ctx.h[i];
3979 // Some explaining would be appreciated
3984 set<uint256> setDependsOn;
3988 COrphan(CTransaction* ptxIn)
3991 dPriority = dFeePerKb = 0;
3996 printf("COrphan(hash=%s, dPriority=%.1f, dFeePerKb=%.1f)\n",
3997 ptx->GetHash().ToString().substr(0,10).c_str(), dPriority, dFeePerKb);
3998 BOOST_FOREACH(uint256 hash, setDependsOn)
3999 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
4004 uint64 nLastBlockTx = 0;
4005 uint64 nLastBlockSize = 0;
4006 int64 nLastCoinStakeSearchInterval = 0;
4008 // We want to sort transactions by priority and fee, so:
4009 typedef boost::tuple<double, double, CTransaction*> TxPriority;
4010 class TxPriorityCompare
4014 TxPriorityCompare(bool _byFee) : byFee(_byFee) { }
4015 bool operator()(const TxPriority& a, const TxPriority& b)
4019 if (a.get<1>() == b.get<1>())
4020 return a.get<0>() < b.get<0>();
4021 return a.get<1>() < b.get<1>();
4025 if (a.get<0>() == b.get<0>())
4026 return a.get<1>() < b.get<1>();
4027 return a.get<0>() < b.get<0>();
4033 // fProofOfStake: try (best effort) to make a proof-of-stake block
4034 CBlock* CreateNewBlock(CWallet* pwallet, bool fProofOfStake)
4036 CReserveKey reservekey(pwallet);
4039 auto_ptr<CBlock> pblock(new CBlock());
4043 // Create coinbase tx
4045 txNew.vin.resize(1);
4046 txNew.vin[0].prevout.SetNull();
4047 txNew.vout.resize(1);
4048 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
4050 // Add our coinbase tx as first transaction
4051 pblock->vtx.push_back(txNew);
4053 // Largest block you're willing to create:
4054 unsigned int nBlockMaxSize = GetArg("-blockmaxsize", MAX_BLOCK_SIZE_GEN/2);
4055 // Limit to betweeen 1K and MAX_BLOCK_SIZE-1K for sanity:
4056 nBlockMaxSize = std::max((unsigned int)1000, std::min((unsigned int)(MAX_BLOCK_SIZE-1000), nBlockMaxSize));
4058 // Special compatibility rule before 20 Aug: limit size to 500,000 bytes:
4059 if (GetAdjustedTime() < LOCKS_SWITCH_TIME)
4060 nBlockMaxSize = std::min(nBlockMaxSize, (unsigned int)(MAX_BLOCK_SIZE_GEN));
4062 // How much of the block should be dedicated to high-priority transactions,
4063 // included regardless of the fees they pay
4064 unsigned int nBlockPrioritySize = GetArg("-blockprioritysize", 27000);
4065 nBlockPrioritySize = std::min(nBlockMaxSize, nBlockPrioritySize);
4067 // Minimum block size you want to create; block will be filled with free transactions
4068 // until there are no more or the block reaches this size:
4069 unsigned int nBlockMinSize = GetArg("-blockminsize", 0);
4070 nBlockMinSize = std::min(nBlockMaxSize, nBlockMinSize);
4072 // Fee-per-kilobyte amount considered the same as "free"
4073 // Be careful setting this: if you set it to zero then
4074 // a transaction spammer can cheaply fill blocks using
4075 // 1-satoshi-fee transactions. It should be set above the real
4076 // cost to you of processing a transaction.
4077 int64 nMinTxFee = MIN_TX_FEE;
4078 if (mapArgs.count("-mintxfee"))
4079 ParseMoney(mapArgs["-mintxfee"], nMinTxFee);
4081 // ppcoin: if coinstake available add coinstake tx
4082 static int64 nLastCoinStakeSearchTime = GetAdjustedTime(); // only initialized at startup
4083 CBlockIndex* pindexPrev = pindexBest;
4085 if (fProofOfStake) // attempt to find a coinstake
4087 pblock->nBits = GetNextTargetRequired(pindexPrev, true);
4088 CTransaction txCoinStake;
4089 int64 nSearchTime = txCoinStake.nTime; // search to current time
4090 if (nSearchTime > nLastCoinStakeSearchTime)
4092 if (pwallet->CreateCoinStake(*pwallet, pblock->nBits, nSearchTime-nLastCoinStakeSearchTime, txCoinStake))
4094 if (txCoinStake.nTime >= max(pindexPrev->GetMedianTimePast()+1, pindexPrev->GetBlockTime() - nMaxClockDrift))
4095 { // make sure coinstake would meet timestamp protocol
4096 // as it would be the same as the block timestamp
4097 pblock->vtx[0].vout[0].SetEmpty();
4098 pblock->vtx[0].nTime = txCoinStake.nTime;
4099 pblock->vtx.push_back(txCoinStake);
4102 nLastCoinStakeSearchInterval = nSearchTime - nLastCoinStakeSearchTime;
4103 nLastCoinStakeSearchTime = nSearchTime;
4107 pblock->nBits = GetNextTargetRequired(pindexPrev, pblock->IsProofOfStake());
4109 // Collect memory pool transactions into the block
4112 LOCK2(cs_main, mempool.cs);
4113 CBlockIndex* pindexPrev = pindexBest;
4116 // Priority order to process transactions
4117 list<COrphan> vOrphan; // list memory doesn't move
4118 map<uint256, vector<COrphan*> > mapDependers;
4120 // This vector will be sorted into a priority queue:
4121 vector<TxPriority> vecPriority;
4122 vecPriority.reserve(mempool.mapTx.size());
4123 for (map<uint256, CTransaction>::iterator mi = mempool.mapTx.begin(); mi != mempool.mapTx.end(); ++mi)
4125 CTransaction& tx = (*mi).second;
4126 if (tx.IsCoinBase() || tx.IsCoinStake() || !tx.IsFinal())
4129 COrphan* porphan = NULL;
4130 double dPriority = 0;
4132 bool fMissingInputs = false;
4133 BOOST_FOREACH(const CTxIn& txin, tx.vin)
4135 // Read prev transaction
4136 CTransaction txPrev;
4138 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
4140 // This should never happen; all transactions in the memory
4141 // pool should connect to either transactions in the chain
4142 // or other transactions in the memory pool.
4143 if (!mempool.mapTx.count(txin.prevout.hash))
4145 printf("ERROR: mempool transaction missing input\n");
4146 if (fDebug) assert("mempool transaction missing input" == 0);
4147 fMissingInputs = true;
4153 // Has to wait for dependencies
4156 // Use list for automatic deletion
4157 vOrphan.push_back(COrphan(&tx));
4158 porphan = &vOrphan.back();
4160 mapDependers[txin.prevout.hash].push_back(porphan);
4161 porphan->setDependsOn.insert(txin.prevout.hash);
4162 nTotalIn += mempool.mapTx[txin.prevout.hash].vout[txin.prevout.n].nValue;
4165 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
4166 nTotalIn += nValueIn;
4168 int nConf = txindex.GetDepthInMainChain();
4169 dPriority += (double)nValueIn * nConf;
4171 if (fMissingInputs) continue;
4173 // Priority is sum(valuein * age) / txsize
4174 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
4175 dPriority /= nTxSize;
4177 // This is a more accurate fee-per-kilobyte than is used by the client code, because the
4178 // client code rounds up the size to the nearest 1K. That's good, because it gives an
4179 // incentive to create smaller transactions.
4180 double dFeePerKb = double(nTotalIn-tx.GetValueOut()) / (double(nTxSize)/1000.0);
4184 porphan->dPriority = dPriority;
4185 porphan->dFeePerKb = dFeePerKb;
4188 vecPriority.push_back(TxPriority(dPriority, dFeePerKb, &(*mi).second));
4191 // Collect transactions into block
4192 map<uint256, CTxIndex> mapTestPool;
4193 uint64 nBlockSize = 1000;
4194 uint64 nBlockTx = 0;
4195 int nBlockSigOps = 100;
4196 bool fSortedByFee = (nBlockPrioritySize <= 0);
4198 TxPriorityCompare comparer(fSortedByFee);
4199 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
4201 while (!vecPriority.empty())
4203 // Take highest priority transaction off the priority queue:
4204 double dPriority = vecPriority.front().get<0>();
4205 double dFeePerKb = vecPriority.front().get<1>();
4206 CTransaction& tx = *(vecPriority.front().get<2>());
4208 std::pop_heap(vecPriority.begin(), vecPriority.end(), comparer);
4209 vecPriority.pop_back();
4212 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
4213 if (nBlockSize + nTxSize >= nBlockMaxSize)
4216 // Legacy limits on sigOps:
4217 unsigned int nTxSigOps = tx.GetLegacySigOpCount();
4218 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
4222 if (tx.nTime > GetAdjustedTime() || (pblock->IsProofOfStake() && tx.nTime > pblock->vtx[1].nTime))
4225 // ppcoin: simplify transaction fee - allow free = false
4226 int64 nMinFee = tx.GetMinFee(nBlockSize, false, GMF_BLOCK);
4228 // Skip free transactions if we're past the minimum block size:
4229 if (fSortedByFee && (dFeePerKb < nMinTxFee) && (nBlockSize + nTxSize >= nBlockMinSize))
4232 // Prioritize by fee once past the priority size or we run out of high-priority
4234 if (!fSortedByFee &&
4235 ((nBlockSize + nTxSize >= nBlockPrioritySize) || (dPriority < COIN * 144 / 250)))
4237 fSortedByFee = true;
4238 comparer = TxPriorityCompare(fSortedByFee);
4239 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
4242 // Connecting shouldn't fail due to dependency on other memory pool transactions
4243 // because we're already processing them in order of dependency
4244 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
4245 MapPrevTx mapInputs;
4247 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
4250 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
4251 if (nTxFees < nMinFee)
4254 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
4255 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
4258 if (!tx.ConnectInputs(txdb, mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
4260 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
4261 swap(mapTestPool, mapTestPoolTmp);
4264 pblock->vtx.push_back(tx);
4265 nBlockSize += nTxSize;
4267 nBlockSigOps += nTxSigOps;
4270 if (fDebug && GetBoolArg("-printpriority"))
4272 printf("priority %.1f feeperkb %.1f txid %s\n",
4273 dPriority, dFeePerKb, tx.GetHash().ToString().c_str());
4276 // Add transactions that depend on this one to the priority queue
4277 uint256 hash = tx.GetHash();
4278 if (mapDependers.count(hash))
4280 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
4282 if (!porphan->setDependsOn.empty())
4284 porphan->setDependsOn.erase(hash);
4285 if (porphan->setDependsOn.empty())
4287 vecPriority.push_back(TxPriority(porphan->dPriority, porphan->dFeePerKb, porphan->ptx));
4288 std::push_heap(vecPriority.begin(), vecPriority.end(), comparer);
4295 nLastBlockTx = nBlockTx;
4296 nLastBlockSize = nBlockSize;
4298 if (fDebug && GetBoolArg("-printpriority"))
4299 printf("CreateNewBlock(): total size %"PRI64u"\n", nBlockSize);
4301 if (pblock->IsProofOfWork())
4302 pblock->vtx[0].vout[0].nValue = GetProofOfWorkReward(pblock->nBits);
4305 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
4306 if (pblock->IsProofOfStake())
4307 pblock->nTime = pblock->vtx[1].nTime; //same as coinstake timestamp
4308 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, pblock->GetMaxTransactionTime());
4309 pblock->nTime = max(pblock->GetBlockTime(), pindexPrev->GetBlockTime() - nMaxClockDrift);
4310 if (pblock->IsProofOfWork())
4311 pblock->UpdateTime(pindexPrev);
4315 return pblock.release();
4319 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
4321 // Update nExtraNonce
4322 static uint256 hashPrevBlock;
4323 if (hashPrevBlock != pblock->hashPrevBlock)
4326 hashPrevBlock = pblock->hashPrevBlock;
4329 unsigned int nHeight = pindexPrev->nHeight+1; // Height first in coinbase required for block.version=2
4330 pblock->vtx[0].vin[0].scriptSig = (CScript() << nHeight << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
4331 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
4333 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
4337 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
4340 // Pre-build hash buffers
4347 uint256 hashPrevBlock;
4348 uint256 hashMerkleRoot;
4351 unsigned int nNonce;
4354 unsigned char pchPadding0[64];
4356 unsigned char pchPadding1[64];
4359 memset(&tmp, 0, sizeof(tmp));
4361 tmp.block.nVersion = pblock->nVersion;
4362 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
4363 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
4364 tmp.block.nTime = pblock->nTime;
4365 tmp.block.nBits = pblock->nBits;
4366 tmp.block.nNonce = pblock->nNonce;
4368 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
4369 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
4371 // Byte swap all the input buffer
4372 for (unsigned int i = 0; i < sizeof(tmp)/4; i++)
4373 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
4375 // Precalc the first half of the first hash, which stays constant
4376 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
4378 memcpy(pdata, &tmp.block, 128);
4379 memcpy(phash1, &tmp.hash1, 64);
4383 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
4385 uint256 hash = pblock->GetHash();
4386 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
4388 if (hash > hashTarget && pblock->IsProofOfWork())
4389 return error("BitcoinMiner : proof-of-work not meeting target");
4392 printf("BitcoinMiner:\n");
4393 printf("new block found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
4395 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
4400 if (pblock->hashPrevBlock != hashBestChain)
4401 return error("BitcoinMiner : generated block is stale");
4403 // Remove key from key pool
4404 reservekey.KeepKey();
4406 // Track how many getdata requests this block gets
4408 LOCK(wallet.cs_wallet);
4409 wallet.mapRequestCount[pblock->GetHash()] = 0;
4412 // Process this block the same as if we had received it from another node
4413 if (!ProcessBlock(NULL, pblock))
4414 return error("BitcoinMiner : ProcessBlock, block not accepted");
4420 void static ThreadBitcoinMiner(void* parg);
4422 static bool fGenerateBitcoins = false;
4423 static bool fLimitProcessors = false;
4424 static int nLimitProcessors = -1;
4426 void BitcoinMiner(CWallet *pwallet, bool fProofOfStake)
4428 SetThreadPriority(THREAD_PRIORITY_LOWEST);
4430 // Make this thread recognisable as the mining thread
4431 RenameThread("bitcoin-miner");
4433 // Each thread has its own key and counter
4434 CReserveKey reservekey(pwallet);
4435 unsigned int nExtraNonce = 0;
4437 while (fProofOfStake)
4441 while (vNodes.empty() || IsInitialBlockDownload())
4450 while (pwallet->IsLocked())
4452 strMintWarning = strMintMessage;
4455 strMintWarning = "";
4460 CBlockIndex* pindexPrev = pindexBest;
4462 auto_ptr<CBlock> pblock(CreateNewBlock(pwallet, fProofOfStake));
4465 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
4469 // ppcoin: if proof-of-stake block found then process block
4470 if (pblock->IsProofOfStake())
4472 if (!pblock->SignBlock(*pwalletMain))
4474 strMintWarning = strMintMessage;
4477 strMintWarning = "";
4478 printf("StakeMiner : proof-of-stake block found %s\n", pblock->GetHash().ToString().c_str());
4479 SetThreadPriority(THREAD_PRIORITY_NORMAL);
4480 CheckWork(pblock.get(), *pwalletMain, reservekey);
4481 SetThreadPriority(THREAD_PRIORITY_LOWEST);
4489 void static ThreadBitcoinMiner(void* parg)
4491 CWallet* pwallet = (CWallet*)parg;
4494 vnThreadsRunning[THREAD_MINER]++;
4495 BitcoinMiner(pwallet, false);
4496 vnThreadsRunning[THREAD_MINER]--;
4498 catch (std::exception& e) {
4499 vnThreadsRunning[THREAD_MINER]--;
4500 PrintException(&e, "ThreadBitcoinMiner()");
4502 vnThreadsRunning[THREAD_MINER]--;
4503 PrintException(NULL, "ThreadBitcoinMiner()");
4506 if (vnThreadsRunning[THREAD_MINER] == 0)
4508 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
4512 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
4514 fGenerateBitcoins = fGenerate;
4515 nLimitProcessors = GetArg("-genproclimit", -1);
4516 if (nLimitProcessors == 0)
4517 fGenerateBitcoins = false;
4518 fLimitProcessors = (nLimitProcessors != -1);
4522 int nProcessors = boost::thread::hardware_concurrency();
4523 printf("%d processors\n", nProcessors);
4524 if (nProcessors < 1)
4526 if (fLimitProcessors && nProcessors > nLimitProcessors)
4527 nProcessors = nLimitProcessors;
4528 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
4529 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
4530 for (int i = 0; i < nAddThreads; i++)
4532 if (!NewThread(ThreadBitcoinMiner, pwallet))
4533 printf("Error: NewThread(ThreadBitcoinMiner) failed\n");