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;
82 //////////////////////////////////////////////////////////////////////////////
87 bool AddKey(const CKey& key)
89 CRITICAL_BLOCK(cs_mapKeys)
91 mapKeys[key.GetPubKey()] = key.GetPrivKey();
92 mapPubKeys[Hash160(key.GetPubKey())] = key.GetPubKey();
94 return CWalletDB().WriteKey(key.GetPubKey(), key.GetPrivKey());
97 vector<unsigned char> GenerateNewKey()
103 throw runtime_error("GenerateNewKey() : AddKey failed");
104 return key.GetPubKey();
110 //////////////////////////////////////////////////////////////////////////////
115 bool AddToWallet(const CWalletTx& wtxIn)
117 uint256 hash = wtxIn.GetHash();
118 CRITICAL_BLOCK(cs_mapWallet)
120 // Inserts only if not already there, returns tx inserted or tx found
121 pair<map<uint256, CWalletTx>::iterator, bool> ret = mapWallet.insert(make_pair(hash, wtxIn));
122 CWalletTx& wtx = (*ret.first).second;
123 bool fInsertedNew = ret.second;
125 wtx.nTimeReceived = GetAdjustedTime();
127 bool fUpdated = false;
131 if (wtxIn.hashBlock != 0 && wtxIn.hashBlock != wtx.hashBlock)
133 wtx.hashBlock = wtxIn.hashBlock;
136 if (wtxIn.nIndex != -1 && (wtxIn.vMerkleBranch != wtx.vMerkleBranch || wtxIn.nIndex != wtx.nIndex))
138 wtx.vMerkleBranch = wtxIn.vMerkleBranch;
139 wtx.nIndex = wtxIn.nIndex;
142 if (wtxIn.fFromMe && wtxIn.fFromMe != wtx.fFromMe)
144 wtx.fFromMe = wtxIn.fFromMe;
147 fUpdated |= wtx.UpdateSpent(wtxIn.vfSpent);
151 printf("AddToWallet %s %s%s\n", wtxIn.GetHash().ToString().substr(0,10).c_str(), (fInsertedNew ? "new" : ""), (fUpdated ? "update" : ""));
154 if (fInsertedNew || fUpdated)
155 if (!wtx.WriteToDisk())
158 // If default receiving address gets used, replace it with a new one
159 CScript scriptDefaultKey;
160 scriptDefaultKey.SetBitcoinAddress(vchDefaultKey);
161 foreach(const CTxOut& txout, wtx.vout)
163 if (txout.scriptPubKey == scriptDefaultKey)
166 vchDefaultKey = GetKeyFromKeyPool();
167 walletdb.WriteDefaultKey(vchDefaultKey);
168 walletdb.WriteName(PubKeyToAddress(vchDefaultKey), "");
173 vWalletUpdated.push_back(hash);
181 bool AddToWalletIfInvolvingMe(const CTransaction& tx, const CBlock* pblock, bool fUpdate = false)
183 uint256 hash = tx.GetHash();
184 bool fExisted = mapWallet.count(hash);
185 if (fExisted && !fUpdate) return false;
186 if (fExisted || tx.IsMine() || tx.IsFromMe())
189 // Get merkle branch if transaction was found in a block
191 wtx.SetMerkleBranch(pblock);
192 return AddToWallet(wtx);
197 bool EraseFromWallet(uint256 hash)
199 CRITICAL_BLOCK(cs_mapWallet)
201 if (mapWallet.erase(hash))
202 CWalletDB().EraseTx(hash);
207 void WalletUpdateSpent(const COutPoint& prevout)
209 // Anytime a signature is successfully verified, it's proof the outpoint is spent.
210 // Update the wallet spent flag if it doesn't know due to wallet.dat being
211 // restored from backup or the user making copies of wallet.dat.
212 CRITICAL_BLOCK(cs_mapWallet)
214 map<uint256, CWalletTx>::iterator mi = mapWallet.find(prevout.hash);
215 if (mi != mapWallet.end())
217 CWalletTx& wtx = (*mi).second;
218 if (!wtx.IsSpent(prevout.n) && wtx.vout[prevout.n].IsMine())
220 printf("WalletUpdateSpent found spent coin %sbc %s\n", FormatMoney(wtx.GetCredit()).c_str(), wtx.GetHash().ToString().c_str());
221 wtx.MarkSpent(prevout.n);
223 vWalletUpdated.push_back(prevout.hash);
236 //////////////////////////////////////////////////////////////////////////////
238 // mapOrphanTransactions
241 void AddOrphanTx(const CDataStream& vMsg)
244 CDataStream(vMsg) >> tx;
245 uint256 hash = tx.GetHash();
246 if (mapOrphanTransactions.count(hash))
248 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
249 foreach(const CTxIn& txin, tx.vin)
250 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
253 void EraseOrphanTx(uint256 hash)
255 if (!mapOrphanTransactions.count(hash))
257 const CDataStream* pvMsg = mapOrphanTransactions[hash];
259 CDataStream(*pvMsg) >> tx;
260 foreach(const CTxIn& txin, tx.vin)
262 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
263 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
265 if ((*mi).second == pvMsg)
266 mapOrphanTransactionsByPrev.erase(mi++);
272 mapOrphanTransactions.erase(hash);
282 //////////////////////////////////////////////////////////////////////////////
284 // CTransaction and CTxIndex
287 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
290 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
292 if (!ReadFromDisk(txindexRet.pos))
294 if (prevout.n >= vout.size())
302 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
305 return ReadFromDisk(txdb, prevout, txindex);
308 bool CTransaction::ReadFromDisk(COutPoint prevout)
312 return ReadFromDisk(txdb, prevout, txindex);
315 bool CTxIn::IsMine() const
317 CRITICAL_BLOCK(cs_mapWallet)
319 map<uint256, CWalletTx>::iterator mi = mapWallet.find(prevout.hash);
320 if (mi != mapWallet.end())
322 const CWalletTx& prev = (*mi).second;
323 if (prevout.n < prev.vout.size())
324 if (prev.vout[prevout.n].IsMine())
331 int64 CTxIn::GetDebit() const
333 CRITICAL_BLOCK(cs_mapWallet)
335 map<uint256, CWalletTx>::iterator mi = mapWallet.find(prevout.hash);
336 if (mi != mapWallet.end())
338 const CWalletTx& prev = (*mi).second;
339 if (prevout.n < prev.vout.size())
340 if (prev.vout[prevout.n].IsMine())
341 return prev.vout[prevout.n].nValue;
347 int64 CWalletTx::GetTxTime() const
349 if (!fTimeReceivedIsTxTime && hashBlock != 0)
351 // If we did not receive the transaction directly, we rely on the block's
352 // time to figure out when it happened. We use the median over a range
353 // of blocks to try to filter out inaccurate block times.
354 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
355 if (mi != mapBlockIndex.end())
357 CBlockIndex* pindex = (*mi).second;
359 return pindex->GetMedianTime();
362 return nTimeReceived;
365 int CWalletTx::GetRequestCount() const
367 // Returns -1 if it wasn't being tracked
369 CRITICAL_BLOCK(cs_mapRequestCount)
376 map<uint256, int>::iterator mi = mapRequestCount.find(hashBlock);
377 if (mi != mapRequestCount.end())
378 nRequests = (*mi).second;
383 // Did anyone request this transaction?
384 map<uint256, int>::iterator mi = mapRequestCount.find(GetHash());
385 if (mi != mapRequestCount.end())
387 nRequests = (*mi).second;
389 // How about the block it's in?
390 if (nRequests == 0 && hashBlock != 0)
392 map<uint256, int>::iterator mi = mapRequestCount.find(hashBlock);
393 if (mi != mapRequestCount.end())
394 nRequests = (*mi).second;
396 nRequests = 1; // If it's in someone else's block it must have got out
404 void CWalletTx::GetAmounts(int64& nGeneratedImmature, int64& nGeneratedMature, list<pair<string, int64> >& listReceived,
405 list<pair<string, int64> >& listSent, int64& nFee, string& strSentAccount) const
407 nGeneratedImmature = nGeneratedMature = nFee = 0;
408 listReceived.clear();
410 strSentAccount = strFromAccount;
414 if (GetBlocksToMaturity() > 0)
415 nGeneratedImmature = CTransaction::GetCredit();
417 nGeneratedMature = GetCredit();
422 int64 nDebit = GetDebit();
423 if (nDebit > 0) // debit>0 means we signed/sent this transaction
425 int64 nValueOut = GetValueOut();
426 nFee = nDebit - nValueOut;
429 // Sent/received. Standard client will never generate a send-to-multiple-recipients,
430 // but non-standard clients might (so return a list of address/amount pairs)
431 foreach(const CTxOut& txout, vout)
435 vector<unsigned char> vchPubKey;
436 if (ExtractHash160(txout.scriptPubKey, hash160))
437 address = Hash160ToAddress(hash160);
438 else if (ExtractPubKey(txout.scriptPubKey, false, vchPubKey))
439 address = PubKeyToAddress(vchPubKey);
442 printf("CWalletTx::GetAmounts: Unknown transaction type found, txid %s\n",
443 this->GetHash().ToString().c_str());
444 address = " unknown ";
447 // Don't report 'change' txouts
448 if (nDebit > 0 && txout.IsChange())
452 listSent.push_back(make_pair(address, txout.nValue));
455 listReceived.push_back(make_pair(address, txout.nValue));
460 void CWalletTx::GetAccountAmounts(const string& strAccount, int64& nGenerated, int64& nReceived,
461 int64& nSent, int64& nFee) const
463 nGenerated = nReceived = nSent = nFee = 0;
465 int64 allGeneratedImmature, allGeneratedMature, allFee;
466 allGeneratedImmature = allGeneratedMature = allFee = 0;
467 string strSentAccount;
468 list<pair<string, int64> > listReceived;
469 list<pair<string, int64> > listSent;
470 GetAmounts(allGeneratedImmature, allGeneratedMature, listReceived, listSent, allFee, strSentAccount);
472 if (strAccount == "")
473 nGenerated = allGeneratedMature;
474 if (strAccount == strSentAccount)
476 foreach(const PAIRTYPE(string,int64)& s, listSent)
480 CRITICAL_BLOCK(cs_mapAddressBook)
482 foreach(const PAIRTYPE(string,int64)& r, listReceived)
484 if (mapAddressBook.count(r.first))
486 if (mapAddressBook[r.first] == strAccount)
488 nReceived += r.second;
491 else if (strAccount.empty())
493 nReceived += r.second;
501 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
513 // Load the block this tx is in
515 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
517 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
522 // Update the tx's hashBlock
523 hashBlock = pblock->GetHash();
525 // Locate the transaction
526 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
527 if (pblock->vtx[nIndex] == *(CTransaction*)this)
529 if (nIndex == pblock->vtx.size())
531 vMerkleBranch.clear();
533 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
537 // Fill in merkle branch
538 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
541 // Is the tx in a block that's in the main chain
542 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
543 if (mi == mapBlockIndex.end())
545 CBlockIndex* pindex = (*mi).second;
546 if (!pindex || !pindex->IsInMainChain())
549 return pindexBest->nHeight - pindex->nHeight + 1;
554 void CWalletTx::AddSupportingTransactions(CTxDB& txdb)
558 const int COPY_DEPTH = 3;
559 if (SetMerkleBranch() < COPY_DEPTH)
561 vector<uint256> vWorkQueue;
562 foreach(const CTxIn& txin, vin)
563 vWorkQueue.push_back(txin.prevout.hash);
565 // This critsect is OK because txdb is already open
566 CRITICAL_BLOCK(cs_mapWallet)
568 map<uint256, const CMerkleTx*> mapWalletPrev;
569 set<uint256> setAlreadyDone;
570 for (int i = 0; i < vWorkQueue.size(); i++)
572 uint256 hash = vWorkQueue[i];
573 if (setAlreadyDone.count(hash))
575 setAlreadyDone.insert(hash);
578 if (mapWallet.count(hash))
580 tx = mapWallet[hash];
581 foreach(const CMerkleTx& txWalletPrev, mapWallet[hash].vtxPrev)
582 mapWalletPrev[txWalletPrev.GetHash()] = &txWalletPrev;
584 else if (mapWalletPrev.count(hash))
586 tx = *mapWalletPrev[hash];
588 else if (!fClient && txdb.ReadDiskTx(hash, tx))
594 printf("ERROR: AddSupportingTransactions() : unsupported transaction\n");
598 int nDepth = tx.SetMerkleBranch();
599 vtxPrev.push_back(tx);
601 if (nDepth < COPY_DEPTH)
602 foreach(const CTxIn& txin, tx.vin)
603 vWorkQueue.push_back(txin.prevout.hash);
608 reverse(vtxPrev.begin(), vtxPrev.end());
621 bool CTransaction::CheckTransaction() const
623 // Basic checks that don't depend on any context
624 if (vin.empty() || vout.empty())
625 return error("CTransaction::CheckTransaction() : vin or vout empty");
628 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
629 return error("CTransaction::CheckTransaction() : size limits failed");
631 // Check for negative or overflow output values
633 foreach(const CTxOut& txout, vout)
635 if (txout.nValue < 0)
636 return error("CTransaction::CheckTransaction() : txout.nValue negative");
637 if (txout.nValue > MAX_MONEY)
638 return error("CTransaction::CheckTransaction() : txout.nValue too high");
639 nValueOut += txout.nValue;
640 if (!MoneyRange(nValueOut))
641 return error("CTransaction::CheckTransaction() : txout total out of range");
646 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
647 return error("CTransaction::CheckTransaction() : coinbase script size");
651 foreach(const CTxIn& txin, vin)
652 if (txin.prevout.IsNull())
653 return error("CTransaction::CheckTransaction() : prevout is null");
659 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
662 *pfMissingInputs = false;
664 if (!CheckTransaction())
665 return error("AcceptToMemoryPool() : CheckTransaction failed");
667 // Coinbase is only valid in a block, not as a loose transaction
669 return error("AcceptToMemoryPool() : coinbase as individual tx");
671 // To help v0.1.5 clients who would see it as a negative number
672 if ((int64)nLockTime > INT_MAX)
673 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
676 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
677 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
678 // attacks disallow transactions with more than one SigOp per 34 bytes.
679 // 34 bytes because a TxOut is:
680 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
681 if (GetSigOpCount() > nSize / 34 || 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 if (AddToWalletIfInvolvingMe(tx, &block))
907 pindex = pindex->pnext;
913 void ReacceptWalletTransactions()
917 while (fRepeat) CRITICAL_BLOCK(cs_mapWallet)
920 vector<CDiskTxPos> vMissingTx;
921 foreach(PAIRTYPE(const uint256, CWalletTx)& item, mapWallet)
923 CWalletTx& wtx = item.second;
924 if (wtx.IsCoinBase() && wtx.IsSpent(0))
928 bool fUpdated = false;
929 if (txdb.ReadTxIndex(wtx.GetHash(), txindex))
931 // Update fSpent if a tx got spent somewhere else by a copy of wallet.dat
932 if (txindex.vSpent.size() != wtx.vout.size())
934 printf("ERROR: ReacceptWalletTransactions() : txindex.vSpent.size() %d != wtx.vout.size() %d\n", txindex.vSpent.size(), wtx.vout.size());
937 for (int i = 0; i < txindex.vSpent.size(); i++)
941 if (!txindex.vSpent[i].IsNull() && wtx.vout[i].IsMine())
945 vMissingTx.push_back(txindex.vSpent[i]);
950 printf("ReacceptWalletTransactions found spent coin %sbc %s\n", FormatMoney(wtx.GetCredit()).c_str(), wtx.GetHash().ToString().c_str());
957 // Reaccept any txes of ours that aren't already in a block
958 if (!wtx.IsCoinBase())
959 wtx.AcceptWalletTransaction(txdb, false);
962 if (!vMissingTx.empty())
964 // TODO: optimize this to scan just part of the block chain?
965 if (ScanForWalletTransactions(pindexGenesisBlock))
966 fRepeat = true; // Found missing transactions: re-do Reaccept.
972 void CWalletTx::RelayWalletTransaction(CTxDB& txdb)
974 foreach(const CMerkleTx& tx, vtxPrev)
976 if (!tx.IsCoinBase())
978 uint256 hash = tx.GetHash();
979 if (!txdb.ContainsTx(hash))
980 RelayMessage(CInv(MSG_TX, hash), (CTransaction)tx);
985 uint256 hash = GetHash();
986 if (!txdb.ContainsTx(hash))
988 printf("Relaying wtx %s\n", hash.ToString().substr(0,10).c_str());
989 RelayMessage(CInv(MSG_TX, hash), (CTransaction)*this);
994 void ResendWalletTransactions()
996 // Do this infrequently and randomly to avoid giving away
997 // that these are our transactions.
998 static int64 nNextTime;
999 if (GetTime() < nNextTime)
1001 bool fFirst = (nNextTime == 0);
1002 nNextTime = GetTime() + GetRand(30 * 60);
1006 // Only do it if there's been a new block since last time
1007 static int64 nLastTime;
1008 if (nTimeBestReceived < nLastTime)
1010 nLastTime = GetTime();
1012 // Rebroadcast any of our txes that aren't in a block yet
1013 printf("ResendWalletTransactions()\n");
1015 CRITICAL_BLOCK(cs_mapWallet)
1017 // Sort them in chronological order
1018 multimap<unsigned int, CWalletTx*> mapSorted;
1019 foreach(PAIRTYPE(const uint256, CWalletTx)& item, mapWallet)
1021 CWalletTx& wtx = item.second;
1022 // Don't rebroadcast until it's had plenty of time that
1023 // it should have gotten in already by now.
1024 if (nTimeBestReceived - (int64)wtx.nTimeReceived > 5 * 60)
1025 mapSorted.insert(make_pair(wtx.nTimeReceived, &wtx));
1027 foreach(PAIRTYPE(const unsigned int, CWalletTx*)& item, mapSorted)
1029 CWalletTx& wtx = *item.second;
1030 wtx.RelayWalletTransaction(txdb);
1035 int CTxIndex::GetDepthInMainChain() const
1037 // Read block header
1039 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
1041 // Find the block in the index
1042 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
1043 if (mi == mapBlockIndex.end())
1045 CBlockIndex* pindex = (*mi).second;
1046 if (!pindex || !pindex->IsInMainChain())
1048 return 1 + nBestHeight - pindex->nHeight;
1060 //////////////////////////////////////////////////////////////////////////////
1062 // CBlock and CBlockIndex
1065 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
1067 if (!fReadTransactions)
1069 *this = pindex->GetBlockHeader();
1072 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
1074 if (GetHash() != pindex->GetBlockHash())
1075 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
1079 uint256 GetOrphanRoot(const CBlock* pblock)
1081 // Work back to the first block in the orphan chain
1082 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
1083 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
1084 return pblock->GetHash();
1087 int64 GetBlockValue(int nHeight, int64 nFees)
1089 int64 nSubsidy = 50 * COIN;
1091 // Subsidy is cut in half every 4 years
1092 nSubsidy >>= (nHeight / 210000);
1094 return nSubsidy + nFees;
1097 unsigned int GetNextWorkRequired(const CBlockIndex* pindexLast)
1099 const int64 nTargetTimespan = 14 * 24 * 60 * 60; // two weeks
1100 const int64 nTargetSpacing = 10 * 60;
1101 const int64 nInterval = nTargetTimespan / nTargetSpacing;
1104 if (pindexLast == NULL)
1105 return bnProofOfWorkLimit.GetCompact();
1107 // Only change once per interval
1108 if ((pindexLast->nHeight+1) % nInterval != 0)
1109 return pindexLast->nBits;
1111 // Go back by what we want to be 14 days worth of blocks
1112 const CBlockIndex* pindexFirst = pindexLast;
1113 for (int i = 0; pindexFirst && i < nInterval-1; i++)
1114 pindexFirst = pindexFirst->pprev;
1115 assert(pindexFirst);
1117 // Limit adjustment step
1118 int64 nActualTimespan = pindexLast->GetBlockTime() - pindexFirst->GetBlockTime();
1119 printf(" nActualTimespan = %"PRI64d" before bounds\n", nActualTimespan);
1120 if (nActualTimespan < nTargetTimespan/4)
1121 nActualTimespan = nTargetTimespan/4;
1122 if (nActualTimespan > nTargetTimespan*4)
1123 nActualTimespan = nTargetTimespan*4;
1127 bnNew.SetCompact(pindexLast->nBits);
1128 bnNew *= nActualTimespan;
1129 bnNew /= nTargetTimespan;
1131 if (bnNew > bnProofOfWorkLimit)
1132 bnNew = bnProofOfWorkLimit;
1135 printf("GetNextWorkRequired RETARGET\n");
1136 printf("nTargetTimespan = %"PRI64d" nActualTimespan = %"PRI64d"\n", nTargetTimespan, nActualTimespan);
1137 printf("Before: %08x %s\n", pindexLast->nBits, CBigNum().SetCompact(pindexLast->nBits).getuint256().ToString().c_str());
1138 printf("After: %08x %s\n", bnNew.GetCompact(), bnNew.getuint256().ToString().c_str());
1140 return bnNew.GetCompact();
1143 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1146 bnTarget.SetCompact(nBits);
1149 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1150 return error("CheckProofOfWork() : nBits below minimum work");
1152 // Check proof of work matches claimed amount
1153 if (hash > bnTarget.getuint256())
1154 return error("CheckProofOfWork() : hash doesn't match nBits");
1159 bool IsInitialBlockDownload()
1161 if (pindexBest == NULL || (!fTestNet && nBestHeight < 118000))
1163 static int64 nLastUpdate;
1164 static CBlockIndex* pindexLastBest;
1165 if (pindexBest != pindexLastBest)
1167 pindexLastBest = pindexBest;
1168 nLastUpdate = GetTime();
1170 return (GetTime() - nLastUpdate < 10 &&
1171 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
1174 void InvalidChainFound(CBlockIndex* pindexNew)
1176 if (pindexNew->bnChainWork > bnBestInvalidWork)
1178 bnBestInvalidWork = pindexNew->bnChainWork;
1179 CTxDB().WriteBestInvalidWork(bnBestInvalidWork);
1182 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());
1183 printf("InvalidChainFound: current best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1184 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
1185 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
1198 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1200 // Relinquish previous transactions' spent pointers
1203 foreach(const CTxIn& txin, vin)
1205 COutPoint prevout = txin.prevout;
1207 // Get prev txindex from disk
1209 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1210 return error("DisconnectInputs() : ReadTxIndex failed");
1212 if (prevout.n >= txindex.vSpent.size())
1213 return error("DisconnectInputs() : prevout.n out of range");
1215 // Mark outpoint as not spent
1216 txindex.vSpent[prevout.n].SetNull();
1219 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1220 return error("DisconnectInputs() : UpdateTxIndex failed");
1224 // Remove transaction from index
1225 if (!txdb.EraseTxIndex(*this))
1226 return error("DisconnectInputs() : EraseTxPos failed");
1232 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
1233 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
1235 // Take over previous transactions' spent pointers
1239 for (int i = 0; i < vin.size(); i++)
1241 COutPoint prevout = vin[i].prevout;
1246 if (fMiner && mapTestPool.count(prevout.hash))
1248 // Get txindex from current proposed changes
1249 txindex = mapTestPool[prevout.hash];
1253 // Read txindex from txdb
1254 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1256 if (!fFound && (fBlock || fMiner))
1257 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());
1260 CTransaction txPrev;
1261 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1263 // Get prev tx from single transactions in memory
1264 CRITICAL_BLOCK(cs_mapTransactions)
1266 if (!mapTransactions.count(prevout.hash))
1267 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1268 txPrev = mapTransactions[prevout.hash];
1271 txindex.vSpent.resize(txPrev.vout.size());
1275 // Get prev tx from disk
1276 if (!txPrev.ReadFromDisk(txindex.pos))
1277 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1280 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1281 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());
1283 // If prev is coinbase, check that it's matured
1284 if (txPrev.IsCoinBase())
1285 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
1286 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1287 return error("ConnectInputs() : tried to spend coinbase at depth %d", pindexBlock->nHeight - pindex->nHeight);
1290 if (!VerifySignature(txPrev, *this, i))
1291 return error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1293 // Check for conflicts
1294 if (!txindex.vSpent[prevout.n].IsNull())
1295 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());
1297 // Check for negative or overflow input values
1298 nValueIn += txPrev.vout[prevout.n].nValue;
1299 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1300 return error("ConnectInputs() : txin values out of range");
1302 // Mark outpoints as spent
1303 txindex.vSpent[prevout.n] = posThisTx;
1308 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1309 return error("ConnectInputs() : UpdateTxIndex failed");
1313 mapTestPool[prevout.hash] = txindex;
1317 if (nValueIn < GetValueOut())
1318 return error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str());
1320 // Tally transaction fees
1321 int64 nTxFee = nValueIn - GetValueOut();
1323 return error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str());
1324 if (nTxFee < nMinFee)
1327 if (!MoneyRange(nFees))
1328 return error("ConnectInputs() : nFees out of range");
1333 // Add transaction to disk index
1334 if (!txdb.AddTxIndex(*this, posThisTx, pindexBlock->nHeight))
1335 return error("ConnectInputs() : AddTxPos failed");
1339 // Add transaction to test pool
1340 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
1347 bool CTransaction::ClientConnectInputs()
1352 // Take over previous transactions' spent pointers
1353 CRITICAL_BLOCK(cs_mapTransactions)
1356 for (int i = 0; i < vin.size(); i++)
1358 // Get prev tx from single transactions in memory
1359 COutPoint prevout = vin[i].prevout;
1360 if (!mapTransactions.count(prevout.hash))
1362 CTransaction& txPrev = mapTransactions[prevout.hash];
1364 if (prevout.n >= txPrev.vout.size())
1368 if (!VerifySignature(txPrev, *this, i))
1369 return error("ConnectInputs() : VerifySignature failed");
1371 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1372 ///// this has to go away now that posNext is gone
1373 // // Check for conflicts
1374 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1375 // return error("ConnectInputs() : prev tx already used");
1377 // // Flag outpoints as used
1378 // txPrev.vout[prevout.n].posNext = posThisTx;
1380 nValueIn += txPrev.vout[prevout.n].nValue;
1382 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1383 return error("ClientConnectInputs() : txin values out of range");
1385 if (GetValueOut() > nValueIn)
1395 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1397 // Disconnect in reverse order
1398 for (int i = vtx.size()-1; i >= 0; i--)
1399 if (!vtx[i].DisconnectInputs(txdb))
1402 // Update block index on disk without changing it in memory.
1403 // The memory index structure will be changed after the db commits.
1406 CDiskBlockIndex blockindexPrev(pindex->pprev);
1407 blockindexPrev.hashNext = 0;
1408 if (!txdb.WriteBlockIndex(blockindexPrev))
1409 return error("DisconnectBlock() : WriteBlockIndex failed");
1415 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1417 // Check it again in case a previous version let a bad block in
1421 //// issue here: it doesn't know the version
1422 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - 1 + GetSizeOfCompactSize(vtx.size());
1424 map<uint256, CTxIndex> mapUnused;
1426 foreach(CTransaction& tx, vtx)
1428 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1429 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1431 if (!tx.ConnectInputs(txdb, mapUnused, posThisTx, pindex, nFees, true, false))
1435 if (vtx[0].GetValueOut() > GetBlockValue(pindex->nHeight, nFees))
1438 // Update block index on disk without changing it in memory.
1439 // The memory index structure will be changed after the db commits.
1442 CDiskBlockIndex blockindexPrev(pindex->pprev);
1443 blockindexPrev.hashNext = pindex->GetBlockHash();
1444 if (!txdb.WriteBlockIndex(blockindexPrev))
1445 return error("ConnectBlock() : WriteBlockIndex failed");
1448 // Watch for transactions paying to me
1449 foreach(CTransaction& tx, vtx)
1450 AddToWalletIfInvolvingMe(tx, this, true);
1455 bool Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1457 printf("REORGANIZE\n");
1460 CBlockIndex* pfork = pindexBest;
1461 CBlockIndex* plonger = pindexNew;
1462 while (pfork != plonger)
1464 while (plonger->nHeight > pfork->nHeight)
1465 if (!(plonger = plonger->pprev))
1466 return error("Reorganize() : plonger->pprev is null");
1467 if (pfork == plonger)
1469 if (!(pfork = pfork->pprev))
1470 return error("Reorganize() : pfork->pprev is null");
1473 // List of what to disconnect
1474 vector<CBlockIndex*> vDisconnect;
1475 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1476 vDisconnect.push_back(pindex);
1478 // List of what to connect
1479 vector<CBlockIndex*> vConnect;
1480 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1481 vConnect.push_back(pindex);
1482 reverse(vConnect.begin(), vConnect.end());
1484 // Disconnect shorter branch
1485 vector<CTransaction> vResurrect;
1486 foreach(CBlockIndex* pindex, vDisconnect)
1489 if (!block.ReadFromDisk(pindex))
1490 return error("Reorganize() : ReadFromDisk for disconnect failed");
1491 if (!block.DisconnectBlock(txdb, pindex))
1492 return error("Reorganize() : DisconnectBlock failed");
1494 // Queue memory transactions to resurrect
1495 foreach(const CTransaction& tx, block.vtx)
1496 if (!tx.IsCoinBase())
1497 vResurrect.push_back(tx);
1500 // Connect longer branch
1501 vector<CTransaction> vDelete;
1502 for (int i = 0; i < vConnect.size(); i++)
1504 CBlockIndex* pindex = vConnect[i];
1506 if (!block.ReadFromDisk(pindex))
1507 return error("Reorganize() : ReadFromDisk for connect failed");
1508 if (!block.ConnectBlock(txdb, pindex))
1512 return error("Reorganize() : ConnectBlock failed");
1515 // Queue memory transactions to delete
1516 foreach(const CTransaction& tx, block.vtx)
1517 vDelete.push_back(tx);
1519 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1520 return error("Reorganize() : WriteHashBestChain failed");
1522 // Make sure it's successfully written to disk before changing memory structure
1523 if (!txdb.TxnCommit())
1524 return error("Reorganize() : TxnCommit failed");
1526 // Disconnect shorter branch
1527 foreach(CBlockIndex* pindex, vDisconnect)
1529 pindex->pprev->pnext = NULL;
1531 // Connect longer branch
1532 foreach(CBlockIndex* pindex, vConnect)
1534 pindex->pprev->pnext = pindex;
1536 // Resurrect memory transactions that were in the disconnected branch
1537 foreach(CTransaction& tx, vResurrect)
1538 tx.AcceptToMemoryPool(txdb, false);
1540 // Delete redundant memory transactions that are in the connected branch
1541 foreach(CTransaction& tx, vDelete)
1542 tx.RemoveFromMemoryPool();
1548 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1550 uint256 hash = GetHash();
1553 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1555 txdb.WriteHashBestChain(hash);
1556 if (!txdb.TxnCommit())
1557 return error("SetBestChain() : TxnCommit failed");
1558 pindexGenesisBlock = pindexNew;
1560 else if (hashPrevBlock == hashBestChain)
1562 // Adding to current best branch
1563 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1566 InvalidChainFound(pindexNew);
1567 return error("SetBestChain() : ConnectBlock failed");
1569 if (!txdb.TxnCommit())
1570 return error("SetBestChain() : TxnCommit failed");
1572 // Add to current best branch
1573 pindexNew->pprev->pnext = pindexNew;
1575 // Delete redundant memory transactions
1576 foreach(CTransaction& tx, vtx)
1577 tx.RemoveFromMemoryPool();
1582 if (!Reorganize(txdb, pindexNew))
1585 InvalidChainFound(pindexNew);
1586 return error("SetBestChain() : Reorganize failed");
1590 // Update best block in wallet (so we can detect restored wallets)
1591 if (!IsInitialBlockDownload())
1594 const CBlockLocator locator(pindexNew);
1595 if (!walletdb.WriteBestBlock(locator))
1596 return error("SetBestChain() : WriteWalletBest failed");
1600 hashBestChain = hash;
1601 pindexBest = pindexNew;
1602 nBestHeight = pindexBest->nHeight;
1603 bnBestChainWork = pindexNew->bnChainWork;
1604 nTimeBestReceived = GetTime();
1605 nTransactionsUpdated++;
1606 printf("SetBestChain: new best=%s height=%d work=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainWork.ToString().c_str());
1612 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1614 // Check for duplicate
1615 uint256 hash = GetHash();
1616 if (mapBlockIndex.count(hash))
1617 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1619 // Construct new block index object
1620 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1622 return error("AddToBlockIndex() : new CBlockIndex failed");
1623 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1624 pindexNew->phashBlock = &((*mi).first);
1625 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1626 if (miPrev != mapBlockIndex.end())
1628 pindexNew->pprev = (*miPrev).second;
1629 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1631 pindexNew->bnChainWork = (pindexNew->pprev ? pindexNew->pprev->bnChainWork : 0) + pindexNew->GetBlockWork();
1635 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1636 if (!txdb.TxnCommit())
1640 if (pindexNew->bnChainWork > bnBestChainWork)
1641 if (!SetBestChain(txdb, pindexNew))
1646 if (pindexNew == pindexBest)
1648 // Notify UI to display prev block's coinbase if it was ours
1649 static uint256 hashPrevBestCoinBase;
1650 CRITICAL_BLOCK(cs_mapWallet)
1651 vWalletUpdated.push_back(hashPrevBestCoinBase);
1652 hashPrevBestCoinBase = vtx[0].GetHash();
1662 bool CBlock::CheckBlock() const
1664 // These are checks that are independent of context
1665 // that can be verified before saving an orphan block.
1668 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1669 return error("CheckBlock() : size limits failed");
1671 // Check proof of work matches claimed amount
1672 if (!CheckProofOfWork(GetHash(), nBits))
1673 return error("CheckBlock() : proof of work failed");
1676 if (GetBlockTime() > GetAdjustedTime() + 2 * 60 * 60)
1677 return error("CheckBlock() : block timestamp too far in the future");
1679 // First transaction must be coinbase, the rest must not be
1680 if (vtx.empty() || !vtx[0].IsCoinBase())
1681 return error("CheckBlock() : first tx is not coinbase");
1682 for (int i = 1; i < vtx.size(); i++)
1683 if (vtx[i].IsCoinBase())
1684 return error("CheckBlock() : more than one coinbase");
1686 // Check transactions
1687 foreach(const CTransaction& tx, vtx)
1688 if (!tx.CheckTransaction())
1689 return error("CheckBlock() : CheckTransaction failed");
1691 // Check that it's not full of nonstandard transactions
1692 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1693 return error("CheckBlock() : too many nonstandard transactions");
1696 if (hashMerkleRoot != BuildMerkleTree())
1697 return error("CheckBlock() : hashMerkleRoot mismatch");
1702 bool CBlock::AcceptBlock()
1704 // Check for duplicate
1705 uint256 hash = GetHash();
1706 if (mapBlockIndex.count(hash))
1707 return error("AcceptBlock() : block already in mapBlockIndex");
1709 // Get prev block index
1710 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1711 if (mi == mapBlockIndex.end())
1712 return error("AcceptBlock() : prev block not found");
1713 CBlockIndex* pindexPrev = (*mi).second;
1714 int nHeight = pindexPrev->nHeight+1;
1716 // Check proof of work
1717 if (nBits != GetNextWorkRequired(pindexPrev))
1718 return error("AcceptBlock() : incorrect proof of work");
1720 // Check timestamp against prev
1721 if (GetBlockTime() <= pindexPrev->GetMedianTimePast())
1722 return error("AcceptBlock() : block's timestamp is too early");
1724 // Check that all transactions are finalized
1725 foreach(const CTransaction& tx, vtx)
1726 if (!tx.IsFinal(nHeight, GetBlockTime()))
1727 return error("AcceptBlock() : contains a non-final transaction");
1729 // Check that the block chain matches the known block chain up to a checkpoint
1731 if ((nHeight == 11111 && hash != uint256("0x0000000069e244f73d78e8fd29ba2fd2ed618bd6fa2ee92559f542fdb26e7c1d")) ||
1732 (nHeight == 33333 && hash != uint256("0x000000002dd5588a74784eaa7ab0507a18ad16a236e7b1ce69f00d7ddfb5d0a6")) ||
1733 (nHeight == 68555 && hash != uint256("0x00000000001e1b4903550a0b96e9a9405c8a95f387162e4944e8d9fbe501cd6a")) ||
1734 (nHeight == 70567 && hash != uint256("0x00000000006a49b14bcf27462068f1264c961f11fa2e0eddd2be0791e1d4124a")) ||
1735 (nHeight == 74000 && hash != uint256("0x0000000000573993a3c9e41ce34471c079dcf5f52a0e824a81e7f953b8661a20")) ||
1736 (nHeight == 105000 && hash != uint256("0x00000000000291ce28027faea320c8d2b054b2e0fe44a773f3eefb151d6bdc97")) ||
1737 (nHeight == 118000 && hash != uint256("0x000000000000774a7f8a7a12dc906ddb9e17e75d684f15e00f8767f9e8f36553")))
1738 return error("AcceptBlock() : rejected by checkpoint lockin at %d", nHeight);
1740 // Write block to history file
1741 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1742 return error("AcceptBlock() : out of disk space");
1743 unsigned int nFile = -1;
1744 unsigned int nBlockPos = 0;
1745 if (!WriteToDisk(nFile, nBlockPos))
1746 return error("AcceptBlock() : WriteToDisk failed");
1747 if (!AddToBlockIndex(nFile, nBlockPos))
1748 return error("AcceptBlock() : AddToBlockIndex failed");
1750 // Relay inventory, but don't relay old inventory during initial block download
1751 if (hashBestChain == hash)
1752 CRITICAL_BLOCK(cs_vNodes)
1753 foreach(CNode* pnode, vNodes)
1754 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 118000))
1755 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1760 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1762 // Check for duplicate
1763 uint256 hash = pblock->GetHash();
1764 if (mapBlockIndex.count(hash))
1765 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1766 if (mapOrphanBlocks.count(hash))
1767 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1769 // Preliminary checks
1770 if (!pblock->CheckBlock())
1771 return error("ProcessBlock() : CheckBlock FAILED");
1773 // If don't already have its previous block, shunt it off to holding area until we get it
1774 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1776 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1777 CBlock* pblock2 = new CBlock(*pblock);
1778 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1779 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1781 // Ask this guy to fill in what we're missing
1783 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1788 if (!pblock->AcceptBlock())
1789 return error("ProcessBlock() : AcceptBlock FAILED");
1791 // Recursively process any orphan blocks that depended on this one
1792 vector<uint256> vWorkQueue;
1793 vWorkQueue.push_back(hash);
1794 for (int i = 0; i < vWorkQueue.size(); i++)
1796 uint256 hashPrev = vWorkQueue[i];
1797 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1798 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1801 CBlock* pblockOrphan = (*mi).second;
1802 if (pblockOrphan->AcceptBlock())
1803 vWorkQueue.push_back(pblockOrphan->GetHash());
1804 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1805 delete pblockOrphan;
1807 mapOrphanBlocksByPrev.erase(hashPrev);
1810 printf("ProcessBlock: ACCEPTED\n");
1821 template<typename Stream>
1822 bool ScanMessageStart(Stream& s)
1824 // Scan ahead to the next pchMessageStart, which should normally be immediately
1825 // at the file pointer. Leaves file pointer at end of pchMessageStart.
1827 short prevmask = s.exceptions(0);
1828 const char* p = BEGIN(pchMessageStart);
1838 s.exceptions(prevmask);
1842 p = BEGIN(pchMessageStart);
1845 if (++p == END(pchMessageStart))
1848 s.exceptions(prevmask);
1857 s.exceptions(prevmask);
1862 bool CheckDiskSpace(uint64 nAdditionalBytes)
1864 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1866 // Check for 15MB because database could create another 10MB log file at any time
1867 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1870 string strMessage = _("Warning: Disk space is low ");
1871 strMiscWarning = strMessage;
1872 printf("*** %s\n", strMessage.c_str());
1873 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1874 CreateThread(Shutdown, NULL);
1880 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1884 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1887 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1889 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1898 static unsigned int nCurrentBlockFile = 1;
1900 FILE* AppendBlockFile(unsigned int& nFileRet)
1905 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1908 if (fseek(file, 0, SEEK_END) != 0)
1910 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1911 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1913 nFileRet = nCurrentBlockFile;
1917 nCurrentBlockFile++;
1921 bool LoadBlockIndex(bool fAllowNew)
1925 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1926 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1927 pchMessageStart[0] = 0xfa;
1928 pchMessageStart[1] = 0xbf;
1929 pchMessageStart[2] = 0xb5;
1930 pchMessageStart[3] = 0xda;
1937 if (!txdb.LoadBlockIndex())
1942 // Init with genesis block
1944 if (mapBlockIndex.empty())
1950 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1951 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1952 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1953 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1954 // vMerkleTree: 4a5e1e
1957 const char* pszTimestamp = "The Times 03/Jan/2009 Chancellor on brink of second bailout for banks";
1959 txNew.vin.resize(1);
1960 txNew.vout.resize(1);
1961 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1962 txNew.vout[0].nValue = 50 * COIN;
1963 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1965 block.vtx.push_back(txNew);
1966 block.hashPrevBlock = 0;
1967 block.hashMerkleRoot = block.BuildMerkleTree();
1969 block.nTime = 1231006505;
1970 block.nBits = 0x1d00ffff;
1971 block.nNonce = 2083236893;
1975 block.nTime = 1296688602;
1976 block.nBits = 0x1d07fff8;
1977 block.nNonce = 384568319;
1981 printf("%s\n", block.GetHash().ToString().c_str());
1982 printf("%s\n", hashGenesisBlock.ToString().c_str());
1983 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1984 assert(block.hashMerkleRoot == uint256("0x4a5e1e4baab89f3a32518a88c31bc87f618f76673e2cc77ab2127b7afdeda33b"));
1986 assert(block.GetHash() == hashGenesisBlock);
1988 // Start new block file
1990 unsigned int nBlockPos;
1991 if (!block.WriteToDisk(nFile, nBlockPos))
1992 return error("LoadBlockIndex() : writing genesis block to disk failed");
1993 if (!block.AddToBlockIndex(nFile, nBlockPos))
1994 return error("LoadBlockIndex() : genesis block not accepted");
2002 void PrintBlockTree()
2004 // precompute tree structure
2005 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2006 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2008 CBlockIndex* pindex = (*mi).second;
2009 mapNext[pindex->pprev].push_back(pindex);
2011 //while (rand() % 3 == 0)
2012 // mapNext[pindex->pprev].push_back(pindex);
2015 vector<pair<int, CBlockIndex*> > vStack;
2016 vStack.push_back(make_pair(0, pindexGenesisBlock));
2019 while (!vStack.empty())
2021 int nCol = vStack.back().first;
2022 CBlockIndex* pindex = vStack.back().second;
2025 // print split or gap
2026 if (nCol > nPrevCol)
2028 for (int i = 0; i < nCol-1; i++)
2032 else if (nCol < nPrevCol)
2034 for (int i = 0; i < nCol; i++)
2041 for (int i = 0; i < nCol; i++)
2046 block.ReadFromDisk(pindex);
2047 printf("%d (%u,%u) %s %s tx %d",
2051 block.GetHash().ToString().substr(0,20).c_str(),
2052 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2055 CRITICAL_BLOCK(cs_mapWallet)
2057 if (mapWallet.count(block.vtx[0].GetHash()))
2059 CWalletTx& wtx = mapWallet[block.vtx[0].GetHash()];
2060 printf(" mine: %d %d %d", wtx.GetDepthInMainChain(), wtx.GetBlocksToMaturity(), wtx.GetCredit());
2066 // put the main timechain first
2067 vector<CBlockIndex*>& vNext = mapNext[pindex];
2068 for (int i = 0; i < vNext.size(); i++)
2070 if (vNext[i]->pnext)
2072 swap(vNext[0], vNext[i]);
2078 for (int i = 0; i < vNext.size(); i++)
2079 vStack.push_back(make_pair(nCol+i, vNext[i]));
2092 //////////////////////////////////////////////////////////////////////////////
2097 map<uint256, CAlert> mapAlerts;
2098 CCriticalSection cs_mapAlerts;
2100 string GetWarnings(string strFor)
2103 string strStatusBar;
2105 if (GetBoolArg("-testsafemode"))
2108 // Misc warnings like out of disk space and clock is wrong
2109 if (strMiscWarning != "")
2112 strStatusBar = strMiscWarning;
2115 // Longer invalid proof-of-work chain
2116 if (pindexBest && bnBestInvalidWork > bnBestChainWork + pindexBest->GetBlockWork() * 6)
2119 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
2123 CRITICAL_BLOCK(cs_mapAlerts)
2125 foreach(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2127 const CAlert& alert = item.second;
2128 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2130 nPriority = alert.nPriority;
2131 strStatusBar = alert.strStatusBar;
2136 if (strFor == "statusbar")
2137 return strStatusBar;
2138 else if (strFor == "rpc")
2140 assert(("GetWarnings() : invalid parameter", false));
2144 bool CAlert::ProcessAlert()
2146 if (!CheckSignature())
2151 CRITICAL_BLOCK(cs_mapAlerts)
2153 // Cancel previous alerts
2154 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2156 const CAlert& alert = (*mi).second;
2159 printf("cancelling alert %d\n", alert.nID);
2160 mapAlerts.erase(mi++);
2162 else if (!alert.IsInEffect())
2164 printf("expiring alert %d\n", alert.nID);
2165 mapAlerts.erase(mi++);
2171 // Check if this alert has been cancelled
2172 foreach(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2174 const CAlert& alert = item.second;
2175 if (alert.Cancels(*this))
2177 printf("alert already cancelled by %d\n", alert.nID);
2183 mapAlerts.insert(make_pair(GetHash(), *this));
2186 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2198 //////////////////////////////////////////////////////////////////////////////
2204 bool AlreadyHave(CTxDB& txdb, const CInv& inv)
2208 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
2209 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
2211 // Don't know what it is, just say we already got one
2218 // The message start string is designed to be unlikely to occur in normal data.
2219 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
2220 // a large 4-byte int at any alignment.
2221 char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
2224 bool ProcessMessages(CNode* pfrom)
2226 CDataStream& vRecv = pfrom->vRecv;
2230 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2234 // (4) message start
2243 // Scan for message start
2244 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2245 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2246 if (vRecv.end() - pstart < nHeaderSize)
2248 if (vRecv.size() > nHeaderSize)
2250 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2251 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2255 if (pstart - vRecv.begin() > 0)
2256 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2257 vRecv.erase(vRecv.begin(), pstart);
2260 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2265 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2268 string strCommand = hdr.GetCommand();
2271 unsigned int nMessageSize = hdr.nMessageSize;
2272 if (nMessageSize > MAX_SIZE)
2274 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2277 if (nMessageSize > vRecv.size())
2279 // Rewind and wait for rest of message
2280 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2285 if (vRecv.GetVersion() >= 209)
2287 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2288 unsigned int nChecksum = 0;
2289 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2290 if (nChecksum != hdr.nChecksum)
2292 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2293 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2298 // Copy message to its own buffer
2299 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2300 vRecv.ignore(nMessageSize);
2306 CRITICAL_BLOCK(cs_main)
2307 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2311 catch (std::ios_base::failure& e)
2313 if (strstr(e.what(), "end of data"))
2315 // Allow exceptions from underlength message on vRecv
2316 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());
2318 else if (strstr(e.what(), "size too large"))
2320 // Allow exceptions from overlong size
2321 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2325 PrintExceptionContinue(&e, "ProcessMessage()");
2328 catch (std::exception& e) {
2329 PrintExceptionContinue(&e, "ProcessMessage()");
2331 PrintExceptionContinue(NULL, "ProcessMessage()");
2335 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2345 bool ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2347 static map<unsigned int, vector<unsigned char> > mapReuseKey;
2348 RandAddSeedPerfmon();
2350 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
2351 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2352 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2354 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2362 if (strCommand == "version")
2364 // Each connection can only send one version message
2365 if (pfrom->nVersion != 0)
2372 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2373 if (pfrom->nVersion == 10300)
2374 pfrom->nVersion = 300;
2375 if (pfrom->nVersion >= 106 && !vRecv.empty())
2376 vRecv >> addrFrom >> nNonce;
2377 if (pfrom->nVersion >= 106 && !vRecv.empty())
2378 vRecv >> pfrom->strSubVer;
2379 if (pfrom->nVersion >= 209 && !vRecv.empty())
2380 vRecv >> pfrom->nStartingHeight;
2382 if (pfrom->nVersion == 0)
2385 // Disconnect if we connected to ourself
2386 if (nNonce == nLocalHostNonce && nNonce > 1)
2388 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2389 pfrom->fDisconnect = true;
2393 // Be shy and don't send version until we hear
2394 if (pfrom->fInbound)
2395 pfrom->PushVersion();
2397 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2399 AddTimeData(pfrom->addr.ip, nTime);
2402 if (pfrom->nVersion >= 209)
2403 pfrom->PushMessage("verack");
2404 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
2405 if (pfrom->nVersion < 209)
2406 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2408 if (!pfrom->fInbound)
2410 // Advertise our address
2411 if (addrLocalHost.IsRoutable() && !fUseProxy)
2413 CAddress addr(addrLocalHost);
2414 addr.nTime = GetAdjustedTime();
2415 pfrom->PushAddress(addr);
2418 // Get recent addresses
2419 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2421 pfrom->PushMessage("getaddr");
2422 pfrom->fGetAddr = true;
2426 // Ask the first connected node for block updates
2427 static int nAskedForBlocks;
2428 if (!pfrom->fClient && (nAskedForBlocks < 1 || vNodes.size() <= 1))
2431 pfrom->PushGetBlocks(pindexBest, uint256(0));
2435 CRITICAL_BLOCK(cs_mapAlerts)
2436 foreach(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2437 item.second.RelayTo(pfrom);
2439 pfrom->fSuccessfullyConnected = true;
2441 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2445 else if (pfrom->nVersion == 0)
2447 // Must have a version message before anything else
2452 else if (strCommand == "verack")
2454 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2458 else if (strCommand == "addr")
2460 vector<CAddress> vAddr;
2463 // Don't want addr from older versions unless seeding
2464 if (pfrom->nVersion < 209)
2466 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2468 if (vAddr.size() > 1000)
2469 return error("message addr size() = %d", vAddr.size());
2471 // Store the new addresses
2472 int64 nNow = GetAdjustedTime();
2473 int64 nSince = nNow - 10 * 60;
2474 foreach(CAddress& addr, vAddr)
2478 // ignore IPv6 for now, since it isn't implemented anyway
2481 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2482 addr.nTime = nNow - 5 * 24 * 60 * 60;
2483 AddAddress(addr, 2 * 60 * 60);
2484 pfrom->AddAddressKnown(addr);
2485 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2487 // Relay to a limited number of other nodes
2488 CRITICAL_BLOCK(cs_vNodes)
2490 // Use deterministic randomness to send to the same nodes for 24 hours
2491 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2492 static uint256 hashSalt;
2494 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2495 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
2496 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2497 multimap<uint256, CNode*> mapMix;
2498 foreach(CNode* pnode, vNodes)
2500 if (pnode->nVersion < 31402)
2502 unsigned int nPointer;
2503 memcpy(&nPointer, &pnode, sizeof(nPointer));
2504 uint256 hashKey = hashRand ^ nPointer;
2505 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2506 mapMix.insert(make_pair(hashKey, pnode));
2508 int nRelayNodes = 2;
2509 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2510 ((*mi).second)->PushAddress(addr);
2514 if (vAddr.size() < 1000)
2515 pfrom->fGetAddr = false;
2519 else if (strCommand == "inv")
2523 if (vInv.size() > 50000)
2524 return error("message inv size() = %d", vInv.size());
2527 foreach(const CInv& inv, vInv)
2531 pfrom->AddInventoryKnown(inv);
2533 bool fAlreadyHave = AlreadyHave(txdb, inv);
2534 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2538 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2539 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2541 // Track requests for our stuff
2542 CRITICAL_BLOCK(cs_mapRequestCount)
2544 map<uint256, int>::iterator mi = mapRequestCount.find(inv.hash);
2545 if (mi != mapRequestCount.end())
2552 else if (strCommand == "getdata")
2556 if (vInv.size() > 50000)
2557 return error("message getdata size() = %d", vInv.size());
2559 foreach(const CInv& inv, vInv)
2563 printf("received getdata for: %s\n", inv.ToString().c_str());
2565 if (inv.type == MSG_BLOCK)
2567 // Send block from disk
2568 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2569 if (mi != mapBlockIndex.end())
2572 block.ReadFromDisk((*mi).second);
2573 pfrom->PushMessage("block", block);
2575 // Trigger them to send a getblocks request for the next batch of inventory
2576 if (inv.hash == pfrom->hashContinue)
2578 // Bypass PushInventory, this must send even if redundant,
2579 // and we want it right after the last block so they don't
2580 // wait for other stuff first.
2582 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2583 pfrom->PushMessage("inv", vInv);
2584 pfrom->hashContinue = 0;
2588 else if (inv.IsKnownType())
2590 // Send stream from relay memory
2591 CRITICAL_BLOCK(cs_mapRelay)
2593 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2594 if (mi != mapRelay.end())
2595 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2599 // Track requests for our stuff
2600 CRITICAL_BLOCK(cs_mapRequestCount)
2602 map<uint256, int>::iterator mi = mapRequestCount.find(inv.hash);
2603 if (mi != mapRequestCount.end())
2610 else if (strCommand == "getblocks")
2612 CBlockLocator locator;
2614 vRecv >> locator >> hashStop;
2616 // Find the last block the caller has in the main chain
2617 CBlockIndex* pindex = locator.GetBlockIndex();
2619 // Send the rest of the chain
2621 pindex = pindex->pnext;
2622 int nLimit = 500 + locator.GetDistanceBack();
2623 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2624 for (; pindex; pindex = pindex->pnext)
2626 if (pindex->GetBlockHash() == hashStop)
2628 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
2631 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2634 // When this block is requested, we'll send an inv that'll make them
2635 // getblocks the next batch of inventory.
2636 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
2637 pfrom->hashContinue = pindex->GetBlockHash();
2644 else if (strCommand == "getheaders")
2646 CBlockLocator locator;
2648 vRecv >> locator >> hashStop;
2650 CBlockIndex* pindex = NULL;
2651 if (locator.IsNull())
2653 // If locator is null, return the hashStop block
2654 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2655 if (mi == mapBlockIndex.end())
2657 pindex = (*mi).second;
2661 // Find the last block the caller has in the main chain
2662 pindex = locator.GetBlockIndex();
2664 pindex = pindex->pnext;
2667 vector<CBlock> vHeaders;
2668 int nLimit = 2000 + locator.GetDistanceBack();
2669 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2670 for (; pindex; pindex = pindex->pnext)
2672 vHeaders.push_back(pindex->GetBlockHeader());
2673 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2676 pfrom->PushMessage("headers", vHeaders);
2680 else if (strCommand == "tx")
2682 vector<uint256> vWorkQueue;
2683 CDataStream vMsg(vRecv);
2687 CInv inv(MSG_TX, tx.GetHash());
2688 pfrom->AddInventoryKnown(inv);
2690 bool fMissingInputs = false;
2691 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2693 AddToWalletIfInvolvingMe(tx, NULL, true);
2694 RelayMessage(inv, vMsg);
2695 mapAlreadyAskedFor.erase(inv);
2696 vWorkQueue.push_back(inv.hash);
2698 // Recursively process any orphan transactions that depended on this one
2699 for (int i = 0; i < vWorkQueue.size(); i++)
2701 uint256 hashPrev = vWorkQueue[i];
2702 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2703 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2706 const CDataStream& vMsg = *((*mi).second);
2708 CDataStream(vMsg) >> tx;
2709 CInv inv(MSG_TX, tx.GetHash());
2711 if (tx.AcceptToMemoryPool(true))
2713 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2714 AddToWalletIfInvolvingMe(tx, NULL, true);
2715 RelayMessage(inv, vMsg);
2716 mapAlreadyAskedFor.erase(inv);
2717 vWorkQueue.push_back(inv.hash);
2722 foreach(uint256 hash, vWorkQueue)
2723 EraseOrphanTx(hash);
2725 else if (fMissingInputs)
2727 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2733 else if (strCommand == "block")
2738 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2741 CInv inv(MSG_BLOCK, block.GetHash());
2742 pfrom->AddInventoryKnown(inv);
2744 if (ProcessBlock(pfrom, &block))
2745 mapAlreadyAskedFor.erase(inv);
2749 else if (strCommand == "getaddr")
2751 // Nodes rebroadcast an addr every 24 hours
2752 pfrom->vAddrToSend.clear();
2753 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2754 CRITICAL_BLOCK(cs_mapAddresses)
2756 unsigned int nCount = 0;
2757 foreach(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2759 const CAddress& addr = item.second;
2760 if (addr.nTime > nSince)
2763 foreach(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2765 const CAddress& addr = item.second;
2766 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2767 pfrom->PushAddress(addr);
2773 else if (strCommand == "checkorder")
2778 if (!GetBoolArg("-allowreceivebyip"))
2780 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2787 /// we have a chance to check the order here
2789 // Keep giving the same key to the same ip until they use it
2790 if (!mapReuseKey.count(pfrom->addr.ip))
2791 mapReuseKey[pfrom->addr.ip] = GetKeyFromKeyPool();
2793 // Send back approval of order and pubkey to use
2794 CScript scriptPubKey;
2795 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2796 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2800 else if (strCommand == "submitorder")
2805 if (!GetBoolArg("-allowreceivebyip"))
2807 pfrom->PushMessage("reply", hashReply, (int)2);
2813 wtxNew.fFromMe = false;
2816 if (!wtxNew.AcceptWalletTransaction())
2818 pfrom->PushMessage("reply", hashReply, (int)1);
2819 return error("submitorder AcceptWalletTransaction() failed, returning error 1");
2821 wtxNew.fTimeReceivedIsTxTime = true;
2822 AddToWallet(wtxNew);
2823 wtxNew.RelayWalletTransaction();
2824 mapReuseKey.erase(pfrom->addr.ip);
2826 // Send back confirmation
2827 pfrom->PushMessage("reply", hashReply, (int)0);
2831 else if (strCommand == "reply")
2836 CRequestTracker tracker;
2837 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2839 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2840 if (mi != pfrom->mapRequests.end())
2842 tracker = (*mi).second;
2843 pfrom->mapRequests.erase(mi);
2846 if (!tracker.IsNull())
2847 tracker.fn(tracker.param1, vRecv);
2851 else if (strCommand == "ping")
2856 else if (strCommand == "alert")
2861 if (alert.ProcessAlert())
2864 pfrom->setKnown.insert(alert.GetHash());
2865 CRITICAL_BLOCK(cs_vNodes)
2866 foreach(CNode* pnode, vNodes)
2867 alert.RelayTo(pnode);
2874 // Ignore unknown commands for extensibility
2878 // Update the last seen time for this node's address
2879 if (pfrom->fNetworkNode)
2880 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2881 AddressCurrentlyConnected(pfrom->addr);
2895 bool SendMessages(CNode* pto, bool fSendTrickle)
2897 CRITICAL_BLOCK(cs_main)
2899 // Don't send anything until we get their version message
2900 if (pto->nVersion == 0)
2904 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2905 pto->PushMessage("ping");
2907 // Resend wallet transactions that haven't gotten in a block yet
2908 ResendWalletTransactions();
2910 // Address refresh broadcast
2911 static int64 nLastRebroadcast;
2912 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2914 nLastRebroadcast = GetTime();
2915 CRITICAL_BLOCK(cs_vNodes)
2917 foreach(CNode* pnode, vNodes)
2919 // Periodically clear setAddrKnown to allow refresh broadcasts
2920 pnode->setAddrKnown.clear();
2922 // Rebroadcast our address
2923 if (addrLocalHost.IsRoutable() && !fUseProxy)
2925 CAddress addr(addrLocalHost);
2926 addr.nTime = GetAdjustedTime();
2927 pnode->PushAddress(addr);
2933 // Clear out old addresses periodically so it's not too much work at once
2934 static int64 nLastClear;
2935 if (nLastClear == 0)
2936 nLastClear = GetTime();
2937 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2939 nLastClear = GetTime();
2940 CRITICAL_BLOCK(cs_mapAddresses)
2943 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2944 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2945 mi != mapAddresses.end();)
2947 const CAddress& addr = (*mi).second;
2948 if (addr.nTime < nSince)
2950 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2952 addrdb.EraseAddress(addr);
2953 mapAddresses.erase(mi++);
2967 vector<CAddress> vAddr;
2968 vAddr.reserve(pto->vAddrToSend.size());
2969 foreach(const CAddress& addr, pto->vAddrToSend)
2971 // returns true if wasn't already contained in the set
2972 if (pto->setAddrKnown.insert(addr).second)
2974 vAddr.push_back(addr);
2975 // receiver rejects addr messages larger than 1000
2976 if (vAddr.size() >= 1000)
2978 pto->PushMessage("addr", vAddr);
2983 pto->vAddrToSend.clear();
2985 pto->PushMessage("addr", vAddr);
2990 // Message: inventory
2993 vector<CInv> vInvWait;
2994 CRITICAL_BLOCK(pto->cs_inventory)
2996 vInv.reserve(pto->vInventoryToSend.size());
2997 vInvWait.reserve(pto->vInventoryToSend.size());
2998 foreach(const CInv& inv, pto->vInventoryToSend)
3000 if (pto->setInventoryKnown.count(inv))
3003 // trickle out tx inv to protect privacy
3004 if (inv.type == MSG_TX && !fSendTrickle)
3006 // 1/4 of tx invs blast to all immediately
3007 static uint256 hashSalt;
3009 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
3010 uint256 hashRand = inv.hash ^ hashSalt;
3011 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3012 bool fTrickleWait = ((hashRand & 3) != 0);
3014 // always trickle our own transactions
3017 TRY_CRITICAL_BLOCK(cs_mapWallet)
3019 map<uint256, CWalletTx>::iterator mi = mapWallet.find(inv.hash);
3020 if (mi != mapWallet.end())
3022 CWalletTx& wtx = (*mi).second;
3024 fTrickleWait = true;
3031 vInvWait.push_back(inv);
3036 // returns true if wasn't already contained in the set
3037 if (pto->setInventoryKnown.insert(inv).second)
3039 vInv.push_back(inv);
3040 if (vInv.size() >= 1000)
3042 pto->PushMessage("inv", vInv);
3047 pto->vInventoryToSend = vInvWait;
3050 pto->PushMessage("inv", vInv);
3056 vector<CInv> vGetData;
3057 int64 nNow = GetTime() * 1000000;
3059 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
3061 const CInv& inv = (*pto->mapAskFor.begin()).second;
3062 if (!AlreadyHave(txdb, inv))
3064 printf("sending getdata: %s\n", inv.ToString().c_str());
3065 vGetData.push_back(inv);
3066 if (vGetData.size() >= 1000)
3068 pto->PushMessage("getdata", vGetData);
3072 pto->mapAskFor.erase(pto->mapAskFor.begin());
3074 if (!vGetData.empty())
3075 pto->PushMessage("getdata", vGetData);
3094 //////////////////////////////////////////////////////////////////////////////
3099 void GenerateBitcoins(bool fGenerate)
3101 if (fGenerateBitcoins != fGenerate)
3103 fGenerateBitcoins = fGenerate;
3104 CWalletDB().WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3107 if (fGenerateBitcoins)
3109 int nProcessors = boost::thread::hardware_concurrency();
3110 printf("%d processors\n", nProcessors);
3111 if (nProcessors < 1)
3113 if (fLimitProcessors && nProcessors > nLimitProcessors)
3114 nProcessors = nLimitProcessors;
3115 int nAddThreads = nProcessors - vnThreadsRunning[3];
3116 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3117 for (int i = 0; i < nAddThreads; i++)
3119 if (!CreateThread(ThreadBitcoinMiner, NULL))
3120 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");
3126 void ThreadBitcoinMiner(void* parg)
3130 vnThreadsRunning[3]++;
3132 vnThreadsRunning[3]--;
3134 catch (std::exception& e) {
3135 vnThreadsRunning[3]--;
3136 PrintException(&e, "ThreadBitcoinMiner()");
3138 vnThreadsRunning[3]--;
3139 PrintException(NULL, "ThreadBitcoinMiner()");
3141 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3143 if (vnThreadsRunning[3] == 0)
3145 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3148 #if defined(__GNUC__) && defined(CRYPTOPP_X86_ASM_AVAILABLE)
3149 void CallCPUID(int in, int& aret, int& cret)
3153 "mov %2, %%eax; " // in into eax
3155 "mov %%eax, %0;" // eax into a
3156 "mov %%ecx, %1;" // ecx into c
3157 :"=r"(a),"=r"(c) /* output */
3158 :"r"(in) /* input */
3159 :"%eax","%ebx","%ecx","%edx" /* clobbered register */
3165 bool Detect128BitSSE2()
3168 CallCPUID(0, a, nBrand);
3169 bool fIntel = (nBrand == 0x6c65746e); // ntel
3170 bool fAMD = (nBrand == 0x444d4163); // cAMD
3174 unsigned int nStepping : 4;
3175 unsigned int nModel : 4;
3176 unsigned int nFamily : 4;
3177 unsigned int nProcessorType : 2;
3178 unsigned int nUnused : 2;
3179 unsigned int nExtendedModel : 4;
3180 unsigned int nExtendedFamily : 8;
3184 memcpy(&cpu, &a, sizeof(cpu));
3185 int nFamily = cpu.nExtendedFamily + cpu.nFamily;
3186 int nModel = cpu.nExtendedModel*16 + cpu.nModel;
3188 // We need Intel Nehalem or AMD K10 or better for 128bit SSE2
3189 // Nehalem = i3/i5/i7 and some Xeon
3190 // K10 = Opterons with 4 or more cores, Phenom, Phenom II, Athlon II
3191 // Intel Core i5 family 6, model 26 or 30
3192 // Intel Core i7 family 6, model 26 or 30
3193 // Intel Core i3 family 6, model 37
3194 // AMD Phenom family 16, model 10
3195 bool fUseSSE2 = ((fIntel && nFamily * 10000 + nModel >= 60026) ||
3196 (fAMD && nFamily * 10000 + nModel >= 160010));
3198 // AMD reports a lower model number in 64-bit mode
3199 if (fAMD && sizeof(void*) > 4 && nFamily * 10000 + nModel >= 160000)
3202 static bool fPrinted;
3206 printf("CPUID %08x family %d, model %d, stepping %d, fUseSSE2=%d\n", nBrand, nFamily, nModel, cpu.nStepping, fUseSSE2);
3211 bool Detect128BitSSE2() { return false; }
3214 int FormatHashBlocks(void* pbuffer, unsigned int len)
3216 unsigned char* pdata = (unsigned char*)pbuffer;
3217 unsigned int blocks = 1 + ((len + 8) / 64);
3218 unsigned char* pend = pdata + 64 * blocks;
3219 memset(pdata + len, 0, 64 * blocks - len);
3221 unsigned int bits = len * 8;
3222 pend[-1] = (bits >> 0) & 0xff;
3223 pend[-2] = (bits >> 8) & 0xff;
3224 pend[-3] = (bits >> 16) & 0xff;
3225 pend[-4] = (bits >> 24) & 0xff;
3229 using CryptoPP::ByteReverse;
3231 static const unsigned int pSHA256InitState[8] =
3232 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
3234 inline void SHA256Transform(void* pstate, void* pinput, const void* pinit)
3236 memcpy(pstate, pinit, 32);
3237 CryptoPP::SHA256::Transform((CryptoPP::word32*)pstate, (CryptoPP::word32*)pinput);
3241 // ScanHash scans nonces looking for a hash with at least some zero bits.
3242 // It operates on big endian data. Caller does the byte reversing.
3243 // All input buffers are 16-byte aligned. nNonce is usually preserved
3244 // between calls, but periodically or if nNonce is 0xffff0000 or above,
3245 // the block is rebuilt and nNonce starts over at zero.
3247 unsigned int ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
3249 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
3253 // Hash pdata using pmidstate as the starting state into
3254 // preformatted buffer phash1, then hash phash1 into phash
3256 SHA256Transform(phash1, pdata, pmidstate);
3257 SHA256Transform(phash, phash1, pSHA256InitState);
3259 // Return the nonce if the hash has at least some zero bits,
3260 // caller will check if it has enough to reach the target
3261 if (((unsigned short*)phash)[14] == 0)
3264 // If nothing found after trying for a while, return -1
3265 if ((nNonce & 0xffff) == 0)
3267 nHashesDone = 0xffff+1;
3273 extern unsigned int ScanHash_4WaySSE2(char* pmidstate, char* pblock, char* phash1, char* phash, unsigned int& nHashesDone);
3281 set<uint256> setDependsOn;
3284 COrphan(CTransaction* ptxIn)
3292 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3293 foreach(uint256 hash, setDependsOn)
3294 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3299 CBlock* CreateNewBlock(CReserveKey& reservekey)
3301 CBlockIndex* pindexPrev = pindexBest;
3304 auto_ptr<CBlock> pblock(new CBlock());
3308 // Create coinbase tx
3310 txNew.vin.resize(1);
3311 txNew.vin[0].prevout.SetNull();
3312 txNew.vout.resize(1);
3313 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3315 // Add our coinbase tx as first transaction
3316 pblock->vtx.push_back(txNew);
3318 // Collect memory pool transactions into the block
3320 CRITICAL_BLOCK(cs_main)
3321 CRITICAL_BLOCK(cs_mapTransactions)
3325 // Priority order to process transactions
3326 list<COrphan> vOrphan; // list memory doesn't move
3327 map<uint256, vector<COrphan*> > mapDependers;
3328 multimap<double, CTransaction*> mapPriority;
3329 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
3331 CTransaction& tx = (*mi).second;
3332 if (tx.IsCoinBase() || !tx.IsFinal())
3335 COrphan* porphan = NULL;
3336 double dPriority = 0;
3337 foreach(const CTxIn& txin, tx.vin)
3339 // Read prev transaction
3340 CTransaction txPrev;
3342 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3344 // Has to wait for dependencies
3347 // Use list for automatic deletion
3348 vOrphan.push_back(COrphan(&tx));
3349 porphan = &vOrphan.back();
3351 mapDependers[txin.prevout.hash].push_back(porphan);
3352 porphan->setDependsOn.insert(txin.prevout.hash);
3355 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3357 // Read block header
3358 int nConf = txindex.GetDepthInMainChain();
3360 dPriority += (double)nValueIn * nConf;
3362 if (fDebug && GetBoolArg("-printpriority"))
3363 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3366 // Priority is sum(valuein * age) / txsize
3367 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
3370 porphan->dPriority = dPriority;
3372 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3374 if (fDebug && GetBoolArg("-printpriority"))
3376 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3383 // Collect transactions into block
3384 map<uint256, CTxIndex> mapTestPool;
3385 uint64 nBlockSize = 1000;
3386 int nBlockSigOps = 100;
3387 while (!mapPriority.empty())
3389 // Take highest priority transaction off priority queue
3390 double dPriority = -(*mapPriority.begin()).first;
3391 CTransaction& tx = *(*mapPriority.begin()).second;
3392 mapPriority.erase(mapPriority.begin());
3395 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
3396 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3398 int nTxSigOps = tx.GetSigOpCount();
3399 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3402 // Transaction fee required depends on block size
3403 bool fAllowFree = (nBlockSize + nTxSize < 4000 || CTransaction::AllowFree(dPriority));
3404 int64 nMinFee = tx.GetMinFee(nBlockSize, fAllowFree);
3406 // Connecting shouldn't fail due to dependency on other memory pool transactions
3407 // because we're already processing them in order of dependency
3408 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3409 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
3411 swap(mapTestPool, mapTestPoolTmp);
3414 pblock->vtx.push_back(tx);
3415 nBlockSize += nTxSize;
3416 nBlockSigOps += nTxSigOps;
3418 // Add transactions that depend on this one to the priority queue
3419 uint256 hash = tx.GetHash();
3420 if (mapDependers.count(hash))
3422 foreach(COrphan* porphan, mapDependers[hash])
3424 if (!porphan->setDependsOn.empty())
3426 porphan->setDependsOn.erase(hash);
3427 if (porphan->setDependsOn.empty())
3428 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3434 pblock->vtx[0].vout[0].nValue = GetBlockValue(pindexPrev->nHeight+1, nFees);
3437 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3438 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3439 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3440 pblock->nBits = GetNextWorkRequired(pindexPrev);
3443 return pblock.release();
3447 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce, int64& nPrevTime)
3449 // Update nExtraNonce
3450 int64 nNow = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3451 if (++nExtraNonce >= 0x7f && nNow > nPrevTime+1)
3456 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nBits << CBigNum(nExtraNonce);
3457 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3461 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3464 // Prebuild hash buffers
3471 uint256 hashPrevBlock;
3472 uint256 hashMerkleRoot;
3475 unsigned int nNonce;
3478 unsigned char pchPadding0[64];
3480 unsigned char pchPadding1[64];
3483 memset(&tmp, 0, sizeof(tmp));
3485 tmp.block.nVersion = pblock->nVersion;
3486 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3487 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3488 tmp.block.nTime = pblock->nTime;
3489 tmp.block.nBits = pblock->nBits;
3490 tmp.block.nNonce = pblock->nNonce;
3492 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3493 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3495 // Byte swap all the input buffer
3496 for (int i = 0; i < sizeof(tmp)/4; i++)
3497 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3499 // Precalc the first half of the first hash, which stays constant
3500 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3502 memcpy(pdata, &tmp.block, 128);
3503 memcpy(phash1, &tmp.hash1, 64);
3507 bool CheckWork(CBlock* pblock, CReserveKey& reservekey)
3509 uint256 hash = pblock->GetHash();
3510 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3512 if (hash > hashTarget)
3516 printf("BitcoinMiner:\n");
3517 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3519 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3520 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3523 CRITICAL_BLOCK(cs_main)
3525 if (pblock->hashPrevBlock != hashBestChain)
3526 return error("BitcoinMiner : generated block is stale");
3528 // Remove key from key pool
3529 reservekey.KeepKey();
3531 // Track how many getdata requests this block gets
3532 CRITICAL_BLOCK(cs_mapRequestCount)
3533 mapRequestCount[pblock->GetHash()] = 0;
3535 // Process this block the same as if we had received it from another node
3536 if (!ProcessBlock(NULL, pblock))
3537 return error("BitcoinMiner : ProcessBlock, block not accepted");
3547 printf("BitcoinMiner started\n");
3548 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3549 bool f4WaySSE2 = Detect128BitSSE2();
3550 if (mapArgs.count("-4way"))
3551 f4WaySSE2 = GetBoolArg("-4way");
3553 // Each thread has its own key and counter
3554 CReserveKey reservekey;
3555 unsigned int nExtraNonce = 0;
3556 int64 nPrevTime = 0;
3558 while (fGenerateBitcoins)
3560 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3564 while (vNodes.empty() || IsInitialBlockDownload())
3569 if (!fGenerateBitcoins)
3577 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3578 CBlockIndex* pindexPrev = pindexBest;
3580 auto_ptr<CBlock> pblock(CreateNewBlock(reservekey));
3583 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce, nPrevTime);
3585 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3589 // Prebuild hash buffers
3591 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3592 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3593 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3595 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3597 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3598 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3604 int64 nStart = GetTime();
3605 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3607 uint256& hash = *alignup<16>(hashbuf);
3610 unsigned int nHashesDone = 0;
3611 unsigned int nNonceFound;
3615 // tcatm's 4-way 128-bit SSE2 SHA-256
3616 nNonceFound = ScanHash_4WaySSE2(pmidstate, pdata + 64, phash1, (char*)&hash, nHashesDone);
3620 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1, (char*)&hash, nHashesDone);
3622 // Check if something found
3623 if (nNonceFound != -1)
3625 for (int i = 0; i < sizeof(hash)/4; i++)
3626 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3628 if (hash <= hashTarget)
3631 pblock->nNonce = ByteReverse(nNonceFound);
3632 assert(hash == pblock->GetHash());
3634 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3635 CheckWork(pblock.get(), reservekey);
3636 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3642 static int64 nHashCounter;
3643 if (nHPSTimerStart == 0)
3645 nHPSTimerStart = GetTimeMillis();
3649 nHashCounter += nHashesDone;
3650 if (GetTimeMillis() - nHPSTimerStart > 4000)
3652 static CCriticalSection cs;
3655 if (GetTimeMillis() - nHPSTimerStart > 4000)
3657 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3658 nHPSTimerStart = GetTimeMillis();
3660 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3661 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3662 static int64 nLogTime;
3663 if (GetTime() - nLogTime > 30 * 60)
3665 nLogTime = GetTime();
3666 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3667 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3673 // Check for stop or if block needs to be rebuilt
3676 if (!fGenerateBitcoins)
3678 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3682 if (nBlockNonce >= 0xffff0000)
3684 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3686 if (pindexPrev != pindexBest)
3689 // Update nTime every few seconds
3690 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3691 nBlockTime = ByteReverse(pblock->nTime);
3713 //////////////////////////////////////////////////////////////////////////////
3721 int64 nStart = GetTimeMillis();
3724 CRITICAL_BLOCK(cs_mapWallet)
3726 for (map<uint256, CWalletTx>::iterator it = mapWallet.begin(); it != mapWallet.end(); ++it)
3728 CWalletTx* pcoin = &(*it).second;
3729 if (!pcoin->IsFinal() || !pcoin->IsConfirmed())
3731 nTotal += pcoin->GetAvailableCredit();
3735 //printf("GetBalance() %"PRI64d"ms\n", GetTimeMillis() - nStart);
3740 bool SelectCoinsMinConf(int64 nTargetValue, int nConfMine, int nConfTheirs, set<pair<CWalletTx*,unsigned int> >& setCoinsRet, int64& nValueRet)
3742 setCoinsRet.clear();
3745 // List of values less than target
3746 pair<int64, pair<CWalletTx*,unsigned int> > coinLowestLarger;
3747 coinLowestLarger.first = INT64_MAX;
3748 coinLowestLarger.second.first = NULL;
3749 vector<pair<int64, pair<CWalletTx*,unsigned int> > > vValue;
3750 int64 nTotalLower = 0;
3752 CRITICAL_BLOCK(cs_mapWallet)
3754 vector<CWalletTx*> vCoins;
3755 vCoins.reserve(mapWallet.size());
3756 for (map<uint256, CWalletTx>::iterator it = mapWallet.begin(); it != mapWallet.end(); ++it)
3757 vCoins.push_back(&(*it).second);
3758 random_shuffle(vCoins.begin(), vCoins.end(), GetRandInt);
3760 foreach(CWalletTx* pcoin, vCoins)
3762 if (!pcoin->IsFinal() || !pcoin->IsConfirmed())
3765 if (pcoin->IsCoinBase() && pcoin->GetBlocksToMaturity() > 0)
3768 int nDepth = pcoin->GetDepthInMainChain();
3769 if (nDepth < (pcoin->IsFromMe() ? nConfMine : nConfTheirs))
3772 for (int i = 0; i < pcoin->vout.size(); i++)
3774 if (pcoin->IsSpent(i) || !pcoin->vout[i].IsMine())
3777 int64 n = pcoin->vout[i].nValue;
3782 pair<int64,pair<CWalletTx*,unsigned int> > coin = make_pair(n,make_pair(pcoin,i));
3784 if (n == nTargetValue)
3786 setCoinsRet.insert(coin.second);
3787 nValueRet += coin.first;
3790 else if (n < nTargetValue + CENT)
3792 vValue.push_back(coin);
3795 else if (n < coinLowestLarger.first)
3797 coinLowestLarger = coin;
3803 if (nTotalLower == nTargetValue || nTotalLower == nTargetValue + CENT)
3805 for (int i = 0; i < vValue.size(); ++i)
3807 setCoinsRet.insert(vValue[i].second);
3808 nValueRet += vValue[i].first;
3813 if (nTotalLower < nTargetValue + (coinLowestLarger.second.first ? CENT : 0))
3815 if (coinLowestLarger.second.first == NULL)
3817 setCoinsRet.insert(coinLowestLarger.second);
3818 nValueRet += coinLowestLarger.first;
3822 if (nTotalLower >= nTargetValue + CENT)
3823 nTargetValue += CENT;
3825 // Solve subset sum by stochastic approximation
3826 sort(vValue.rbegin(), vValue.rend());
3827 vector<char> vfIncluded;
3828 vector<char> vfBest(vValue.size(), true);
3829 int64 nBest = nTotalLower;
3831 for (int nRep = 0; nRep < 1000 && nBest != nTargetValue; nRep++)
3833 vfIncluded.assign(vValue.size(), false);
3835 bool fReachedTarget = false;
3836 for (int nPass = 0; nPass < 2 && !fReachedTarget; nPass++)
3838 for (int i = 0; i < vValue.size(); i++)
3840 if (nPass == 0 ? rand() % 2 : !vfIncluded[i])
3842 nTotal += vValue[i].first;
3843 vfIncluded[i] = true;
3844 if (nTotal >= nTargetValue)
3846 fReachedTarget = true;
3850 vfBest = vfIncluded;
3852 nTotal -= vValue[i].first;
3853 vfIncluded[i] = false;
3860 // If the next larger is still closer, return it
3861 if (coinLowestLarger.second.first && coinLowestLarger.first - nTargetValue <= nBest - nTargetValue)
3863 setCoinsRet.insert(coinLowestLarger.second);
3864 nValueRet += coinLowestLarger.first;
3867 for (int i = 0; i < vValue.size(); i++)
3870 setCoinsRet.insert(vValue[i].second);
3871 nValueRet += vValue[i].first;
3875 printf("SelectCoins() best subset: ");
3876 for (int i = 0; i < vValue.size(); i++)
3878 printf("%s ", FormatMoney(vValue[i].first).c_str());
3879 printf("total %s\n", FormatMoney(nBest).c_str());
3885 bool SelectCoins(int64 nTargetValue, set<pair<CWalletTx*,unsigned int> >& setCoinsRet, int64& nValueRet)
3887 return (SelectCoinsMinConf(nTargetValue, 1, 6, setCoinsRet, nValueRet) ||
3888 SelectCoinsMinConf(nTargetValue, 1, 1, setCoinsRet, nValueRet) ||
3889 SelectCoinsMinConf(nTargetValue, 0, 1, setCoinsRet, nValueRet));
3895 bool CreateTransaction(const vector<pair<CScript, int64> >& vecSend, CWalletTx& wtxNew, CReserveKey& reservekey, int64& nFeeRet)
3898 foreach (const PAIRTYPE(CScript, int64)& s, vecSend)
3904 if (vecSend.empty() || nValue < 0)
3907 CRITICAL_BLOCK(cs_main)
3909 // txdb must be opened before the mapWallet lock
3911 CRITICAL_BLOCK(cs_mapWallet)
3913 nFeeRet = nTransactionFee;
3917 wtxNew.vout.clear();
3918 wtxNew.fFromMe = true;
3920 int64 nTotalValue = nValue + nFeeRet;
3921 double dPriority = 0;
3922 // vouts to the payees
3923 foreach (const PAIRTYPE(CScript, int64)& s, vecSend)
3924 wtxNew.vout.push_back(CTxOut(s.second, s.first));
3926 // Choose coins to use
3927 set<pair<CWalletTx*,unsigned int> > setCoins;
3929 if (!SelectCoins(nTotalValue, setCoins, nValueIn))
3931 foreach(PAIRTYPE(CWalletTx*, unsigned int) pcoin, setCoins)
3933 int64 nCredit = pcoin.first->vout[pcoin.second].nValue;
3934 dPriority += (double)nCredit * pcoin.first->GetDepthInMainChain();
3937 // Fill a vout back to self with any change
3938 int64 nChange = nValueIn - nTotalValue;
3939 if (nChange >= CENT)
3941 // Note: We use a new key here to keep it from being obvious which side is the change.
3942 // The drawback is that by not reusing a previous key, the change may be lost if a
3943 // backup is restored, if the backup doesn't have the new private key for the change.
3944 // If we reused the old key, it would be possible to add code to look for and
3945 // rediscover unknown transactions that were written with keys of ours to recover
3946 // post-backup change.
3948 // Reserve a new key pair from key pool
3949 vector<unsigned char> vchPubKey = reservekey.GetReservedKey();
3950 assert(mapKeys.count(vchPubKey));
3952 // Fill a vout to ourself, using same address type as the payment
3953 CScript scriptChange;
3954 if (vecSend[0].first.GetBitcoinAddressHash160() != 0)
3955 scriptChange.SetBitcoinAddress(vchPubKey);
3957 scriptChange << vchPubKey << OP_CHECKSIG;
3959 // Insert change txn at random position:
3960 vector<CTxOut>::iterator position = wtxNew.vout.begin()+GetRandInt(wtxNew.vout.size());
3961 wtxNew.vout.insert(position, CTxOut(nChange, scriptChange));
3964 reservekey.ReturnKey();
3967 foreach(const PAIRTYPE(CWalletTx*,unsigned int)& coin, setCoins)
3968 wtxNew.vin.push_back(CTxIn(coin.first->GetHash(),coin.second));
3972 foreach(const PAIRTYPE(CWalletTx*,unsigned int)& coin, setCoins)
3973 if (!SignSignature(*coin.first, wtxNew, nIn++))
3977 unsigned int nBytes = ::GetSerializeSize(*(CTransaction*)&wtxNew, SER_NETWORK);
3978 if (nBytes >= MAX_BLOCK_SIZE_GEN/5)
3980 dPriority /= nBytes;
3982 // Check that enough fee is included
3983 int64 nPayFee = nTransactionFee * (1 + (int64)nBytes / 1000);
3984 bool fAllowFree = CTransaction::AllowFree(dPriority);
3985 int64 nMinFee = wtxNew.GetMinFee(1, fAllowFree);
3986 if (nFeeRet < max(nPayFee, nMinFee))
3988 nFeeRet = max(nPayFee, nMinFee);
3992 // Fill vtxPrev by copying from previous transactions vtxPrev
3993 wtxNew.AddSupportingTransactions(txdb);
3994 wtxNew.fTimeReceivedIsTxTime = true;
4003 bool CreateTransaction(CScript scriptPubKey, int64 nValue, CWalletTx& wtxNew, CReserveKey& reservekey, int64& nFeeRet)
4005 vector< pair<CScript, int64> > vecSend;
4006 vecSend.push_back(make_pair(scriptPubKey, nValue));
4007 return CreateTransaction(vecSend, wtxNew, reservekey, nFeeRet);
4010 // Call after CreateTransaction unless you want to abort
4011 bool CommitTransaction(CWalletTx& wtxNew, CReserveKey& reservekey)
4013 CRITICAL_BLOCK(cs_main)
4015 printf("CommitTransaction:\n%s", wtxNew.ToString().c_str());
4016 CRITICAL_BLOCK(cs_mapWallet)
4018 // This is only to keep the database open to defeat the auto-flush for the
4019 // duration of this scope. This is the only place where this optimization
4020 // maybe makes sense; please don't do it anywhere else.
4021 CWalletDB walletdb("r");
4023 // Take key pair from key pool so it won't be used again
4024 reservekey.KeepKey();
4026 // Add tx to wallet, because if it has change it's also ours,
4027 // otherwise just for transaction history.
4028 AddToWallet(wtxNew);
4030 // Mark old coins as spent
4031 set<CWalletTx*> setCoins;
4032 foreach(const CTxIn& txin, wtxNew.vin)
4034 CWalletTx &pcoin = mapWallet[txin.prevout.hash];
4035 pcoin.MarkSpent(txin.prevout.n);
4036 pcoin.WriteToDisk();
4037 vWalletUpdated.push_back(pcoin.GetHash());
4041 // Track how many getdata requests our transaction gets
4042 CRITICAL_BLOCK(cs_mapRequestCount)
4043 mapRequestCount[wtxNew.GetHash()] = 0;
4046 if (!wtxNew.AcceptToMemoryPool())
4048 // This must not fail. The transaction has already been signed and recorded.
4049 printf("CommitTransaction() : Error: Transaction not valid");
4052 wtxNew.RelayWalletTransaction();
4061 // requires cs_main lock
4062 string SendMoney(CScript scriptPubKey, int64 nValue, CWalletTx& wtxNew, bool fAskFee)
4064 CReserveKey reservekey;
4066 if (!CreateTransaction(scriptPubKey, nValue, wtxNew, reservekey, nFeeRequired))
4069 if (nValue + nFeeRequired > GetBalance())
4070 strError = strprintf(_("Error: This transaction requires a transaction fee of at least %s because of its amount, complexity, or use of recently received funds "), FormatMoney(nFeeRequired).c_str());
4072 strError = _("Error: Transaction creation failed ");
4073 printf("SendMoney() : %s", strError.c_str());
4077 if (fAskFee && !ThreadSafeAskFee(nFeeRequired, _("Sending..."), NULL))
4080 if (!CommitTransaction(wtxNew, reservekey))
4081 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.");
4089 // requires cs_main lock
4090 string SendMoneyToBitcoinAddress(string strAddress, int64 nValue, CWalletTx& wtxNew, bool fAskFee)
4094 return _("Invalid amount");
4095 if (nValue + nTransactionFee > GetBalance())
4096 return _("Insufficient funds");
4098 // Parse bitcoin address
4099 CScript scriptPubKey;
4100 if (!scriptPubKey.SetBitcoinAddress(strAddress))
4101 return _("Invalid bitcoin address");
4103 return SendMoney(scriptPubKey, nValue, wtxNew, fAskFee);