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 // NovaCoin: enforce minimum output amount for user transactions
480 // (and for all transactions until 20 Sep 2013)
481 if ((!IsCoinBase() || nTime < CHAINCHECKS_SWITCH_TIME)
482 && (!txout.IsEmpty()) && txout.nValue < MIN_TXOUT_AMOUNT)
483 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue below minimum"));
485 if (txout.nValue > MAX_MONEY)
486 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
487 nValueOut += txout.nValue;
488 if (!MoneyRange(nValueOut))
489 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
492 // Check for duplicate inputs
493 set<COutPoint> vInOutPoints;
494 BOOST_FOREACH(const CTxIn& txin, vin)
496 if (vInOutPoints.count(txin.prevout))
498 vInOutPoints.insert(txin.prevout);
503 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
504 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
508 BOOST_FOREACH(const CTxIn& txin, vin)
509 if (txin.prevout.IsNull())
510 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
516 int64 CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree,
517 enum GetMinFee_mode mode) const
519 // Base fee is either MIN_TX_FEE or MIN_RELAY_TX_FEE
520 int64 nBaseFee = (mode == GMF_RELAY) ? MIN_RELAY_TX_FEE : MIN_TX_FEE;
522 unsigned int nBytes = ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION);
523 unsigned int nNewBlockSize = nBlockSize + nBytes;
524 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
526 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if any output is less than 0.01
527 if (nMinFee < nBaseFee)
529 BOOST_FOREACH(const CTxOut& txout, vout)
530 if (txout.nValue < CENT)
534 // Raise the price as the block approaches full
535 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
537 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
539 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
542 if (!MoneyRange(nMinFee))
548 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
549 bool* pfMissingInputs)
552 *pfMissingInputs = false;
554 if (!tx.CheckTransaction())
555 return error("CTxMemPool::accept() : CheckTransaction failed");
557 // Coinbase is only valid in a block, not as a loose transaction
559 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
561 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
562 if (tx.IsCoinStake())
563 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
565 // To help v0.1.5 clients who would see it as a negative number
566 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
567 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
569 // Rather not work on nonstandard transactions (unless -testnet)
570 if (!fTestNet && !tx.IsStandard())
571 return error("CTxMemPool::accept() : nonstandard transaction type");
573 // Do we already have it?
574 uint256 hash = tx.GetHash();
577 if (mapTx.count(hash))
581 if (txdb.ContainsTx(hash))
584 // Check for conflicts with in-memory transactions
585 CTransaction* ptxOld = NULL;
586 for (unsigned int i = 0; i < tx.vin.size(); i++)
588 COutPoint outpoint = tx.vin[i].prevout;
589 if (mapNextTx.count(outpoint))
591 // Disable replacement feature for now
594 // Allow replacing with a newer version of the same transaction
597 ptxOld = mapNextTx[outpoint].ptx;
598 if (ptxOld->IsFinal())
600 if (!tx.IsNewerThan(*ptxOld))
602 for (unsigned int i = 0; i < tx.vin.size(); i++)
604 COutPoint outpoint = tx.vin[i].prevout;
605 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
615 map<uint256, CTxIndex> mapUnused;
616 bool fInvalid = false;
617 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
620 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
622 *pfMissingInputs = true;
626 // Check for non-standard pay-to-script-hash in inputs
627 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
628 return error("CTxMemPool::accept() : nonstandard transaction input");
630 // Note: if you modify this code to accept non-standard transactions, then
631 // you should add code here to check that the transaction does a
632 // reasonable number of ECDSA signature verifications.
634 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
635 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
637 // Don't accept it if it can't get into a block
638 int64 txMinFee = tx.GetMinFee(1000, false, GMF_RELAY);
639 if (nFees < txMinFee)
640 return error("CTxMemPool::accept() : not enough fees %s, %"PRI64d" < %"PRI64d,
641 hash.ToString().c_str(),
644 // Continuously rate-limit free transactions
645 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
646 // be annoying or make others' transactions take longer to confirm.
647 if (nFees < MIN_RELAY_TX_FEE)
649 static CCriticalSection cs;
650 static double dFreeCount;
651 static int64 nLastTime;
652 int64 nNow = GetTime();
656 // Use an exponentially decaying ~10-minute window:
657 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
659 // -limitfreerelay unit is thousand-bytes-per-minute
660 // At default rate it would take over a month to fill 1GB
661 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
662 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
664 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
669 // Check against previous transactions
670 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
671 if (!tx.ConnectInputs(txdb, mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
673 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
677 // Store transaction in memory
682 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
685 addUnchecked(hash, tx);
688 ///// are we sure this is ok when loading transactions or restoring block txes
689 // If updated, erase old tx from wallet
691 EraseFromWallets(ptxOld->GetHash());
693 printf("CTxMemPool::accept() : accepted %s (poolsz %"PRIszu")\n",
694 hash.ToString().substr(0,10).c_str(),
699 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
701 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
704 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
706 // Add to memory pool without checking anything. Don't call this directly,
707 // call CTxMemPool::accept to properly check the transaction first.
710 for (unsigned int i = 0; i < tx.vin.size(); i++)
711 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
712 nTransactionsUpdated++;
718 bool CTxMemPool::remove(CTransaction &tx)
720 // Remove transaction from memory pool
723 uint256 hash = tx.GetHash();
724 if (mapTx.count(hash))
726 BOOST_FOREACH(const CTxIn& txin, tx.vin)
727 mapNextTx.erase(txin.prevout);
729 nTransactionsUpdated++;
735 void CTxMemPool::clear()
740 ++nTransactionsUpdated;
743 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
748 vtxid.reserve(mapTx.size());
749 for (map<uint256, CTransaction>::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi)
750 vtxid.push_back((*mi).first);
756 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
758 if (hashBlock == 0 || nIndex == -1)
761 // Find the block it claims to be in
762 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
763 if (mi == mapBlockIndex.end())
765 CBlockIndex* pindex = (*mi).second;
766 if (!pindex || !pindex->IsInMainChain())
769 // Make sure the merkle branch connects to this block
770 if (!fMerkleVerified)
772 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
774 fMerkleVerified = true;
778 return pindexBest->nHeight - pindex->nHeight + 1;
782 int CMerkleTx::GetBlocksToMaturity() const
784 if (!(IsCoinBase() || IsCoinStake()))
786 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
790 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
794 if (!IsInMainChain() && !ClientConnectInputs())
796 return CTransaction::AcceptToMemoryPool(txdb, false);
800 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
804 bool CMerkleTx::AcceptToMemoryPool()
807 return AcceptToMemoryPool(txdb);
812 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
817 // Add previous supporting transactions first
818 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
820 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
822 uint256 hash = tx.GetHash();
823 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
824 tx.AcceptToMemoryPool(txdb, fCheckInputs);
827 return AcceptToMemoryPool(txdb, fCheckInputs);
832 bool CWalletTx::AcceptWalletTransaction()
835 return AcceptWalletTransaction(txdb);
838 int CTxIndex::GetDepthInMainChain() const
842 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
844 // Find the block in the index
845 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
846 if (mi == mapBlockIndex.end())
848 CBlockIndex* pindex = (*mi).second;
849 if (!pindex || !pindex->IsInMainChain())
851 return 1 + nBestHeight - pindex->nHeight;
854 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
855 bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock)
861 if (mempool.exists(hash))
863 tx = mempool.lookup(hash);
869 if (tx.ReadFromDisk(txdb, COutPoint(hash, 0), txindex))
872 if (block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
873 hashBlock = block.GetHash();
887 //////////////////////////////////////////////////////////////////////////////
889 // CBlock and CBlockIndex
892 static CBlockIndex* pblockindexFBBHLast;
893 CBlockIndex* FindBlockByHeight(int nHeight)
895 CBlockIndex *pblockindex;
896 if (nHeight < nBestHeight / 2)
897 pblockindex = pindexGenesisBlock;
899 pblockindex = pindexBest;
900 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
901 pblockindex = pblockindexFBBHLast;
902 while (pblockindex->nHeight > nHeight)
903 pblockindex = pblockindex->pprev;
904 while (pblockindex->nHeight < nHeight)
905 pblockindex = pblockindex->pnext;
906 pblockindexFBBHLast = pblockindex;
910 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
912 if (!fReadTransactions)
914 *this = pindex->GetBlockHeader();
917 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
919 if (GetHash() != pindex->GetBlockHash())
920 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
924 uint256 static GetOrphanRoot(const CBlock* pblock)
926 // Work back to the first block in the orphan chain
927 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
928 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
929 return pblock->GetHash();
932 // ppcoin: find block wanted by given orphan block
933 uint256 WantedByOrphan(const CBlock* pblockOrphan)
935 // Work back to the first block in the orphan chain
936 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
937 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
938 return pblockOrphan->hashPrevBlock;
941 // select stake target limit according to hard-coded conditions
942 CBigNum static GetProofOfStakeLimit(int nHeight, unsigned int nTime)
944 if(fTestNet) // separate proof of stake target limit for testnet
945 return bnProofOfStakeLimit;
946 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
947 return bnProofOfStakeLimit;
948 if(nHeight + 1 > 15000) // 24 bits since block 15000
949 return bnProofOfStakeLegacyLimit;
950 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
951 return bnProofOfStakeHardLimit;
953 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
956 // miner's coin base reward based on nBits
957 int64 GetProofOfWorkReward(unsigned int nBits)
959 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
962 bnTarget.SetCompact(nBits);
963 CBigNum bnTargetLimit = bnProofOfWorkLimit;
964 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
966 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
967 // A reasonably continuous curve is used to avoid shock to market
968 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
970 // Human readable form:
972 // nSubsidy = 100 / (diff ^ 1/6)
973 CBigNum bnLowerBound = CENT;
974 CBigNum bnUpperBound = bnSubsidyLimit;
975 while (bnLowerBound + CENT <= bnUpperBound)
977 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
978 if (fDebug && GetBoolArg("-printcreation"))
979 printf("GetProofOfWorkReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
980 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
981 bnUpperBound = bnMidValue;
983 bnLowerBound = bnMidValue;
986 int64 nSubsidy = bnUpperBound.getuint64();
988 nSubsidy = (nSubsidy / CENT) * CENT;
989 if (fDebug && GetBoolArg("-printcreation"))
990 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
992 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK);
995 // miner's coin stake reward based on nBits and coin age spent (coin-days)
996 int64 GetProofOfStakeReward(int64 nCoinAge, unsigned int nBits, unsigned int nTime)
998 int64 nRewardCoinYear;
1000 if(fTestNet || nTime > STAKE_SWITCH_TIME)
1002 // Stage 2 of emission process is PoS-based. It will be active on mainNet since 20 Jun 2013.
1004 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1006 bnTarget.SetCompact(nBits);
1007 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1008 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1010 // NovaCoin: reward for coin-year is cut in half every 64x multiply of PoS difficulty
1011 // A reasonably continuous curve is used to avoid shock to market
1012 // (nRewardCoinYearLimit / nRewardCoinYear) ** 6 == bnProofOfStakeLimit / bnTarget
1014 // Human readable form:
1016 // nRewardCoinYear = 1 / (posdiff ^ 1/6)
1018 CBigNum bnLowerBound = 1 * CENT; // Lower interest bound is 1% per year
1019 CBigNum bnUpperBound = bnRewardCoinYearLimit;
1020 while (bnLowerBound + CENT <= bnUpperBound)
1022 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1023 if (fDebug && GetBoolArg("-printcreation"))
1024 printf("GetProofOfStakeReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1025 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnTarget)
1026 bnUpperBound = bnMidValue;
1028 bnLowerBound = bnMidValue;
1031 nRewardCoinYear = bnUpperBound.getuint64();
1032 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1036 // Old creation amount per coin-year, 5% fixed stake mint rate
1037 nRewardCoinYear = 5 * CENT;
1040 int64 nSubsidy = nCoinAge * 33 / (365 * 33 + 8) * nRewardCoinYear;
1041 if (fDebug && GetBoolArg("-printcreation"))
1042 printf("GetProofOfStakeReward(): create=%s nCoinAge=%"PRI64d" nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1046 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
1048 // get proof of work blocks max spacing according to hard-coded conditions
1049 int64 static GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1051 if(nTime > TARGETS_SWITCH_TIME)
1052 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1055 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1057 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1061 // minimum amount of work that could possibly be required nTime after
1062 // minimum work required was nBase
1064 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
1066 CBigNum bnTargetLimit = bnProofOfWorkLimit;
1069 bnResult.SetCompact(nBase);
1071 while (nTime > 0 && bnResult < bnTargetLimit)
1073 // Maximum 200% adjustment per day...
1075 nTime -= 24 * 60 * 60;
1077 if (bnResult > bnTargetLimit)
1078 bnResult = bnTargetLimit;
1079 return bnResult.GetCompact();
1082 // ppcoin: find last block index up to pindex
1083 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1085 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1086 pindex = pindex->pprev;
1090 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1092 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1094 if (pindexLast == NULL)
1095 return bnTargetLimit.GetCompact(); // genesis block
1097 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1098 if (pindexPrev->pprev == NULL)
1099 return bnTargetLimit.GetCompact(); // first block
1100 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1101 if (pindexPrevPrev->pprev == NULL)
1102 return bnTargetLimit.GetCompact(); // second block
1104 int64 nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1106 // ppcoin: target change every block
1107 // ppcoin: retarget with exponential moving toward target spacing
1109 bnNew.SetCompact(pindexPrev->nBits);
1110 int64 nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1111 int64 nInterval = nTargetTimespan / nTargetSpacing;
1112 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1113 bnNew /= ((nInterval + 1) * nTargetSpacing);
1115 if (bnNew > bnTargetLimit)
1116 bnNew = bnTargetLimit;
1118 return bnNew.GetCompact();
1121 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1124 bnTarget.SetCompact(nBits);
1127 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1128 return error("CheckProofOfWork() : nBits below minimum work");
1130 // Check proof of work matches claimed amount
1131 if (hash > bnTarget.getuint256())
1132 return error("CheckProofOfWork() : hash doesn't match nBits");
1137 // Return maximum amount of blocks that other nodes claim to have
1138 int GetNumBlocksOfPeers()
1140 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1143 bool IsInitialBlockDownload()
1145 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1147 static int64 nLastUpdate;
1148 static CBlockIndex* pindexLastBest;
1149 if (pindexBest != pindexLastBest)
1151 pindexLastBest = pindexBest;
1152 nLastUpdate = GetTime();
1154 return (GetTime() - nLastUpdate < 10 &&
1155 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
1158 void static InvalidChainFound(CBlockIndex* pindexNew)
1160 if (pindexNew->bnChainTrust > bnBestInvalidTrust)
1162 bnBestInvalidTrust = pindexNew->bnChainTrust;
1163 CTxDB().WriteBestInvalidTrust(bnBestInvalidTrust);
1164 uiInterface.NotifyBlocksChanged();
1167 CBigNum bnBestInvalidBlockTrust = pindexNew->bnChainTrust - pindexNew->pprev->bnChainTrust;
1168 CBigNum bnBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->bnChainTrust - pindexBest->pprev->bnChainTrust) : pindexBest->bnChainTrust;
1170 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%s date=%s\n",
1171 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1172 pindexNew->bnChainTrust.ToString().c_str(), bnBestInvalidBlockTrust.ToString().c_str(),
1173 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1174 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%s date=%s\n",
1175 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1176 bnBestChainTrust.ToString().c_str(),
1177 bnBestBlockTrust.ToString().c_str(),
1178 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1182 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1184 nTime = max(GetBlockTime(), GetAdjustedTime());
1197 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1199 // Relinquish previous transactions' spent pointers
1202 BOOST_FOREACH(const CTxIn& txin, vin)
1204 COutPoint prevout = txin.prevout;
1206 // Get prev txindex from disk
1208 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1209 return error("DisconnectInputs() : ReadTxIndex failed");
1211 if (prevout.n >= txindex.vSpent.size())
1212 return error("DisconnectInputs() : prevout.n out of range");
1214 // Mark outpoint as not spent
1215 txindex.vSpent[prevout.n].SetNull();
1218 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1219 return error("DisconnectInputs() : UpdateTxIndex failed");
1223 // Remove transaction from index
1224 // This can fail if a duplicate of this transaction was in a chain that got
1225 // reorganized away. This is only possible if this transaction was completely
1226 // spent, so erasing it would be a no-op anyway.
1227 txdb.EraseTxIndex(*this);
1233 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1234 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1236 // FetchInputs can return false either because we just haven't seen some inputs
1237 // (in which case the transaction should be stored as an orphan)
1238 // or because the transaction is malformed (in which case the transaction should
1239 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1243 return true; // Coinbase transactions have no inputs to fetch.
1245 for (unsigned int i = 0; i < vin.size(); i++)
1247 COutPoint prevout = vin[i].prevout;
1248 if (inputsRet.count(prevout.hash))
1249 continue; // Got it already
1252 CTxIndex& txindex = inputsRet[prevout.hash].first;
1254 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1256 // Get txindex from current proposed changes
1257 txindex = mapTestPool.find(prevout.hash)->second;
1261 // Read txindex from txdb
1262 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1264 if (!fFound && (fBlock || fMiner))
1265 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());
1268 CTransaction& txPrev = inputsRet[prevout.hash].second;
1269 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1271 // Get prev tx from single transactions in memory
1274 if (!mempool.exists(prevout.hash))
1275 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());
1276 txPrev = mempool.lookup(prevout.hash);
1279 txindex.vSpent.resize(txPrev.vout.size());
1283 // Get prev tx from disk
1284 if (!txPrev.ReadFromDisk(txindex.pos))
1285 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1289 // Make sure all prevout.n indexes are valid:
1290 for (unsigned int i = 0; i < vin.size(); i++)
1292 const COutPoint prevout = vin[i].prevout;
1293 assert(inputsRet.count(prevout.hash) != 0);
1294 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1295 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1296 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1298 // Revisit this if/when transaction replacement is implemented and allows
1301 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()));
1308 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1310 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1311 if (mi == inputs.end())
1312 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1314 const CTransaction& txPrev = (mi->second).second;
1315 if (input.prevout.n >= txPrev.vout.size())
1316 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1318 return txPrev.vout[input.prevout.n];
1321 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1327 for (unsigned int i = 0; i < vin.size(); i++)
1329 nResult += GetOutputFor(vin[i], inputs).nValue;
1335 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1340 unsigned int nSigOps = 0;
1341 for (unsigned int i = 0; i < vin.size(); i++)
1343 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1344 if (prevout.scriptPubKey.IsPayToScriptHash())
1345 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1350 bool CTransaction::ConnectInputs(CTxDB& txdb, MapPrevTx inputs,
1351 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1352 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1354 // Take over previous transactions' spent pointers
1355 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1356 // fMiner is true when called from the internal bitcoin miner
1357 // ... both are false when called from CTransaction::AcceptToMemoryPool
1362 for (unsigned int i = 0; i < vin.size(); i++)
1364 COutPoint prevout = vin[i].prevout;
1365 assert(inputs.count(prevout.hash) > 0);
1366 CTxIndex& txindex = inputs[prevout.hash].first;
1367 CTransaction& txPrev = inputs[prevout.hash].second;
1369 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1370 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()));
1372 // If prev is coinbase or coinstake, check that it's matured
1373 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
1374 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < nCoinbaseMaturity; pindex = pindex->pprev)
1375 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1376 return error("ConnectInputs() : tried to spend %s at depth %d", txPrev.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - pindex->nHeight);
1378 // ppcoin: check transaction timestamp
1379 if (txPrev.nTime > nTime)
1380 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
1382 // Check for negative or overflow input values
1383 nValueIn += txPrev.vout[prevout.n].nValue;
1384 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1385 return DoS(100, error("ConnectInputs() : txin values out of range"));
1388 // The first loop above does all the inexpensive checks.
1389 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1390 // Helps prevent CPU exhaustion attacks.
1391 for (unsigned int i = 0; i < vin.size(); i++)
1393 COutPoint prevout = vin[i].prevout;
1394 assert(inputs.count(prevout.hash) > 0);
1395 CTxIndex& txindex = inputs[prevout.hash].first;
1396 CTransaction& txPrev = inputs[prevout.hash].second;
1398 // Check for conflicts (double-spend)
1399 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1400 // for an attacker to attempt to split the network.
1401 if (!txindex.vSpent[prevout.n].IsNull())
1402 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());
1404 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1405 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1406 // still computed and checked, and any change will be caught at the next checkpoint.
1407 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1410 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1412 // only during transition phase for P2SH: do not invoke anti-DoS code for
1413 // potentially old clients relaying bad P2SH transactions
1414 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1415 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1417 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1421 // Mark outpoints as spent
1422 txindex.vSpent[prevout.n] = posThisTx;
1425 if (fBlock || fMiner)
1427 mapTestPool[prevout.hash] = txindex;
1433 // ppcoin: coin stake tx earns reward instead of paying fee
1435 if (!GetCoinAge(txdb, nCoinAge))
1436 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1437 int64 nStakeReward = GetValueOut() - nValueIn;
1438 if (nStakeReward > GetProofOfStakeReward(nCoinAge, pindexBlock->nBits, nTime) - GetMinFee() + MIN_TX_FEE)
1439 return DoS(100, error("ConnectInputs() : %s stake reward exceeded", GetHash().ToString().substr(0,10).c_str()));
1443 if (nValueIn < GetValueOut())
1444 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1446 // Tally transaction fees
1447 int64 nTxFee = nValueIn - GetValueOut();
1449 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1450 // ppcoin: enforce transaction fees for every block
1451 if (nTxFee < GetMinFee())
1452 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;
1455 if (!MoneyRange(nFees))
1456 return DoS(100, error("ConnectInputs() : nFees out of range"));
1464 bool CTransaction::ClientConnectInputs()
1469 // Take over previous transactions' spent pointers
1473 for (unsigned int i = 0; i < vin.size(); i++)
1475 // Get prev tx from single transactions in memory
1476 COutPoint prevout = vin[i].prevout;
1477 if (!mempool.exists(prevout.hash))
1479 CTransaction& txPrev = mempool.lookup(prevout.hash);
1481 if (prevout.n >= txPrev.vout.size())
1485 if (!VerifySignature(txPrev, *this, i, true, 0))
1486 return error("ConnectInputs() : VerifySignature failed");
1488 ///// this is redundant with the mempool.mapNextTx stuff,
1489 ///// not sure which I want to get rid of
1490 ///// this has to go away now that posNext is gone
1491 // // Check for conflicts
1492 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1493 // return error("ConnectInputs() : prev tx already used");
1495 // // Flag outpoints as used
1496 // txPrev.vout[prevout.n].posNext = posThisTx;
1498 nValueIn += txPrev.vout[prevout.n].nValue;
1500 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1501 return error("ClientConnectInputs() : txin values out of range");
1503 if (GetValueOut() > nValueIn)
1513 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1515 // Disconnect in reverse order
1516 for (int i = vtx.size()-1; i >= 0; i--)
1517 if (!vtx[i].DisconnectInputs(txdb))
1520 // Update block index on disk without changing it in memory.
1521 // The memory index structure will be changed after the db commits.
1524 CDiskBlockIndex blockindexPrev(pindex->pprev);
1525 blockindexPrev.hashNext = 0;
1526 if (!txdb.WriteBlockIndex(blockindexPrev))
1527 return error("DisconnectBlock() : WriteBlockIndex failed");
1530 // ppcoin: clean up wallet after disconnecting coinstake
1531 BOOST_FOREACH(CTransaction& tx, vtx)
1532 SyncWithWallets(tx, this, false, false);
1537 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex, bool fJustCheck)
1539 // Check it again in case a previous version let a bad block in
1540 if (!CheckBlock(!fJustCheck, !fJustCheck))
1543 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1544 // unless those are already completely spent.
1545 // If such overwrites are allowed, coinbases and transactions depending upon those
1546 // can be duplicated to remove the ability to spend the first instance -- even after
1547 // being sent to another address.
1548 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1549 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1550 // already refuses previously-known transaction ids entirely.
1551 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1552 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1553 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1554 // initial block download.
1555 bool fEnforceBIP30 = true; // Always active in NovaCoin
1556 bool fStrictPayToScriptHash = true; // Always active in NovaCoin
1558 //// issue here: it doesn't know the version
1559 unsigned int nTxPos;
1561 // FetchInputs treats CDiskTxPos(1,1,1) as a special "refer to memorypool" indicator
1562 // 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
1565 nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1567 map<uint256, CTxIndex> mapQueuedChanges;
1570 int64 nValueOut = 0;
1571 unsigned int nSigOps = 0;
1572 BOOST_FOREACH(CTransaction& tx, vtx)
1574 uint256 hashTx = tx.GetHash();
1576 if (fEnforceBIP30) {
1577 CTxIndex txindexOld;
1578 if (txdb.ReadTxIndex(hashTx, txindexOld)) {
1579 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1585 nSigOps += tx.GetLegacySigOpCount();
1586 if (nSigOps > MAX_BLOCK_SIGOPS)
1587 return DoS(100, error("ConnectBlock() : too many sigops"));
1589 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1591 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1593 MapPrevTx mapInputs;
1594 if (tx.IsCoinBase())
1595 nValueOut += tx.GetValueOut();
1599 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1602 if (fStrictPayToScriptHash)
1604 // Add in sigops done by pay-to-script-hash inputs;
1605 // this is to prevent a "rogue miner" from creating
1606 // an incredibly-expensive-to-validate block.
1607 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1608 if (nSigOps > MAX_BLOCK_SIGOPS)
1609 return DoS(100, error("ConnectBlock() : too many sigops"));
1612 int64 nTxValueIn = tx.GetValueIn(mapInputs);
1613 int64 nTxValueOut = tx.GetValueOut();
1614 nValueIn += nTxValueIn;
1615 nValueOut += nTxValueOut;
1616 if (!tx.IsCoinStake())
1617 nFees += nTxValueIn - nTxValueOut;
1619 if (!tx.ConnectInputs(txdb, mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1623 mapQueuedChanges[hashTx] = CTxIndex(posThisTx, tx.vout.size());
1626 // ppcoin: track money supply and mint amount info
1627 pindex->nMint = nValueOut - nValueIn + nFees;
1628 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1629 if (!txdb.WriteBlockIndex(CDiskBlockIndex(pindex)))
1630 return error("Connect() : WriteBlockIndex for pindex failed");
1632 // ppcoin: fees are not collected by miners as in bitcoin
1633 // ppcoin: fees are destroyed to compensate the entire network
1634 if (fDebug && GetBoolArg("-printcreation"))
1635 printf("ConnectBlock() : destroy=%s nFees=%"PRI64d"\n", FormatMoney(nFees).c_str(), nFees);
1640 // Write queued txindex changes
1641 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1643 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1644 return error("ConnectBlock() : UpdateTxIndex failed");
1647 // Update block index on disk without changing it in memory.
1648 // The memory index structure will be changed after the db commits.
1651 CDiskBlockIndex blockindexPrev(pindex->pprev);
1652 blockindexPrev.hashNext = pindex->GetBlockHash();
1653 if (!txdb.WriteBlockIndex(blockindexPrev))
1654 return error("ConnectBlock() : WriteBlockIndex failed");
1657 // Watch for transactions paying to me
1658 BOOST_FOREACH(CTransaction& tx, vtx)
1659 SyncWithWallets(tx, this, true);
1664 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1666 printf("REORGANIZE\n");
1669 CBlockIndex* pfork = pindexBest;
1670 CBlockIndex* plonger = pindexNew;
1671 while (pfork != plonger)
1673 while (plonger->nHeight > pfork->nHeight)
1674 if (!(plonger = plonger->pprev))
1675 return error("Reorganize() : plonger->pprev is null");
1676 if (pfork == plonger)
1678 if (!(pfork = pfork->pprev))
1679 return error("Reorganize() : pfork->pprev is null");
1682 // List of what to disconnect
1683 vector<CBlockIndex*> vDisconnect;
1684 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1685 vDisconnect.push_back(pindex);
1687 // List of what to connect
1688 vector<CBlockIndex*> vConnect;
1689 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1690 vConnect.push_back(pindex);
1691 reverse(vConnect.begin(), vConnect.end());
1693 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());
1694 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());
1696 // Disconnect shorter branch
1697 vector<CTransaction> vResurrect;
1698 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1701 if (!block.ReadFromDisk(pindex))
1702 return error("Reorganize() : ReadFromDisk for disconnect failed");
1703 if (!block.DisconnectBlock(txdb, pindex))
1704 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1706 // Queue memory transactions to resurrect
1707 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1708 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1709 vResurrect.push_back(tx);
1712 // Connect longer branch
1713 vector<CTransaction> vDelete;
1714 for (unsigned int i = 0; i < vConnect.size(); i++)
1716 CBlockIndex* pindex = vConnect[i];
1718 if (!block.ReadFromDisk(pindex))
1719 return error("Reorganize() : ReadFromDisk for connect failed");
1720 if (!block.ConnectBlock(txdb, pindex))
1723 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1726 // Queue memory transactions to delete
1727 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1728 vDelete.push_back(tx);
1730 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1731 return error("Reorganize() : WriteHashBestChain failed");
1733 // Make sure it's successfully written to disk before changing memory structure
1734 if (!txdb.TxnCommit())
1735 return error("Reorganize() : TxnCommit failed");
1737 // Disconnect shorter branch
1738 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1740 pindex->pprev->pnext = NULL;
1742 // Connect longer branch
1743 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1745 pindex->pprev->pnext = pindex;
1747 // Resurrect memory transactions that were in the disconnected branch
1748 BOOST_FOREACH(CTransaction& tx, vResurrect)
1749 tx.AcceptToMemoryPool(txdb, false);
1751 // Delete redundant memory transactions that are in the connected branch
1752 BOOST_FOREACH(CTransaction& tx, vDelete)
1755 printf("REORGANIZE: done\n");
1761 // Called from inside SetBestChain: attaches a block to the new best chain being built
1762 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1764 uint256 hash = GetHash();
1766 // Adding to current best branch
1767 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1770 InvalidChainFound(pindexNew);
1773 if (!txdb.TxnCommit())
1774 return error("SetBestChain() : TxnCommit failed");
1776 // Add to current best branch
1777 pindexNew->pprev->pnext = pindexNew;
1779 // Delete redundant memory transactions
1780 BOOST_FOREACH(CTransaction& tx, vtx)
1786 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1788 uint256 hash = GetHash();
1790 if (!txdb.TxnBegin())
1791 return error("SetBestChain() : TxnBegin failed");
1793 if (pindexGenesisBlock == NULL && hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1795 txdb.WriteHashBestChain(hash);
1796 if (!txdb.TxnCommit())
1797 return error("SetBestChain() : TxnCommit failed");
1798 pindexGenesisBlock = pindexNew;
1800 else if (hashPrevBlock == hashBestChain)
1802 if (!SetBestChainInner(txdb, pindexNew))
1803 return error("SetBestChain() : SetBestChainInner failed");
1807 // the first block in the new chain that will cause it to become the new best chain
1808 CBlockIndex *pindexIntermediate = pindexNew;
1810 // list of blocks that need to be connected afterwards
1811 std::vector<CBlockIndex*> vpindexSecondary;
1813 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1814 // Try to limit how much needs to be done inside
1815 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainTrust > pindexBest->bnChainTrust)
1817 vpindexSecondary.push_back(pindexIntermediate);
1818 pindexIntermediate = pindexIntermediate->pprev;
1821 if (!vpindexSecondary.empty())
1822 printf("Postponing %"PRIszu" reconnects\n", vpindexSecondary.size());
1824 // Switch to new best branch
1825 if (!Reorganize(txdb, pindexIntermediate))
1828 InvalidChainFound(pindexNew);
1829 return error("SetBestChain() : Reorganize failed");
1832 // Connect further blocks
1833 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1836 if (!block.ReadFromDisk(pindex))
1838 printf("SetBestChain() : ReadFromDisk failed\n");
1841 if (!txdb.TxnBegin()) {
1842 printf("SetBestChain() : TxnBegin 2 failed\n");
1845 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1846 if (!block.SetBestChainInner(txdb, pindex))
1851 // Update best block in wallet (so we can detect restored wallets)
1852 bool fIsInitialDownload = IsInitialBlockDownload();
1853 if (!fIsInitialDownload)
1855 const CBlockLocator locator(pindexNew);
1856 ::SetBestChain(locator);
1860 hashBestChain = hash;
1861 pindexBest = pindexNew;
1862 pblockindexFBBHLast = NULL;
1863 nBestHeight = pindexBest->nHeight;
1864 bnBestChainTrust = pindexNew->bnChainTrust;
1865 nTimeBestReceived = GetTime();
1866 nTransactionsUpdated++;
1868 CBigNum bnBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->bnChainTrust - pindexBest->pprev->bnChainTrust) : pindexBest->bnChainTrust;
1870 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%s date=%s\n",
1871 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainTrust.ToString().c_str(),
1872 bnBestBlockTrust.ToString().c_str(),
1873 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1875 // Check the version of the last 100 blocks to see if we need to upgrade:
1876 if (!fIsInitialDownload)
1879 const CBlockIndex* pindex = pindexBest;
1880 for (int i = 0; i < 100 && pindex != NULL; i++)
1882 if (pindex->nVersion > CBlock::CURRENT_VERSION)
1884 pindex = pindex->pprev;
1887 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
1888 if (nUpgraded > 100/2)
1889 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
1890 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
1893 std::string strCmd = GetArg("-blocknotify", "");
1895 if (!fIsInitialDownload && !strCmd.empty())
1897 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1898 boost::thread t(runCommand, strCmd); // thread runs free
1904 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
1905 // Only those coins meeting minimum age requirement counts. As those
1906 // transactions not in main chain are not currently indexed so we
1907 // might not find out about their coin age. Older transactions are
1908 // guaranteed to be in main chain by sync-checkpoint. This rule is
1909 // introduced to help nodes establish a consistent view of the coin
1910 // age (trust score) of competing branches.
1911 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64& nCoinAge) const
1913 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
1919 BOOST_FOREACH(const CTxIn& txin, vin)
1921 // First try finding the previous transaction in database
1922 CTransaction txPrev;
1924 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
1925 continue; // previous transaction not in main chain
1926 if (nTime < txPrev.nTime)
1927 return false; // Transaction timestamp violation
1929 // Read block header
1931 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
1932 return false; // unable to read block of previous transaction
1933 if (block.GetBlockTime() + nStakeMinAge > nTime)
1934 continue; // only count coins meeting min age requirement
1936 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
1937 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
1939 if (fDebug && GetBoolArg("-printcoinage"))
1940 printf("coin age nValueIn=%"PRI64d" nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
1943 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
1944 if (fDebug && GetBoolArg("-printcoinage"))
1945 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
1946 nCoinAge = bnCoinDay.getuint64();
1950 // ppcoin: total coin age spent in block, in the unit of coin-days.
1951 bool CBlock::GetCoinAge(uint64& nCoinAge) const
1956 BOOST_FOREACH(const CTransaction& tx, vtx)
1959 if (tx.GetCoinAge(txdb, nTxCoinAge))
1960 nCoinAge += nTxCoinAge;
1965 if (nCoinAge == 0) // block coin age minimum 1 coin-day
1967 if (fDebug && GetBoolArg("-printcoinage"))
1968 printf("block coin age total nCoinDays=%"PRI64d"\n", nCoinAge);
1972 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1974 // Check for duplicate
1975 uint256 hash = GetHash();
1976 if (mapBlockIndex.count(hash))
1977 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1979 // Construct new block index object
1980 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1982 return error("AddToBlockIndex() : new CBlockIndex failed");
1983 pindexNew->phashBlock = &hash;
1984 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1985 if (miPrev != mapBlockIndex.end())
1987 pindexNew->pprev = (*miPrev).second;
1988 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1991 // ppcoin: compute chain trust score
1992 pindexNew->bnChainTrust = (pindexNew->pprev ? pindexNew->pprev->bnChainTrust : 0) + pindexNew->GetBlockTrust();
1994 // ppcoin: compute stake entropy bit for stake modifier
1995 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nHeight)))
1996 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
1998 // ppcoin: record proof-of-stake hash value
1999 if (pindexNew->IsProofOfStake())
2001 if (!mapProofOfStake.count(hash))
2002 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2003 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2006 // ppcoin: compute stake modifier
2007 uint64 nStakeModifier = 0;
2008 bool fGeneratedStakeModifier = false;
2009 if (!ComputeNextStakeModifier(pindexNew->pprev, nStakeModifier, fGeneratedStakeModifier))
2010 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2011 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2012 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2013 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2014 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016"PRI64x, pindexNew->nHeight, nStakeModifier);
2016 // Add to mapBlockIndex
2017 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2018 if (pindexNew->IsProofOfStake())
2019 setStakeSeen.insert(make_pair(pindexNew->prevoutStake, pindexNew->nStakeTime));
2020 pindexNew->phashBlock = &((*mi).first);
2022 // Write to disk block index
2024 if (!txdb.TxnBegin())
2026 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
2027 if (!txdb.TxnCommit())
2031 if (pindexNew->bnChainTrust > bnBestChainTrust)
2032 if (!SetBestChain(txdb, pindexNew))
2037 if (pindexNew == pindexBest)
2039 // Notify UI to display prev block's coinbase if it was ours
2040 static uint256 hashPrevBestCoinBase;
2041 UpdatedTransaction(hashPrevBestCoinBase);
2042 hashPrevBestCoinBase = vtx[0].GetHash();
2045 uiInterface.NotifyBlocksChanged();
2052 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot) const
2054 // These are checks that are independent of context
2055 // that can be verified before saving an orphan block.
2058 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2059 return DoS(100, error("CheckBlock() : size limits failed"));
2061 // Special short-term limits to avoid 10,000 BDB lock limit:
2062 if (GetBlockTime() < LOCKS_SWITCH_TIME)
2064 // Rule is: #unique txids referenced <= 4,500
2065 // ... to prevent 10,000 BDB lock exhaustion on old clients
2066 set<uint256> setTxIn;
2067 for (size_t i = 0; i < vtx.size(); i++)
2069 setTxIn.insert(vtx[i].GetHash());
2070 if (i == 0) continue; // skip coinbase txin
2071 BOOST_FOREACH(const CTxIn& txin, vtx[i].vin)
2072 setTxIn.insert(txin.prevout.hash);
2074 size_t nTxids = setTxIn.size();
2076 return error("CheckBlock() : maxlocks violation");
2079 // Check proof of work matches claimed amount
2080 if (fCheckPOW && IsProofOfWork() && !CheckProofOfWork(GetHash(), nBits))
2081 return DoS(50, error("CheckBlock() : proof of work failed"));
2084 if (GetBlockTime() > GetAdjustedTime() + nMaxClockDrift)
2085 return error("CheckBlock() : block timestamp too far in the future");
2087 // First transaction must be coinbase, the rest must not be
2088 if (vtx.empty() || !vtx[0].IsCoinBase())
2089 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2090 for (unsigned int i = 1; i < vtx.size(); i++)
2091 if (vtx[i].IsCoinBase())
2092 return DoS(100, error("CheckBlock() : more than one coinbase"));
2094 // Check coinbase timestamp
2095 if (GetBlockTime() > (int64)vtx[0].nTime + nMaxClockDrift)
2096 return DoS(50, error("CheckBlock() : coinbase timestamp is too early"));
2098 if (IsProofOfStake())
2100 // ppcoin: coinbase output should be empty if proof-of-stake block
2101 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2102 return error("CheckBlock() : coinbase output not empty for proof-of-stake block");
2104 // Second transaction must be coinstake, the rest must not be
2105 if (vtx.empty() || !vtx[1].IsCoinStake())
2106 return DoS(100, error("CheckBlock() : second tx is not coinstake"));
2107 for (unsigned int i = 2; i < vtx.size(); i++)
2108 if (vtx[i].IsCoinStake())
2109 return DoS(100, error("CheckBlock() : more than one coinstake"));
2111 // Check coinstake timestamp
2112 if (!CheckCoinStakeTimestamp(GetBlockTime(), (int64)vtx[1].nTime))
2113 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%"PRI64d" nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2117 // Coinbase fee paid until 20 Sep 2013
2118 int64 nFee = GetBlockTime() < CHAINCHECKS_SWITCH_TIME ? vtx[0].GetMinFee() - MIN_TX_FEE : 0;
2120 // Check coinbase reward
2121 if (vtx[0].GetValueOut() > (GetProofOfWorkReward(nBits) - nFee))
2122 return DoS(50, error("CheckBlock() : coinbase reward exceeded %s > %s",
2123 FormatMoney(vtx[0].GetValueOut()).c_str(),
2124 FormatMoney(GetProofOfWorkReward(nBits) - nFee).c_str()));
2127 // Check transactions
2128 BOOST_FOREACH(const CTransaction& tx, vtx)
2130 if (!tx.CheckTransaction())
2131 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2133 // ppcoin: check transaction timestamp
2134 if (GetBlockTime() < (int64)tx.nTime)
2135 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2138 // Check for duplicate txids. This is caught by ConnectInputs(),
2139 // but catching it earlier avoids a potential DoS attack:
2140 set<uint256> uniqueTx;
2141 BOOST_FOREACH(const CTransaction& tx, vtx)
2143 uniqueTx.insert(tx.GetHash());
2145 if (uniqueTx.size() != vtx.size())
2146 return DoS(100, error("CheckBlock() : duplicate transaction"));
2148 unsigned int nSigOps = 0;
2149 BOOST_FOREACH(const CTransaction& tx, vtx)
2151 nSigOps += tx.GetLegacySigOpCount();
2153 if (nSigOps > MAX_BLOCK_SIGOPS)
2154 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2156 // Check merkle root
2157 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2158 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2160 // NovaCoin: check proof-of-stake block signature
2161 if (IsProofOfStake() || (!fTestNet && GetBlockTime() < CHAINCHECKS_SWITCH_TIME))
2163 if (!CheckBlockSignature())
2164 return DoS(100, error("CheckBlock() : bad block signature"));
2170 bool CBlock::AcceptBlock()
2172 // Check for duplicate
2173 uint256 hash = GetHash();
2174 if (mapBlockIndex.count(hash))
2175 return error("AcceptBlock() : block already in mapBlockIndex");
2177 // Get prev block index
2178 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
2179 if (mi == mapBlockIndex.end())
2180 return DoS(10, error("AcceptBlock() : prev block not found"));
2181 CBlockIndex* pindexPrev = (*mi).second;
2182 int nHeight = pindexPrev->nHeight+1;
2184 // Check proof-of-work or proof-of-stake
2185 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2186 return DoS(100, error("AcceptBlock() : incorrect %s", IsProofOfWork() ? "proof-of-work" : "proof-of-stake"));
2188 // Check timestamp against prev
2189 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || GetBlockTime() + nMaxClockDrift < pindexPrev->GetBlockTime())
2190 return error("AcceptBlock() : block's timestamp is too early");
2192 // Check that all transactions are finalized
2193 BOOST_FOREACH(const CTransaction& tx, vtx)
2194 if (!tx.IsFinal(nHeight, GetBlockTime()))
2195 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2197 // Check that the block chain matches the known block chain up to a checkpoint
2198 if (!Checkpoints::CheckHardened(nHeight, hash))
2199 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2201 // ppcoin: check that the block satisfies synchronized checkpoint
2202 if (!Checkpoints::CheckSync(hash, pindexPrev))
2204 if(!GetBoolArg("-nosynccheckpoints", false))
2206 return error("AcceptBlock() : rejected by synchronized checkpoint");
2210 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2214 // Reject block.nVersion < 3 blocks since 95% threshold on mainNet and always on testNet:
2215 if (nVersion < 3 && ((!fTestNet && nHeight > 14060) || (fTestNet && nHeight > 0)))
2216 return error("CheckBlock() : rejected nVersion < 3 block");
2218 // Enforce rule that the coinbase starts with serialized block height
2219 CScript expect = CScript() << nHeight;
2220 if (!std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2221 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2223 // Write block to history file
2224 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2225 return error("AcceptBlock() : out of disk space");
2226 unsigned int nFile = -1;
2227 unsigned int nBlockPos = 0;
2228 if (!WriteToDisk(nFile, nBlockPos))
2229 return error("AcceptBlock() : WriteToDisk failed");
2230 if (!AddToBlockIndex(nFile, nBlockPos))
2231 return error("AcceptBlock() : AddToBlockIndex failed");
2233 // Relay inventory, but don't relay old inventory during initial block download
2234 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2235 if (hashBestChain == hash)
2238 BOOST_FOREACH(CNode* pnode, vNodes)
2239 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2240 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2243 // ppcoin: check pending sync-checkpoint
2244 Checkpoints::AcceptPendingSyncCheckpoint();
2249 CBigNum CBlockIndex::GetBlockTrust() const
2254 if (!fTestNet && GetBlockTime() < CHAINCHECKS_SWITCH_TIME)
2257 bnTarget.SetCompact(nBits);
2261 return (IsProofOfStake()? (CBigNum(1)<<256) / (bnTarget+1) : 1);
2265 if (pprev == NULL || pprev->nHeight < 12)
2268 const CBlockIndex* currentIndex = pprev;
2270 if(IsProofOfStake())
2272 bnTarget.SetCompact(nBits);
2276 if (!pprev->IsProofOfWork())
2277 return (CBigNum(1)<<256) / (3 * (bnTarget+1));
2281 // Check last 12 blocks type
2282 while (pprev->nHeight - currentIndex->nHeight < 12)
2284 if (currentIndex->IsProofOfWork())
2286 currentIndex = currentIndex->pprev;
2289 // Return 1/3 of score if less than 3 PoW blocks found
2291 return (CBigNum(1)<<256) / (3 * (bnTarget+1));
2293 return (CBigNum(1)<<256) / (bnTarget+1);
2297 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2298 return 1 + (2 * (pprev->bnChainTrust - pprev->pprev->bnChainTrust) / 3);
2302 // Check last 12 blocks type
2303 while (pprev->nHeight - currentIndex->nHeight < 12)
2305 if (currentIndex->IsProofOfStake())
2307 currentIndex = currentIndex->pprev;
2310 // Return 2/3 of previous block score if less than 7 PoS blocks found
2312 return 1 + (2 * (pprev->bnChainTrust - pprev->pprev->bnChainTrust) / 3);
2314 return (pprev->bnChainTrust - pprev->pprev->bnChainTrust);
2318 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2320 unsigned int nFound = 0;
2321 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2323 if (pstart->nVersion >= minVersion)
2325 pstart = pstart->pprev;
2327 return (nFound >= nRequired);
2330 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2332 // Check for duplicate
2333 uint256 hash = pblock->GetHash();
2334 if (mapBlockIndex.count(hash))
2335 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2336 if (mapOrphanBlocks.count(hash))
2337 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2339 // ppcoin: check proof-of-stake
2340 // Limited duplicity on stake: prevents block flood attack
2341 // Duplicate stake allowed only when there is orphan child block
2342 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2343 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());
2345 // Preliminary checks
2346 if (!pblock->CheckBlock())
2347 return error("ProcessBlock() : CheckBlock FAILED");
2349 // ppcoin: verify hash target and signature of coinstake tx
2350 if (pblock->IsProofOfStake())
2352 uint256 hashProofOfStake = 0;
2353 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake))
2355 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2356 return false; // do not error here as we expect this during initial block download
2358 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2359 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2362 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2363 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2365 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2366 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2368 bnNewBlock.SetCompact(pblock->nBits);
2370 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, pblock->IsProofOfStake())->nBits, deltaTime));
2371 if (bnNewBlock > bnRequired)
2374 pfrom->Misbehaving(100);
2375 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2379 // ppcoin: ask for pending sync-checkpoint if any
2380 if (!IsInitialBlockDownload())
2381 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2383 // If don't already have its previous block, shunt it off to holding area until we get it
2384 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2386 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2387 CBlock* pblock2 = new CBlock(*pblock);
2388 // ppcoin: check proof-of-stake
2389 if (pblock2->IsProofOfStake())
2391 // Limited duplicity on stake: prevents block flood attack
2392 // Duplicate stake allowed only when there is orphan child block
2393 if (setStakeSeenOrphan.count(pblock2->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2394 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());
2396 setStakeSeenOrphan.insert(pblock2->GetProofOfStake());
2398 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2399 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2401 // Ask this guy to fill in what we're missing
2404 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2405 // ppcoin: getblocks may not obtain the ancestor block rejected
2406 // earlier by duplicate-stake check so we ask for it again directly
2407 if (!IsInitialBlockDownload())
2408 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2414 if (!pblock->AcceptBlock())
2415 return error("ProcessBlock() : AcceptBlock FAILED");
2417 // Recursively process any orphan blocks that depended on this one
2418 vector<uint256> vWorkQueue;
2419 vWorkQueue.push_back(hash);
2420 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2422 uint256 hashPrev = vWorkQueue[i];
2423 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2424 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2427 CBlock* pblockOrphan = (*mi).second;
2428 if (pblockOrphan->AcceptBlock())
2429 vWorkQueue.push_back(pblockOrphan->GetHash());
2430 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2431 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2432 delete pblockOrphan;
2434 mapOrphanBlocksByPrev.erase(hashPrev);
2437 printf("ProcessBlock: ACCEPTED\n");
2439 // ppcoin: if responsible for sync-checkpoint send it
2440 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2441 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2446 // ppcoin: sign block
2447 bool CBlock::SignBlock(const CKeyStore& keystore)
2449 vector<valtype> vSolutions;
2450 txnouttype whichType;
2452 if(!IsProofOfStake())
2454 for(unsigned int i = 0; i < vtx[0].vout.size(); i++)
2456 const CTxOut& txout = vtx[0].vout[i];
2458 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2461 if (whichType == TX_PUBKEY)
2464 valtype& vchPubKey = vSolutions[0];
2467 if (!keystore.GetKey(Hash160(vchPubKey), key))
2469 if (key.GetPubKey() != vchPubKey)
2471 if(!key.Sign(GetHash(), vchBlockSig))
2480 const CTxOut& txout = vtx[1].vout[1];
2482 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2485 if (whichType == TX_PUBKEY)
2488 valtype& vchPubKey = vSolutions[0];
2491 if (!keystore.GetKey(Hash160(vchPubKey), key))
2493 if (key.GetPubKey() != vchPubKey)
2496 return key.Sign(GetHash(), vchBlockSig);
2500 printf("Sign failed\n");
2504 // ppcoin: check block signature
2505 bool CBlock::CheckBlockSignature() const
2507 if (GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
2508 return vchBlockSig.empty();
2510 vector<valtype> vSolutions;
2511 txnouttype whichType;
2513 if(IsProofOfStake())
2515 const CTxOut& txout = vtx[1].vout[1];
2517 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2519 if (whichType == TX_PUBKEY)
2521 valtype& vchPubKey = vSolutions[0];
2523 if (!key.SetPubKey(vchPubKey))
2525 if (vchBlockSig.empty())
2527 return key.Verify(GetHash(), vchBlockSig);
2532 for(unsigned int i = 0; i < vtx[0].vout.size(); i++)
2534 const CTxOut& txout = vtx[0].vout[i];
2536 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2539 if (whichType == TX_PUBKEY)
2542 valtype& vchPubKey = vSolutions[0];
2544 if (!key.SetPubKey(vchPubKey))
2546 if (vchBlockSig.empty())
2548 if(!key.Verify(GetHash(), vchBlockSig))
2558 bool CheckDiskSpace(uint64 nAdditionalBytes)
2560 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2562 // Check for nMinDiskSpace bytes (currently 50MB)
2563 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2566 string strMessage = _("Warning: Disk space is low!");
2567 strMiscWarning = strMessage;
2568 printf("*** %s\n", strMessage.c_str());
2569 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2576 static filesystem::path BlockFilePath(unsigned int nFile)
2578 string strBlockFn = strprintf("blk%04u.dat", nFile);
2579 return GetDataDir() / strBlockFn;
2582 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
2584 if ((nFile < 1) || (nFile == (unsigned int) -1))
2586 FILE* file = fopen(BlockFilePath(nFile).string().c_str(), pszMode);
2589 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
2591 if (fseek(file, nBlockPos, SEEK_SET) != 0)
2600 static unsigned int nCurrentBlockFile = 1;
2602 FILE* AppendBlockFile(unsigned int& nFileRet)
2607 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
2610 if (fseek(file, 0, SEEK_END) != 0)
2612 // FAT32 file size max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
2613 if (ftell(file) < (long)(0x7F000000 - MAX_SIZE))
2615 nFileRet = nCurrentBlockFile;
2619 nCurrentBlockFile++;
2623 bool LoadBlockIndex(bool fAllowNew)
2627 pchMessageStart[0] = 0xcd;
2628 pchMessageStart[1] = 0xf2;
2629 pchMessageStart[2] = 0xc0;
2630 pchMessageStart[3] = 0xef;
2632 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2633 nStakeMinAge = 2 * 60 * 60; // test net min age is 2 hours
2634 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2635 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2636 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
2643 if (!txdb.LoadBlockIndex())
2648 // Init with genesis block
2650 if (mapBlockIndex.empty())
2659 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
2660 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2661 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2663 // vMerkleTree: 4cb33b3b6a
2667 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
2668 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2669 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2671 // vMerkleTree: 4cb33b3b6a
2673 const char* pszTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
2675 txNew.nTime = 1360105017;
2676 txNew.vin.resize(1);
2677 txNew.vout.resize(1);
2678 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
2679 txNew.vout[0].SetEmpty();
2681 block.vtx.push_back(txNew);
2682 block.hashPrevBlock = 0;
2683 block.hashMerkleRoot = block.BuildMerkleTree();
2685 block.nTime = 1360105017;
2686 block.nBits = bnProofOfWorkLimit.GetCompact();
2687 block.nNonce = !fTestNet ? 1575379 : 46534;
2690 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
2692 assert(block.GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
2693 assert(block.CheckBlock());
2695 // Start new block file
2697 unsigned int nBlockPos;
2698 if (!block.WriteToDisk(nFile, nBlockPos))
2699 return error("LoadBlockIndex() : writing genesis block to disk failed");
2700 if (!block.AddToBlockIndex(nFile, nBlockPos))
2701 return error("LoadBlockIndex() : genesis block not accepted");
2703 // ppcoin: initialize synchronized checkpoint
2704 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
2705 return error("LoadBlockIndex() : failed to init sync checkpoint");
2708 // ppcoin: if checkpoint master key changed must reset sync-checkpoint
2711 string strPubKey = "";
2712 if (!txdb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
2714 // write checkpoint master key to db
2716 if (!txdb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
2717 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
2718 if (!txdb.TxnCommit())
2719 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
2720 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
2721 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
2731 void PrintBlockTree()
2733 // pre-compute tree structure
2734 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2735 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2737 CBlockIndex* pindex = (*mi).second;
2738 mapNext[pindex->pprev].push_back(pindex);
2740 //while (rand() % 3 == 0)
2741 // mapNext[pindex->pprev].push_back(pindex);
2744 vector<pair<int, CBlockIndex*> > vStack;
2745 vStack.push_back(make_pair(0, pindexGenesisBlock));
2748 while (!vStack.empty())
2750 int nCol = vStack.back().first;
2751 CBlockIndex* pindex = vStack.back().second;
2754 // print split or gap
2755 if (nCol > nPrevCol)
2757 for (int i = 0; i < nCol-1; i++)
2761 else if (nCol < nPrevCol)
2763 for (int i = 0; i < nCol; i++)
2770 for (int i = 0; i < nCol; i++)
2775 block.ReadFromDisk(pindex);
2776 printf("%d (%u,%u) %s %08x %s mint %7s tx %"PRIszu"",
2780 block.GetHash().ToString().c_str(),
2782 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2783 FormatMoney(pindex->nMint).c_str(),
2786 PrintWallets(block);
2788 // put the main time-chain first
2789 vector<CBlockIndex*>& vNext = mapNext[pindex];
2790 for (unsigned int i = 0; i < vNext.size(); i++)
2792 if (vNext[i]->pnext)
2794 swap(vNext[0], vNext[i]);
2800 for (unsigned int i = 0; i < vNext.size(); i++)
2801 vStack.push_back(make_pair(nCol+i, vNext[i]));
2805 bool LoadExternalBlockFile(FILE* fileIn)
2807 int64 nStart = GetTimeMillis();
2813 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
2814 unsigned int nPos = 0;
2815 while (nPos != (unsigned int)-1 && blkdat.good() && !fRequestShutdown)
2817 unsigned char pchData[65536];
2819 fseek(blkdat, nPos, SEEK_SET);
2820 int nRead = fread(pchData, 1, sizeof(pchData), blkdat);
2823 nPos = (unsigned int)-1;
2826 void* nFind = memchr(pchData, pchMessageStart[0], nRead+1-sizeof(pchMessageStart));
2829 if (memcmp(nFind, pchMessageStart, sizeof(pchMessageStart))==0)
2831 nPos += ((unsigned char*)nFind - pchData) + sizeof(pchMessageStart);
2834 nPos += ((unsigned char*)nFind - pchData) + 1;
2837 nPos += sizeof(pchData) - sizeof(pchMessageStart) + 1;
2838 } while(!fRequestShutdown);
2839 if (nPos == (unsigned int)-1)
2841 fseek(blkdat, nPos, SEEK_SET);
2844 if (nSize > 0 && nSize <= MAX_BLOCK_SIZE)
2848 if (ProcessBlock(NULL,&block))
2856 catch (std::exception &e) {
2857 printf("%s() : Deserialize or I/O error caught during load\n",
2858 __PRETTY_FUNCTION__);
2861 printf("Loaded %i blocks from external file in %"PRI64d"ms\n", nLoaded, GetTimeMillis() - nStart);
2873 //////////////////////////////////////////////////////////////////////////////
2878 extern map<uint256, CAlert> mapAlerts;
2879 extern CCriticalSection cs_mapAlerts;
2881 static string strMintMessage = "Info: Minting suspended due to locked wallet.";
2882 static string strMintWarning;
2884 string GetWarnings(string strFor)
2887 string strStatusBar;
2890 if (GetBoolArg("-testsafemode"))
2893 // ppcoin: wallet lock warning for minting
2894 if (strMintWarning != "")
2897 strStatusBar = strMintWarning;
2900 // Misc warnings like out of disk space and clock is wrong
2901 if (strMiscWarning != "")
2904 strStatusBar = strMiscWarning;
2907 // ppcoin: should not enter safe mode for longer invalid chain
2908 // ppcoin: if sync-checkpoint is too old do not enter safe mode
2909 if (Checkpoints::IsSyncCheckpointTooOld(60 * 60 * 24 * 10) && !fTestNet && !IsInitialBlockDownload())
2912 strStatusBar = "WARNING: Checkpoint is too old. Wait for block chain to download, or notify developers.";
2915 // ppcoin: if detected invalid checkpoint enter safe mode
2916 if (Checkpoints::hashInvalidCheckpoint != 0)
2919 strStatusBar = strRPC = "WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.";
2925 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2927 const CAlert& alert = item.second;
2928 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2930 nPriority = alert.nPriority;
2931 strStatusBar = alert.strStatusBar;
2932 if (nPriority > 1000)
2933 strRPC = strStatusBar; // ppcoin: safe mode for high alert
2938 if (strFor == "statusbar")
2939 return strStatusBar;
2940 else if (strFor == "rpc")
2942 assert(!"GetWarnings() : invalid parameter");
2953 //////////////////////////////////////////////////////////////////////////////
2959 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2965 bool txInMap = false;
2968 txInMap = (mempool.exists(inv.hash));
2971 mapOrphanTransactions.count(inv.hash) ||
2972 txdb.ContainsTx(inv.hash);
2976 return mapBlockIndex.count(inv.hash) ||
2977 mapOrphanBlocks.count(inv.hash);
2979 // Don't know what it is, just say we already got one
2986 // The message start string is designed to be unlikely to occur in normal data.
2987 // The characters are rarely used upper ASCII, not valid as UTF-8, and produce
2988 // a large 4-byte int at any alignment.
2989 unsigned char pchMessageStart[4] = { 0xe4, 0xe8, 0xe9, 0xe5 };
2991 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2993 static map<CService, CPubKey> mapReuseKey;
2994 RandAddSeedPerfmon();
2996 printf("received: %s (%"PRIszu" bytes)\n", strCommand.c_str(), vRecv.size());
2997 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2999 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3007 if (strCommand == "version")
3009 // Each connection can only send one version message
3010 if (pfrom->nVersion != 0)
3012 pfrom->Misbehaving(1);
3020 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3021 if (pfrom->nVersion < MIN_PROTO_VERSION)
3023 // Since February 20, 2012, the protocol is initiated at version 209,
3024 // and earlier versions are no longer supported
3025 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3026 pfrom->fDisconnect = true;
3030 if (pfrom->nVersion == 10300)
3031 pfrom->nVersion = 300;
3033 vRecv >> addrFrom >> nNonce;
3035 vRecv >> pfrom->strSubVer;
3037 vRecv >> pfrom->nStartingHeight;
3039 if (pfrom->fInbound && addrMe.IsRoutable())
3041 pfrom->addrLocal = addrMe;
3045 // Disconnect if we connected to ourself
3046 if (nNonce == nLocalHostNonce && nNonce > 1)
3048 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3049 pfrom->fDisconnect = true;
3053 // ppcoin: record my external IP reported by peer
3054 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3055 addrSeenByPeer = addrMe;
3057 // Be shy and don't send version until we hear
3058 if (pfrom->fInbound)
3059 pfrom->PushVersion();
3061 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3063 AddTimeData(pfrom->addr, nTime);
3066 pfrom->PushMessage("verack");
3067 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3069 if (!pfrom->fInbound)
3071 // Advertise our address
3072 if (!fNoListen && !IsInitialBlockDownload())
3074 CAddress addr = GetLocalAddress(&pfrom->addr);
3075 if (addr.IsRoutable())
3076 pfrom->PushAddress(addr);
3079 // Get recent addresses
3080 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3082 pfrom->PushMessage("getaddr");
3083 pfrom->fGetAddr = true;
3085 addrman.Good(pfrom->addr);
3087 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3089 addrman.Add(addrFrom, addrFrom);
3090 addrman.Good(addrFrom);
3094 // Ask the first connected node for block updates
3095 static int nAskedForBlocks = 0;
3096 if (!pfrom->fClient && !pfrom->fOneShot &&
3097 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3098 (pfrom->nVersion < NOBLKS_VERSION_START ||
3099 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3100 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3103 pfrom->PushGetBlocks(pindexBest, uint256(0));
3109 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3110 item.second.RelayTo(pfrom);
3113 // ppcoin: relay sync-checkpoint
3115 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3116 if (!Checkpoints::checkpointMessage.IsNull())
3117 Checkpoints::checkpointMessage.RelayTo(pfrom);
3120 pfrom->fSuccessfullyConnected = true;
3122 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());
3124 cPeerBlockCounts.input(pfrom->nStartingHeight);
3126 // ppcoin: ask for pending sync-checkpoint if any
3127 if (!IsInitialBlockDownload())
3128 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3132 else if (pfrom->nVersion == 0)
3134 // Must have a version message before anything else
3135 pfrom->Misbehaving(1);
3140 else if (strCommand == "verack")
3142 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3146 else if (strCommand == "addr")
3148 vector<CAddress> vAddr;
3151 // Don't want addr from older versions unless seeding
3152 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3154 if (vAddr.size() > 1000)
3156 pfrom->Misbehaving(20);
3157 return error("message addr size() = %"PRIszu"", vAddr.size());
3160 // Store the new addresses
3161 vector<CAddress> vAddrOk;
3162 int64 nNow = GetAdjustedTime();
3163 int64 nSince = nNow - 10 * 60;
3164 BOOST_FOREACH(CAddress& addr, vAddr)
3168 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3169 addr.nTime = nNow - 5 * 24 * 60 * 60;
3170 pfrom->AddAddressKnown(addr);
3171 bool fReachable = IsReachable(addr);
3172 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3174 // Relay to a limited number of other nodes
3177 // Use deterministic randomness to send to the same nodes for 24 hours
3178 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3179 static uint256 hashSalt;
3181 hashSalt = GetRandHash();
3182 uint64 hashAddr = addr.GetHash();
3183 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
3184 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3185 multimap<uint256, CNode*> mapMix;
3186 BOOST_FOREACH(CNode* pnode, vNodes)
3188 if (pnode->nVersion < CADDR_TIME_VERSION)
3190 unsigned int nPointer;
3191 memcpy(&nPointer, &pnode, sizeof(nPointer));
3192 uint256 hashKey = hashRand ^ nPointer;
3193 hashKey = Hash(BEGIN(hashKey), END(hashKey));
3194 mapMix.insert(make_pair(hashKey, pnode));
3196 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3197 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3198 ((*mi).second)->PushAddress(addr);
3201 // Do not store addresses outside our network
3203 vAddrOk.push_back(addr);
3205 addrman.Add(vAddrOk, pfrom->addr, 2 * 60 * 60);
3206 if (vAddr.size() < 1000)
3207 pfrom->fGetAddr = false;
3208 if (pfrom->fOneShot)
3209 pfrom->fDisconnect = true;
3213 else if (strCommand == "inv")
3217 if (vInv.size() > MAX_INV_SZ)
3219 pfrom->Misbehaving(20);
3220 return error("message inv size() = %"PRIszu"", vInv.size());
3223 // find last block in inv vector
3224 unsigned int nLastBlock = (unsigned int)(-1);
3225 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++) {
3226 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
3227 nLastBlock = vInv.size() - 1 - nInv;
3232 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
3234 const CInv &inv = vInv[nInv];
3238 pfrom->AddInventoryKnown(inv);
3240 bool fAlreadyHave = AlreadyHave(txdb, inv);
3242 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3246 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
3247 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
3248 } else if (nInv == nLastBlock) {
3249 // In case we are on a very long side-chain, it is possible that we already have
3250 // the last block in an inv bundle sent in response to getblocks. Try to detect
3251 // this situation and push another getblocks to continue.
3252 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
3254 printf("force request: %s\n", inv.ToString().c_str());
3257 // Track requests for our stuff
3258 Inventory(inv.hash);
3263 else if (strCommand == "getdata")
3267 if (vInv.size() > MAX_INV_SZ)
3269 pfrom->Misbehaving(20);
3270 return error("message getdata size() = %"PRIszu"", vInv.size());
3273 if (fDebugNet || (vInv.size() != 1))
3274 printf("received getdata (%"PRIszu" invsz)\n", vInv.size());
3276 BOOST_FOREACH(const CInv& inv, vInv)
3280 if (fDebugNet || (vInv.size() == 1))
3281 printf("received getdata for: %s\n", inv.ToString().c_str());
3283 if (inv.type == MSG_BLOCK)
3285 // Send block from disk
3286 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
3287 if (mi != mapBlockIndex.end())
3290 block.ReadFromDisk((*mi).second);
3291 pfrom->PushMessage("block", block);
3293 // Trigger them to send a getblocks request for the next batch of inventory
3294 if (inv.hash == pfrom->hashContinue)
3296 // ppcoin: send latest proof-of-work block to allow the
3297 // download node to accept as orphan (proof-of-stake
3298 // block might be rejected by stake connection check)
3300 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3301 pfrom->PushMessage("inv", vInv);
3302 pfrom->hashContinue = 0;
3306 else if (inv.IsKnownType())
3308 // Send stream from relay memory
3309 bool pushed = false;
3312 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
3313 if (mi != mapRelay.end()) {
3314 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3318 if (!pushed && inv.type == MSG_TX) {
3320 if (mempool.exists(inv.hash)) {
3321 CTransaction tx = mempool.lookup(inv.hash);
3322 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3325 pfrom->PushMessage("tx", ss);
3330 // Track requests for our stuff
3331 Inventory(inv.hash);
3336 else if (strCommand == "getblocks")
3338 CBlockLocator locator;
3340 vRecv >> locator >> hashStop;
3342 // Find the last block the caller has in the main chain
3343 CBlockIndex* pindex = locator.GetBlockIndex();
3345 // Send the rest of the chain
3347 pindex = pindex->pnext;
3349 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3350 for (; pindex; pindex = pindex->pnext)
3352 if (pindex->GetBlockHash() == hashStop)
3354 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3355 // ppcoin: tell downloading node about the latest block if it's
3356 // without risk being rejected due to stake connection check
3357 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3358 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3361 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3364 // When this block is requested, we'll send an inv that'll make them
3365 // getblocks the next batch of inventory.
3366 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3367 pfrom->hashContinue = pindex->GetBlockHash();
3372 else if (strCommand == "checkpoint")
3374 CSyncCheckpoint checkpoint;
3375 vRecv >> checkpoint;
3377 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3380 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3382 BOOST_FOREACH(CNode* pnode, vNodes)
3383 checkpoint.RelayTo(pnode);
3387 else if (strCommand == "getheaders")
3389 CBlockLocator locator;
3391 vRecv >> locator >> hashStop;
3393 CBlockIndex* pindex = NULL;
3394 if (locator.IsNull())
3396 // If locator is null, return the hashStop block
3397 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
3398 if (mi == mapBlockIndex.end())
3400 pindex = (*mi).second;
3404 // Find the last block the caller has in the main chain
3405 pindex = locator.GetBlockIndex();
3407 pindex = pindex->pnext;
3410 vector<CBlock> vHeaders;
3412 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3413 for (; pindex; pindex = pindex->pnext)
3415 vHeaders.push_back(pindex->GetBlockHeader());
3416 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3419 pfrom->PushMessage("headers", vHeaders);
3423 else if (strCommand == "tx")
3425 vector<uint256> vWorkQueue;
3426 vector<uint256> vEraseQueue;
3427 CDataStream vMsg(vRecv);
3432 CInv inv(MSG_TX, tx.GetHash());
3433 pfrom->AddInventoryKnown(inv);
3435 bool fMissingInputs = false;
3436 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
3438 SyncWithWallets(tx, NULL, true);
3439 RelayMessage(inv, vMsg);
3440 mapAlreadyAskedFor.erase(inv);
3441 vWorkQueue.push_back(inv.hash);
3442 vEraseQueue.push_back(inv.hash);
3444 // Recursively process any orphan transactions that depended on this one
3445 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3447 uint256 hashPrev = vWorkQueue[i];
3448 for (map<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3449 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3452 const CDataStream& vMsg = *((*mi).second);
3454 CDataStream(vMsg) >> tx;
3455 CInv inv(MSG_TX, tx.GetHash());
3456 bool fMissingInputs2 = false;
3458 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
3460 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
3461 SyncWithWallets(tx, NULL, true);
3462 RelayMessage(inv, vMsg);
3463 mapAlreadyAskedFor.erase(inv);
3464 vWorkQueue.push_back(inv.hash);
3465 vEraseQueue.push_back(inv.hash);
3467 else if (!fMissingInputs2)
3470 vEraseQueue.push_back(inv.hash);
3471 printf(" removed invalid orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
3476 BOOST_FOREACH(uint256 hash, vEraseQueue)
3477 EraseOrphanTx(hash);
3479 else if (fMissingInputs)
3483 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3484 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3486 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3488 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3492 else if (strCommand == "block")
3497 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
3500 CInv inv(MSG_BLOCK, block.GetHash());
3501 pfrom->AddInventoryKnown(inv);
3503 if (ProcessBlock(pfrom, &block))
3504 mapAlreadyAskedFor.erase(inv);
3505 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3509 else if (strCommand == "getaddr")
3511 pfrom->vAddrToSend.clear();
3512 vector<CAddress> vAddr = addrman.GetAddr();
3513 BOOST_FOREACH(const CAddress &addr, vAddr)
3514 pfrom->PushAddress(addr);
3518 else if (strCommand == "mempool")
3520 std::vector<uint256> vtxid;
3521 mempool.queryHashes(vtxid);
3523 for (unsigned int i = 0; i < vtxid.size(); i++) {
3524 CInv inv(MSG_TX, vtxid[i]);
3525 vInv.push_back(inv);
3526 if (i == (MAX_INV_SZ - 1))
3529 if (vInv.size() > 0)
3530 pfrom->PushMessage("inv", vInv);
3534 else if (strCommand == "checkorder")
3539 if (!GetBoolArg("-allowreceivebyip"))
3541 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
3548 /// we have a chance to check the order here
3550 // Keep giving the same key to the same ip until they use it
3551 if (!mapReuseKey.count(pfrom->addr))
3552 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3554 // Send back approval of order and pubkey to use
3555 CScript scriptPubKey;
3556 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3557 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
3561 else if (strCommand == "reply")
3566 CRequestTracker tracker;
3568 LOCK(pfrom->cs_mapRequests);
3569 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
3570 if (mi != pfrom->mapRequests.end())
3572 tracker = (*mi).second;
3573 pfrom->mapRequests.erase(mi);
3576 if (!tracker.IsNull())
3577 tracker.fn(tracker.param1, vRecv);
3581 else if (strCommand == "ping")
3583 if (pfrom->nVersion > BIP0031_VERSION)
3587 // Echo the message back with the nonce. This allows for two useful features:
3589 // 1) A remote node can quickly check if the connection is operational
3590 // 2) Remote nodes can measure the latency of the network thread. If this node
3591 // is overloaded it won't respond to pings quickly and the remote node can
3592 // avoid sending us more work, like chain download requests.
3594 // The nonce stops the remote getting confused between different pings: without
3595 // it, if the remote node sends a ping once per second and this node takes 5
3596 // seconds to respond to each, the 5th ping the remote sends would appear to
3597 // return very quickly.
3598 pfrom->PushMessage("pong", nonce);
3603 else if (strCommand == "alert")
3608 uint256 alertHash = alert.GetHash();
3609 if (pfrom->setKnown.count(alertHash) == 0)
3611 if (alert.ProcessAlert())
3614 pfrom->setKnown.insert(alertHash);
3617 BOOST_FOREACH(CNode* pnode, vNodes)
3618 alert.RelayTo(pnode);
3622 // Small DoS penalty so peers that send us lots of
3623 // duplicate/expired/invalid-signature/whatever alerts
3624 // eventually get banned.
3625 // This isn't a Misbehaving(100) (immediate ban) because the
3626 // peer might be an older or different implementation with
3627 // a different signature key, etc.
3628 pfrom->Misbehaving(10);
3636 // Ignore unknown commands for extensibility
3640 // Update the last seen time for this node's address
3641 if (pfrom->fNetworkNode)
3642 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3643 AddressCurrentlyConnected(pfrom->addr);
3649 bool ProcessMessages(CNode* pfrom)
3651 CDataStream& vRecv = pfrom->vRecv;
3655 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3659 // (4) message start
3668 // Don't bother if send buffer is too full to respond anyway
3669 if (pfrom->vSend.size() >= SendBufferSize())
3672 // Scan for message start
3673 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
3674 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3675 if (vRecv.end() - pstart < nHeaderSize)
3677 if ((int)vRecv.size() > nHeaderSize)
3679 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
3680 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
3684 if (pstart - vRecv.begin() > 0)
3685 printf("\n\nPROCESSMESSAGE SKIPPED %"PRIpdd" BYTES\n\n", pstart - vRecv.begin());
3686 vRecv.erase(vRecv.begin(), pstart);
3689 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
3694 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
3697 string strCommand = hdr.GetCommand();
3700 unsigned int nMessageSize = hdr.nMessageSize;
3701 if (nMessageSize > MAX_SIZE)
3703 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
3706 if (nMessageSize > vRecv.size())
3708 // Rewind and wait for rest of message
3709 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
3714 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
3715 unsigned int nChecksum = 0;
3716 memcpy(&nChecksum, &hash, sizeof(nChecksum));
3717 if (nChecksum != hdr.nChecksum)
3719 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
3720 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
3724 // Copy message to its own buffer
3725 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
3726 vRecv.ignore(nMessageSize);
3734 fRet = ProcessMessage(pfrom, strCommand, vMsg);
3739 catch (std::ios_base::failure& e)
3741 if (strstr(e.what(), "end of data"))
3743 // Allow exceptions from under-length message on vRecv
3744 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());
3746 else if (strstr(e.what(), "size too large"))
3748 // Allow exceptions from over-long size
3749 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
3753 PrintExceptionContinue(&e, "ProcessMessages()");
3756 catch (std::exception& e) {
3757 PrintExceptionContinue(&e, "ProcessMessages()");
3759 PrintExceptionContinue(NULL, "ProcessMessages()");
3763 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
3771 bool SendMessages(CNode* pto, bool fSendTrickle)
3773 TRY_LOCK(cs_main, lockMain);
3775 // Don't send anything until we get their version message
3776 if (pto->nVersion == 0)
3779 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
3781 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
3783 if (pto->nVersion > BIP0031_VERSION)
3784 pto->PushMessage("ping", nonce);
3786 pto->PushMessage("ping");
3789 // Resend wallet transactions that haven't gotten in a block yet
3790 ResendWalletTransactions();
3792 // Address refresh broadcast
3793 static int64 nLastRebroadcast;
3794 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
3798 BOOST_FOREACH(CNode* pnode, vNodes)
3800 // Periodically clear setAddrKnown to allow refresh broadcasts
3801 if (nLastRebroadcast)
3802 pnode->setAddrKnown.clear();
3804 // Rebroadcast our address
3807 CAddress addr = GetLocalAddress(&pnode->addr);
3808 if (addr.IsRoutable())
3809 pnode->PushAddress(addr);
3813 nLastRebroadcast = GetTime();
3821 vector<CAddress> vAddr;
3822 vAddr.reserve(pto->vAddrToSend.size());
3823 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
3825 // returns true if wasn't already contained in the set
3826 if (pto->setAddrKnown.insert(addr).second)
3828 vAddr.push_back(addr);
3829 // receiver rejects addr messages larger than 1000
3830 if (vAddr.size() >= 1000)
3832 pto->PushMessage("addr", vAddr);
3837 pto->vAddrToSend.clear();
3839 pto->PushMessage("addr", vAddr);
3844 // Message: inventory
3847 vector<CInv> vInvWait;
3849 LOCK(pto->cs_inventory);
3850 vInv.reserve(pto->vInventoryToSend.size());
3851 vInvWait.reserve(pto->vInventoryToSend.size());
3852 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
3854 if (pto->setInventoryKnown.count(inv))
3857 // trickle out tx inv to protect privacy
3858 if (inv.type == MSG_TX && !fSendTrickle)
3860 // 1/4 of tx invs blast to all immediately
3861 static uint256 hashSalt;
3863 hashSalt = GetRandHash();
3864 uint256 hashRand = inv.hash ^ hashSalt;
3865 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3866 bool fTrickleWait = ((hashRand & 3) != 0);
3868 // always trickle our own transactions
3872 if (GetTransaction(inv.hash, wtx))
3874 fTrickleWait = true;
3879 vInvWait.push_back(inv);
3884 // returns true if wasn't already contained in the set
3885 if (pto->setInventoryKnown.insert(inv).second)
3887 vInv.push_back(inv);
3888 if (vInv.size() >= 1000)
3890 pto->PushMessage("inv", vInv);
3895 pto->vInventoryToSend = vInvWait;
3898 pto->PushMessage("inv", vInv);
3904 vector<CInv> vGetData;
3905 int64 nNow = GetTime() * 1000000;
3907 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
3909 const CInv& inv = (*pto->mapAskFor.begin()).second;
3910 if (!AlreadyHave(txdb, inv))
3913 printf("sending getdata: %s\n", inv.ToString().c_str());
3914 vGetData.push_back(inv);
3915 if (vGetData.size() >= 1000)
3917 pto->PushMessage("getdata", vGetData);
3920 mapAlreadyAskedFor[inv] = nNow;
3922 pto->mapAskFor.erase(pto->mapAskFor.begin());
3924 if (!vGetData.empty())
3925 pto->PushMessage("getdata", vGetData);
3944 //////////////////////////////////////////////////////////////////////////////
3949 int static FormatHashBlocks(void* pbuffer, unsigned int len)
3951 unsigned char* pdata = (unsigned char*)pbuffer;
3952 unsigned int blocks = 1 + ((len + 8) / 64);
3953 unsigned char* pend = pdata + 64 * blocks;
3954 memset(pdata + len, 0, 64 * blocks - len);
3956 unsigned int bits = len * 8;
3957 pend[-1] = (bits >> 0) & 0xff;
3958 pend[-2] = (bits >> 8) & 0xff;
3959 pend[-3] = (bits >> 16) & 0xff;
3960 pend[-4] = (bits >> 24) & 0xff;
3964 static const unsigned int pSHA256InitState[8] =
3965 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
3967 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
3970 unsigned char data[64];
3974 for (int i = 0; i < 16; i++)
3975 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
3977 for (int i = 0; i < 8; i++)
3978 ctx.h[i] = ((uint32_t*)pinit)[i];
3980 SHA256_Update(&ctx, data, sizeof(data));
3981 for (int i = 0; i < 8; i++)
3982 ((uint32_t*)pstate)[i] = ctx.h[i];
3985 // Some explaining would be appreciated
3990 set<uint256> setDependsOn;
3994 COrphan(CTransaction* ptxIn)
3997 dPriority = dFeePerKb = 0;
4002 printf("COrphan(hash=%s, dPriority=%.1f, dFeePerKb=%.1f)\n",
4003 ptx->GetHash().ToString().substr(0,10).c_str(), dPriority, dFeePerKb);
4004 BOOST_FOREACH(uint256 hash, setDependsOn)
4005 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
4010 uint64 nLastBlockTx = 0;
4011 uint64 nLastBlockSize = 0;
4012 int64 nLastCoinStakeSearchInterval = 0;
4014 // We want to sort transactions by priority and fee, so:
4015 typedef boost::tuple<double, double, CTransaction*> TxPriority;
4016 class TxPriorityCompare
4020 TxPriorityCompare(bool _byFee) : byFee(_byFee) { }
4021 bool operator()(const TxPriority& a, const TxPriority& b)
4025 if (a.get<1>() == b.get<1>())
4026 return a.get<0>() < b.get<0>();
4027 return a.get<1>() < b.get<1>();
4031 if (a.get<0>() == b.get<0>())
4032 return a.get<1>() < b.get<1>();
4033 return a.get<0>() < b.get<0>();
4039 // fProofOfStake: try (best effort) to make a proof-of-stake block
4040 CBlock* CreateNewBlock(CWallet* pwallet, bool fProofOfStake)
4042 CReserveKey reservekey(pwallet);
4045 auto_ptr<CBlock> pblock(new CBlock());
4049 // Create coinbase tx
4051 txNew.vin.resize(1);
4052 txNew.vin[0].prevout.SetNull();
4053 txNew.vout.resize(1);
4054 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
4056 // Add our coinbase tx as first transaction
4057 pblock->vtx.push_back(txNew);
4059 // Largest block you're willing to create:
4060 unsigned int nBlockMaxSize = GetArg("-blockmaxsize", MAX_BLOCK_SIZE_GEN/2);
4061 // Limit to betweeen 1K and MAX_BLOCK_SIZE-1K for sanity:
4062 nBlockMaxSize = std::max((unsigned int)1000, std::min((unsigned int)(MAX_BLOCK_SIZE-1000), nBlockMaxSize));
4064 // Special compatibility rule before 20 Aug: limit size to 500,000 bytes:
4065 if (GetAdjustedTime() < LOCKS_SWITCH_TIME)
4066 nBlockMaxSize = std::min(nBlockMaxSize, (unsigned int)(MAX_BLOCK_SIZE_GEN));
4068 // How much of the block should be dedicated to high-priority transactions,
4069 // included regardless of the fees they pay
4070 unsigned int nBlockPrioritySize = GetArg("-blockprioritysize", 27000);
4071 nBlockPrioritySize = std::min(nBlockMaxSize, nBlockPrioritySize);
4073 // Minimum block size you want to create; block will be filled with free transactions
4074 // until there are no more or the block reaches this size:
4075 unsigned int nBlockMinSize = GetArg("-blockminsize", 0);
4076 nBlockMinSize = std::min(nBlockMaxSize, nBlockMinSize);
4078 // Fee-per-kilobyte amount considered the same as "free"
4079 // Be careful setting this: if you set it to zero then
4080 // a transaction spammer can cheaply fill blocks using
4081 // 1-satoshi-fee transactions. It should be set above the real
4082 // cost to you of processing a transaction.
4083 int64 nMinTxFee = MIN_TX_FEE;
4084 if (mapArgs.count("-mintxfee"))
4085 ParseMoney(mapArgs["-mintxfee"], nMinTxFee);
4087 // ppcoin: if coinstake available add coinstake tx
4088 static int64 nLastCoinStakeSearchTime = GetAdjustedTime(); // only initialized at startup
4089 CBlockIndex* pindexPrev = pindexBest;
4091 if (fProofOfStake) // attempt to find a coinstake
4093 pblock->nBits = GetNextTargetRequired(pindexPrev, true);
4094 CTransaction txCoinStake;
4095 int64 nSearchTime = txCoinStake.nTime; // search to current time
4096 if (nSearchTime > nLastCoinStakeSearchTime)
4098 if (pwallet->CreateCoinStake(*pwallet, pblock->nBits, nSearchTime-nLastCoinStakeSearchTime, txCoinStake))
4100 if (txCoinStake.nTime >= max(pindexPrev->GetMedianTimePast()+1, pindexPrev->GetBlockTime() - nMaxClockDrift))
4101 { // make sure coinstake would meet timestamp protocol
4102 // as it would be the same as the block timestamp
4103 pblock->vtx[0].vout[0].SetEmpty();
4104 pblock->vtx[0].nTime = txCoinStake.nTime;
4105 pblock->vtx.push_back(txCoinStake);
4108 nLastCoinStakeSearchInterval = nSearchTime - nLastCoinStakeSearchTime;
4109 nLastCoinStakeSearchTime = nSearchTime;
4113 pblock->nBits = GetNextTargetRequired(pindexPrev, pblock->IsProofOfStake());
4115 // Collect memory pool transactions into the block
4118 LOCK2(cs_main, mempool.cs);
4119 CBlockIndex* pindexPrev = pindexBest;
4122 // Priority order to process transactions
4123 list<COrphan> vOrphan; // list memory doesn't move
4124 map<uint256, vector<COrphan*> > mapDependers;
4126 // This vector will be sorted into a priority queue:
4127 vector<TxPriority> vecPriority;
4128 vecPriority.reserve(mempool.mapTx.size());
4129 for (map<uint256, CTransaction>::iterator mi = mempool.mapTx.begin(); mi != mempool.mapTx.end(); ++mi)
4131 CTransaction& tx = (*mi).second;
4132 if (tx.IsCoinBase() || tx.IsCoinStake() || !tx.IsFinal())
4135 COrphan* porphan = NULL;
4136 double dPriority = 0;
4138 bool fMissingInputs = false;
4139 BOOST_FOREACH(const CTxIn& txin, tx.vin)
4141 // Read prev transaction
4142 CTransaction txPrev;
4144 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
4146 // This should never happen; all transactions in the memory
4147 // pool should connect to either transactions in the chain
4148 // or other transactions in the memory pool.
4149 if (!mempool.mapTx.count(txin.prevout.hash))
4151 printf("ERROR: mempool transaction missing input\n");
4152 if (fDebug) assert("mempool transaction missing input" == 0);
4153 fMissingInputs = true;
4159 // Has to wait for dependencies
4162 // Use list for automatic deletion
4163 vOrphan.push_back(COrphan(&tx));
4164 porphan = &vOrphan.back();
4166 mapDependers[txin.prevout.hash].push_back(porphan);
4167 porphan->setDependsOn.insert(txin.prevout.hash);
4168 nTotalIn += mempool.mapTx[txin.prevout.hash].vout[txin.prevout.n].nValue;
4171 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
4172 nTotalIn += nValueIn;
4174 int nConf = txindex.GetDepthInMainChain();
4175 dPriority += (double)nValueIn * nConf;
4177 if (fMissingInputs) continue;
4179 // Priority is sum(valuein * age) / txsize
4180 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
4181 dPriority /= nTxSize;
4183 // This is a more accurate fee-per-kilobyte than is used by the client code, because the
4184 // client code rounds up the size to the nearest 1K. That's good, because it gives an
4185 // incentive to create smaller transactions.
4186 double dFeePerKb = double(nTotalIn-tx.GetValueOut()) / (double(nTxSize)/1000.0);
4190 porphan->dPriority = dPriority;
4191 porphan->dFeePerKb = dFeePerKb;
4194 vecPriority.push_back(TxPriority(dPriority, dFeePerKb, &(*mi).second));
4197 // Collect transactions into block
4198 map<uint256, CTxIndex> mapTestPool;
4199 uint64 nBlockSize = 1000;
4200 uint64 nBlockTx = 0;
4201 int nBlockSigOps = 100;
4202 bool fSortedByFee = (nBlockPrioritySize <= 0);
4204 TxPriorityCompare comparer(fSortedByFee);
4205 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
4207 while (!vecPriority.empty())
4209 // Take highest priority transaction off the priority queue:
4210 double dPriority = vecPriority.front().get<0>();
4211 double dFeePerKb = vecPriority.front().get<1>();
4212 CTransaction& tx = *(vecPriority.front().get<2>());
4214 std::pop_heap(vecPriority.begin(), vecPriority.end(), comparer);
4215 vecPriority.pop_back();
4218 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
4219 if (nBlockSize + nTxSize >= nBlockMaxSize)
4222 // Legacy limits on sigOps:
4223 unsigned int nTxSigOps = tx.GetLegacySigOpCount();
4224 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
4228 if (tx.nTime > GetAdjustedTime() || (pblock->IsProofOfStake() && tx.nTime > pblock->vtx[1].nTime))
4231 // ppcoin: simplify transaction fee - allow free = false
4232 int64 nMinFee = tx.GetMinFee(nBlockSize, false, GMF_BLOCK);
4234 // Skip free transactions if we're past the minimum block size:
4235 if (fSortedByFee && (dFeePerKb < nMinTxFee) && (nBlockSize + nTxSize >= nBlockMinSize))
4238 // Prioritize by fee once past the priority size or we run out of high-priority
4240 if (!fSortedByFee &&
4241 ((nBlockSize + nTxSize >= nBlockPrioritySize) || (dPriority < COIN * 144 / 250)))
4243 fSortedByFee = true;
4244 comparer = TxPriorityCompare(fSortedByFee);
4245 std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
4248 // Connecting shouldn't fail due to dependency on other memory pool transactions
4249 // because we're already processing them in order of dependency
4250 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
4251 MapPrevTx mapInputs;
4253 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
4256 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
4257 if (nTxFees < nMinFee)
4260 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
4261 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
4264 if (!tx.ConnectInputs(txdb, mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
4266 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
4267 swap(mapTestPool, mapTestPoolTmp);
4270 pblock->vtx.push_back(tx);
4271 nBlockSize += nTxSize;
4273 nBlockSigOps += nTxSigOps;
4276 if (fDebug && GetBoolArg("-printpriority"))
4278 printf("priority %.1f feeperkb %.1f txid %s\n",
4279 dPriority, dFeePerKb, tx.GetHash().ToString().c_str());
4282 // Add transactions that depend on this one to the priority queue
4283 uint256 hash = tx.GetHash();
4284 if (mapDependers.count(hash))
4286 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
4288 if (!porphan->setDependsOn.empty())
4290 porphan->setDependsOn.erase(hash);
4291 if (porphan->setDependsOn.empty())
4293 vecPriority.push_back(TxPriority(porphan->dPriority, porphan->dFeePerKb, porphan->ptx));
4294 std::push_heap(vecPriority.begin(), vecPriority.end(), comparer);
4301 nLastBlockTx = nBlockTx;
4302 nLastBlockSize = nBlockSize;
4304 if (fDebug && GetBoolArg("-printpriority"))
4305 printf("CreateNewBlock(): total size %"PRI64u"\n", nBlockSize);
4307 if (pblock->IsProofOfWork())
4308 pblock->vtx[0].vout[0].nValue = GetProofOfWorkReward(pblock->nBits);
4311 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
4312 if (pblock->IsProofOfStake())
4313 pblock->nTime = pblock->vtx[1].nTime; //same as coinstake timestamp
4314 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, pblock->GetMaxTransactionTime());
4315 pblock->nTime = max(pblock->GetBlockTime(), pindexPrev->GetBlockTime() - nMaxClockDrift);
4316 if (pblock->IsProofOfWork())
4317 pblock->UpdateTime(pindexPrev);
4321 return pblock.release();
4325 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
4327 // Update nExtraNonce
4328 static uint256 hashPrevBlock;
4329 if (hashPrevBlock != pblock->hashPrevBlock)
4332 hashPrevBlock = pblock->hashPrevBlock;
4335 unsigned int nHeight = pindexPrev->nHeight+1; // Height first in coinbase required for block.version=2
4336 pblock->vtx[0].vin[0].scriptSig = (CScript() << nHeight << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
4337 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
4339 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
4343 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
4346 // Pre-build hash buffers
4353 uint256 hashPrevBlock;
4354 uint256 hashMerkleRoot;
4357 unsigned int nNonce;
4360 unsigned char pchPadding0[64];
4362 unsigned char pchPadding1[64];
4365 memset(&tmp, 0, sizeof(tmp));
4367 tmp.block.nVersion = pblock->nVersion;
4368 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
4369 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
4370 tmp.block.nTime = pblock->nTime;
4371 tmp.block.nBits = pblock->nBits;
4372 tmp.block.nNonce = pblock->nNonce;
4374 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
4375 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
4377 // Byte swap all the input buffer
4378 for (unsigned int i = 0; i < sizeof(tmp)/4; i++)
4379 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
4381 // Precalc the first half of the first hash, which stays constant
4382 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
4384 memcpy(pdata, &tmp.block, 128);
4385 memcpy(phash1, &tmp.hash1, 64);
4389 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
4391 uint256 hash = pblock->GetHash();
4392 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
4394 if (hash > hashTarget && pblock->IsProofOfWork())
4395 return error("BitcoinMiner : proof-of-work not meeting target");
4398 printf("BitcoinMiner:\n");
4399 printf("new block found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
4401 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
4406 if (pblock->hashPrevBlock != hashBestChain)
4407 return error("BitcoinMiner : generated block is stale");
4409 // Remove key from key pool
4410 reservekey.KeepKey();
4412 // Track how many getdata requests this block gets
4414 LOCK(wallet.cs_wallet);
4415 wallet.mapRequestCount[pblock->GetHash()] = 0;
4418 // Process this block the same as if we had received it from another node
4419 if (!ProcessBlock(NULL, pblock))
4420 return error("BitcoinMiner : ProcessBlock, block not accepted");
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);