1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Distributed under the MIT/X11 software license, see the accompanying
3 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
6 #include "cryptopp/sha.h"
16 CCriticalSection cs_main;
18 map<uint256, CTransaction> mapTransactions;
19 CCriticalSection cs_mapTransactions;
20 unsigned int nTransactionsUpdated = 0;
21 map<COutPoint, CInPoint> mapNextTx;
23 map<uint256, CBlockIndex*> mapBlockIndex;
24 uint256 hashGenesisBlock("0x000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f");
25 CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
26 CBlockIndex* pindexGenesisBlock = NULL;
28 CBigNum bnBestChainWork = 0;
29 CBigNum bnBestInvalidWork = 0;
30 uint256 hashBestChain = 0;
31 CBlockIndex* pindexBest = NULL;
32 int64 nTimeBestReceived = 0;
34 map<uint256, CBlock*> mapOrphanBlocks;
35 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
37 map<uint256, CDataStream*> mapOrphanTransactions;
38 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
40 map<uint256, CWalletTx> mapWallet;
41 vector<uint256> vWalletUpdated;
42 CCriticalSection cs_mapWallet;
44 map<vector<unsigned char>, CPrivKey> mapKeys;
45 map<uint160, vector<unsigned char> > mapPubKeys;
46 CCriticalSection cs_mapKeys;
49 map<uint256, int> mapRequestCount;
50 CCriticalSection cs_mapRequestCount;
52 map<string, string> mapAddressBook;
53 CCriticalSection cs_mapAddressBook;
55 vector<unsigned char> vchDefaultKey;
61 int fGenerateBitcoins = false;
62 int64 nTransactionFee = 0;
63 CAddress addrIncoming;
64 int fLimitProcessors = false;
65 int nLimitProcessors = 1;
66 int fMinimizeToTray = true;
67 int fMinimizeOnClose = true;
74 //////////////////////////////////////////////////////////////////////////////
79 bool AddKey(const CKey& key)
81 CRITICAL_BLOCK(cs_mapKeys)
83 mapKeys[key.GetPubKey()] = key.GetPrivKey();
84 mapPubKeys[Hash160(key.GetPubKey())] = key.GetPubKey();
86 return CWalletDB().WriteKey(key.GetPubKey(), key.GetPrivKey());
89 vector<unsigned char> GenerateNewKey()
95 throw runtime_error("GenerateNewKey() : AddKey failed");
96 return key.GetPubKey();
102 //////////////////////////////////////////////////////////////////////////////
107 bool AddToWallet(const CWalletTx& wtxIn)
109 uint256 hash = wtxIn.GetHash();
110 CRITICAL_BLOCK(cs_mapWallet)
112 // Inserts only if not already there, returns tx inserted or tx found
113 pair<map<uint256, CWalletTx>::iterator, bool> ret = mapWallet.insert(make_pair(hash, wtxIn));
114 CWalletTx& wtx = (*ret.first).second;
115 bool fInsertedNew = ret.second;
117 wtx.nTimeReceived = GetAdjustedTime();
119 bool fUpdated = false;
123 if (wtxIn.hashBlock != 0 && wtxIn.hashBlock != wtx.hashBlock)
125 wtx.hashBlock = wtxIn.hashBlock;
128 if (wtxIn.nIndex != -1 && (wtxIn.vMerkleBranch != wtx.vMerkleBranch || wtxIn.nIndex != wtx.nIndex))
130 wtx.vMerkleBranch = wtxIn.vMerkleBranch;
131 wtx.nIndex = wtxIn.nIndex;
134 if (wtxIn.fFromMe && wtxIn.fFromMe != wtx.fFromMe)
136 wtx.fFromMe = wtxIn.fFromMe;
139 if (wtxIn.fSpent && wtxIn.fSpent != wtx.fSpent)
141 wtx.fSpent = wtxIn.fSpent;
147 printf("AddToWallet %s %s%s\n", wtxIn.GetHash().ToString().substr(0,10).c_str(), (fInsertedNew ? "new" : ""), (fUpdated ? "update" : ""));
150 if (fInsertedNew || fUpdated)
151 if (!wtx.WriteToDisk())
154 // If default receiving address gets used, replace it with a new one
155 CScript scriptDefaultKey;
156 scriptDefaultKey.SetBitcoinAddress(vchDefaultKey);
157 foreach(const CTxOut& txout, wtx.vout)
159 if (txout.scriptPubKey == scriptDefaultKey)
162 vchDefaultKey = GetKeyFromKeyPool();
163 walletdb.WriteDefaultKey(vchDefaultKey);
164 walletdb.WriteName(PubKeyToAddress(vchDefaultKey), "");
169 vWalletUpdated.push_back(hash);
177 bool AddToWalletIfMine(const CTransaction& tx, const CBlock* pblock)
179 if (tx.IsMine() || mapWallet.count(tx.GetHash()))
182 // Get merkle branch if transaction was found in a block
184 wtx.SetMerkleBranch(pblock);
185 return AddToWallet(wtx);
190 bool AddToWalletIfFromMe(const CTransaction& tx, const CBlock* pblock)
192 if (tx.IsFromMe() || mapWallet.count(tx.GetHash()))
195 // Get merkle branch if transaction was found in a block
197 wtx.SetMerkleBranch(pblock);
198 return AddToWallet(wtx);
203 bool EraseFromWallet(uint256 hash)
205 CRITICAL_BLOCK(cs_mapWallet)
207 if (mapWallet.erase(hash))
208 CWalletDB().EraseTx(hash);
213 void WalletUpdateSpent(const COutPoint& prevout)
215 // Anytime a signature is successfully verified, it's proof the outpoint is spent.
216 // Update the wallet spent flag if it doesn't know due to wallet.dat being
217 // restored from backup or the user making copies of wallet.dat.
218 CRITICAL_BLOCK(cs_mapWallet)
220 map<uint256, CWalletTx>::iterator mi = mapWallet.find(prevout.hash);
221 if (mi != mapWallet.end())
223 CWalletTx& wtx = (*mi).second;
224 if (!wtx.fSpent && wtx.vout[prevout.n].IsMine())
226 printf("WalletUpdateSpent found spent coin %sbc %s\n", FormatMoney(wtx.GetCredit()).c_str(), wtx.GetHash().ToString().c_str());
229 vWalletUpdated.push_back(prevout.hash);
242 //////////////////////////////////////////////////////////////////////////////
244 // mapOrphanTransactions
247 void AddOrphanTx(const CDataStream& vMsg)
250 CDataStream(vMsg) >> tx;
251 uint256 hash = tx.GetHash();
252 if (mapOrphanTransactions.count(hash))
254 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
255 foreach(const CTxIn& txin, tx.vin)
256 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
259 void EraseOrphanTx(uint256 hash)
261 if (!mapOrphanTransactions.count(hash))
263 const CDataStream* pvMsg = mapOrphanTransactions[hash];
265 CDataStream(*pvMsg) >> tx;
266 foreach(const CTxIn& txin, tx.vin)
268 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
269 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
271 if ((*mi).second == pvMsg)
272 mapOrphanTransactionsByPrev.erase(mi++);
278 mapOrphanTransactions.erase(hash);
288 //////////////////////////////////////////////////////////////////////////////
290 // CTransaction and CTxIndex
293 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
296 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
298 if (!ReadFromDisk(txindexRet.pos))
300 if (prevout.n >= vout.size())
308 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
311 return ReadFromDisk(txdb, prevout, txindex);
314 bool CTransaction::ReadFromDisk(COutPoint prevout)
318 return ReadFromDisk(txdb, prevout, txindex);
321 bool CTxIn::IsMine() const
323 CRITICAL_BLOCK(cs_mapWallet)
325 map<uint256, CWalletTx>::iterator mi = mapWallet.find(prevout.hash);
326 if (mi != mapWallet.end())
328 const CWalletTx& prev = (*mi).second;
329 if (prevout.n < prev.vout.size())
330 if (prev.vout[prevout.n].IsMine())
337 int64 CTxIn::GetDebit() const
339 CRITICAL_BLOCK(cs_mapWallet)
341 map<uint256, CWalletTx>::iterator mi = mapWallet.find(prevout.hash);
342 if (mi != mapWallet.end())
344 const CWalletTx& prev = (*mi).second;
345 if (prevout.n < prev.vout.size())
346 if (prev.vout[prevout.n].IsMine())
347 return prev.vout[prevout.n].nValue;
353 int64 CWalletTx::GetTxTime() const
355 if (!fTimeReceivedIsTxTime && hashBlock != 0)
357 // If we did not receive the transaction directly, we rely on the block's
358 // time to figure out when it happened. We use the median over a range
359 // of blocks to try to filter out inaccurate block times.
360 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
361 if (mi != mapBlockIndex.end())
363 CBlockIndex* pindex = (*mi).second;
365 return pindex->GetMedianTime();
368 return nTimeReceived;
371 int CWalletTx::GetRequestCount() const
373 // Returns -1 if it wasn't being tracked
375 CRITICAL_BLOCK(cs_mapRequestCount)
382 map<uint256, int>::iterator mi = mapRequestCount.find(hashBlock);
383 if (mi != mapRequestCount.end())
384 nRequests = (*mi).second;
389 // Did anyone request this transaction?
390 map<uint256, int>::iterator mi = mapRequestCount.find(GetHash());
391 if (mi != mapRequestCount.end())
393 nRequests = (*mi).second;
395 // How about the block it's in?
396 if (nRequests == 0 && hashBlock != 0)
398 map<uint256, int>::iterator mi = mapRequestCount.find(hashBlock);
399 if (mi != mapRequestCount.end())
400 nRequests = (*mi).second;
402 nRequests = 1; // If it's in someone else's block it must have got out
410 void CWalletTx::GetAmounts(int64& nGenerated, list<pair<string, int64> >& listReceived,
411 list<pair<string, int64> >& listSent, int64& nFee, string& strSentAccount) const
413 nGenerated = nFee = 0;
414 listReceived.clear();
416 strSentAccount = strFromAccount;
420 if (GetDepthInMainChain() >= COINBASE_MATURITY)
421 nGenerated = GetCredit();
426 int64 nDebit = GetDebit();
427 if (nDebit > 0) // debit>0 means we signed/sent this transaction
429 int64 nValueOut = GetValueOut();
430 nFee = nDebit - nValueOut;
433 // Sent/received. Standard client will never generate a send-to-multiple-recipients,
434 // but non-standard clients might (so return a list of address/amount pairs)
435 foreach(const CTxOut& txout, vout)
439 vector<unsigned char> vchPubKey;
440 if (ExtractHash160(txout.scriptPubKey, hash160))
441 address = Hash160ToAddress(hash160);
442 else if (ExtractPubKey(txout.scriptPubKey, false, vchPubKey))
443 address = PubKeyToAddress(vchPubKey);
446 printf("CWalletTx::GetAmounts: Unknown transaction type found, txid %s\n",
447 this->GetHash().ToString().c_str());
448 address = " unknown ";
451 // Don't report 'change' txouts
452 if (nDebit > 0 && txout.IsChange())
456 listSent.push_back(make_pair(address, txout.nValue));
459 listReceived.push_back(make_pair(address, txout.nValue));
464 void CWalletTx::GetAccountAmounts(const string& strAccount, int64& nGenerated, int64& nReceived,
465 int64& nSent, int64& nFee) const
467 nGenerated = nReceived = nSent = nFee = 0;
469 int64 allGenerated, allFee;
470 allGenerated = allFee = 0;
471 string strSentAccount;
472 list<pair<string, int64> > listReceived;
473 list<pair<string, int64> > listSent;
474 GetAmounts(allGenerated, listReceived, listSent, allFee, strSentAccount);
476 if (strAccount == "")
477 nGenerated = allGenerated;
478 if (strAccount == strSentAccount)
480 foreach(const PAIRTYPE(string,int64)& s, listSent)
484 CRITICAL_BLOCK(cs_mapAddressBook)
486 foreach(const PAIRTYPE(string,int64)& r, listReceived)
488 if (mapAddressBook.count(r.first))
490 if (mapAddressBook[r.first] == strAccount)
492 nReceived += r.second;
495 else if (strAccount.empty())
497 nReceived += r.second;
505 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
517 // Load the block this tx is in
519 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
521 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
526 // Update the tx's hashBlock
527 hashBlock = pblock->GetHash();
529 // Locate the transaction
530 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
531 if (pblock->vtx[nIndex] == *(CTransaction*)this)
533 if (nIndex == pblock->vtx.size())
535 vMerkleBranch.clear();
537 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
541 // Fill in merkle branch
542 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
545 // Is the tx in a block that's in the main chain
546 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
547 if (mi == mapBlockIndex.end())
549 CBlockIndex* pindex = (*mi).second;
550 if (!pindex || !pindex->IsInMainChain())
553 return pindexBest->nHeight - pindex->nHeight + 1;
558 void CWalletTx::AddSupportingTransactions(CTxDB& txdb)
562 const int COPY_DEPTH = 3;
563 if (SetMerkleBranch() < COPY_DEPTH)
565 vector<uint256> vWorkQueue;
566 foreach(const CTxIn& txin, vin)
567 vWorkQueue.push_back(txin.prevout.hash);
569 // This critsect is OK because txdb is already open
570 CRITICAL_BLOCK(cs_mapWallet)
572 map<uint256, const CMerkleTx*> mapWalletPrev;
573 set<uint256> setAlreadyDone;
574 for (int i = 0; i < vWorkQueue.size(); i++)
576 uint256 hash = vWorkQueue[i];
577 if (setAlreadyDone.count(hash))
579 setAlreadyDone.insert(hash);
582 if (mapWallet.count(hash))
584 tx = mapWallet[hash];
585 foreach(const CMerkleTx& txWalletPrev, mapWallet[hash].vtxPrev)
586 mapWalletPrev[txWalletPrev.GetHash()] = &txWalletPrev;
588 else if (mapWalletPrev.count(hash))
590 tx = *mapWalletPrev[hash];
592 else if (!fClient && txdb.ReadDiskTx(hash, tx))
598 printf("ERROR: AddSupportingTransactions() : unsupported transaction\n");
602 int nDepth = tx.SetMerkleBranch();
603 vtxPrev.push_back(tx);
605 if (nDepth < COPY_DEPTH)
606 foreach(const CTxIn& txin, tx.vin)
607 vWorkQueue.push_back(txin.prevout.hash);
612 reverse(vtxPrev.begin(), vtxPrev.end());
625 bool CTransaction::CheckTransaction() const
627 // Basic checks that don't depend on any context
628 if (vin.empty() || vout.empty())
629 return error("CTransaction::CheckTransaction() : vin or vout empty");
632 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
633 return error("CTransaction::CheckTransaction() : size limits failed");
635 // Check for negative or overflow output values
637 foreach(const CTxOut& txout, vout)
639 if (txout.nValue < 0)
640 return error("CTransaction::CheckTransaction() : txout.nValue negative");
641 if (txout.nValue > MAX_MONEY)
642 return error("CTransaction::CheckTransaction() : txout.nValue too high");
643 nValueOut += txout.nValue;
644 if (!MoneyRange(nValueOut))
645 return error("CTransaction::CheckTransaction() : txout total out of range");
650 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
651 return error("CTransaction::CheckTransaction() : coinbase script size");
655 foreach(const CTxIn& txin, vin)
656 if (txin.prevout.IsNull())
657 return error("CTransaction::CheckTransaction() : prevout is null");
663 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
666 *pfMissingInputs = false;
668 if (!CheckTransaction())
669 return error("AcceptToMemoryPool() : CheckTransaction failed");
671 // Coinbase is only valid in a block, not as a loose transaction
673 return error("AcceptToMemoryPool() : coinbase as individual tx");
675 // To help v0.1.5 clients who would see it as a negative number
676 if ((int64)nLockTime > INT_MAX)
677 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
680 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
681 if (GetSigOpCount() > 2 || nSize < 100)
682 return error("AcceptToMemoryPool() : nonstandard transaction");
684 // Rather not work on nonstandard transactions
686 return error("AcceptToMemoryPool() : nonstandard transaction type");
688 // Do we already have it?
689 uint256 hash = GetHash();
690 CRITICAL_BLOCK(cs_mapTransactions)
691 if (mapTransactions.count(hash))
694 if (txdb.ContainsTx(hash))
697 // Check for conflicts with in-memory transactions
698 CTransaction* ptxOld = NULL;
699 for (int i = 0; i < vin.size(); i++)
701 COutPoint outpoint = vin[i].prevout;
702 if (mapNextTx.count(outpoint))
704 // Disable replacement feature for now
707 // Allow replacing with a newer version of the same transaction
710 ptxOld = mapNextTx[outpoint].ptx;
711 if (ptxOld->IsFinal())
713 if (!IsNewerThan(*ptxOld))
715 for (int i = 0; i < vin.size(); i++)
717 COutPoint outpoint = vin[i].prevout;
718 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
727 // Check against previous transactions
728 map<uint256, CTxIndex> mapUnused;
730 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
733 *pfMissingInputs = true;
734 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
737 // Don't accept it if it can't get into a block
738 if (nFees < GetMinFee(1000))
739 return error("AcceptToMemoryPool() : not enough fees");
741 // Limit free transactions per 10 minutes
742 if (nFees < CENT && GetBoolArg("-limitfreerelay"))
744 static int64 nNextReset;
745 static int64 nFreeCount;
746 if (GetTime() > nNextReset)
748 nNextReset = GetTime() + 10 * 60;
751 if (nFreeCount > 150000 && !IsFromMe())
752 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
757 // Store transaction in memory
758 CRITICAL_BLOCK(cs_mapTransactions)
762 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
763 ptxOld->RemoveFromMemoryPool();
765 AddToMemoryPoolUnchecked();
768 ///// are we sure this is ok when loading transactions or restoring block txes
769 // If updated, erase old tx from wallet
771 EraseFromWallet(ptxOld->GetHash());
773 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
778 bool CTransaction::AddToMemoryPoolUnchecked()
780 // Add to memory pool without checking anything. Don't call this directly,
781 // call AcceptToMemoryPool to properly check the transaction first.
782 CRITICAL_BLOCK(cs_mapTransactions)
784 uint256 hash = GetHash();
785 mapTransactions[hash] = *this;
786 for (int i = 0; i < vin.size(); i++)
787 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
788 nTransactionsUpdated++;
794 bool CTransaction::RemoveFromMemoryPool()
796 // Remove transaction from memory pool
797 CRITICAL_BLOCK(cs_mapTransactions)
799 foreach(const CTxIn& txin, vin)
800 mapNextTx.erase(txin.prevout);
801 mapTransactions.erase(GetHash());
802 nTransactionsUpdated++;
812 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
814 if (hashBlock == 0 || nIndex == -1)
817 // Find the block it claims to be in
818 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
819 if (mi == mapBlockIndex.end())
821 CBlockIndex* pindex = (*mi).second;
822 if (!pindex || !pindex->IsInMainChain())
825 // Make sure the merkle branch connects to this block
826 if (!fMerkleVerified)
828 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
830 fMerkleVerified = true;
833 nHeightRet = pindex->nHeight;
834 return pindexBest->nHeight - pindex->nHeight + 1;
838 int CMerkleTx::GetBlocksToMaturity() const
842 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
846 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
850 if (!IsInMainChain() && !ClientConnectInputs())
852 return CTransaction::AcceptToMemoryPool(txdb, false);
856 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
862 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
864 CRITICAL_BLOCK(cs_mapTransactions)
866 // Add previous supporting transactions first
867 foreach(CMerkleTx& tx, vtxPrev)
869 if (!tx.IsCoinBase())
871 uint256 hash = tx.GetHash();
872 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
873 tx.AcceptToMemoryPool(txdb, fCheckInputs);
876 return AcceptToMemoryPool(txdb, fCheckInputs);
881 int ScanForWalletTransactions(CBlockIndex* pindexStart)
885 CBlockIndex* pindex = pindexStart;
886 CRITICAL_BLOCK(cs_mapWallet)
891 block.ReadFromDisk(pindex, true);
892 foreach(CTransaction& tx, block.vtx)
894 uint256 hash = tx.GetHash();
895 if (mapWallet.count(hash)) continue;
896 AddToWalletIfMine(tx, &block);
897 if (mapWallet.count(hash))
900 printf("Added missing RECEIVE %s\n", hash.ToString().c_str());
903 AddToWalletIfFromMe(tx, &block);
904 if (mapWallet.count(hash))
907 printf("Added missing SEND %s\n", hash.ToString().c_str());
911 pindex = pindex->pnext;
917 void ReacceptWalletTransactions()
921 while (fRepeat) CRITICAL_BLOCK(cs_mapWallet)
924 vector<CDiskTxPos> vMissingTx;
925 foreach(PAIRTYPE(const uint256, CWalletTx)& item, mapWallet)
927 CWalletTx& wtx = item.second;
928 if (wtx.fSpent && wtx.IsCoinBase())
932 if (txdb.ReadTxIndex(wtx.GetHash(), txindex))
934 // Update fSpent if a tx got spent somewhere else by a copy of wallet.dat
937 if (txindex.vSpent.size() != wtx.vout.size())
939 printf("ERROR: ReacceptWalletTransactions() : txindex.vSpent.size() %d != wtx.vout.size() %d\n", txindex.vSpent.size(), wtx.vout.size());
942 for (int i = 0; i < txindex.vSpent.size(); i++)
944 if (!txindex.vSpent[i].IsNull() && wtx.vout[i].IsMine())
947 vMissingTx.push_back(txindex.vSpent[i]);
952 printf("ReacceptWalletTransactions found spent coin %sbc %s\n", FormatMoney(wtx.GetCredit()).c_str(), wtx.GetHash().ToString().c_str());
959 // Reaccept any txes of ours that aren't already in a block
960 if (!wtx.IsCoinBase())
961 wtx.AcceptWalletTransaction(txdb, false);
964 if (!vMissingTx.empty())
966 // TODO: optimize this to scan just part of the block chain?
967 if (ScanForWalletTransactions(pindexGenesisBlock))
968 fRepeat = true; // Found missing transactions: re-do Reaccept.
974 void CWalletTx::RelayWalletTransaction(CTxDB& txdb)
976 foreach(const CMerkleTx& tx, vtxPrev)
978 if (!tx.IsCoinBase())
980 uint256 hash = tx.GetHash();
981 if (!txdb.ContainsTx(hash))
982 RelayMessage(CInv(MSG_TX, hash), (CTransaction)tx);
987 uint256 hash = GetHash();
988 if (!txdb.ContainsTx(hash))
990 printf("Relaying wtx %s\n", hash.ToString().substr(0,10).c_str());
991 RelayMessage(CInv(MSG_TX, hash), (CTransaction)*this);
996 void ResendWalletTransactions()
998 // Do this infrequently and randomly to avoid giving away
999 // that these are our transactions.
1000 static int64 nNextTime;
1001 if (GetTime() < nNextTime)
1003 bool fFirst = (nNextTime == 0);
1004 nNextTime = GetTime() + GetRand(30 * 60);
1008 // Only do it if there's been a new block since last time
1009 static int64 nLastTime;
1010 if (nTimeBestReceived < nLastTime)
1012 nLastTime = GetTime();
1014 // Rebroadcast any of our txes that aren't in a block yet
1015 printf("ResendWalletTransactions()\n");
1017 CRITICAL_BLOCK(cs_mapWallet)
1019 // Sort them in chronological order
1020 multimap<unsigned int, CWalletTx*> mapSorted;
1021 foreach(PAIRTYPE(const uint256, CWalletTx)& item, mapWallet)
1023 CWalletTx& wtx = item.second;
1024 // Don't rebroadcast until it's had plenty of time that
1025 // it should have gotten in already by now.
1026 if (nTimeBestReceived - (int64)wtx.nTimeReceived > 5 * 60)
1027 mapSorted.insert(make_pair(wtx.nTimeReceived, &wtx));
1029 foreach(PAIRTYPE(const unsigned int, CWalletTx*)& item, mapSorted)
1031 CWalletTx& wtx = *item.second;
1032 wtx.RelayWalletTransaction(txdb);
1037 int CTxIndex::GetDepthInMainChain() const
1039 // Read block header
1041 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
1043 // Find the block in the index
1044 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
1045 if (mi == mapBlockIndex.end())
1047 CBlockIndex* pindex = (*mi).second;
1048 if (!pindex || !pindex->IsInMainChain())
1050 return 1 + nBestHeight - pindex->nHeight;
1062 //////////////////////////////////////////////////////////////////////////////
1064 // CBlock and CBlockIndex
1067 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
1069 if (!fReadTransactions)
1071 *this = pindex->GetBlockHeader();
1074 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
1076 if (GetHash() != pindex->GetBlockHash())
1077 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
1081 uint256 GetOrphanRoot(const CBlock* pblock)
1083 // Work back to the first block in the orphan chain
1084 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
1085 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
1086 return pblock->GetHash();
1089 int64 GetBlockValue(int nHeight, int64 nFees)
1091 int64 nSubsidy = 50 * COIN;
1093 // Subsidy is cut in half every 4 years
1094 nSubsidy >>= (nHeight / 210000);
1096 return nSubsidy + nFees;
1099 unsigned int GetNextWorkRequired(const CBlockIndex* pindexLast)
1101 const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
1102 const int64 nTargetSpacing = 10 * 60;
1103 const int64 nInterval = nTargetTimespan / nTargetSpacing;
1106 if (pindexLast == NULL)
1107 return bnProofOfWorkLimit.GetCompact();
1109 // Only change once per interval
1110 if ((pindexLast->nHeight+1) % nInterval != 0)
1111 return pindexLast->nBits;
1113 // Go back by what we want to be 14 days worth of blocks
1114 const CBlockIndex* pindexFirst = pindexLast;
1115 for (int i = 0; pindexFirst && i < nInterval-1; i++)
1116 pindexFirst = pindexFirst->pprev;
1117 assert(pindexFirst);
1119 // Limit adjustment step
1120 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
1121 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
1122 if (nActualTimespan < nTargetTimespan/4)
1123 nActualTimespan = nTargetTimespan/4;
1124 if (nActualTimespan > nTargetTimespan*4)
1125 nActualTimespan = nTargetTimespan*4;
1129 bnNew.SetCompact(pindexLast->nBits);
1130 bnNew *= nActualTimespan;
1131 bnNew /= nTargetTimespan;
1133 if (bnNew > bnProofOfWorkLimit)
1134 bnNew = bnProofOfWorkLimit;
1137 printf("GetNextWorkRequired RETARGET\n");
1138 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
1139 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
1140 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
1142 return bnNew.GetCompact();
1145 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1148 bnTarget.SetCompact(nBits);
1151 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1152 return error("CheckProofOfWork() : nBits below minimum work");
1154 // Check proof of work matches claimed amount
1155 if (hash > bnTarget.getuint256())
1156 return error("CheckProofOfWork() : hash doesn't match nBits");
1161 bool IsInitialBlockDownload()
1163 if (pindexBest == NULL || (!fTestNet && nBestHeight < 105000))
1165 static int64 nLastUpdate;
1166 static CBlockIndex* pindexLastBest;
1167 if (pindexBest != pindexLastBest)
1169 pindexLastBest = pindexBest;
1170 nLastUpdate = GetTime();
1172 return (GetTime() - nLastUpdate < 10 &&
1173 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
1176 void InvalidChainFound(CBlockIndex* pindexNew)
1178 if (pindexNew->bnChainWork > bnBestInvalidWork)
1180 bnBestInvalidWork = pindexNew->bnChainWork;
1181 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
1184 printf("InvalidChainFound: invalid block=%s height=%d work=%s\n", pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight, pindexNew->bnChainWork.ToString().c_str());
1185 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1186 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1187 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
1200 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1202 // Relinquish previous transactions' spent pointers
1205 foreach(const CTxIn& txin, vin)
1207 COutPoint prevout = txin.prevout;
1209 // Get prev txindex from disk
1211 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1212 return error("DisconnectInputs() : ReadTxIndex failed");
1214 if (prevout.n >= txindex.vSpent.size())
1215 return error("DisconnectInputs() : prevout.n out of range");
1217 // Mark outpoint as not spent
1218 txindex.vSpent[prevout.n].SetNull();
1221 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1222 return error("DisconnectInputs() : UpdateTxIndex failed");
1226 // Remove transaction from index
1227 if (!txdb.EraseTxIndex(*this))
1228 return error("DisconnectInputs() : EraseTxPos failed");
1234 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
1235 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
1237 // Take over previous transactions' spent pointers
1241 for (int i = 0; i < vin.size(); i++)
1243 COutPoint prevout = vin[i].prevout;
1248 if (fMiner && mapTestPool.count(prevout.hash))
1250 // Get txindex from current proposed changes
1251 txindex = mapTestPool[prevout.hash];
1255 // Read txindex from txdb
1256 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1258 if (!fFound && (fBlock || fMiner))
1259 return fMiner ? false : error("ConnectInputs() : %s prev tx %s index entry not found", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1262 CTransaction txPrev;
1263 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1265 // Get prev tx from single transactions in memory
1266 CRITICAL_BLOCK(cs_mapTransactions)
1268 if (!mapTransactions.count(prevout.hash))
1269 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1270 txPrev = mapTransactions[prevout.hash];
1273 txindex.vSpent.resize(txPrev.vout.size());
1277 // Get prev tx from disk
1278 if (!txPrev.ReadFromDisk(txindex.pos))
1279 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1282 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1283 return error("ConnectInputs() : %s prevout.n out of range %d %d %d 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());
1285 // If prev is coinbase, check that it's matured
1286 if (txPrev.IsCoinBase())
1287 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1288 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1289 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1292 if (!VerifySignature(txPrev, *this, i))
1293 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1295 // Check for conflicts
1296 if (!txindex.vSpent[prevout.n].IsNull())
1297 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());
1299 // Check for negative or overflow input values
1300 nValueIn += txPrev.vout[prevout.n].nValue;
1301 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1302 return error("ConnectInputs() : txin values out of range");
1304 // Mark outpoints as spent
1305 txindex.vSpent[prevout.n] = posThisTx;
1310 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1311 return error("ConnectInputs() : UpdateTxIndex failed");
1315 mapTestPool[prevout.hash] = txindex;
1319 if (nValueIn < GetValueOut())
1320 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
1322 // Tally transaction fees
1323 int64 nTxFee = nValueIn - GetValueOut();
1325 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
1326 if (nTxFee < nMinFee)
1329 if (!MoneyRange(nFees))
1330 return error("ConnectInputs() : nFees out of range");
1335 // Add transaction to disk index
1336 if (!txdb.AddTxIndex(*this, posThisTx, pindexBlock->nHeight))
1337 return error("ConnectInputs() : AddTxPos failed");
1341 // Add transaction to test pool
1342 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
1349 bool CTransaction::ClientConnectInputs()
1354 // Take over previous transactions' spent pointers
1355 CRITICAL_BLOCK(cs_mapTransactions)
1358 for (int i = 0; i < vin.size(); i++)
1360 // Get prev tx from single transactions in memory
1361 COutPoint prevout = vin[i].prevout;
1362 if (!mapTransactions.count(prevout.hash))
1364 CTransaction& txPrev = mapTransactions[prevout.hash];
1366 if (prevout.n >= txPrev.vout.size())
1370 if (!VerifySignature(txPrev, *this, i))
1371 return error("ConnectInputs() : VerifySignature failed");
1373 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1374 ///// this has to go away now that posNext is gone
1375 // // Check for conflicts
1376 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1377 // return error("ConnectInputs() : prev tx already used");
1379 // // Flag outpoints as used
1380 // txPrev.vout[prevout.n].posNext = posThisTx;
1382 nValueIn += txPrev.vout[prevout.n].nValue;
1384 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1385 return error("ClientConnectInputs() : txin values out of range");
1387 if (GetValueOut() > nValueIn)
1397 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1399 // Disconnect in reverse order
1400 for (int i = vtx.size()-1; i >= 0; i--)
1401 if (!vtx[i].DisconnectInputs(txdb))
1404 // Update block index on disk without changing it in memory.
1405 // The memory index structure will be changed after the db commits.
1408 CDiskBlockIndex blockindexPrev(pindex->pprev);
1409 blockindexPrev.hashNext = 0;
1410 if (!txdb.WriteBlockIndex(blockindexPrev))
1411 return error("DisconnectBlock() : WriteBlockIndex failed");
1417 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1419 // Check it again in case a previous version let a bad block in
1423 //// issue here: it doesn't know the version
1424 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1426 map<uint256, CTxIndex> mapUnused;
1428 foreach(CTransaction& tx, vtx)
1430 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1431 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1433 if (!tx.ConnectInputs(txdb, mapUnused, posThisTx, pindex, nFees, true, false))
1437 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1440 // Update block index on disk without changing it in memory.
1441 // The memory index structure will be changed after the db commits.
1444 CDiskBlockIndex blockindexPrev(pindex->pprev);
1445 blockindexPrev.hashNext = pindex->GetBlockHash();
1446 if (!txdb.WriteBlockIndex(blockindexPrev))
1447 return error("ConnectBlock() : WriteBlockIndex failed");
1450 // Watch for transactions paying to me
1451 foreach(CTransaction& tx, vtx)
1452 AddToWalletIfMine(tx, this);
1457 bool Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1459 printf("REORGANIZE\n");
1462 CBlockIndex* pfork = pindexBest;
1463 CBlockIndex* plonger = pindexNew;
1464 while (pfork != plonger)
1466 while (plonger->nHeight > pfork->nHeight)
1467 if (!(plonger = plonger->pprev))
1468 return error("Reorganize() : plonger->pprev is null");
1469 if (pfork == plonger)
1471 if (!(pfork = pfork->pprev))
1472 return error("Reorganize() : pfork->pprev is null");
1475 // List of what to disconnect
1476 vector<CBlockIndex*> vDisconnect;
1477 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1478 vDisconnect.push_back(pindex);
1480 // List of what to connect
1481 vector<CBlockIndex*> vConnect;
1482 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1483 vConnect.push_back(pindex);
1484 reverse(vConnect.begin(), vConnect.end());
1486 // Disconnect shorter branch
1487 vector<CTransaction> vResurrect;
1488 foreach(CBlockIndex* pindex, vDisconnect)
1491 if (!block.ReadFromDisk(pindex))
1492 return error("Reorganize() : ReadFromDisk for disconnect failed");
1493 if (!block.DisconnectBlock(txdb, pindex))
1494 return error("Reorganize() : DisconnectBlock failed");
1496 // Queue memory transactions to resurrect
1497 foreach(const CTransaction& tx, block.vtx)
1498 if (!tx.IsCoinBase())
1499 vResurrect.push_back(tx);
1502 // Connect longer branch
1503 vector<CTransaction> vDelete;
1504 for (int i = 0; i < vConnect.size(); i++)
1506 CBlockIndex* pindex = vConnect[i];
1508 if (!block.ReadFromDisk(pindex))
1509 return error("Reorganize() : ReadFromDisk for connect failed");
1510 if (!block.ConnectBlock(txdb, pindex))
1514 return error("Reorganize() : ConnectBlock failed");
1517 // Queue memory transactions to delete
1518 foreach(const CTransaction& tx, block.vtx)
1519 vDelete.push_back(tx);
1521 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1522 return error("Reorganize() : WriteHashBestChain failed");
1524 // Make sure it's successfully written to disk before changing memory structure
1525 if (!txdb.TxnCommit())
1526 return error("Reorganize() : TxnCommit failed");
1528 // Disconnect shorter branch
1529 foreach(CBlockIndex* pindex, vDisconnect)
1531 pindex->pprev->pnext = NULL;
1533 // Connect longer branch
1534 foreach(CBlockIndex* pindex, vConnect)
1536 pindex->pprev->pnext = pindex;
1538 // Resurrect memory transactions that were in the disconnected branch
1539 foreach(CTransaction& tx, vResurrect)
1540 tx.AcceptToMemoryPool(txdb, false);
1542 // Delete redundant memory transactions that are in the connected branch
1543 foreach(CTransaction& tx, vDelete)
1544 tx.RemoveFromMemoryPool();
1550 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1552 uint256 hash = GetHash();
1555 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1557 txdb.WriteHashBestChain(hash);
1558 if (!txdb.TxnCommit())
1559 return error("SetBestChain() : TxnCommit failed");
1560 pindexGenesisBlock = pindexNew;
1562 else if (hashPrevBlock == hashBestChain)
1564 // Adding to current best branch
1565 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1568 InvalidChainFound(pindexNew);
1569 return error("SetBestChain() : ConnectBlock failed");
1571 if (!txdb.TxnCommit())
1572 return error("SetBestChain() : TxnCommit failed");
1574 // Add to current best branch
1575 pindexNew->pprev->pnext = pindexNew;
1577 // Delete redundant memory transactions
1578 foreach(CTransaction& tx, vtx)
1579 tx.RemoveFromMemoryPool();
1584 if (!Reorganize(txdb, pindexNew))
1587 InvalidChainFound(pindexNew);
1588 return error("SetBestChain() : Reorganize failed");
1593 hashBestChain = hash;
1594 pindexBest = pindexNew;
1595 nBestHeight = pindexBest->nHeight;
1596 bnBestChainWork = pindexNew->bnChainWork;
1597 nTimeBestReceived = GetTime();
1598 nTransactionsUpdated++;
1599 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1605 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1607 // Check for duplicate
1608 uint256 hash = GetHash();
1609 if (mapBlockIndex.count(hash))
1610 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1612 // Construct new block index object
1613 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1615 return error("AddToBlockIndex() : new CBlockIndex failed");
1616 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1617 pindexNew->phashBlock = &((*mi).first);
1618 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1619 if (miPrev != mapBlockIndex.end())
1621 pindexNew->pprev = (*miPrev).second;
1622 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1624 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1628 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1629 if (!txdb.TxnCommit())
1633 if (pindexNew->bnChainWork > bnBestChainWork)
1634 if (!SetBestChain(txdb, pindexNew))
1639 if (pindexNew == pindexBest)
1641 // Notify UI to display prev block's coinbase if it was ours
1642 static uint256 hashPrevBestCoinBase;
1643 CRITICAL_BLOCK(cs_mapWallet)
1644 vWalletUpdated.push_back(hashPrevBestCoinBase);
1645 hashPrevBestCoinBase = vtx[0].GetHash();
1655 bool CBlock::CheckBlock() const
1657 // These are checks that are independent of context
1658 // that can be verified before saving an orphan block.
1661 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1662 return error("CheckBlock() : size limits failed");
1664 // Check proof of work matches claimed amount
1665 if (!CheckProofOfWork(GetHash(), nBits))
1666 return error("CheckBlock() : proof of work failed");
1669 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1670 return error("CheckBlock() : block timestamp too far in the future");
1672 // First transaction must be coinbase, the rest must not be
1673 if (vtx.empty() || !vtx[0].IsCoinBase())
1674 return error("CheckBlock() : first tx is not coinbase");
1675 for (int i = 1; i < vtx.size(); i++)
1676 if (vtx[i].IsCoinBase())
1677 return error("CheckBlock() : more than one coinbase");
1679 // Check transactions
1680 foreach(const CTransaction& tx, vtx)
1681 if (!tx.CheckTransaction())
1682 return error("CheckBlock() : CheckTransaction failed");
1684 // Check that it's not full of nonstandard transactions
1685 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1686 return error("CheckBlock() : too many nonstandard transactions");
1689 if (hashMerkleRoot != BuildMerkleTree())
1690 return error("CheckBlock() : hashMerkleRoot mismatch");
1695 bool CBlock::AcceptBlock()
1697 // Check for duplicate
1698 uint256 hash = GetHash();
1699 if (mapBlockIndex.count(hash))
1700 return error("AcceptBlock() : block already in mapBlockIndex");
1702 // Get prev block index
1703 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1704 if (mi == mapBlockIndex.end())
1705 return error("AcceptBlock() : prev block not found");
1706 CBlockIndex* pindexPrev = (*mi).second;
1707 int nHeight = pindexPrev->nHeight+1;
1709 // Check proof of work
1710 if (nBits != GetNextWorkRequired(pindexPrev))
1711 return error("AcceptBlock() : incorrect proof of work");
1713 // Check timestamp against prev
1714 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1715 return error("AcceptBlock() : block's timestamp is too early");
1717 // Check that all transactions are finalized
1718 foreach(const CTransaction& tx, vtx)
1719 if (!tx.IsFinal(nHeight, GetBlockTime()))
1720 return error("AcceptBlock() : contains a non-final transaction");
1722 // Check that the block chain matches the known block chain up to a checkpoint
1724 if ((nHeight == 11111 && hash != uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d")) ||
1725 (nHeight == 33333 && hash != uint256("0x000000002dd5588a74784eaa7ab0507a18ad16a236e7b1ce69f00d7ddfb5d0a6")) ||
1726 (nHeight == 68555 && hash != uint256("0x00000000001e1b4903550a0b96e9a9405c8a95f387162e4944e8d9fbe501cd6a")) ||
1727 (nHeight == 70567 && hash != uint256("0x00000000006a49b14bcf27462068f1264c961f11fa2e0eddd2be0791e1d4124a")) ||
1728 (nHeight == 74000 && hash != uint256("0x0000000000573993a3c9e41ce34471c079dcf5f52a0e824a81e7f953b8661a20")) ||
1729 (nHeight == 105000 && hash != uint256("0x00000000000291ce28027faea320c8d2b054b2e0fe44a773f3eefb151d6bdc97")))
1730 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1732 // Write block to history file
1733 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1734 return error("AcceptBlock() : out of disk space");
1735 unsigned int nFile = -1;
1736 unsigned int nBlockPos = 0;
1737 if (!WriteToDisk(nFile, nBlockPos))
1738 return error("AcceptBlock() : WriteToDisk failed");
1739 if (!AddToBlockIndex(nFile, nBlockPos))
1740 return error("AcceptBlock() : AddToBlockIndex failed");
1742 // Relay inventory, but don't relay old inventory during initial block download
1743 if (hashBestChain == hash)
1744 CRITICAL_BLOCK(cs_vNodes)
1745 foreach(CNode* pnode, vNodes)
1746 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 105000))
1747 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1752 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1754 // Check for duplicate
1755 uint256 hash = pblock->GetHash();
1756 if (mapBlockIndex.count(hash))
1757 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1758 if (mapOrphanBlocks.count(hash))
1759 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1761 // Preliminary checks
1762 if (!pblock->CheckBlock())
1763 return error("ProcessBlock() : CheckBlock FAILED");
1765 // If don't already have its previous block, shunt it off to holding area until we get it
1766 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1768 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1769 CBlock* pblock2 = new CBlock(*pblock);
1770 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1771 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1773 // Ask this guy to fill in what we're missing
1775 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1780 if (!pblock->AcceptBlock())
1781 return error("ProcessBlock() : AcceptBlock FAILED");
1783 // Recursively process any orphan blocks that depended on this one
1784 vector<uint256> vWorkQueue;
1785 vWorkQueue.push_back(hash);
1786 for (int i = 0; i < vWorkQueue.size(); i++)
1788 uint256 hashPrev = vWorkQueue[i];
1789 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1790 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1793 CBlock* pblockOrphan = (*mi).second;
1794 if (pblockOrphan->AcceptBlock())
1795 vWorkQueue.push_back(pblockOrphan->GetHash());
1796 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1797 delete pblockOrphan;
1799 mapOrphanBlocksByPrev.erase(hashPrev);
1802 printf("ProcessBlock: ACCEPTED\n");
1813 template<typename Stream>
1814 bool ScanMessageStart(Stream& s)
1816 // Scan ahead to the next pchMessageStart, which should normally be immediately
1817 // at the file pointer. Leaves file pointer at end of pchMessageStart.
1819 short prevmask = s.exceptions(0);
1820 const char* p = BEGIN(pchMessageStart);
1830 s.exceptions(prevmask);
1834 p = BEGIN(pchMessageStart);
1837 if (++p == END(pchMessageStart))
1840 s.exceptions(prevmask);
1849 s.exceptions(prevmask);
1854 bool CheckDiskSpace(uint64 nAdditionalBytes)
1856 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1858 // Check for 15MB because database could create another 10MB log file at any time
1859 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1862 string strMessage = _("Warning: Disk space is low ");
1863 strMiscWarning = strMessage;
1864 printf("*** %s\n", strMessage.c_str());
1865 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1866 CreateThread(Shutdown, NULL);
1872 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1876 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1879 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1881 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1890 static unsigned int nCurrentBlockFile = 1;
1892 FILE* AppendBlockFile(unsigned int& nFileRet)
1897 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1900 if (fseek(file, 0, SEEK_END) != 0)
1902 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1903 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1905 nFileRet = nCurrentBlockFile;
1909 nCurrentBlockFile++;
1913 bool LoadBlockIndex(bool fAllowNew)
1917 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1918 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1919 pchMessageStart[0] = 0xfa;
1920 pchMessageStart[1] = 0xbf;
1921 pchMessageStart[2] = 0xb5;
1922 pchMessageStart[3] = 0xda;
1929 if (!txdb.LoadBlockIndex())
1934 // Init with genesis block
1936 if (mapBlockIndex.empty())
1942 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1943 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1944 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1945 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1946 // vMerkleTree: 4a5e1e
1949 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1951 txNew.vin.resize(1);
1952 txNew.vout.resize(1);
1953 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1954 txNew.vout[0].nValue = 50 * COIN;
1955 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1957 block.vtx.push_back(txNew);
1958 block.hashPrevBlock = 0;
1959 block.hashMerkleRoot = block.BuildMerkleTree();
1961 block.nTime = 1231006505;
1962 block.nBits = 0x1d00ffff;
1963 block.nNonce = 2083236893;
1967 block.nTime = 1296688602;
1968 block.nBits = 0x1d07fff8;
1969 block.nNonce = 384568319;
1973 printf("%s\n", block.GetHash().ToString().c_str());
1974 printf("%s\n", hashGenesisBlock.ToString().c_str());
1975 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1976 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1978 assert(block.GetHash() == hashGenesisBlock);
1980 // Start new block file
1982 unsigned int nBlockPos;
1983 if (!block.WriteToDisk(nFile, nBlockPos))
1984 return error("LoadBlockIndex() : writing genesis block to disk failed");
1985 if (!block.AddToBlockIndex(nFile, nBlockPos))
1986 return error("LoadBlockIndex() : genesis block not accepted");
1994 void PrintBlockTree()
1996 // precompute tree structure
1997 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1998 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2000 CBlockIndex* pindex = (*mi).second;
2001 mapNext[pindex->pprev].push_back(pindex);
2003 //while (rand() % 3 == 0)
2004 // mapNext[pindex->pprev].push_back(pindex);
2007 vector<pair<int, CBlockIndex*> > vStack;
2008 vStack.push_back(make_pair(0, pindexGenesisBlock));
2011 while (!vStack.empty())
2013 int nCol = vStack.back().first;
2014 CBlockIndex* pindex = vStack.back().second;
2017 // print split or gap
2018 if (nCol > nPrevCol)
2020 for (int i = 0; i < nCol-1; i++)
2024 else if (nCol < nPrevCol)
2026 for (int i = 0; i < nCol; i++)
2033 for (int i = 0; i < nCol; i++)
2038 block.ReadFromDisk(pindex);
2039 printf("%d (%u,%u) %s %s tx %d",
2043 block.GetHash().ToString().substr(0,20).c_str(),
2044 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2047 CRITICAL_BLOCK(cs_mapWallet)
2049 if (mapWallet.count(block.vtx[0].GetHash()))
2051 CWalletTx& wtx = mapWallet[block.vtx[0].GetHash()];
2052 printf(" mine: %d %d %d", wtx.GetDepthInMainChain(), wtx.GetBlocksToMaturity(), wtx.GetCredit());
2058 // put the main timechain first
2059 vector<CBlockIndex*>& vNext = mapNext[pindex];
2060 for (int i = 0; i < vNext.size(); i++)
2062 if (vNext[i]->pnext)
2064 swap(vNext[0], vNext[i]);
2070 for (int i = 0; i < vNext.size(); i++)
2071 vStack.push_back(make_pair(nCol+i, vNext[i]));
2084 //////////////////////////////////////////////////////////////////////////////
2089 map<uint256, CAlert> mapAlerts;
2090 CCriticalSection cs_mapAlerts;
2092 string GetWarnings(string strFor)
2095 string strStatusBar;
2097 if (GetBoolArg("-testsafemode"))
2100 // Misc warnings like out of disk space and clock is wrong
2101 if (strMiscWarning != "")
2104 strStatusBar = strMiscWarning;
2107 // Longer invalid proof-of-work chain
2108 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2111 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2115 CRITICAL_BLOCK(cs_mapAlerts)
2117 foreach(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2119 const CAlert& alert = item.second;
2120 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2122 nPriority = alert.nPriority;
2123 strStatusBar = alert.strStatusBar;
2128 if (strFor == "statusbar")
2129 return strStatusBar;
2130 else if (strFor == "rpc")
2132 assert(("GetWarnings() : invalid parameter", false));
2136 bool CAlert::ProcessAlert()
2138 if (!CheckSignature())
2143 CRITICAL_BLOCK(cs_mapAlerts)
2145 // Cancel previous alerts
2146 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2148 const CAlert& alert = (*mi).second;
2151 printf("cancelling alert %d\n", alert.nID);
2152 mapAlerts.erase(mi++);
2154 else if (!alert.IsInEffect())
2156 printf("expiring alert %d\n", alert.nID);
2157 mapAlerts.erase(mi++);
2163 // Check if this alert has been cancelled
2164 foreach(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2166 const CAlert& alert = item.second;
2167 if (alert.Cancels(*this))
2169 printf("alert already cancelled by %d\n", alert.nID);
2175 mapAlerts.insert(make_pair(GetHash(), *this));
2178 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2190 //////////////////////////////////////////////////////////////////////////////
2196 bool AlreadyHave(CTxDB& txdb, const CInv& inv)
2200 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2201 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2203 // Don't know what it is, just say we already got one
2210 // The message start string is designed to be unlikely to occur in normal data.
2211 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2212 // a large 4-byte int at any alignment.
2213 char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2216 bool ProcessMessages(CNode* pfrom)
2218 CDataStream& vRecv = pfrom->vRecv;
2222 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2226 // (4) message start
2235 // Scan for message start
2236 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2237 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2238 if (vRecv.end() - pstart < nHeaderSize)
2240 if (vRecv.size() > nHeaderSize)
2242 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2243 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2247 if (pstart - vRecv.begin() > 0)
2248 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2249 vRecv.erase(vRecv.begin(), pstart);
2252 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2257 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2260 string strCommand = hdr.GetCommand();
2263 unsigned int nMessageSize = hdr.nMessageSize;
2264 if (nMessageSize > MAX_SIZE)
2266 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2269 if (nMessageSize > vRecv.size())
2271 // Rewind and wait for rest of message
2272 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2277 if (vRecv.GetVersion() >= 209)
2279 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2280 unsigned int nChecksum = 0;
2281 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2282 if (nChecksum != hdr.nChecksum)
2284 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2285 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2290 // Copy message to its own buffer
2291 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2292 vRecv.ignore(nMessageSize);
2298 CRITICAL_BLOCK(cs_main)
2299 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2303 catch (std::ios_base::failure& e)
2305 if (strstr(e.what(), "end of data"))
2307 // Allow exceptions from underlength message on vRecv
2308 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught, normally caused by a message being shorter than its stated length\n", strCommand.c_str(), nMessageSize, e.what());
2310 else if (strstr(e.what(), "size too large"))
2312 // Allow exceptions from overlong size
2313 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2317 PrintExceptionContinue(&e, "ProcessMessage()");
2320 catch (std::exception& e) {
2321 PrintExceptionContinue(&e, "ProcessMessage()");
2323 PrintExceptionContinue(NULL, "ProcessMessage()");
2327 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2337 bool ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2339 static map<unsigned int, vector<unsigned char> > mapReuseKey;
2340 RandAddSeedPerfmon();
2342 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2343 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2344 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2346 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2354 if (strCommand == "version")
2356 // Each connection can only send one version message
2357 if (pfrom->nVersion != 0)
2364 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2365 if (pfrom->nVersion == 10300)
2366 pfrom->nVersion = 300;
2367 if (pfrom->nVersion >= 106 && !vRecv.empty())
2368 vRecv >> addrFrom >> nNonce;
2369 if (pfrom->nVersion >= 106 && !vRecv.empty())
2370 vRecv >> pfrom->strSubVer;
2371 if (pfrom->nVersion >= 209 && !vRecv.empty())
2372 vRecv >> pfrom->nStartingHeight;
2374 if (pfrom->nVersion == 0)
2377 // Disconnect if we connected to ourself
2378 if (nNonce == nLocalHostNonce && nNonce > 1)
2380 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2381 pfrom->fDisconnect = true;
2385 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2387 AddTimeData(pfrom->addr.ip, nTime);
2390 if (pfrom->nVersion >= 209)
2391 pfrom->PushMessage("verack");
2392 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
2393 if (pfrom->nVersion < 209)
2394 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2396 if (!pfrom->fInbound)
2398 // Advertise our address
2399 if (addrLocalHost.IsRoutable() && !fUseProxy)
2401 CAddress addr(addrLocalHost);
2402 addr.nTime = GetAdjustedTime();
2403 pfrom->PushAddress(addr);
2406 // Get recent addresses
2407 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2409 pfrom->PushMessage("getaddr");
2410 pfrom->fGetAddr = true;
2414 // Ask the first connected node for block updates
2415 static int nAskedForBlocks;
2416 if (!pfrom->fClient && (nAskedForBlocks < 1 || vNodes.size() <= 1))
2419 pfrom->PushGetBlocks(pindexBest, uint256(0));
2423 CRITICAL_BLOCK(cs_mapAlerts)
2424 foreach(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2425 item.second.RelayTo(pfrom);
2427 pfrom->fSuccessfullyConnected = true;
2429 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2433 else if (pfrom->nVersion == 0)
2435 // Must have a version message before anything else
2440 else if (strCommand == "verack")
2442 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2446 else if (strCommand == "addr")
2448 vector<CAddress> vAddr;
2451 // Don't want addr from older versions unless seeding
2452 if (pfrom->nVersion < 209)
2454 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2456 if (vAddr.size() > 1000)
2457 return error("message addr size() = %d", vAddr.size());
2459 // Store the new addresses
2460 int64 nNow = GetAdjustedTime();
2461 int64 nSince = nNow - 10 * 60;
2462 foreach(CAddress& addr, vAddr)
2466 // ignore IPv6 for now, since it isn't implemented anyway
2469 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2470 addr.nTime = nNow - 5 * 24 * 60 * 60;
2471 AddAddress(addr, 2 * 60 * 60);
2472 pfrom->AddAddressKnown(addr);
2473 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2475 // Relay to a limited number of other nodes
2476 CRITICAL_BLOCK(cs_vNodes)
2478 // Use deterministic randomness to send to the same nodes for 24 hours
2479 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2480 static uint256 hashSalt;
2482 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2483 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
2484 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2485 multimap<uint256, CNode*> mapMix;
2486 foreach(CNode* pnode, vNodes)
2488 if (pnode->nVersion < 31402)
2490 unsigned int nPointer;
2491 memcpy(&nPointer, &pnode, sizeof(nPointer));
2492 uint256 hashKey = hashRand ^ nPointer;
2493 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2494 mapMix.insert(make_pair(hashKey, pnode));
2496 int nRelayNodes = 2;
2497 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2498 ((*mi).second)->PushAddress(addr);
2502 if (vAddr.size() < 1000)
2503 pfrom->fGetAddr = false;
2507 else if (strCommand == "inv")
2511 if (vInv.size() > 50000)
2512 return error("message inv size() = %d", vInv.size());
2515 foreach(const CInv& inv, vInv)
2519 pfrom->AddInventoryKnown(inv);
2521 bool fAlreadyHave = AlreadyHave(txdb, inv);
2522 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2526 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2527 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2529 // Track requests for our stuff
2530 CRITICAL_BLOCK(cs_mapRequestCount)
2532 map<uint256, int>::iterator mi = mapRequestCount.find(inv.hash);
2533 if (mi != mapRequestCount.end())
2540 else if (strCommand == "getdata")
2544 if (vInv.size() > 50000)
2545 return error("message getdata size() = %d", vInv.size());
2547 foreach(const CInv& inv, vInv)
2551 printf("received getdata for: %s\n", inv.ToString().c_str());
2553 if (inv.type == MSG_BLOCK)
2555 // Send block from disk
2556 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2557 if (mi != mapBlockIndex.end())
2560 block.ReadFromDisk((*mi).second);
2561 pfrom->PushMessage("block", block);
2563 // Trigger them to send a getblocks request for the next batch of inventory
2564 if (inv.hash == pfrom->hashContinue)
2566 // Bypass PushInventory, this must send even if redundant,
2567 // and we want it right after the last block so they don't
2568 // wait for other stuff first.
2570 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2571 pfrom->PushMessage("inv", vInv);
2572 pfrom->hashContinue = 0;
2576 else if (inv.IsKnownType())
2578 // Send stream from relay memory
2579 CRITICAL_BLOCK(cs_mapRelay)
2581 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2582 if (mi != mapRelay.end())
2583 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2587 // Track requests for our stuff
2588 CRITICAL_BLOCK(cs_mapRequestCount)
2590 map<uint256, int>::iterator mi = mapRequestCount.find(inv.hash);
2591 if (mi != mapRequestCount.end())
2598 else if (strCommand == "getblocks")
2600 CBlockLocator locator;
2602 vRecv >> locator >> hashStop;
2604 // Find the last block the caller has in the main chain
2605 CBlockIndex* pindex = locator.GetBlockIndex();
2607 // Send the rest of the chain
2609 pindex = pindex->pnext;
2610 int nLimit = 500 + locator.GetDistanceBack();
2611 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2612 for (; pindex; pindex = pindex->pnext)
2614 if (pindex->GetBlockHash() == hashStop)
2616 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
2619 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2622 // When this block is requested, we'll send an inv that'll make them
2623 // getblocks the next batch of inventory.
2624 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
2625 pfrom->hashContinue = pindex->GetBlockHash();
2632 else if (strCommand == "getheaders")
2634 CBlockLocator locator;
2636 vRecv >> locator >> hashStop;
2638 CBlockIndex* pindex = NULL;
2639 if (locator.IsNull())
2641 // If locator is null, return the hashStop block
2642 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2643 if (mi == mapBlockIndex.end())
2645 pindex = (*mi).second;
2649 // Find the last block the caller has in the main chain
2650 pindex = locator.GetBlockIndex();
2652 pindex = pindex->pnext;
2655 vector<CBlock> vHeaders;
2656 int nLimit = 2000 + locator.GetDistanceBack();
2657 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2658 for (; pindex; pindex = pindex->pnext)
2660 vHeaders.push_back(pindex->GetBlockHeader());
2661 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2664 pfrom->PushMessage("headers", vHeaders);
2668 else if (strCommand == "tx")
2670 vector<uint256> vWorkQueue;
2671 CDataStream vMsg(vRecv);
2675 CInv inv(MSG_TX, tx.GetHash());
2676 pfrom->AddInventoryKnown(inv);
2678 bool fMissingInputs = false;
2679 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2681 AddToWalletIfMine(tx, NULL);
2682 RelayMessage(inv, vMsg);
2683 mapAlreadyAskedFor.erase(inv);
2684 vWorkQueue.push_back(inv.hash);
2686 // Recursively process any orphan transactions that depended on this one
2687 for (int i = 0; i < vWorkQueue.size(); i++)
2689 uint256 hashPrev = vWorkQueue[i];
2690 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2691 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2694 const CDataStream& vMsg = *((*mi).second);
2696 CDataStream(vMsg) >> tx;
2697 CInv inv(MSG_TX, tx.GetHash());
2699 if (tx.AcceptToMemoryPool(true))
2701 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2702 AddToWalletIfMine(tx, NULL);
2703 RelayMessage(inv, vMsg);
2704 mapAlreadyAskedFor.erase(inv);
2705 vWorkQueue.push_back(inv.hash);
2710 foreach(uint256 hash, vWorkQueue)
2711 EraseOrphanTx(hash);
2713 else if (fMissingInputs)
2715 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2721 else if (strCommand == "block")
2726 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2729 CInv inv(MSG_BLOCK, block.GetHash());
2730 pfrom->AddInventoryKnown(inv);
2732 if (ProcessBlock(pfrom, &block))
2733 mapAlreadyAskedFor.erase(inv);
2737 else if (strCommand == "getaddr")
2739 // Nodes rebroadcast an addr every 24 hours
2740 pfrom->vAddrToSend.clear();
2741 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2742 CRITICAL_BLOCK(cs_mapAddresses)
2744 unsigned int nCount = 0;
2745 foreach(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2747 const CAddress& addr = item.second;
2748 if (addr.nTime > nSince)
2751 foreach(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2753 const CAddress& addr = item.second;
2754 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2755 pfrom->PushAddress(addr);
2761 else if (strCommand == "checkorder")
2766 if (!GetBoolArg("-allowreceivebyip"))
2768 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2775 /// we have a chance to check the order here
2777 // Keep giving the same key to the same ip until they use it
2778 if (!mapReuseKey.count(pfrom->addr.ip))
2779 mapReuseKey[pfrom->addr.ip] = GetKeyFromKeyPool();
2781 // Send back approval of order and pubkey to use
2782 CScript scriptPubKey;
2783 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2784 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2788 else if (strCommand == "submitorder")
2793 if (!GetBoolArg("-allowreceivebyip"))
2795 pfrom->PushMessage("reply", hashReply, (int)2);
2801 wtxNew.fFromMe = false;
2804 if (!wtxNew.AcceptWalletTransaction())
2806 pfrom->PushMessage("reply", hashReply, (int)1);
2807 return error("submitorder AcceptWalletTransaction() failed, returning error 1");
2809 wtxNew.fTimeReceivedIsTxTime = true;
2810 AddToWallet(wtxNew);
2811 wtxNew.RelayWalletTransaction();
2812 mapReuseKey.erase(pfrom->addr.ip);
2814 // Send back confirmation
2815 pfrom->PushMessage("reply", hashReply, (int)0);
2819 else if (strCommand == "reply")
2824 CRequestTracker tracker;
2825 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2827 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2828 if (mi != pfrom->mapRequests.end())
2830 tracker = (*mi).second;
2831 pfrom->mapRequests.erase(mi);
2834 if (!tracker.IsNull())
2835 tracker.fn(tracker.param1, vRecv);
2839 else if (strCommand == "ping")
2844 else if (strCommand == "alert")
2849 if (alert.ProcessAlert())
2852 pfrom->setKnown.insert(alert.GetHash());
2853 CRITICAL_BLOCK(cs_vNodes)
2854 foreach(CNode* pnode, vNodes)
2855 alert.RelayTo(pnode);
2862 // Ignore unknown commands for extensibility
2866 // Update the last seen time for this node's address
2867 if (pfrom->fNetworkNode)
2868 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2869 AddressCurrentlyConnected(pfrom->addr);
2883 bool SendMessages(CNode* pto, bool fSendTrickle)
2885 CRITICAL_BLOCK(cs_main)
2887 // Don't send anything until we get their version message
2888 if (pto->nVersion == 0)
2892 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2893 pto->PushMessage("ping");
2895 // Resend wallet transactions that haven't gotten in a block yet
2896 ResendWalletTransactions();
2898 // Address refresh broadcast
2899 static int64 nLastRebroadcast;
2900 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2902 nLastRebroadcast = GetTime();
2903 CRITICAL_BLOCK(cs_vNodes)
2905 foreach(CNode* pnode, vNodes)
2907 // Periodically clear setAddrKnown to allow refresh broadcasts
2908 pnode->setAddrKnown.clear();
2910 // Rebroadcast our address
2911 if (addrLocalHost.IsRoutable() && !fUseProxy)
2913 CAddress addr(addrLocalHost);
2914 addr.nTime = GetAdjustedTime();
2915 pnode->PushAddress(addr);
2921 // Clear out old addresses periodically so it's not too much work at once
2922 static int64 nLastClear;
2923 if (nLastClear == 0)
2924 nLastClear = GetTime();
2925 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2927 nLastClear = GetTime();
2928 CRITICAL_BLOCK(cs_mapAddresses)
2931 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2932 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2933 mi != mapAddresses.end();)
2935 const CAddress& addr = (*mi).second;
2936 if (addr.nTime < nSince)
2938 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2940 addrdb.EraseAddress(addr);
2941 mapAddresses.erase(mi++);
2955 vector<CAddress> vAddr;
2956 vAddr.reserve(pto->vAddrToSend.size());
2957 foreach(const CAddress& addr, pto->vAddrToSend)
2959 // returns true if wasn't already contained in the set
2960 if (pto->setAddrKnown.insert(addr).second)
2962 vAddr.push_back(addr);
2963 // receiver rejects addr messages larger than 1000
2964 if (vAddr.size() >= 1000)
2966 pto->PushMessage("addr", vAddr);
2971 pto->vAddrToSend.clear();
2973 pto->PushMessage("addr", vAddr);
2978 // Message: inventory
2981 vector<CInv> vInvWait;
2982 CRITICAL_BLOCK(pto->cs_inventory)
2984 vInv.reserve(pto->vInventoryToSend.size());
2985 vInvWait.reserve(pto->vInventoryToSend.size());
2986 foreach(const CInv& inv, pto->vInventoryToSend)
2988 if (pto->setInventoryKnown.count(inv))
2991 // trickle out tx inv to protect privacy
2992 if (inv.type == MSG_TX && !fSendTrickle)
2994 // 1/4 of tx invs blast to all immediately
2995 static uint256 hashSalt;
2997 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2998 uint256 hashRand = inv.hash ^ hashSalt;
2999 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3000 bool fTrickleWait = ((hashRand & 3) != 0);
3002 // always trickle our own transactions
3005 TRY_CRITICAL_BLOCK(cs_mapWallet)
3007 map<uint256, CWalletTx>::iterator mi = mapWallet.find(inv.hash);
3008 if (mi != mapWallet.end())
3010 CWalletTx& wtx = (*mi).second;
3012 fTrickleWait = true;
3019 vInvWait.push_back(inv);
3024 // returns true if wasn't already contained in the set
3025 if (pto->setInventoryKnown.insert(inv).second)
3027 vInv.push_back(inv);
3028 if (vInv.size() >= 1000)
3030 pto->PushMessage("inv", vInv);
3035 pto->vInventoryToSend = vInvWait;
3038 pto->PushMessage("inv", vInv);
3044 vector<CInv> vGetData;
3045 int64 nNow = GetTime() * 1000000;
3047 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
3049 const CInv& inv = (*pto->mapAskFor.begin()).second;
3050 if (!AlreadyHave(txdb, inv))
3052 printf("sending getdata: %s\n", inv.ToString().c_str());
3053 vGetData.push_back(inv);
3054 if (vGetData.size() >= 1000)
3056 pto->PushMessage("getdata", vGetData);
3060 pto->mapAskFor.erase(pto->mapAskFor.begin());
3062 if (!vGetData.empty())
3063 pto->PushMessage("getdata", vGetData);
3082 //////////////////////////////////////////////////////////////////////////////
3087 void GenerateBitcoins(bool fGenerate)
3089 if (fGenerateBitcoins != fGenerate)
3091 fGenerateBitcoins = fGenerate;
3092 CWalletDB().WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3095 if (fGenerateBitcoins)
3097 int nProcessors = boost::thread::hardware_concurrency();
3098 printf("%d processors\n", nProcessors);
3099 if (nProcessors < 1)
3101 if (fLimitProcessors && nProcessors > nLimitProcessors)
3102 nProcessors = nLimitProcessors;
3103 int nAddThreads = nProcessors - vnThreadsRunning[3];
3104 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3105 for (int i = 0; i < nAddThreads; i++)
3107 if (!CreateThread(ThreadBitcoinMiner, NULL))
3108 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");
3114 void ThreadBitcoinMiner(void* parg)
3118 vnThreadsRunning[3]++;
3120 vnThreadsRunning[3]--;
3122 catch (std::exception& e) {
3123 vnThreadsRunning[3]--;
3124 PrintException(&e, "ThreadBitcoinMiner()");
3126 vnThreadsRunning[3]--;
3127 PrintException(NULL, "ThreadBitcoinMiner()");
3129 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3131 if (vnThreadsRunning[3] == 0)
3133 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3136 #if defined(__GNUC__) && defined(CRYPTOPP_X86_ASM_AVAILABLE)
3137 void CallCPUID(int in, int& aret, int& cret)
3141 "mov %2, %%eax; " // in into eax
3143 "mov %%eax, %0;" // eax into a
3144 "mov %%ecx, %1;" // ecx into c
3145 :"=r"(a),"=r"(c) /* output */
3146 :"r"(in) /* input */
3147 :"%eax","%ebx","%ecx","%edx" /* clobbered register */
3153 bool Detect128BitSSE2()
3156 CallCPUID(0, a, nBrand);
3157 bool fIntel = (nBrand == 0x6c65746e); // ntel
3158 bool fAMD = (nBrand == 0x444d4163); // cAMD
3162 unsigned int nStepping : 4;
3163 unsigned int nModel : 4;
3164 unsigned int nFamily : 4;
3165 unsigned int nProcessorType : 2;
3166 unsigned int nUnused : 2;
3167 unsigned int nExtendedModel : 4;
3168 unsigned int nExtendedFamily : 8;
3172 memcpy(&cpu, &a, sizeof(cpu));
3173 int nFamily = cpu.nExtendedFamily + cpu.nFamily;
3174 int nModel = cpu.nExtendedModel*16 + cpu.nModel;
3176 // We need Intel Nehalem or AMD K10 or better for 128bit SSE2
3177 // Nehalem = i3/i5/i7 and some Xeon
3178 // K10 = Opterons with 4 or more cores, Phenom, Phenom II, Athlon II
3179 // Intel Core i5 family 6, model 26 or 30
3180 // Intel Core i7 family 6, model 26 or 30
3181 // Intel Core i3 family 6, model 37
3182 // AMD Phenom family 16, model 10
3183 bool fUseSSE2 = ((fIntel && nFamily * 10000 + nModel >= 60026) ||
3184 (fAMD && nFamily * 10000 + nModel >= 160010));
3186 // AMD reports a lower model number in 64-bit mode
3187 if (fAMD && sizeof(void*) > 4 && nFamily * 10000 + nModel >= 160000)
3190 static bool fPrinted;
3194 printf("CPUID %08x family %d, model %d, stepping %d, fUseSSE2=%d\n", nBrand, nFamily, nModel, cpu.nStepping, fUseSSE2);
3199 bool Detect128BitSSE2() { return false; }
3202 int FormatHashBlocks(void* pbuffer, unsigned int len)
3204 unsigned char* pdata = (unsigned char*)pbuffer;
3205 unsigned int blocks = 1 + ((len + 8) / 64);
3206 unsigned char* pend = pdata + 64 * blocks;
3207 memset(pdata + len, 0, 64 * blocks - len);
3209 unsigned int bits = len * 8;
3210 pend[-1] = (bits >> 0) & 0xff;
3211 pend[-2] = (bits >> 8) & 0xff;
3212 pend[-3] = (bits >> 16) & 0xff;
3213 pend[-4] = (bits >> 24) & 0xff;
3217 using CryptoPP::ByteReverse;
3219 static const unsigned int pSHA256InitState[8] =
3220 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
3222 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
3224 memcpy(pstate, pinit, 32);
3225 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
3229 // ScanHash scans nonces looking for a hash with at least some zero bits.
3230 // It operates on big endian data. Caller does the byte reversing.
3231 // All input buffers are 16-byte aligned. nNonce is usually preserved
3232 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3233 // the block is rebuilt and nNonce starts over at zero.
3235 unsigned int ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3237 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3241 // Hash pdata using pmidstate as the starting state into
3242 // preformatted buffer phash1, then hash phash1 into phash
3244 SHA256Transform(phash1, pdata, pmidstate);
3245 SHA256Transform(phash, phash1, pSHA256InitState);
3247 // Return the nonce if the hash has at least some zero bits,
3248 // caller will check if it has enough to reach the target
3249 if (((unsigned short*)phash)[14] == 0)
3252 // If nothing found after trying for a while, return -1
3253 if ((nNonce & 0xffff) == 0)
3255 nHashesDone = 0xffff+1;
3261 extern unsigned int ScanHash_4WaySSE2(char* pmidstate, char* pblock, char* phash1, char* phash, unsigned int& nHashesDone);
3269 set<uint256> setDependsOn;
3272 COrphan(CTransaction* ptxIn)
3280 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3281 foreach(uint256 hash, setDependsOn)
3282 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3287 CBlock* CreateNewBlock(CReserveKey& reservekey)
3289 CBlockIndex* pindexPrev = pindexBest;
3292 auto_ptr<CBlock> pblock(new CBlock());
3296 // Create coinbase tx
3298 txNew.vin.resize(1);
3299 txNew.vin[0].prevout.SetNull();
3300 txNew.vout.resize(1);
3301 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3303 // Add our coinbase tx as first transaction
3304 pblock->vtx.push_back(txNew);
3306 // Collect memory pool transactions into the block
3308 CRITICAL_BLOCK(cs_main)
3309 CRITICAL_BLOCK(cs_mapTransactions)
3313 // Priority order to process transactions
3314 list<COrphan> vOrphan; // list memory doesn't move
3315 map<uint256, vector<COrphan*> > mapDependers;
3316 multimap<double, CTransaction*> mapPriority;
3317 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
3319 CTransaction& tx = (*mi).second;
3320 if (tx.IsCoinBase() || !tx.IsFinal())
3323 COrphan* porphan = NULL;
3324 double dPriority = 0;
3325 foreach(const CTxIn& txin, tx.vin)
3327 // Read prev transaction
3328 CTransaction txPrev;
3330 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3332 // Has to wait for dependencies
3335 // Use list for automatic deletion
3336 vOrphan.push_back(COrphan(&tx));
3337 porphan = &vOrphan.back();
3339 mapDependers[txin.prevout.hash].push_back(porphan);
3340 porphan->setDependsOn.insert(txin.prevout.hash);
3343 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3345 // Read block header
3346 int nConf = txindex.GetDepthInMainChain();
3348 dPriority += (double)nValueIn * nConf;
3350 if (fDebug && GetBoolArg("-printpriority"))
3351 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3354 // Priority is sum(valuein * age) / txsize
3355 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3358 porphan->dPriority = dPriority;
3360 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3362 if (fDebug && GetBoolArg("-printpriority"))
3364 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3371 // Collect transactions into block
3372 map<uint256, CTxIndex> mapTestPool;
3373 uint64 nBlockSize = 1000;
3374 int nBlockSigOps = 100;
3375 while (!mapPriority.empty())
3377 // Take highest priority transaction off priority queue
3378 double dPriority = -(*mapPriority.begin()).first;
3379 CTransaction& tx = *(*mapPriority.begin()).second;
3380 mapPriority.erase(mapPriority.begin());
3383 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3384 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3386 int nTxSigOps = tx.GetSigOpCount();
3387 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3390 // Transaction fee required depends on block size
3391 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3392 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree);
3394 // Connecting shouldn't fail due to dependency on other memory pool transactions
3395 // because we're already processing them in order of dependency
3396 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3397 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
3399 swap(mapTestPool, mapTestPoolTmp);
3402 pblock->vtx.push_back(tx);
3403 nBlockSize += nTxSize;
3404 nBlockSigOps += nTxSigOps;
3406 // Add transactions that depend on this one to the priority queue
3407 uint256 hash = tx.GetHash();
3408 if (mapDependers.count(hash))
3410 foreach(COrphan* porphan, mapDependers[hash])
3412 if (!porphan->setDependsOn.empty())
3414 porphan->setDependsOn.erase(hash);
3415 if (porphan->setDependsOn.empty())
3416 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3422 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3425 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3426 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3427 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3428 pblock->nBits = GetNextWorkRequired(pindexPrev);
3431 return pblock.release();
3435 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce, int64& nPrevTime)
3437 // Update nExtraNonce
3438 int64 nNow = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3439 if (++nExtraNonce >= 0x7f && nNow > nPrevTime+1)
3444 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nBits << CBigNum(nExtraNonce);
3445 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3449 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3452 // Prebuild hash buffers
3459 uint256 hashPrevBlock;
3460 uint256 hashMerkleRoot;
3463 unsigned int nNonce;
3466 unsigned char pchPadding0[64];
3468 unsigned char pchPadding1[64];
3471 memset(&tmp, 0, sizeof(tmp));
3473 tmp.block.nVersion = pblock->nVersion;
3474 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3475 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3476 tmp.block.nTime = pblock->nTime;
3477 tmp.block.nBits = pblock->nBits;
3478 tmp.block.nNonce = pblock->nNonce;
3480 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3481 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3483 // Byte swap all the input buffer
3484 for (int i = 0; i < sizeof(tmp)/4; i++)
3485 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3487 // Precalc the first half of the first hash, which stays constant
3488 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3490 memcpy(pdata, &tmp.block, 128);
3491 memcpy(phash1, &tmp.hash1, 64);
3495 bool CheckWork(CBlock* pblock, CReserveKey& reservekey)
3497 uint256 hash = pblock->GetHash();
3498 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3500 if (hash > hashTarget)
3504 printf("BitcoinMiner:\n");
3505 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3507 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3508 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3511 CRITICAL_BLOCK(cs_main)
3513 if (pblock->hashPrevBlock != hashBestChain)
3514 return error("BitcoinMiner : generated block is stale");
3516 // Remove key from key pool
3517 reservekey.KeepKey();
3519 // Track how many getdata requests this block gets
3520 CRITICAL_BLOCK(cs_mapRequestCount)
3521 mapRequestCount[pblock->GetHash()] = 0;
3523 // Process this block the same as if we had received it from another node
3524 if (!ProcessBlock(NULL, pblock))
3525 return error("BitcoinMiner : ProcessBlock, block not accepted");
3535 printf("BitcoinMiner started\n");
3536 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3537 bool f4WaySSE2 = Detect128BitSSE2();
3538 if (mapArgs.count("-4way"))
3539 f4WaySSE2 = GetBoolArg("-4way");
3541 // Each thread has its own key and counter
3542 CReserveKey reservekey;
3543 unsigned int nExtraNonce = 0;
3544 int64 nPrevTime = 0;
3546 while (fGenerateBitcoins)
3548 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3552 while (vNodes.empty() || IsInitialBlockDownload())
3557 if (!fGenerateBitcoins)
3565 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3566 CBlockIndex* pindexPrev = pindexBest;
3568 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3571 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce, nPrevTime);
3573 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3577 // Prebuild hash buffers
3579 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3580 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3581 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3583 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3585 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3586 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3592 int64 nStart = GetTime();
3593 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3595 uint256& hash = *alignup<16>(hashbuf);
3598 unsigned int nHashesDone = 0;
3599 unsigned int nNonceFound;
3603 // tcatm's 4-way 128-bit SSE2 SHA-256
3604 nNonceFound = ScanHash_4WaySSE2(pmidstate, pdata + 64, phash1, (char*)&hash, nHashesDone);
3608 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1, (char*)&hash, nHashesDone);
3610 // Check if something found
3611 if (nNonceFound != -1)
3613 for (int i = 0; i < sizeof(hash)/4; i++)
3614 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3616 if (hash <= hashTarget)
3619 pblock->nNonce = ByteReverse(nNonceFound);
3620 assert(hash == pblock->GetHash());
3622 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3623 CheckWork(pblock.get(), reservekey);
3624 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3630 static int64 nHashCounter;
3631 if (nHPSTimerStart == 0)
3633 nHPSTimerStart = GetTimeMillis();
3637 nHashCounter += nHashesDone;
3638 if (GetTimeMillis() - nHPSTimerStart > 4000)
3640 static CCriticalSection cs;
3643 if (GetTimeMillis() - nHPSTimerStart > 4000)
3645 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3646 nHPSTimerStart = GetTimeMillis();
3648 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3649 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3650 static int64 nLogTime;
3651 if (GetTime() - nLogTime > 30 * 60)
3653 nLogTime = GetTime();
3654 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3655 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3661 // Check for stop or if block needs to be rebuilt
3664 if (!fGenerateBitcoins)
3666 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3670 if (nBlockNonce >= 0xffff0000)
3672 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3674 if (pindexPrev != pindexBest)
3677 // Update nTime every few seconds
3678 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3679 nBlockTime = ByteReverse(pblock->nTime);
3701 //////////////////////////////////////////////////////////////////////////////
3709 int64 nStart = GetTimeMillis();
3712 CRITICAL_BLOCK(cs_mapWallet)
3714 for (map<uint256, CWalletTx>::iterator it = mapWallet.begin(); it != mapWallet.end(); ++it)
3716 CWalletTx* pcoin = &(*it).second;
3717 if (!pcoin->IsFinal() || pcoin->fSpent || !pcoin->IsConfirmed())
3719 nTotal += pcoin->GetCredit();
3723 //printf("GetBalance() %"PRI64d"ms\n", GetTimeMillis() - nStart);
3728 bool SelectCoinsMinConf(int64 nTargetValue, int nConfMine, int nConfTheirs, set<CWalletTx*>& setCoinsRet)
3730 setCoinsRet.clear();
3732 // List of values less than target
3733 int64 nLowestLarger = INT64_MAX;
3734 CWalletTx* pcoinLowestLarger = NULL;
3735 vector<pair<int64, CWalletTx*> > vValue;
3736 int64 nTotalLower = 0;
3738 CRITICAL_BLOCK(cs_mapWallet)
3740 vector<CWalletTx*> vCoins;
3741 vCoins.reserve(mapWallet.size());
3742 for (map<uint256, CWalletTx>::iterator it = mapWallet.begin(); it != mapWallet.end(); ++it)
3743 vCoins.push_back(&(*it).second);
3744 random_shuffle(vCoins.begin(), vCoins.end(), GetRandInt);
3746 foreach(CWalletTx* pcoin, vCoins)
3748 if (!pcoin->IsFinal() || pcoin->fSpent || !pcoin->IsConfirmed())
3751 int nDepth = pcoin->GetDepthInMainChain();
3752 if (nDepth < (pcoin->IsFromMe() ? nConfMine : nConfTheirs))
3755 int64 n = pcoin->GetCredit();
3758 if (n < nTargetValue)
3760 vValue.push_back(make_pair(n, pcoin));
3763 else if (n == nTargetValue)
3765 setCoinsRet.insert(pcoin);
3768 else if (n < nLowestLarger)
3771 pcoinLowestLarger = pcoin;
3776 if (nTotalLower < nTargetValue)
3778 if (pcoinLowestLarger == NULL)
3780 setCoinsRet.insert(pcoinLowestLarger);
3784 // Solve subset sum by stochastic approximation
3785 sort(vValue.rbegin(), vValue.rend());
3786 vector<char> vfIncluded;
3787 vector<char> vfBest(vValue.size(), true);
3788 int64 nBest = nTotalLower;
3790 for (int nRep = 0; nRep < 1000 && nBest != nTargetValue; nRep++)
3792 vfIncluded.assign(vValue.size(), false);
3794 bool fReachedTarget = false;
3795 for (int nPass = 0; nPass < 2 && !fReachedTarget; nPass++)
3797 for (int i = 0; i < vValue.size(); i++)
3799 if (nPass == 0 ? rand() % 2 : !vfIncluded[i])
3801 nTotal += vValue[i].first;
3802 vfIncluded[i] = true;
3803 if (nTotal >= nTargetValue)
3805 fReachedTarget = true;
3809 vfBest = vfIncluded;
3811 nTotal -= vValue[i].first;
3812 vfIncluded[i] = false;
3819 // If the next larger is still closer, return it
3820 if (pcoinLowestLarger && nLowestLarger - nTargetValue <= nBest - nTargetValue)
3821 setCoinsRet.insert(pcoinLowestLarger);
3824 for (int i = 0; i < vValue.size(); i++)
3826 setCoinsRet.insert(vValue[i].second);
3829 printf("SelectCoins() best subset: ");
3830 for (int i = 0; i < vValue.size(); i++)
3832 printf("%s ", FormatMoney(vValue[i].first).c_str());
3833 printf("total %s\n", FormatMoney(nBest).c_str());
3839 bool SelectCoins(int64 nTargetValue, set<CWalletTx*>& setCoinsRet)
3841 return (SelectCoinsMinConf(nTargetValue, 1, 6, setCoinsRet) ||
3842 SelectCoinsMinConf(nTargetValue, 1, 1, setCoinsRet) ||
3843 SelectCoinsMinConf(nTargetValue, 0, 1, setCoinsRet));
3849 bool CreateTransaction(CScript scriptPubKey, int64 nValue, CWalletTx& wtxNew, CReserveKey& reservekey, int64& nFeeRet)
3851 CRITICAL_BLOCK(cs_main)
3853 // txdb must be opened before the mapWallet lock
3855 CRITICAL_BLOCK(cs_mapWallet)
3857 nFeeRet = nTransactionFee;
3861 wtxNew.vout.clear();
3862 wtxNew.fFromMe = true;
3865 int64 nValueOut = nValue;
3866 int64 nTotalValue = nValue + nFeeRet;
3867 double dPriority = 0;
3869 // Choose coins to use
3870 set<CWalletTx*> setCoins;
3871 if (!SelectCoins(nTotalValue, setCoins))
3874 foreach(CWalletTx* pcoin, setCoins)
3876 int64 nCredit = pcoin->GetCredit();
3877 nValueIn += nCredit;
3878 dPriority += (double)nCredit * pcoin->GetDepthInMainChain();
3881 // Fill a vout to the payee
3882 bool fChangeFirst = GetRand(2);
3884 wtxNew.vout.push_back(CTxOut(nValueOut, scriptPubKey));
3886 // Fill a vout back to self with any change
3887 int64 nChange = nValueIn - nTotalValue;
3888 if (nChange >= CENT)
3890 // Note: We use a new key here to keep it from being obvious which side is the change.
3891 // The drawback is that by not reusing a previous key, the change may be lost if a
3892 // backup is restored, if the backup doesn't have the new private key for the change.
3893 // If we reused the old key, it would be possible to add code to look for and
3894 // rediscover unknown transactions that were written with keys of ours to recover
3895 // post-backup change.
3897 // Reserve a new key pair from key pool
3898 vector<unsigned char> vchPubKey = reservekey.GetReservedKey();
3899 assert(mapKeys.count(vchPubKey));
3901 // Fill a vout to ourself, using same address type as the payment
3902 CScript scriptChange;
3903 if (scriptPubKey.GetBitcoinAddressHash160() != 0)
3904 scriptChange.SetBitcoinAddress(vchPubKey);
3906 scriptChange << vchPubKey << OP_CHECKSIG;
3907 wtxNew.vout.push_back(CTxOut(nChange, scriptChange));
3910 reservekey.ReturnKey();
3912 // Fill a vout to the payee
3914 wtxNew.vout.push_back(CTxOut(nValueOut, scriptPubKey));
3917 foreach(CWalletTx* pcoin, setCoins)
3918 for (int nOut = 0; nOut < pcoin->vout.size(); nOut++)
3919 if (pcoin->vout[nOut].IsMine())
3920 wtxNew.vin.push_back(CTxIn(pcoin->GetHash(), nOut));
3924 foreach(CWalletTx* pcoin, setCoins)
3925 for (int nOut = 0; nOut < pcoin->vout.size(); nOut++)
3926 if (pcoin->vout[nOut].IsMine())
3927 if (!SignSignature(*pcoin, wtxNew, nIn++))
3931 unsigned int nBytes = ::GetSerializeSize(*(CTransaction*)&wtxNew, SER_NETWORK);
3932 if (nBytes >= MAX_BLOCK_SIZE_GEN/5)
3934 dPriority /= nBytes;
3936 // Check that enough fee is included
3937 int64 nPayFee = nTransactionFee * (1 + (int64)nBytes / 1000);
3938 bool fAllowFree = CTransaction::AllowFree(dPriority);
3939 int64 nMinFee = wtxNew.GetMinFee(1, fAllowFree);
3940 if (nFeeRet < max(nPayFee, nMinFee))
3942 nFeeRet = max(nPayFee, nMinFee);
3946 // Fill vtxPrev by copying from previous transactions vtxPrev
3947 wtxNew.AddSupportingTransactions(txdb);
3948 wtxNew.fTimeReceivedIsTxTime = true;
3957 // Call after CreateTransaction unless you want to abort
3958 bool CommitTransaction(CWalletTx& wtxNew, CReserveKey& reservekey)
3960 CRITICAL_BLOCK(cs_main)
3962 printf("CommitTransaction:\n%s", wtxNew.ToString().c_str());
3963 CRITICAL_BLOCK(cs_mapWallet)
3965 // This is only to keep the database open to defeat the auto-flush for the
3966 // duration of this scope. This is the only place where this optimization
3967 // maybe makes sense; please don't do it anywhere else.
3968 CWalletDB walletdb("r");
3970 // Take key pair from key pool so it won't be used again
3971 reservekey.KeepKey();
3973 // Add tx to wallet, because if it has change it's also ours,
3974 // otherwise just for transaction history.
3975 AddToWallet(wtxNew);
3977 // Mark old coins as spent
3978 set<CWalletTx*> setCoins;
3979 foreach(const CTxIn& txin, wtxNew.vin)
3980 setCoins.insert(&mapWallet[txin.prevout.hash]);
3981 foreach(CWalletTx* pcoin, setCoins)
3983 pcoin->fSpent = true;
3984 pcoin->WriteToDisk();
3985 vWalletUpdated.push_back(pcoin->GetHash());
3989 // Track how many getdata requests our transaction gets
3990 CRITICAL_BLOCK(cs_mapRequestCount)
3991 mapRequestCount[wtxNew.GetHash()] = 0;
3994 if (!wtxNew.AcceptToMemoryPool())
3996 // This must not fail. The transaction has already been signed and recorded.
3997 printf("CommitTransaction() : Error: Transaction not valid");
4000 wtxNew.RelayWalletTransaction();
4009 string SendMoney(CScript scriptPubKey, int64 nValue, CWalletTx& wtxNew, bool fAskFee)
4011 CRITICAL_BLOCK(cs_main)
4013 CReserveKey reservekey;
4015 if (!CreateTransaction(scriptPubKey, nValue, wtxNew, reservekey, nFeeRequired))
4018 if (nValue + nFeeRequired > GetBalance())
4019 strError = strprintf(_("Error: This is an oversized transaction that requires a transaction fee of %s "), FormatMoney(nFeeRequired).c_str());
4021 strError = _("Error: Transaction creation failed ");
4022 printf("SendMoney() : %s", strError.c_str());
4026 if (fAskFee && !ThreadSafeAskFee(nFeeRequired, _("Sending..."), NULL))
4029 if (!CommitTransaction(wtxNew, reservekey))
4030 return _("Error: The transaction was rejected. This might happen if some of the coins in your wallet were already spent, such as if you used a copy of wallet.dat and coins were spent in the copy but not marked as spent here.");
4038 string SendMoneyToBitcoinAddress(string strAddress, int64 nValue, CWalletTx& wtxNew, bool fAskFee)
4042 return _("Invalid amount");
4043 if (nValue + nTransactionFee > GetBalance())
4044 return _("Insufficient funds");
4046 // Parse bitcoin address
4047 CScript scriptPubKey;
4048 if (!scriptPubKey.SetBitcoinAddress(strAddress))
4049 return _("Invalid bitcoin address");
4051 return SendMoney(scriptPubKey, nValue, wtxNew, fAskFee);