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 // Continuously rate-limit free transactions
742 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
743 // be annoying or make other's transactions take longer to confirm.
746 static CCriticalSection cs;
747 static double dFreeCount;
748 static int64 nLastTime;
749 int64 nNow = GetTime();
753 // Use an exponentially decaying ~10-minute window:
754 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
756 // -limitfreerelay unit is thousand-bytes-per-minute
757 // At default rate it would take over a month to fill 1GB
758 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe())
759 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
761 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
767 // Store transaction in memory
768 CRITICAL_BLOCK(cs_mapTransactions)
772 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
773 ptxOld->RemoveFromMemoryPool();
775 AddToMemoryPoolUnchecked();
778 ///// are we sure this is ok when loading transactions or restoring block txes
779 // If updated, erase old tx from wallet
781 EraseFromWallet(ptxOld->GetHash());
783 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
788 bool CTransaction::AddToMemoryPoolUnchecked()
790 // Add to memory pool without checking anything. Don't call this directly,
791 // call AcceptToMemoryPool to properly check the transaction first.
792 CRITICAL_BLOCK(cs_mapTransactions)
794 uint256 hash = GetHash();
795 mapTransactions[hash] = *this;
796 for (int i = 0; i < vin.size(); i++)
797 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
798 nTransactionsUpdated++;
804 bool CTransaction::RemoveFromMemoryPool()
806 // Remove transaction from memory pool
807 CRITICAL_BLOCK(cs_mapTransactions)
809 foreach(const CTxIn& txin, vin)
810 mapNextTx.erase(txin.prevout);
811 mapTransactions.erase(GetHash());
812 nTransactionsUpdated++;
822 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
824 if (hashBlock == 0 || nIndex == -1)
827 // Find the block it claims to be in
828 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
829 if (mi == mapBlockIndex.end())
831 CBlockIndex* pindex = (*mi).second;
832 if (!pindex || !pindex->IsInMainChain())
835 // Make sure the merkle branch connects to this block
836 if (!fMerkleVerified)
838 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
840 fMerkleVerified = true;
843 nHeightRet = pindex->nHeight;
844 return pindexBest->nHeight - pindex->nHeight + 1;
848 int CMerkleTx::GetBlocksToMaturity() const
852 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
856 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
860 if (!IsInMainChain() && !ClientConnectInputs())
862 return CTransaction::AcceptToMemoryPool(txdb, false);
866 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
872 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
874 CRITICAL_BLOCK(cs_mapTransactions)
876 // Add previous supporting transactions first
877 foreach(CMerkleTx& tx, vtxPrev)
879 if (!tx.IsCoinBase())
881 uint256 hash = tx.GetHash();
882 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
883 tx.AcceptToMemoryPool(txdb, fCheckInputs);
886 return AcceptToMemoryPool(txdb, fCheckInputs);
891 int ScanForWalletTransactions(CBlockIndex* pindexStart)
895 CBlockIndex* pindex = pindexStart;
896 CRITICAL_BLOCK(cs_mapWallet)
901 block.ReadFromDisk(pindex, true);
902 foreach(CTransaction& tx, block.vtx)
904 uint256 hash = tx.GetHash();
905 if (mapWallet.count(hash)) continue;
906 AddToWalletIfMine(tx, &block);
907 if (mapWallet.count(hash))
910 printf("Added missing RECEIVE %s\n", hash.ToString().c_str());
913 AddToWalletIfFromMe(tx, &block);
914 if (mapWallet.count(hash))
917 printf("Added missing SEND %s\n", hash.ToString().c_str());
921 pindex = pindex->pnext;
927 void ReacceptWalletTransactions()
931 while (fRepeat) CRITICAL_BLOCK(cs_mapWallet)
934 vector<CDiskTxPos> vMissingTx;
935 foreach(PAIRTYPE(const uint256, CWalletTx)& item, mapWallet)
937 CWalletTx& wtx = item.second;
938 if (wtx.fSpent && wtx.IsCoinBase())
942 if (txdb.ReadTxIndex(wtx.GetHash(), txindex))
944 // Update fSpent if a tx got spent somewhere else by a copy of wallet.dat
947 if (txindex.vSpent.size() != wtx.vout.size())
949 printf("ERROR: ReacceptWalletTransactions() : txindex.vSpent.size() %d != wtx.vout.size() %d\n", txindex.vSpent.size(), wtx.vout.size());
952 for (int i = 0; i < txindex.vSpent.size(); i++)
954 if (!txindex.vSpent[i].IsNull() && wtx.vout[i].IsMine())
957 vMissingTx.push_back(txindex.vSpent[i]);
962 printf("ReacceptWalletTransactions found spent coin %sbc %s\n", FormatMoney(wtx.GetCredit()).c_str(), wtx.GetHash().ToString().c_str());
969 // Reaccept any txes of ours that aren't already in a block
970 if (!wtx.IsCoinBase())
971 wtx.AcceptWalletTransaction(txdb, false);
974 if (!vMissingTx.empty())
976 // TODO: optimize this to scan just part of the block chain?
977 if (ScanForWalletTransactions(pindexGenesisBlock))
978 fRepeat = true; // Found missing transactions: re-do Reaccept.
984 void CWalletTx::RelayWalletTransaction(CTxDB& txdb)
986 foreach(const CMerkleTx& tx, vtxPrev)
988 if (!tx.IsCoinBase())
990 uint256 hash = tx.GetHash();
991 if (!txdb.ContainsTx(hash))
992 RelayMessage(CInv(MSG_TX, hash), (CTransaction)tx);
997 uint256 hash = GetHash();
998 if (!txdb.ContainsTx(hash))
1000 printf("Relaying wtx %s\n", hash.ToString().substr(0,10).c_str());
1001 RelayMessage(CInv(MSG_TX, hash), (CTransaction)*this);
1006 void ResendWalletTransactions()
1008 // Do this infrequently and randomly to avoid giving away
1009 // that these are our transactions.
1010 static int64 nNextTime;
1011 if (GetTime() < nNextTime)
1013 bool fFirst = (nNextTime == 0);
1014 nNextTime = GetTime() + GetRand(30 * 60);
1018 // Only do it if there's been a new block since last time
1019 static int64 nLastTime;
1020 if (nTimeBestReceived < nLastTime)
1022 nLastTime = GetTime();
1024 // Rebroadcast any of our txes that aren't in a block yet
1025 printf("ResendWalletTransactions()\n");
1027 CRITICAL_BLOCK(cs_mapWallet)
1029 // Sort them in chronological order
1030 multimap<unsigned int, CWalletTx*> mapSorted;
1031 foreach(PAIRTYPE(const uint256, CWalletTx)& item, mapWallet)
1033 CWalletTx& wtx = item.second;
1034 // Don't rebroadcast until it's had plenty of time that
1035 // it should have gotten in already by now.
1036 if (nTimeBestReceived - (int64)wtx.nTimeReceived > 5 * 60)
1037 mapSorted.insert(make_pair(wtx.nTimeReceived, &wtx));
1039 foreach(PAIRTYPE(const unsigned int, CWalletTx*)& item, mapSorted)
1041 CWalletTx& wtx = *item.second;
1042 wtx.RelayWalletTransaction(txdb);
1047 int CTxIndex::GetDepthInMainChain() const
1049 // Read block header
1051 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
1053 // Find the block in the index
1054 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
1055 if (mi == mapBlockIndex.end())
1057 CBlockIndex* pindex = (*mi).second;
1058 if (!pindex || !pindex->IsInMainChain())
1060 return 1 + nBestHeight - pindex->nHeight;
1072 //////////////////////////////////////////////////////////////////////////////
1074 // CBlock and CBlockIndex
1077 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
1079 if (!fReadTransactions)
1081 *this = pindex->GetBlockHeader();
1084 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
1086 if (GetHash() != pindex->GetBlockHash())
1087 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
1091 uint256 GetOrphanRoot(const CBlock* pblock)
1093 // Work back to the first block in the orphan chain
1094 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
1095 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
1096 return pblock->GetHash();
1099 int64 GetBlockValue(int nHeight, int64 nFees)
1101 int64 nSubsidy = 50 * COIN;
1103 // Subsidy is cut in half every 4 years
1104 nSubsidy >>= (nHeight / 210000);
1106 return nSubsidy + nFees;
1109 unsigned int GetNextWorkRequired(const CBlockIndex* pindexLast)
1111 const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
1112 const int64 nTargetSpacing = 10 * 60;
1113 const int64 nInterval = nTargetTimespan / nTargetSpacing;
1116 if (pindexLast == NULL)
1117 return bnProofOfWorkLimit.GetCompact();
1119 // Only change once per interval
1120 if ((pindexLast->nHeight+1) % nInterval != 0)
1121 return pindexLast->nBits;
1123 // Go back by what we want to be 14 days worth of blocks
1124 const CBlockIndex* pindexFirst = pindexLast;
1125 for (int i = 0; pindexFirst && i < nInterval-1; i++)
1126 pindexFirst = pindexFirst->pprev;
1127 assert(pindexFirst);
1129 // Limit adjustment step
1130 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
1131 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
1132 if (nActualTimespan < nTargetTimespan/4)
1133 nActualTimespan = nTargetTimespan/4;
1134 if (nActualTimespan > nTargetTimespan*4)
1135 nActualTimespan = nTargetTimespan*4;
1139 bnNew.SetCompact(pindexLast->nBits);
1140 bnNew *= nActualTimespan;
1141 bnNew /= nTargetTimespan;
1143 if (bnNew > bnProofOfWorkLimit)
1144 bnNew = bnProofOfWorkLimit;
1147 printf("GetNextWorkRequired RETARGET\n");
1148 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
1149 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
1150 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
1152 return bnNew.GetCompact();
1155 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1158 bnTarget.SetCompact(nBits);
1161 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1162 return error("CheckProofOfWork() : nBits below minimum work");
1164 // Check proof of work matches claimed amount
1165 if (hash > bnTarget.getuint256())
1166 return error("CheckProofOfWork() : hash doesn't match nBits");
1171 bool IsInitialBlockDownload()
1173 if (pindexBest == NULL || (!fTestNet && nBestHeight < 105000))
1175 static int64 nLastUpdate;
1176 static CBlockIndex* pindexLastBest;
1177 if (pindexBest != pindexLastBest)
1179 pindexLastBest = pindexBest;
1180 nLastUpdate = GetTime();
1182 return (GetTime() - nLastUpdate < 10 &&
1183 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
1186 void InvalidChainFound(CBlockIndex* pindexNew)
1188 if (pindexNew->bnChainWork > bnBestInvalidWork)
1190 bnBestInvalidWork = pindexNew->bnChainWork;
1191 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
1194 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());
1195 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1196 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1197 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
1210 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1212 // Relinquish previous transactions' spent pointers
1215 foreach(const CTxIn& txin, vin)
1217 COutPoint prevout = txin.prevout;
1219 // Get prev txindex from disk
1221 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1222 return error("DisconnectInputs() : ReadTxIndex failed");
1224 if (prevout.n >= txindex.vSpent.size())
1225 return error("DisconnectInputs() : prevout.n out of range");
1227 // Mark outpoint as not spent
1228 txindex.vSpent[prevout.n].SetNull();
1231 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1232 return error("DisconnectInputs() : UpdateTxIndex failed");
1236 // Remove transaction from index
1237 if (!txdb.EraseTxIndex(*this))
1238 return error("DisconnectInputs() : EraseTxPos failed");
1244 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
1245 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
1247 // Take over previous transactions' spent pointers
1251 for (int i = 0; i < vin.size(); i++)
1253 COutPoint prevout = vin[i].prevout;
1258 if (fMiner && mapTestPool.count(prevout.hash))
1260 // Get txindex from current proposed changes
1261 txindex = mapTestPool[prevout.hash];
1265 // Read txindex from txdb
1266 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1268 if (!fFound && (fBlock || fMiner))
1269 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());
1272 CTransaction txPrev;
1273 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1275 // Get prev tx from single transactions in memory
1276 CRITICAL_BLOCK(cs_mapTransactions)
1278 if (!mapTransactions.count(prevout.hash))
1279 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1280 txPrev = mapTransactions[prevout.hash];
1283 txindex.vSpent.resize(txPrev.vout.size());
1287 // Get prev tx from disk
1288 if (!txPrev.ReadFromDisk(txindex.pos))
1289 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1292 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1293 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());
1295 // If prev is coinbase, check that it's matured
1296 if (txPrev.IsCoinBase())
1297 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1298 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1299 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1302 if (!VerifySignature(txPrev, *this, i))
1303 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1305 // Check for conflicts
1306 if (!txindex.vSpent[prevout.n].IsNull())
1307 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());
1309 // Check for negative or overflow input values
1310 nValueIn += txPrev.vout[prevout.n].nValue;
1311 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1312 return error("ConnectInputs() : txin values out of range");
1314 // Mark outpoints as spent
1315 txindex.vSpent[prevout.n] = posThisTx;
1320 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1321 return error("ConnectInputs() : UpdateTxIndex failed");
1325 mapTestPool[prevout.hash] = txindex;
1329 if (nValueIn < GetValueOut())
1330 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
1332 // Tally transaction fees
1333 int64 nTxFee = nValueIn - GetValueOut();
1335 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
1336 if (nTxFee < nMinFee)
1339 if (!MoneyRange(nFees))
1340 return error("ConnectInputs() : nFees out of range");
1345 // Add transaction to disk index
1346 if (!txdb.AddTxIndex(*this, posThisTx, pindexBlock->nHeight))
1347 return error("ConnectInputs() : AddTxPos failed");
1351 // Add transaction to test pool
1352 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
1359 bool CTransaction::ClientConnectInputs()
1364 // Take over previous transactions' spent pointers
1365 CRITICAL_BLOCK(cs_mapTransactions)
1368 for (int i = 0; i < vin.size(); i++)
1370 // Get prev tx from single transactions in memory
1371 COutPoint prevout = vin[i].prevout;
1372 if (!mapTransactions.count(prevout.hash))
1374 CTransaction& txPrev = mapTransactions[prevout.hash];
1376 if (prevout.n >= txPrev.vout.size())
1380 if (!VerifySignature(txPrev, *this, i))
1381 return error("ConnectInputs() : VerifySignature failed");
1383 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1384 ///// this has to go away now that posNext is gone
1385 // // Check for conflicts
1386 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1387 // return error("ConnectInputs() : prev tx already used");
1389 // // Flag outpoints as used
1390 // txPrev.vout[prevout.n].posNext = posThisTx;
1392 nValueIn += txPrev.vout[prevout.n].nValue;
1394 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1395 return error("ClientConnectInputs() : txin values out of range");
1397 if (GetValueOut() > nValueIn)
1407 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1409 // Disconnect in reverse order
1410 for (int i = vtx.size()-1; i >= 0; i--)
1411 if (!vtx[i].DisconnectInputs(txdb))
1414 // Update block index on disk without changing it in memory.
1415 // The memory index structure will be changed after the db commits.
1418 CDiskBlockIndex blockindexPrev(pindex->pprev);
1419 blockindexPrev.hashNext = 0;
1420 if (!txdb.WriteBlockIndex(blockindexPrev))
1421 return error("DisconnectBlock() : WriteBlockIndex failed");
1427 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1429 // Check it again in case a previous version let a bad block in
1433 //// issue here: it doesn't know the version
1434 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1436 map<uint256, CTxIndex> mapUnused;
1438 foreach(CTransaction& tx, vtx)
1440 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1441 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1443 if (!tx.ConnectInputs(txdb, mapUnused, posThisTx, pindex, nFees, true, false))
1447 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1450 // Update block index on disk without changing it in memory.
1451 // The memory index structure will be changed after the db commits.
1454 CDiskBlockIndex blockindexPrev(pindex->pprev);
1455 blockindexPrev.hashNext = pindex->GetBlockHash();
1456 if (!txdb.WriteBlockIndex(blockindexPrev))
1457 return error("ConnectBlock() : WriteBlockIndex failed");
1460 // Watch for transactions paying to me
1461 foreach(CTransaction& tx, vtx)
1462 AddToWalletIfMine(tx, this);
1467 bool Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1469 printf("REORGANIZE\n");
1472 CBlockIndex* pfork = pindexBest;
1473 CBlockIndex* plonger = pindexNew;
1474 while (pfork != plonger)
1476 while (plonger->nHeight > pfork->nHeight)
1477 if (!(plonger = plonger->pprev))
1478 return error("Reorganize() : plonger->pprev is null");
1479 if (pfork == plonger)
1481 if (!(pfork = pfork->pprev))
1482 return error("Reorganize() : pfork->pprev is null");
1485 // List of what to disconnect
1486 vector<CBlockIndex*> vDisconnect;
1487 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1488 vDisconnect.push_back(pindex);
1490 // List of what to connect
1491 vector<CBlockIndex*> vConnect;
1492 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1493 vConnect.push_back(pindex);
1494 reverse(vConnect.begin(), vConnect.end());
1496 // Disconnect shorter branch
1497 vector<CTransaction> vResurrect;
1498 foreach(CBlockIndex* pindex, vDisconnect)
1501 if (!block.ReadFromDisk(pindex))
1502 return error("Reorganize() : ReadFromDisk for disconnect failed");
1503 if (!block.DisconnectBlock(txdb, pindex))
1504 return error("Reorganize() : DisconnectBlock failed");
1506 // Queue memory transactions to resurrect
1507 foreach(const CTransaction& tx, block.vtx)
1508 if (!tx.IsCoinBase())
1509 vResurrect.push_back(tx);
1512 // Connect longer branch
1513 vector<CTransaction> vDelete;
1514 for (int i = 0; i < vConnect.size(); i++)
1516 CBlockIndex* pindex = vConnect[i];
1518 if (!block.ReadFromDisk(pindex))
1519 return error("Reorganize() : ReadFromDisk for connect failed");
1520 if (!block.ConnectBlock(txdb, pindex))
1524 return error("Reorganize() : ConnectBlock failed");
1527 // Queue memory transactions to delete
1528 foreach(const CTransaction& tx, block.vtx)
1529 vDelete.push_back(tx);
1531 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1532 return error("Reorganize() : WriteHashBestChain failed");
1534 // Make sure it's successfully written to disk before changing memory structure
1535 if (!txdb.TxnCommit())
1536 return error("Reorganize() : TxnCommit failed");
1538 // Disconnect shorter branch
1539 foreach(CBlockIndex* pindex, vDisconnect)
1541 pindex->pprev->pnext = NULL;
1543 // Connect longer branch
1544 foreach(CBlockIndex* pindex, vConnect)
1546 pindex->pprev->pnext = pindex;
1548 // Resurrect memory transactions that were in the disconnected branch
1549 foreach(CTransaction& tx, vResurrect)
1550 tx.AcceptToMemoryPool(txdb, false);
1552 // Delete redundant memory transactions that are in the connected branch
1553 foreach(CTransaction& tx, vDelete)
1554 tx.RemoveFromMemoryPool();
1560 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1562 uint256 hash = GetHash();
1565 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1567 txdb.WriteHashBestChain(hash);
1568 if (!txdb.TxnCommit())
1569 return error("SetBestChain() : TxnCommit failed");
1570 pindexGenesisBlock = pindexNew;
1572 else if (hashPrevBlock == hashBestChain)
1574 // Adding to current best branch
1575 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1578 InvalidChainFound(pindexNew);
1579 return error("SetBestChain() : ConnectBlock failed");
1581 if (!txdb.TxnCommit())
1582 return error("SetBestChain() : TxnCommit failed");
1584 // Add to current best branch
1585 pindexNew->pprev->pnext = pindexNew;
1587 // Delete redundant memory transactions
1588 foreach(CTransaction& tx, vtx)
1589 tx.RemoveFromMemoryPool();
1594 if (!Reorganize(txdb, pindexNew))
1597 InvalidChainFound(pindexNew);
1598 return error("SetBestChain() : Reorganize failed");
1603 hashBestChain = hash;
1604 pindexBest = pindexNew;
1605 nBestHeight = pindexBest->nHeight;
1606 bnBestChainWork = pindexNew->bnChainWork;
1607 nTimeBestReceived = GetTime();
1608 nTransactionsUpdated++;
1609 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1615 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1617 // Check for duplicate
1618 uint256 hash = GetHash();
1619 if (mapBlockIndex.count(hash))
1620 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1622 // Construct new block index object
1623 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1625 return error("AddToBlockIndex() : new CBlockIndex failed");
1626 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1627 pindexNew->phashBlock = &((*mi).first);
1628 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1629 if (miPrev != mapBlockIndex.end())
1631 pindexNew->pprev = (*miPrev).second;
1632 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1634 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1638 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1639 if (!txdb.TxnCommit())
1643 if (pindexNew->bnChainWork > bnBestChainWork)
1644 if (!SetBestChain(txdb, pindexNew))
1649 if (pindexNew == pindexBest)
1651 // Notify UI to display prev block's coinbase if it was ours
1652 static uint256 hashPrevBestCoinBase;
1653 CRITICAL_BLOCK(cs_mapWallet)
1654 vWalletUpdated.push_back(hashPrevBestCoinBase);
1655 hashPrevBestCoinBase = vtx[0].GetHash();
1665 bool CBlock::CheckBlock() const
1667 // These are checks that are independent of context
1668 // that can be verified before saving an orphan block.
1671 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1672 return error("CheckBlock() : size limits failed");
1674 // Check proof of work matches claimed amount
1675 if (!CheckProofOfWork(GetHash(), nBits))
1676 return error("CheckBlock() : proof of work failed");
1679 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1680 return error("CheckBlock() : block timestamp too far in the future");
1682 // First transaction must be coinbase, the rest must not be
1683 if (vtx.empty() || !vtx[0].IsCoinBase())
1684 return error("CheckBlock() : first tx is not coinbase");
1685 for (int i = 1; i < vtx.size(); i++)
1686 if (vtx[i].IsCoinBase())
1687 return error("CheckBlock() : more than one coinbase");
1689 // Check transactions
1690 foreach(const CTransaction& tx, vtx)
1691 if (!tx.CheckTransaction())
1692 return error("CheckBlock() : CheckTransaction failed");
1694 // Check that it's not full of nonstandard transactions
1695 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1696 return error("CheckBlock() : too many nonstandard transactions");
1699 if (hashMerkleRoot != BuildMerkleTree())
1700 return error("CheckBlock() : hashMerkleRoot mismatch");
1705 bool CBlock::AcceptBlock()
1707 // Check for duplicate
1708 uint256 hash = GetHash();
1709 if (mapBlockIndex.count(hash))
1710 return error("AcceptBlock() : block already in mapBlockIndex");
1712 // Get prev block index
1713 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1714 if (mi == mapBlockIndex.end())
1715 return error("AcceptBlock() : prev block not found");
1716 CBlockIndex* pindexPrev = (*mi).second;
1717 int nHeight = pindexPrev->nHeight+1;
1719 // Check proof of work
1720 if (nBits != GetNextWorkRequired(pindexPrev))
1721 return error("AcceptBlock() : incorrect proof of work");
1723 // Check timestamp against prev
1724 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1725 return error("AcceptBlock() : block's timestamp is too early");
1727 // Check that all transactions are finalized
1728 foreach(const CTransaction& tx, vtx)
1729 if (!tx.IsFinal(nHeight, GetBlockTime()))
1730 return error("AcceptBlock() : contains a non-final transaction");
1732 // Check that the block chain matches the known block chain up to a checkpoint
1734 if ((nHeight == 11111 && hash != uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d")) ||
1735 (nHeight == 33333 && hash != uint256("0x000000002dd5588a74784eaa7ab0507a18ad16a236e7b1ce69f00d7ddfb5d0a6")) ||
1736 (nHeight == 68555 && hash != uint256("0x00000000001e1b4903550a0b96e9a9405c8a95f387162e4944e8d9fbe501cd6a")) ||
1737 (nHeight == 70567 && hash != uint256("0x00000000006a49b14bcf27462068f1264c961f11fa2e0eddd2be0791e1d4124a")) ||
1738 (nHeight == 74000 && hash != uint256("0x0000000000573993a3c9e41ce34471c079dcf5f52a0e824a81e7f953b8661a20")) ||
1739 (nHeight == 105000 && hash != uint256("0x00000000000291ce28027faea320c8d2b054b2e0fe44a773f3eefb151d6bdc97")))
1740 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1742 // Write block to history file
1743 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1744 return error("AcceptBlock() : out of disk space");
1745 unsigned int nFile = -1;
1746 unsigned int nBlockPos = 0;
1747 if (!WriteToDisk(nFile, nBlockPos))
1748 return error("AcceptBlock() : WriteToDisk failed");
1749 if (!AddToBlockIndex(nFile, nBlockPos))
1750 return error("AcceptBlock() : AddToBlockIndex failed");
1752 // Relay inventory, but don't relay old inventory during initial block download
1753 if (hashBestChain == hash)
1754 CRITICAL_BLOCK(cs_vNodes)
1755 foreach(CNode* pnode, vNodes)
1756 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 105000))
1757 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1762 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1764 // Check for duplicate
1765 uint256 hash = pblock->GetHash();
1766 if (mapBlockIndex.count(hash))
1767 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1768 if (mapOrphanBlocks.count(hash))
1769 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1771 // Preliminary checks
1772 if (!pblock->CheckBlock())
1773 return error("ProcessBlock() : CheckBlock FAILED");
1775 // If don't already have its previous block, shunt it off to holding area until we get it
1776 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1778 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1779 CBlock* pblock2 = new CBlock(*pblock);
1780 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1781 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1783 // Ask this guy to fill in what we're missing
1785 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1790 if (!pblock->AcceptBlock())
1791 return error("ProcessBlock() : AcceptBlock FAILED");
1793 // Recursively process any orphan blocks that depended on this one
1794 vector<uint256> vWorkQueue;
1795 vWorkQueue.push_back(hash);
1796 for (int i = 0; i < vWorkQueue.size(); i++)
1798 uint256 hashPrev = vWorkQueue[i];
1799 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1800 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1803 CBlock* pblockOrphan = (*mi).second;
1804 if (pblockOrphan->AcceptBlock())
1805 vWorkQueue.push_back(pblockOrphan->GetHash());
1806 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1807 delete pblockOrphan;
1809 mapOrphanBlocksByPrev.erase(hashPrev);
1812 printf("ProcessBlock: ACCEPTED\n");
1823 template<typename Stream>
1824 bool ScanMessageStart(Stream& s)
1826 // Scan ahead to the next pchMessageStart, which should normally be immediately
1827 // at the file pointer. Leaves file pointer at end of pchMessageStart.
1829 short prevmask = s.exceptions(0);
1830 const char* p = BEGIN(pchMessageStart);
1840 s.exceptions(prevmask);
1844 p = BEGIN(pchMessageStart);
1847 if (++p == END(pchMessageStart))
1850 s.exceptions(prevmask);
1859 s.exceptions(prevmask);
1864 bool CheckDiskSpace(uint64 nAdditionalBytes)
1866 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1868 // Check for 15MB because database could create another 10MB log file at any time
1869 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1872 string strMessage = _("Warning: Disk space is low ");
1873 strMiscWarning = strMessage;
1874 printf("*** %s\n", strMessage.c_str());
1875 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1876 CreateThread(Shutdown, NULL);
1882 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1886 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1889 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1891 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1900 static unsigned int nCurrentBlockFile = 1;
1902 FILE* AppendBlockFile(unsigned int& nFileRet)
1907 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1910 if (fseek(file, 0, SEEK_END) != 0)
1912 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1913 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1915 nFileRet = nCurrentBlockFile;
1919 nCurrentBlockFile++;
1923 bool LoadBlockIndex(bool fAllowNew)
1927 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1928 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1929 pchMessageStart[0] = 0xfa;
1930 pchMessageStart[1] = 0xbf;
1931 pchMessageStart[2] = 0xb5;
1932 pchMessageStart[3] = 0xda;
1939 if (!txdb.LoadBlockIndex())
1944 // Init with genesis block
1946 if (mapBlockIndex.empty())
1952 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1953 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1954 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1955 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1956 // vMerkleTree: 4a5e1e
1959 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1961 txNew.vin.resize(1);
1962 txNew.vout.resize(1);
1963 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1964 txNew.vout[0].nValue = 50 * COIN;
1965 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1967 block.vtx.push_back(txNew);
1968 block.hashPrevBlock = 0;
1969 block.hashMerkleRoot = block.BuildMerkleTree();
1971 block.nTime = 1231006505;
1972 block.nBits = 0x1d00ffff;
1973 block.nNonce = 2083236893;
1977 block.nTime = 1296688602;
1978 block.nBits = 0x1d07fff8;
1979 block.nNonce = 384568319;
1983 printf("%s\n", block.GetHash().ToString().c_str());
1984 printf("%s\n", hashGenesisBlock.ToString().c_str());
1985 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1986 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1988 assert(block.GetHash() == hashGenesisBlock);
1990 // Start new block file
1992 unsigned int nBlockPos;
1993 if (!block.WriteToDisk(nFile, nBlockPos))
1994 return error("LoadBlockIndex() : writing genesis block to disk failed");
1995 if (!block.AddToBlockIndex(nFile, nBlockPos))
1996 return error("LoadBlockIndex() : genesis block not accepted");
2004 void PrintBlockTree()
2006 // precompute tree structure
2007 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2008 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2010 CBlockIndex* pindex = (*mi).second;
2011 mapNext[pindex->pprev].push_back(pindex);
2013 //while (rand() % 3 == 0)
2014 // mapNext[pindex->pprev].push_back(pindex);
2017 vector<pair<int, CBlockIndex*> > vStack;
2018 vStack.push_back(make_pair(0, pindexGenesisBlock));
2021 while (!vStack.empty())
2023 int nCol = vStack.back().first;
2024 CBlockIndex* pindex = vStack.back().second;
2027 // print split or gap
2028 if (nCol > nPrevCol)
2030 for (int i = 0; i < nCol-1; i++)
2034 else if (nCol < nPrevCol)
2036 for (int i = 0; i < nCol; i++)
2043 for (int i = 0; i < nCol; i++)
2048 block.ReadFromDisk(pindex);
2049 printf("%d (%u,%u) %s %s tx %d",
2053 block.GetHash().ToString().substr(0,20).c_str(),
2054 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2057 CRITICAL_BLOCK(cs_mapWallet)
2059 if (mapWallet.count(block.vtx[0].GetHash()))
2061 CWalletTx& wtx = mapWallet[block.vtx[0].GetHash()];
2062 printf(" mine: %d %d %d", wtx.GetDepthInMainChain(), wtx.GetBlocksToMaturity(), wtx.GetCredit());
2068 // put the main timechain first
2069 vector<CBlockIndex*>& vNext = mapNext[pindex];
2070 for (int i = 0; i < vNext.size(); i++)
2072 if (vNext[i]->pnext)
2074 swap(vNext[0], vNext[i]);
2080 for (int i = 0; i < vNext.size(); i++)
2081 vStack.push_back(make_pair(nCol+i, vNext[i]));
2094 //////////////////////////////////////////////////////////////////////////////
2099 map<uint256, CAlert> mapAlerts;
2100 CCriticalSection cs_mapAlerts;
2102 string GetWarnings(string strFor)
2105 string strStatusBar;
2107 if (GetBoolArg("-testsafemode"))
2110 // Misc warnings like out of disk space and clock is wrong
2111 if (strMiscWarning != "")
2114 strStatusBar = strMiscWarning;
2117 // Longer invalid proof-of-work chain
2118 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2121 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2125 CRITICAL_BLOCK(cs_mapAlerts)
2127 foreach(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2129 const CAlert& alert = item.second;
2130 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2132 nPriority = alert.nPriority;
2133 strStatusBar = alert.strStatusBar;
2138 if (strFor == "statusbar")
2139 return strStatusBar;
2140 else if (strFor == "rpc")
2142 assert(("GetWarnings() : invalid parameter", false));
2146 bool CAlert::ProcessAlert()
2148 if (!CheckSignature())
2153 CRITICAL_BLOCK(cs_mapAlerts)
2155 // Cancel previous alerts
2156 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2158 const CAlert& alert = (*mi).second;
2161 printf("cancelling alert %d\n", alert.nID);
2162 mapAlerts.erase(mi++);
2164 else if (!alert.IsInEffect())
2166 printf("expiring alert %d\n", alert.nID);
2167 mapAlerts.erase(mi++);
2173 // Check if this alert has been cancelled
2174 foreach(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2176 const CAlert& alert = item.second;
2177 if (alert.Cancels(*this))
2179 printf("alert already cancelled by %d\n", alert.nID);
2185 mapAlerts.insert(make_pair(GetHash(), *this));
2188 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2200 //////////////////////////////////////////////////////////////////////////////
2206 bool AlreadyHave(CTxDB& txdb, const CInv& inv)
2210 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2211 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2213 // Don't know what it is, just say we already got one
2220 // The message start string is designed to be unlikely to occur in normal data.
2221 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2222 // a large 4-byte int at any alignment.
2223 char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2226 bool ProcessMessages(CNode* pfrom)
2228 CDataStream& vRecv = pfrom->vRecv;
2232 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2236 // (4) message start
2245 // Scan for message start
2246 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2247 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2248 if (vRecv.end() - pstart < nHeaderSize)
2250 if (vRecv.size() > nHeaderSize)
2252 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2253 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2257 if (pstart - vRecv.begin() > 0)
2258 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2259 vRecv.erase(vRecv.begin(), pstart);
2262 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2267 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2270 string strCommand = hdr.GetCommand();
2273 unsigned int nMessageSize = hdr.nMessageSize;
2274 if (nMessageSize > MAX_SIZE)
2276 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2279 if (nMessageSize > vRecv.size())
2281 // Rewind and wait for rest of message
2282 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2287 if (vRecv.GetVersion() >= 209)
2289 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2290 unsigned int nChecksum = 0;
2291 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2292 if (nChecksum != hdr.nChecksum)
2294 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2295 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2300 // Copy message to its own buffer
2301 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2302 vRecv.ignore(nMessageSize);
2308 CRITICAL_BLOCK(cs_main)
2309 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2313 catch (std::ios_base::failure& e)
2315 if (strstr(e.what(), "end of data"))
2317 // Allow exceptions from underlength message on vRecv
2318 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());
2320 else if (strstr(e.what(), "size too large"))
2322 // Allow exceptions from overlong size
2323 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2327 PrintExceptionContinue(&e, "ProcessMessage()");
2330 catch (std::exception& e) {
2331 PrintExceptionContinue(&e, "ProcessMessage()");
2333 PrintExceptionContinue(NULL, "ProcessMessage()");
2337 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2347 bool ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2349 static map<unsigned int, vector<unsigned char> > mapReuseKey;
2350 RandAddSeedPerfmon();
2352 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2353 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2354 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2356 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2364 if (strCommand == "version")
2366 // Each connection can only send one version message
2367 if (pfrom->nVersion != 0)
2374 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2375 if (pfrom->nVersion == 10300)
2376 pfrom->nVersion = 300;
2377 if (pfrom->nVersion >= 106 && !vRecv.empty())
2378 vRecv >> addrFrom >> nNonce;
2379 if (pfrom->nVersion >= 106 && !vRecv.empty())
2380 vRecv >> pfrom->strSubVer;
2381 if (pfrom->nVersion >= 209 && !vRecv.empty())
2382 vRecv >> pfrom->nStartingHeight;
2384 if (pfrom->nVersion == 0)
2387 // Disconnect if we connected to ourself
2388 if (nNonce == nLocalHostNonce && nNonce > 1)
2390 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2391 pfrom->fDisconnect = true;
2395 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2397 AddTimeData(pfrom->addr.ip, nTime);
2400 if (pfrom->nVersion >= 209)
2401 pfrom->PushMessage("verack");
2402 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
2403 if (pfrom->nVersion < 209)
2404 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2406 if (!pfrom->fInbound)
2408 // Advertise our address
2409 if (addrLocalHost.IsRoutable() && !fUseProxy)
2411 CAddress addr(addrLocalHost);
2412 addr.nTime = GetAdjustedTime();
2413 pfrom->PushAddress(addr);
2416 // Get recent addresses
2417 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2419 pfrom->PushMessage("getaddr");
2420 pfrom->fGetAddr = true;
2424 // Ask the first connected node for block updates
2425 static int nAskedForBlocks;
2426 if (!pfrom->fClient && (nAskedForBlocks < 1 || vNodes.size() <= 1))
2429 pfrom->PushGetBlocks(pindexBest, uint256(0));
2433 CRITICAL_BLOCK(cs_mapAlerts)
2434 foreach(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2435 item.second.RelayTo(pfrom);
2437 pfrom->fSuccessfullyConnected = true;
2439 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2443 else if (pfrom->nVersion == 0)
2445 // Must have a version message before anything else
2450 else if (strCommand == "verack")
2452 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2456 else if (strCommand == "addr")
2458 vector<CAddress> vAddr;
2461 // Don't want addr from older versions unless seeding
2462 if (pfrom->nVersion < 209)
2464 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2466 if (vAddr.size() > 1000)
2467 return error("message addr size() = %d", vAddr.size());
2469 // Store the new addresses
2470 int64 nNow = GetAdjustedTime();
2471 int64 nSince = nNow - 10 * 60;
2472 foreach(CAddress& addr, vAddr)
2476 // ignore IPv6 for now, since it isn't implemented anyway
2479 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2480 addr.nTime = nNow - 5 * 24 * 60 * 60;
2481 AddAddress(addr, 2 * 60 * 60);
2482 pfrom->AddAddressKnown(addr);
2483 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2485 // Relay to a limited number of other nodes
2486 CRITICAL_BLOCK(cs_vNodes)
2488 // Use deterministic randomness to send to the same nodes for 24 hours
2489 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2490 static uint256 hashSalt;
2492 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2493 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
2494 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2495 multimap<uint256, CNode*> mapMix;
2496 foreach(CNode* pnode, vNodes)
2498 if (pnode->nVersion < 31402)
2500 unsigned int nPointer;
2501 memcpy(&nPointer, &pnode, sizeof(nPointer));
2502 uint256 hashKey = hashRand ^ nPointer;
2503 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2504 mapMix.insert(make_pair(hashKey, pnode));
2506 int nRelayNodes = 2;
2507 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2508 ((*mi).second)->PushAddress(addr);
2512 if (vAddr.size() < 1000)
2513 pfrom->fGetAddr = false;
2517 else if (strCommand == "inv")
2521 if (vInv.size() > 50000)
2522 return error("message inv size() = %d", vInv.size());
2525 foreach(const CInv& inv, vInv)
2529 pfrom->AddInventoryKnown(inv);
2531 bool fAlreadyHave = AlreadyHave(txdb, inv);
2532 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2536 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2537 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2539 // Track requests for our stuff
2540 CRITICAL_BLOCK(cs_mapRequestCount)
2542 map<uint256, int>::iterator mi = mapRequestCount.find(inv.hash);
2543 if (mi != mapRequestCount.end())
2550 else if (strCommand == "getdata")
2554 if (vInv.size() > 50000)
2555 return error("message getdata size() = %d", vInv.size());
2557 foreach(const CInv& inv, vInv)
2561 printf("received getdata for: %s\n", inv.ToString().c_str());
2563 if (inv.type == MSG_BLOCK)
2565 // Send block from disk
2566 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2567 if (mi != mapBlockIndex.end())
2570 block.ReadFromDisk((*mi).second);
2571 pfrom->PushMessage("block", block);
2573 // Trigger them to send a getblocks request for the next batch of inventory
2574 if (inv.hash == pfrom->hashContinue)
2576 // Bypass PushInventory, this must send even if redundant,
2577 // and we want it right after the last block so they don't
2578 // wait for other stuff first.
2580 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2581 pfrom->PushMessage("inv", vInv);
2582 pfrom->hashContinue = 0;
2586 else if (inv.IsKnownType())
2588 // Send stream from relay memory
2589 CRITICAL_BLOCK(cs_mapRelay)
2591 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2592 if (mi != mapRelay.end())
2593 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2597 // Track requests for our stuff
2598 CRITICAL_BLOCK(cs_mapRequestCount)
2600 map<uint256, int>::iterator mi = mapRequestCount.find(inv.hash);
2601 if (mi != mapRequestCount.end())
2608 else if (strCommand == "getblocks")
2610 CBlockLocator locator;
2612 vRecv >> locator >> hashStop;
2614 // Find the last block the caller has in the main chain
2615 CBlockIndex* pindex = locator.GetBlockIndex();
2617 // Send the rest of the chain
2619 pindex = pindex->pnext;
2620 int nLimit = 500 + locator.GetDistanceBack();
2621 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2622 for (; pindex; pindex = pindex->pnext)
2624 if (pindex->GetBlockHash() == hashStop)
2626 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
2629 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2632 // When this block is requested, we'll send an inv that'll make them
2633 // getblocks the next batch of inventory.
2634 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
2635 pfrom->hashContinue = pindex->GetBlockHash();
2642 else if (strCommand == "getheaders")
2644 CBlockLocator locator;
2646 vRecv >> locator >> hashStop;
2648 CBlockIndex* pindex = NULL;
2649 if (locator.IsNull())
2651 // If locator is null, return the hashStop block
2652 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2653 if (mi == mapBlockIndex.end())
2655 pindex = (*mi).second;
2659 // Find the last block the caller has in the main chain
2660 pindex = locator.GetBlockIndex();
2662 pindex = pindex->pnext;
2665 vector<CBlock> vHeaders;
2666 int nLimit = 2000 + locator.GetDistanceBack();
2667 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2668 for (; pindex; pindex = pindex->pnext)
2670 vHeaders.push_back(pindex->GetBlockHeader());
2671 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2674 pfrom->PushMessage("headers", vHeaders);
2678 else if (strCommand == "tx")
2680 vector<uint256> vWorkQueue;
2681 CDataStream vMsg(vRecv);
2685 CInv inv(MSG_TX, tx.GetHash());
2686 pfrom->AddInventoryKnown(inv);
2688 bool fMissingInputs = false;
2689 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2691 AddToWalletIfMine(tx, NULL);
2692 RelayMessage(inv, vMsg);
2693 mapAlreadyAskedFor.erase(inv);
2694 vWorkQueue.push_back(inv.hash);
2696 // Recursively process any orphan transactions that depended on this one
2697 for (int i = 0; i < vWorkQueue.size(); i++)
2699 uint256 hashPrev = vWorkQueue[i];
2700 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2701 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2704 const CDataStream& vMsg = *((*mi).second);
2706 CDataStream(vMsg) >> tx;
2707 CInv inv(MSG_TX, tx.GetHash());
2709 if (tx.AcceptToMemoryPool(true))
2711 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2712 AddToWalletIfMine(tx, NULL);
2713 RelayMessage(inv, vMsg);
2714 mapAlreadyAskedFor.erase(inv);
2715 vWorkQueue.push_back(inv.hash);
2720 foreach(uint256 hash, vWorkQueue)
2721 EraseOrphanTx(hash);
2723 else if (fMissingInputs)
2725 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2731 else if (strCommand == "block")
2736 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2739 CInv inv(MSG_BLOCK, block.GetHash());
2740 pfrom->AddInventoryKnown(inv);
2742 if (ProcessBlock(pfrom, &block))
2743 mapAlreadyAskedFor.erase(inv);
2747 else if (strCommand == "getaddr")
2749 // Nodes rebroadcast an addr every 24 hours
2750 pfrom->vAddrToSend.clear();
2751 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2752 CRITICAL_BLOCK(cs_mapAddresses)
2754 unsigned int nCount = 0;
2755 foreach(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2757 const CAddress& addr = item.second;
2758 if (addr.nTime > nSince)
2761 foreach(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2763 const CAddress& addr = item.second;
2764 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2765 pfrom->PushAddress(addr);
2771 else if (strCommand == "checkorder")
2776 if (!GetBoolArg("-allowreceivebyip"))
2778 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2785 /// we have a chance to check the order here
2787 // Keep giving the same key to the same ip until they use it
2788 if (!mapReuseKey.count(pfrom->addr.ip))
2789 mapReuseKey[pfrom->addr.ip] = GetKeyFromKeyPool();
2791 // Send back approval of order and pubkey to use
2792 CScript scriptPubKey;
2793 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2794 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2798 else if (strCommand == "submitorder")
2803 if (!GetBoolArg("-allowreceivebyip"))
2805 pfrom->PushMessage("reply", hashReply, (int)2);
2811 wtxNew.fFromMe = false;
2814 if (!wtxNew.AcceptWalletTransaction())
2816 pfrom->PushMessage("reply", hashReply, (int)1);
2817 return error("submitorder AcceptWalletTransaction() failed, returning error 1");
2819 wtxNew.fTimeReceivedIsTxTime = true;
2820 AddToWallet(wtxNew);
2821 wtxNew.RelayWalletTransaction();
2822 mapReuseKey.erase(pfrom->addr.ip);
2824 // Send back confirmation
2825 pfrom->PushMessage("reply", hashReply, (int)0);
2829 else if (strCommand == "reply")
2834 CRequestTracker tracker;
2835 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2837 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2838 if (mi != pfrom->mapRequests.end())
2840 tracker = (*mi).second;
2841 pfrom->mapRequests.erase(mi);
2844 if (!tracker.IsNull())
2845 tracker.fn(tracker.param1, vRecv);
2849 else if (strCommand == "ping")
2854 else if (strCommand == "alert")
2859 if (alert.ProcessAlert())
2862 pfrom->setKnown.insert(alert.GetHash());
2863 CRITICAL_BLOCK(cs_vNodes)
2864 foreach(CNode* pnode, vNodes)
2865 alert.RelayTo(pnode);
2872 // Ignore unknown commands for extensibility
2876 // Update the last seen time for this node's address
2877 if (pfrom->fNetworkNode)
2878 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2879 AddressCurrentlyConnected(pfrom->addr);
2893 bool SendMessages(CNode* pto, bool fSendTrickle)
2895 CRITICAL_BLOCK(cs_main)
2897 // Don't send anything until we get their version message
2898 if (pto->nVersion == 0)
2902 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2903 pto->PushMessage("ping");
2905 // Resend wallet transactions that haven't gotten in a block yet
2906 ResendWalletTransactions();
2908 // Address refresh broadcast
2909 static int64 nLastRebroadcast;
2910 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2912 nLastRebroadcast = GetTime();
2913 CRITICAL_BLOCK(cs_vNodes)
2915 foreach(CNode* pnode, vNodes)
2917 // Periodically clear setAddrKnown to allow refresh broadcasts
2918 pnode->setAddrKnown.clear();
2920 // Rebroadcast our address
2921 if (addrLocalHost.IsRoutable() && !fUseProxy)
2923 CAddress addr(addrLocalHost);
2924 addr.nTime = GetAdjustedTime();
2925 pnode->PushAddress(addr);
2931 // Clear out old addresses periodically so it's not too much work at once
2932 static int64 nLastClear;
2933 if (nLastClear == 0)
2934 nLastClear = GetTime();
2935 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2937 nLastClear = GetTime();
2938 CRITICAL_BLOCK(cs_mapAddresses)
2941 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2942 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2943 mi != mapAddresses.end();)
2945 const CAddress& addr = (*mi).second;
2946 if (addr.nTime < nSince)
2948 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2950 addrdb.EraseAddress(addr);
2951 mapAddresses.erase(mi++);
2965 vector<CAddress> vAddr;
2966 vAddr.reserve(pto->vAddrToSend.size());
2967 foreach(const CAddress& addr, pto->vAddrToSend)
2969 // returns true if wasn't already contained in the set
2970 if (pto->setAddrKnown.insert(addr).second)
2972 vAddr.push_back(addr);
2973 // receiver rejects addr messages larger than 1000
2974 if (vAddr.size() >= 1000)
2976 pto->PushMessage("addr", vAddr);
2981 pto->vAddrToSend.clear();
2983 pto->PushMessage("addr", vAddr);
2988 // Message: inventory
2991 vector<CInv> vInvWait;
2992 CRITICAL_BLOCK(pto->cs_inventory)
2994 vInv.reserve(pto->vInventoryToSend.size());
2995 vInvWait.reserve(pto->vInventoryToSend.size());
2996 foreach(const CInv& inv, pto->vInventoryToSend)
2998 if (pto->setInventoryKnown.count(inv))
3001 // trickle out tx inv to protect privacy
3002 if (inv.type == MSG_TX && !fSendTrickle)
3004 // 1/4 of tx invs blast to all immediately
3005 static uint256 hashSalt;
3007 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
3008 uint256 hashRand = inv.hash ^ hashSalt;
3009 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3010 bool fTrickleWait = ((hashRand & 3) != 0);
3012 // always trickle our own transactions
3015 TRY_CRITICAL_BLOCK(cs_mapWallet)
3017 map<uint256, CWalletTx>::iterator mi = mapWallet.find(inv.hash);
3018 if (mi != mapWallet.end())
3020 CWalletTx& wtx = (*mi).second;
3022 fTrickleWait = true;
3029 vInvWait.push_back(inv);
3034 // returns true if wasn't already contained in the set
3035 if (pto->setInventoryKnown.insert(inv).second)
3037 vInv.push_back(inv);
3038 if (vInv.size() >= 1000)
3040 pto->PushMessage("inv", vInv);
3045 pto->vInventoryToSend = vInvWait;
3048 pto->PushMessage("inv", vInv);
3054 vector<CInv> vGetData;
3055 int64 nNow = GetTime() * 1000000;
3057 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
3059 const CInv& inv = (*pto->mapAskFor.begin()).second;
3060 if (!AlreadyHave(txdb, inv))
3062 printf("sending getdata: %s\n", inv.ToString().c_str());
3063 vGetData.push_back(inv);
3064 if (vGetData.size() >= 1000)
3066 pto->PushMessage("getdata", vGetData);
3070 pto->mapAskFor.erase(pto->mapAskFor.begin());
3072 if (!vGetData.empty())
3073 pto->PushMessage("getdata", vGetData);
3092 //////////////////////////////////////////////////////////////////////////////
3097 void GenerateBitcoins(bool fGenerate)
3099 if (fGenerateBitcoins != fGenerate)
3101 fGenerateBitcoins = fGenerate;
3102 CWalletDB().WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3105 if (fGenerateBitcoins)
3107 int nProcessors = boost::thread::hardware_concurrency();
3108 printf("%d processors\n", nProcessors);
3109 if (nProcessors < 1)
3111 if (fLimitProcessors && nProcessors > nLimitProcessors)
3112 nProcessors = nLimitProcessors;
3113 int nAddThreads = nProcessors - vnThreadsRunning[3];
3114 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3115 for (int i = 0; i < nAddThreads; i++)
3117 if (!CreateThread(ThreadBitcoinMiner, NULL))
3118 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");
3124 void ThreadBitcoinMiner(void* parg)
3128 vnThreadsRunning[3]++;
3130 vnThreadsRunning[3]--;
3132 catch (std::exception& e) {
3133 vnThreadsRunning[3]--;
3134 PrintException(&e, "ThreadBitcoinMiner()");
3136 vnThreadsRunning[3]--;
3137 PrintException(NULL, "ThreadBitcoinMiner()");
3139 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3141 if (vnThreadsRunning[3] == 0)
3143 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3146 #if defined(__GNUC__) && defined(CRYPTOPP_X86_ASM_AVAILABLE)
3147 void CallCPUID(int in, int& aret, int& cret)
3151 "mov %2, %%eax; " // in into eax
3153 "mov %%eax, %0;" // eax into a
3154 "mov %%ecx, %1;" // ecx into c
3155 :"=r"(a),"=r"(c) /* output */
3156 :"r"(in) /* input */
3157 :"%eax","%ebx","%ecx","%edx" /* clobbered register */
3163 bool Detect128BitSSE2()
3166 CallCPUID(0, a, nBrand);
3167 bool fIntel = (nBrand == 0x6c65746e); // ntel
3168 bool fAMD = (nBrand == 0x444d4163); // cAMD
3172 unsigned int nStepping : 4;
3173 unsigned int nModel : 4;
3174 unsigned int nFamily : 4;
3175 unsigned int nProcessorType : 2;
3176 unsigned int nUnused : 2;
3177 unsigned int nExtendedModel : 4;
3178 unsigned int nExtendedFamily : 8;
3182 memcpy(&cpu, &a, sizeof(cpu));
3183 int nFamily = cpu.nExtendedFamily + cpu.nFamily;
3184 int nModel = cpu.nExtendedModel*16 + cpu.nModel;
3186 // We need Intel Nehalem or AMD K10 or better for 128bit SSE2
3187 // Nehalem = i3/i5/i7 and some Xeon
3188 // K10 = Opterons with 4 or more cores, Phenom, Phenom II, Athlon II
3189 // Intel Core i5 family 6, model 26 or 30
3190 // Intel Core i7 family 6, model 26 or 30
3191 // Intel Core i3 family 6, model 37
3192 // AMD Phenom family 16, model 10
3193 bool fUseSSE2 = ((fIntel && nFamily * 10000 + nModel >= 60026) ||
3194 (fAMD && nFamily * 10000 + nModel >= 160010));
3196 // AMD reports a lower model number in 64-bit mode
3197 if (fAMD && sizeof(void*) > 4 && nFamily * 10000 + nModel >= 160000)
3200 static bool fPrinted;
3204 printf("CPUID %08x family %d, model %d, stepping %d, fUseSSE2=%d\n", nBrand, nFamily, nModel, cpu.nStepping, fUseSSE2);
3209 bool Detect128BitSSE2() { return false; }
3212 int FormatHashBlocks(void* pbuffer, unsigned int len)
3214 unsigned char* pdata = (unsigned char*)pbuffer;
3215 unsigned int blocks = 1 + ((len + 8) / 64);
3216 unsigned char* pend = pdata + 64 * blocks;
3217 memset(pdata + len, 0, 64 * blocks - len);
3219 unsigned int bits = len * 8;
3220 pend[-1] = (bits >> 0) & 0xff;
3221 pend[-2] = (bits >> 8) & 0xff;
3222 pend[-3] = (bits >> 16) & 0xff;
3223 pend[-4] = (bits >> 24) & 0xff;
3227 using CryptoPP::ByteReverse;
3229 static const unsigned int pSHA256InitState[8] =
3230 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
3232 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
3234 memcpy(pstate, pinit, 32);
3235 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
3239 // ScanHash scans nonces looking for a hash with at least some zero bits.
3240 // It operates on big endian data. Caller does the byte reversing.
3241 // All input buffers are 16-byte aligned. nNonce is usually preserved
3242 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3243 // the block is rebuilt and nNonce starts over at zero.
3245 unsigned int ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3247 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3251 // Hash pdata using pmidstate as the starting state into
3252 // preformatted buffer phash1, then hash phash1 into phash
3254 SHA256Transform(phash1, pdata, pmidstate);
3255 SHA256Transform(phash, phash1, pSHA256InitState);
3257 // Return the nonce if the hash has at least some zero bits,
3258 // caller will check if it has enough to reach the target
3259 if (((unsigned short*)phash)[14] == 0)
3262 // If nothing found after trying for a while, return -1
3263 if ((nNonce & 0xffff) == 0)
3265 nHashesDone = 0xffff+1;
3271 extern unsigned int ScanHash_4WaySSE2(char* pmidstate, char* pblock, char* phash1, char* phash, unsigned int& nHashesDone);
3279 set<uint256> setDependsOn;
3282 COrphan(CTransaction* ptxIn)
3290 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3291 foreach(uint256 hash, setDependsOn)
3292 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3297 CBlock* CreateNewBlock(CReserveKey& reservekey)
3299 CBlockIndex* pindexPrev = pindexBest;
3302 auto_ptr<CBlock> pblock(new CBlock());
3306 // Create coinbase tx
3308 txNew.vin.resize(1);
3309 txNew.vin[0].prevout.SetNull();
3310 txNew.vout.resize(1);
3311 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3313 // Add our coinbase tx as first transaction
3314 pblock->vtx.push_back(txNew);
3316 // Collect memory pool transactions into the block
3318 CRITICAL_BLOCK(cs_main)
3319 CRITICAL_BLOCK(cs_mapTransactions)
3323 // Priority order to process transactions
3324 list<COrphan> vOrphan; // list memory doesn't move
3325 map<uint256, vector<COrphan*> > mapDependers;
3326 multimap<double, CTransaction*> mapPriority;
3327 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
3329 CTransaction& tx = (*mi).second;
3330 if (tx.IsCoinBase() || !tx.IsFinal())
3333 COrphan* porphan = NULL;
3334 double dPriority = 0;
3335 foreach(const CTxIn& txin, tx.vin)
3337 // Read prev transaction
3338 CTransaction txPrev;
3340 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3342 // Has to wait for dependencies
3345 // Use list for automatic deletion
3346 vOrphan.push_back(COrphan(&tx));
3347 porphan = &vOrphan.back();
3349 mapDependers[txin.prevout.hash].push_back(porphan);
3350 porphan->setDependsOn.insert(txin.prevout.hash);
3353 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3355 // Read block header
3356 int nConf = txindex.GetDepthInMainChain();
3358 dPriority += (double)nValueIn * nConf;
3360 if (fDebug && GetBoolArg("-printpriority"))
3361 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3364 // Priority is sum(valuein * age) / txsize
3365 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3368 porphan->dPriority = dPriority;
3370 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3372 if (fDebug && GetBoolArg("-printpriority"))
3374 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3381 // Collect transactions into block
3382 map<uint256, CTxIndex> mapTestPool;
3383 uint64 nBlockSize = 1000;
3384 int nBlockSigOps = 100;
3385 while (!mapPriority.empty())
3387 // Take highest priority transaction off priority queue
3388 double dPriority = -(*mapPriority.begin()).first;
3389 CTransaction& tx = *(*mapPriority.begin()).second;
3390 mapPriority.erase(mapPriority.begin());
3393 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3394 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3396 int nTxSigOps = tx.GetSigOpCount();
3397 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3400 // Transaction fee required depends on block size
3401 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3402 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree);
3404 // Connecting shouldn't fail due to dependency on other memory pool transactions
3405 // because we're already processing them in order of dependency
3406 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3407 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
3409 swap(mapTestPool, mapTestPoolTmp);
3412 pblock->vtx.push_back(tx);
3413 nBlockSize += nTxSize;
3414 nBlockSigOps += nTxSigOps;
3416 // Add transactions that depend on this one to the priority queue
3417 uint256 hash = tx.GetHash();
3418 if (mapDependers.count(hash))
3420 foreach(COrphan* porphan, mapDependers[hash])
3422 if (!porphan->setDependsOn.empty())
3424 porphan->setDependsOn.erase(hash);
3425 if (porphan->setDependsOn.empty())
3426 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3432 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3435 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3436 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3437 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3438 pblock->nBits = GetNextWorkRequired(pindexPrev);
3441 return pblock.release();
3445 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce, int64& nPrevTime)
3447 // Update nExtraNonce
3448 int64 nNow = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3449 if (++nExtraNonce >= 0x7f && nNow > nPrevTime+1)
3454 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nBits << CBigNum(nExtraNonce);
3455 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3459 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3462 // Prebuild hash buffers
3469 uint256 hashPrevBlock;
3470 uint256 hashMerkleRoot;
3473 unsigned int nNonce;
3476 unsigned char pchPadding0[64];
3478 unsigned char pchPadding1[64];
3481 memset(&tmp, 0, sizeof(tmp));
3483 tmp.block.nVersion = pblock->nVersion;
3484 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3485 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3486 tmp.block.nTime = pblock->nTime;
3487 tmp.block.nBits = pblock->nBits;
3488 tmp.block.nNonce = pblock->nNonce;
3490 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3491 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3493 // Byte swap all the input buffer
3494 for (int i = 0; i < sizeof(tmp)/4; i++)
3495 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3497 // Precalc the first half of the first hash, which stays constant
3498 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3500 memcpy(pdata, &tmp.block, 128);
3501 memcpy(phash1, &tmp.hash1, 64);
3505 bool CheckWork(CBlock* pblock, CReserveKey& reservekey)
3507 uint256 hash = pblock->GetHash();
3508 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3510 if (hash > hashTarget)
3514 printf("BitcoinMiner:\n");
3515 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3517 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3518 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3521 CRITICAL_BLOCK(cs_main)
3523 if (pblock->hashPrevBlock != hashBestChain)
3524 return error("BitcoinMiner : generated block is stale");
3526 // Remove key from key pool
3527 reservekey.KeepKey();
3529 // Track how many getdata requests this block gets
3530 CRITICAL_BLOCK(cs_mapRequestCount)
3531 mapRequestCount[pblock->GetHash()] = 0;
3533 // Process this block the same as if we had received it from another node
3534 if (!ProcessBlock(NULL, pblock))
3535 return error("BitcoinMiner : ProcessBlock, block not accepted");
3545 printf("BitcoinMiner started\n");
3546 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3547 bool f4WaySSE2 = Detect128BitSSE2();
3548 if (mapArgs.count("-4way"))
3549 f4WaySSE2 = GetBoolArg("-4way");
3551 // Each thread has its own key and counter
3552 CReserveKey reservekey;
3553 unsigned int nExtraNonce = 0;
3554 int64 nPrevTime = 0;
3556 while (fGenerateBitcoins)
3558 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3562 while (vNodes.empty() || IsInitialBlockDownload())
3567 if (!fGenerateBitcoins)
3575 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3576 CBlockIndex* pindexPrev = pindexBest;
3578 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3581 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce, nPrevTime);
3583 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3587 // Prebuild hash buffers
3589 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3590 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3591 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3593 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3595 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3596 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3602 int64 nStart = GetTime();
3603 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3605 uint256& hash = *alignup<16>(hashbuf);
3608 unsigned int nHashesDone = 0;
3609 unsigned int nNonceFound;
3613 // tcatm's 4-way 128-bit SSE2 SHA-256
3614 nNonceFound = ScanHash_4WaySSE2(pmidstate, pdata + 64, phash1, (char*)&hash, nHashesDone);
3618 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1, (char*)&hash, nHashesDone);
3620 // Check if something found
3621 if (nNonceFound != -1)
3623 for (int i = 0; i < sizeof(hash)/4; i++)
3624 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3626 if (hash <= hashTarget)
3629 pblock->nNonce = ByteReverse(nNonceFound);
3630 assert(hash == pblock->GetHash());
3632 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3633 CheckWork(pblock.get(), reservekey);
3634 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3640 static int64 nHashCounter;
3641 if (nHPSTimerStart == 0)
3643 nHPSTimerStart = GetTimeMillis();
3647 nHashCounter += nHashesDone;
3648 if (GetTimeMillis() - nHPSTimerStart > 4000)
3650 static CCriticalSection cs;
3653 if (GetTimeMillis() - nHPSTimerStart > 4000)
3655 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3656 nHPSTimerStart = GetTimeMillis();
3658 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3659 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3660 static int64 nLogTime;
3661 if (GetTime() - nLogTime > 30 * 60)
3663 nLogTime = GetTime();
3664 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3665 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3671 // Check for stop or if block needs to be rebuilt
3674 if (!fGenerateBitcoins)
3676 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3680 if (nBlockNonce >= 0xffff0000)
3682 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3684 if (pindexPrev != pindexBest)
3687 // Update nTime every few seconds
3688 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3689 nBlockTime = ByteReverse(pblock->nTime);
3711 //////////////////////////////////////////////////////////////////////////////
3719 int64 nStart = GetTimeMillis();
3722 CRITICAL_BLOCK(cs_mapWallet)
3724 for (map<uint256, CWalletTx>::iterator it = mapWallet.begin(); it != mapWallet.end(); ++it)
3726 CWalletTx* pcoin = &(*it).second;
3727 if (!pcoin->IsFinal() || pcoin->fSpent || !pcoin->IsConfirmed())
3729 nTotal += pcoin->GetCredit();
3733 //printf("GetBalance() %"PRI64d"ms\n", GetTimeMillis() - nStart);
3738 bool SelectCoinsMinConf(int64 nTargetValue, int nConfMine, int nConfTheirs, set<CWalletTx*>& setCoinsRet)
3740 setCoinsRet.clear();
3742 // List of values less than target
3743 int64 nLowestLarger = INT64_MAX;
3744 CWalletTx* pcoinLowestLarger = NULL;
3745 vector<pair<int64, CWalletTx*> > vValue;
3746 int64 nTotalLower = 0;
3748 CRITICAL_BLOCK(cs_mapWallet)
3750 vector<CWalletTx*> vCoins;
3751 vCoins.reserve(mapWallet.size());
3752 for (map<uint256, CWalletTx>::iterator it = mapWallet.begin(); it != mapWallet.end(); ++it)
3753 vCoins.push_back(&(*it).second);
3754 random_shuffle(vCoins.begin(), vCoins.end(), GetRandInt);
3756 foreach(CWalletTx* pcoin, vCoins)
3758 if (!pcoin->IsFinal() || pcoin->fSpent || !pcoin->IsConfirmed())
3761 int nDepth = pcoin->GetDepthInMainChain();
3762 if (nDepth < (pcoin->IsFromMe() ? nConfMine : nConfTheirs))
3765 int64 n = pcoin->GetCredit();
3768 if (n < nTargetValue)
3770 vValue.push_back(make_pair(n, pcoin));
3773 else if (n == nTargetValue)
3775 setCoinsRet.insert(pcoin);
3778 else if (n < nLowestLarger)
3781 pcoinLowestLarger = pcoin;
3786 if (nTotalLower < nTargetValue)
3788 if (pcoinLowestLarger == NULL)
3790 setCoinsRet.insert(pcoinLowestLarger);
3794 // Solve subset sum by stochastic approximation
3795 sort(vValue.rbegin(), vValue.rend());
3796 vector<char> vfIncluded;
3797 vector<char> vfBest(vValue.size(), true);
3798 int64 nBest = nTotalLower;
3800 for (int nRep = 0; nRep < 1000 && nBest != nTargetValue; nRep++)
3802 vfIncluded.assign(vValue.size(), false);
3804 bool fReachedTarget = false;
3805 for (int nPass = 0; nPass < 2 && !fReachedTarget; nPass++)
3807 for (int i = 0; i < vValue.size(); i++)
3809 if (nPass == 0 ? rand() % 2 : !vfIncluded[i])
3811 nTotal += vValue[i].first;
3812 vfIncluded[i] = true;
3813 if (nTotal >= nTargetValue)
3815 fReachedTarget = true;
3819 vfBest = vfIncluded;
3821 nTotal -= vValue[i].first;
3822 vfIncluded[i] = false;
3829 // If the next larger is still closer, return it
3830 if (pcoinLowestLarger && nLowestLarger - nTargetValue <= nBest - nTargetValue)
3831 setCoinsRet.insert(pcoinLowestLarger);
3834 for (int i = 0; i < vValue.size(); i++)
3836 setCoinsRet.insert(vValue[i].second);
3839 printf("SelectCoins() best subset: ");
3840 for (int i = 0; i < vValue.size(); i++)
3842 printf("%s ", FormatMoney(vValue[i].first).c_str());
3843 printf("total %s\n", FormatMoney(nBest).c_str());
3849 bool SelectCoins(int64 nTargetValue, set<CWalletTx*>& setCoinsRet)
3851 return (SelectCoinsMinConf(nTargetValue, 1, 6, setCoinsRet) ||
3852 SelectCoinsMinConf(nTargetValue, 1, 1, setCoinsRet) ||
3853 SelectCoinsMinConf(nTargetValue, 0, 1, setCoinsRet));
3859 bool CreateTransaction(CScript scriptPubKey, int64 nValue, CWalletTx& wtxNew, CReserveKey& reservekey, int64& nFeeRet)
3861 CRITICAL_BLOCK(cs_main)
3863 // txdb must be opened before the mapWallet lock
3865 CRITICAL_BLOCK(cs_mapWallet)
3867 nFeeRet = nTransactionFee;
3871 wtxNew.vout.clear();
3872 wtxNew.fFromMe = true;
3875 int64 nValueOut = nValue;
3876 int64 nTotalValue = nValue + nFeeRet;
3877 double dPriority = 0;
3879 // Choose coins to use
3880 set<CWalletTx*> setCoins;
3881 if (!SelectCoins(nTotalValue, setCoins))
3884 foreach(CWalletTx* pcoin, setCoins)
3886 int64 nCredit = pcoin->GetCredit();
3887 nValueIn += nCredit;
3888 dPriority += (double)nCredit * pcoin->GetDepthInMainChain();
3891 // Fill a vout to the payee
3892 bool fChangeFirst = GetRand(2);
3894 wtxNew.vout.push_back(CTxOut(nValueOut, scriptPubKey));
3896 // Fill a vout back to self with any change
3897 int64 nChange = nValueIn - nTotalValue;
3898 if (nChange >= CENT)
3900 // Note: We use a new key here to keep it from being obvious which side is the change.
3901 // The drawback is that by not reusing a previous key, the change may be lost if a
3902 // backup is restored, if the backup doesn't have the new private key for the change.
3903 // If we reused the old key, it would be possible to add code to look for and
3904 // rediscover unknown transactions that were written with keys of ours to recover
3905 // post-backup change.
3907 // Reserve a new key pair from key pool
3908 vector<unsigned char> vchPubKey = reservekey.GetReservedKey();
3909 assert(mapKeys.count(vchPubKey));
3911 // Fill a vout to ourself, using same address type as the payment
3912 CScript scriptChange;
3913 if (scriptPubKey.GetBitcoinAddressHash160() != 0)
3914 scriptChange.SetBitcoinAddress(vchPubKey);
3916 scriptChange << vchPubKey << OP_CHECKSIG;
3917 wtxNew.vout.push_back(CTxOut(nChange, scriptChange));
3920 reservekey.ReturnKey();
3922 // Fill a vout to the payee
3924 wtxNew.vout.push_back(CTxOut(nValueOut, scriptPubKey));
3927 foreach(CWalletTx* pcoin, setCoins)
3928 for (int nOut = 0; nOut < pcoin->vout.size(); nOut++)
3929 if (pcoin->vout[nOut].IsMine())
3930 wtxNew.vin.push_back(CTxIn(pcoin->GetHash(), nOut));
3934 foreach(CWalletTx* pcoin, setCoins)
3935 for (int nOut = 0; nOut < pcoin->vout.size(); nOut++)
3936 if (pcoin->vout[nOut].IsMine())
3937 if (!SignSignature(*pcoin, wtxNew, nIn++))
3941 unsigned int nBytes = ::GetSerializeSize(*(CTransaction*)&wtxNew, SER_NETWORK);
3942 if (nBytes >= MAX_BLOCK_SIZE_GEN/5)
3944 dPriority /= nBytes;
3946 // Check that enough fee is included
3947 int64 nPayFee = nTransactionFee * (1 + (int64)nBytes / 1000);
3948 bool fAllowFree = CTransaction::AllowFree(dPriority);
3949 int64 nMinFee = wtxNew.GetMinFee(1, fAllowFree);
3950 if (nFeeRet < max(nPayFee, nMinFee))
3952 nFeeRet = max(nPayFee, nMinFee);
3956 // Fill vtxPrev by copying from previous transactions vtxPrev
3957 wtxNew.AddSupportingTransactions(txdb);
3958 wtxNew.fTimeReceivedIsTxTime = true;
3967 // Call after CreateTransaction unless you want to abort
3968 bool CommitTransaction(CWalletTx& wtxNew, CReserveKey& reservekey)
3970 CRITICAL_BLOCK(cs_main)
3972 printf("CommitTransaction:\n%s", wtxNew.ToString().c_str());
3973 CRITICAL_BLOCK(cs_mapWallet)
3975 // This is only to keep the database open to defeat the auto-flush for the
3976 // duration of this scope. This is the only place where this optimization
3977 // maybe makes sense; please don't do it anywhere else.
3978 CWalletDB walletdb("r");
3980 // Take key pair from key pool so it won't be used again
3981 reservekey.KeepKey();
3983 // Add tx to wallet, because if it has change it's also ours,
3984 // otherwise just for transaction history.
3985 AddToWallet(wtxNew);
3987 // Mark old coins as spent
3988 set<CWalletTx*> setCoins;
3989 foreach(const CTxIn& txin, wtxNew.vin)
3990 setCoins.insert(&mapWallet[txin.prevout.hash]);
3991 foreach(CWalletTx* pcoin, setCoins)
3993 pcoin->fSpent = true;
3994 pcoin->WriteToDisk();
3995 vWalletUpdated.push_back(pcoin->GetHash());
3999 // Track how many getdata requests our transaction gets
4000 CRITICAL_BLOCK(cs_mapRequestCount)
4001 mapRequestCount[wtxNew.GetHash()] = 0;
4004 if (!wtxNew.AcceptToMemoryPool())
4006 // This must not fail. The transaction has already been signed and recorded.
4007 printf("CommitTransaction() : Error: Transaction not valid");
4010 wtxNew.RelayWalletTransaction();
4019 string SendMoney(CScript scriptPubKey, int64 nValue, CWalletTx& wtxNew, bool fAskFee)
4021 CRITICAL_BLOCK(cs_main)
4023 CReserveKey reservekey;
4025 if (!CreateTransaction(scriptPubKey, nValue, wtxNew, reservekey, nFeeRequired))
4028 if (nValue + nFeeRequired > GetBalance())
4029 strError = strprintf(_("Error: This is an oversized transaction that requires a transaction fee of %s "), FormatMoney(nFeeRequired).c_str());
4031 strError = _("Error: Transaction creation failed ");
4032 printf("SendMoney() : %s", strError.c_str());
4036 if (fAskFee && !ThreadSafeAskFee(nFeeRequired, _("Sending..."), NULL))
4039 if (!CommitTransaction(wtxNew, reservekey))
4040 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.");
4048 string SendMoneyToBitcoinAddress(string strAddress, int64 nValue, CWalletTx& wtxNew, bool fAskFee)
4052 return _("Invalid amount");
4053 if (nValue + nTransactionFee > GetBalance())
4054 return _("Insufficient funds");
4056 // Parse bitcoin address
4057 CScript scriptPubKey;
4058 if (!scriptPubKey.SetBitcoinAddress(strAddress))
4059 return _("Invalid bitcoin address");
4061 return SendMoney(scriptPubKey, nValue, wtxNew, fAskFee);