1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2011 The Bitcoin developers
3 // Copyright (c) 2011-2012 The PPCoin developers
4 // Distributed under the MIT/X11 software license, see the accompanying
5 // file license.txt or http://www.opensource.org/licenses/mit-license.php.
7 #include "checkpoints.h"
11 #include <boost/filesystem.hpp>
12 #include <boost/filesystem/fstream.hpp>
15 using namespace boost;
21 CCriticalSection cs_setpwalletRegistered;
22 set<CWallet*> setpwalletRegistered;
24 CCriticalSection cs_main;
26 static map<uint256, CTransaction> mapTransactions;
27 CCriticalSection cs_mapTransactions;
28 unsigned int nTransactionsUpdated = 0;
29 map<COutPoint, CInPoint> mapNextTx;
31 map<uint256, CBlockIndex*> mapBlockIndex;
32 uint256 hashGenesisBlock("0x000000006d52486334316794cc38ffeb7ebf35a7ebd661fd39f5f46b0d001575");
33 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 32);
34 const int nInitialBlockThreshold = 120; // Regard blocks up until N-threshold as "initial download"
35 CBlockIndex* pindexGenesisBlock = NULL;
37 uint64 nBestChainTrust = 0;
38 uint64 nBestInvalidTrust = 0;
39 uint256 hashBestChain = 0;
40 CBlockIndex* pindexBest = NULL;
41 int64 nTimeBestReceived = 0;
43 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
45 map<uint256, CBlock*> mapOrphanBlocks;
46 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
48 map<uint256, CDataStream*> mapOrphanTransactions;
49 multimap<uint256, CDataStream*> mapOrphanTransactionsByPrev;
56 int fGenerateBitcoins = false;
57 int64 nTransactionFee = MIN_TX_FEE;
58 int fLimitProcessors = false;
59 int nLimitProcessors = 1;
60 int fMinimizeToTray = true;
61 int fMinimizeOnClose = true;
67 int64 nBalanceReserve = 0;
69 //////////////////////////////////////////////////////////////////////////////
71 // dispatching functions
74 // These functions dispatch to one or all registered wallets
77 void RegisterWallet(CWallet* pwalletIn)
79 CRITICAL_BLOCK(cs_setpwalletRegistered)
81 setpwalletRegistered.insert(pwalletIn);
85 void UnregisterWallet(CWallet* pwalletIn)
87 CRITICAL_BLOCK(cs_setpwalletRegistered)
89 setpwalletRegistered.erase(pwalletIn);
93 // check whether the passed transaction is from us
94 bool static IsFromMe(CTransaction& tx)
96 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
97 if (pwallet->IsFromMe(tx))
102 // get the wallet transaction with the given hash (if it exists)
103 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
105 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
106 if (pwallet->GetTransaction(hashTx,wtx))
111 // erases transaction with the given hash from all wallets
112 void static EraseFromWallets(uint256 hash)
114 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
115 pwallet->EraseFromWallet(hash);
118 // make sure all wallets know about the given transaction, in the given block
119 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false, bool fConnect = true)
123 // ppcoin: wallets need to refund inputs when disconnecting coinstake
124 if (tx.IsCoinStake())
125 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
126 if (pwallet->IsFromMe(tx))
127 pwallet->DisableTransaction(tx);
131 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
132 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
135 // notify wallets about a new best chain
136 void static SetBestChain(const CBlockLocator& loc)
138 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
139 pwallet->SetBestChain(loc);
142 // notify wallets about an updated transaction
143 void static UpdatedTransaction(const uint256& hashTx)
145 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
146 pwallet->UpdatedTransaction(hashTx);
150 void static PrintWallets(const CBlock& block)
152 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
153 pwallet->PrintWallet(block);
156 // notify wallets about an incoming inventory (for request counts)
157 void static Inventory(const uint256& hash)
159 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
160 pwallet->Inventory(hash);
163 // ask wallets to resend their transactions
164 void static ResendWalletTransactions()
166 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
167 pwallet->ResendWalletTransactions();
176 //////////////////////////////////////////////////////////////////////////////
178 // mapOrphanTransactions
181 void static AddOrphanTx(const CDataStream& vMsg)
184 CDataStream(vMsg) >> tx;
185 uint256 hash = tx.GetHash();
186 if (mapOrphanTransactions.count(hash))
188 CDataStream* pvMsg = mapOrphanTransactions[hash] = new CDataStream(vMsg);
189 BOOST_FOREACH(const CTxIn& txin, tx.vin)
190 mapOrphanTransactionsByPrev.insert(make_pair(txin.prevout.hash, pvMsg));
193 void static EraseOrphanTx(uint256 hash)
195 if (!mapOrphanTransactions.count(hash))
197 const CDataStream* pvMsg = mapOrphanTransactions[hash];
199 CDataStream(*pvMsg) >> tx;
200 BOOST_FOREACH(const CTxIn& txin, tx.vin)
202 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(txin.prevout.hash);
203 mi != mapOrphanTransactionsByPrev.upper_bound(txin.prevout.hash);)
205 if ((*mi).second == pvMsg)
206 mapOrphanTransactionsByPrev.erase(mi++);
212 mapOrphanTransactions.erase(hash);
222 //////////////////////////////////////////////////////////////////////////////
224 // CTransaction and CTxIndex
227 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
230 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
232 if (!ReadFromDisk(txindexRet.pos))
234 if (prevout.n >= vout.size())
242 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
245 return ReadFromDisk(txdb, prevout, txindex);
248 bool CTransaction::ReadFromDisk(COutPoint prevout)
252 return ReadFromDisk(txdb, prevout, txindex);
257 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
269 // Load the block this tx is in
271 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
273 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
278 // Update the tx's hashBlock
279 hashBlock = pblock->GetHash();
281 // Locate the transaction
282 for (nIndex = 0; nIndex < pblock->vtx.size(); nIndex++)
283 if (pblock->vtx[nIndex] == *(CTransaction*)this)
285 if (nIndex == pblock->vtx.size())
287 vMerkleBranch.clear();
289 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
293 // Fill in merkle branch
294 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
297 // Is the tx in a block that's in the main chain
298 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
299 if (mi == mapBlockIndex.end())
301 CBlockIndex* pindex = (*mi).second;
302 if (!pindex || !pindex->IsInMainChain())
305 return pindexBest->nHeight - pindex->nHeight + 1;
314 bool CTransaction::CheckTransaction() const
316 // Basic checks that don't depend on any context
318 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
320 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
322 if (::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
323 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
325 // Check for negative or overflow output values
327 for (int i = (IsCoinStake()? 1 : 0); i < vout.size(); i++)
329 const CTxOut& txout = vout[i];
330 if (txout.nValue < 0)
331 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue negative"));
332 if (txout.nValue > MAX_MONEY)
333 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
334 nValueOut += txout.nValue;
335 if (!MoneyRange(nValueOut))
336 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
339 // Check for duplicate inputs
340 set<COutPoint> vInOutPoints;
341 BOOST_FOREACH(const CTxIn& txin, vin)
343 if (vInOutPoints.count(txin.prevout))
345 vInOutPoints.insert(txin.prevout);
350 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
351 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
355 BOOST_FOREACH(const CTxIn& txin, vin)
356 if (txin.prevout.IsNull())
357 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
363 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
366 *pfMissingInputs = false;
368 if (!CheckTransaction())
369 return error("AcceptToMemoryPool() : CheckTransaction failed");
371 // Coinbase is only valid in a block, not as a loose transaction
373 return DoS(100, error("AcceptToMemoryPool() : coinbase as individual tx"));
374 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
376 return DoS(100, error("AcceptToMemoryPool() : coinstake as individual tx"));
378 // To help v0.1.5 clients who would see it as a negative number
379 if ((int64)nLockTime > INT_MAX)
380 return error("AcceptToMemoryPool() : not accepting nLockTime beyond 2038 yet");
383 unsigned int nSize = ::GetSerializeSize(*this, SER_NETWORK);
384 // Checking ECDSA signatures is a CPU bottleneck, so to avoid denial-of-service
385 // attacks disallow transactions with more than one SigOp per 34 bytes.
386 // 34 bytes because a TxOut is:
387 // 20-byte address + 8 byte bitcoin amount + 5 bytes of ops + 1 byte script length
388 if (GetSigOpCount() > nSize / 34 || nSize < 100)
389 return error("AcceptToMemoryPool() : transaction with out-of-bounds SigOpCount");
391 // Rather not work on nonstandard transactions (unless -testnet)
392 if (!fTestNet && !IsStandard())
393 return error("AcceptToMemoryPool() : nonstandard transaction type");
395 // Do we already have it?
396 uint256 hash = GetHash();
397 CRITICAL_BLOCK(cs_mapTransactions)
398 if (mapTransactions.count(hash))
401 if (txdb.ContainsTx(hash))
404 // Check for conflicts with in-memory transactions
405 CTransaction* ptxOld = NULL;
406 for (int i = 0; i < vin.size(); i++)
408 COutPoint outpoint = vin[i].prevout;
409 if (mapNextTx.count(outpoint))
411 // Disable replacement feature for now
414 // Allow replacing with a newer version of the same transaction
417 ptxOld = mapNextTx[outpoint].ptx;
418 if (ptxOld->IsFinal())
420 if (!IsNewerThan(*ptxOld))
422 for (int i = 0; i < vin.size(); i++)
424 COutPoint outpoint = vin[i].prevout;
425 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
434 // Check against previous transactions
435 map<uint256, CTxIndex> mapUnused;
437 if (!ConnectInputs(txdb, mapUnused, CDiskTxPos(1,1,1), pindexBest, nFees, false, false))
440 *pfMissingInputs = true;
441 return error("AcceptToMemoryPool() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
444 // Don't accept it if it can't get into a block
445 if (nFees < GetMinFee(1000, false, true))
446 return error("AcceptToMemoryPool() : not enough fees");
448 // Continuously rate-limit free transactions
449 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
450 // be annoying or make other's transactions take longer to confirm.
451 if (nFees < MIN_RELAY_TX_FEE)
453 static CCriticalSection cs;
454 static double dFreeCount;
455 static int64 nLastTime;
456 int64 nNow = GetTime();
460 // Use an exponentially decaying ~10-minute window:
461 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
463 // -limitfreerelay unit is thousand-bytes-per-minute
464 // At default rate it would take over a month to fill 1GB
465 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(*this))
466 return error("AcceptToMemoryPool() : free transaction rejected by rate limiter");
468 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
474 // Store transaction in memory
475 CRITICAL_BLOCK(cs_mapTransactions)
479 printf("AcceptToMemoryPool() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
480 ptxOld->RemoveFromMemoryPool();
482 AddToMemoryPoolUnchecked();
485 ///// are we sure this is ok when loading transactions or restoring block txes
486 // If updated, erase old tx from wallet
488 EraseFromWallets(ptxOld->GetHash());
490 printf("AcceptToMemoryPool(): accepted %s\n", hash.ToString().substr(0,10).c_str());
494 bool CTransaction::AcceptToMemoryPool(bool fCheckInputs, bool* pfMissingInputs)
497 return AcceptToMemoryPool(txdb, fCheckInputs, pfMissingInputs);
500 bool CTransaction::AddToMemoryPoolUnchecked()
502 // Add to memory pool without checking anything. Don't call this directly,
503 // call AcceptToMemoryPool to properly check the transaction first.
504 CRITICAL_BLOCK(cs_mapTransactions)
506 uint256 hash = GetHash();
507 mapTransactions[hash] = *this;
508 for (int i = 0; i < vin.size(); i++)
509 mapNextTx[vin[i].prevout] = CInPoint(&mapTransactions[hash], i);
510 nTransactionsUpdated++;
516 bool CTransaction::RemoveFromMemoryPool()
518 // Remove transaction from memory pool
519 CRITICAL_BLOCK(cs_mapTransactions)
521 BOOST_FOREACH(const CTxIn& txin, vin)
522 mapNextTx.erase(txin.prevout);
523 mapTransactions.erase(GetHash());
524 nTransactionsUpdated++;
534 int CMerkleTx::GetDepthInMainChain(int& nHeightRet) const
536 if (hashBlock == 0 || nIndex == -1)
539 // Find the block it claims to be in
540 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
541 if (mi == mapBlockIndex.end())
543 CBlockIndex* pindex = (*mi).second;
544 if (!pindex || !pindex->IsInMainChain())
547 // Make sure the merkle branch connects to this block
548 if (!fMerkleVerified)
550 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
552 fMerkleVerified = true;
555 nHeightRet = pindex->nHeight;
556 return pindexBest->nHeight - pindex->nHeight + 1;
560 int CMerkleTx::GetBlocksToMaturity() const
562 if (!(IsCoinBase() || IsCoinStake()))
564 return max(0, (COINBASE_MATURITY+20) - GetDepthInMainChain());
568 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
572 if (!IsInMainChain() && !ClientConnectInputs())
574 return CTransaction::AcceptToMemoryPool(txdb, false);
578 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
582 bool CMerkleTx::AcceptToMemoryPool()
585 return AcceptToMemoryPool(txdb);
590 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
592 CRITICAL_BLOCK(cs_mapTransactions)
594 // Add previous supporting transactions first
595 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
597 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
599 uint256 hash = tx.GetHash();
600 if (!mapTransactions.count(hash) && !txdb.ContainsTx(hash))
601 tx.AcceptToMemoryPool(txdb, fCheckInputs);
604 return AcceptToMemoryPool(txdb, fCheckInputs);
609 bool CWalletTx::AcceptWalletTransaction()
612 return AcceptWalletTransaction(txdb);
615 int CTxIndex::GetDepthInMainChain() const
619 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
621 // Find the block in the index
622 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
623 if (mi == mapBlockIndex.end())
625 CBlockIndex* pindex = (*mi).second;
626 if (!pindex || !pindex->IsInMainChain())
628 return 1 + nBestHeight - pindex->nHeight;
640 //////////////////////////////////////////////////////////////////////////////
642 // CBlock and CBlockIndex
645 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
647 if (!fReadTransactions)
649 *this = pindex->GetBlockHeader();
652 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
654 if (GetHash() != pindex->GetBlockHash())
655 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
659 uint256 static GetOrphanRoot(const CBlock* pblock)
661 // Work back to the first block in the orphan chain
662 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
663 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
664 return pblock->GetHash();
667 int64 static GetProofOfWorkReward(unsigned int nBits)
669 CBigNum bnSubsidyLimit = 9999 * COIN; // subsidy amount for difficulty 1
671 bnTarget.SetCompact(nBits);
672 CBigNum bnTargetLimit = bnProofOfWorkLimit;
673 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
675 // ppcoin: subsidy is cut in half every 16x multiply of difficulty
676 // A reasonably continuous curve is used to avoid shock to market
677 // (nSubsidyLimit / nSubsidy) ** 4 == bnProofOfWorkLimit / bnTarget
678 CBigNum bnLowerBound = CENT;
679 CBigNum bnUpperBound = bnSubsidyLimit;
680 while (bnLowerBound + CENT <= bnUpperBound)
682 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
683 if (fDebug && GetBoolArg("-printcreation"))
684 printf("GetProofOfWorkReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
685 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
686 bnUpperBound = bnMidValue;
688 bnLowerBound = bnMidValue;
691 int64 nSubsidy = bnUpperBound.getuint64();
692 nSubsidy = (nSubsidy / CENT) * CENT;
693 if (fDebug && GetBoolArg("-printcreation"))
694 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
699 // ppcoin: miner's coin stake is rewarded based on coin age spent (coin-days)
700 int64 GetProofOfStakeReward(int64 nCoinAge)
702 static int64 nRewardCoinYear = CENT; // creation amount per coin-year
703 int64 nSubsidy = nCoinAge * 33 / (365 * 33 + 8) * nRewardCoinYear;
704 if (fDebug && GetBoolArg("-printcreation"))
705 printf("GetProofOfStakeReward(): create=%s nCoinAge=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nCoinAge);
709 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
710 static const int64 nTargetSpacing = 10 * 60;
711 static const int64 nInterval = nTargetTimespan / nTargetSpacing;
712 static const int64 nMaxClockDrift = 2 * 60 * 60; // 2 hours
715 // minimum amount of work that could possibly be required nTime after
716 // minimum work required was nBase
718 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
721 bnResult.SetCompact(nBase);
722 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
724 // Maximum 400% adjustment...
726 // ... in best-case exactly 4-times-normal target time
727 nTime -= nTargetTimespan*4;
729 if (bnResult > bnProofOfWorkLimit)
730 bnResult = bnProofOfWorkLimit;
731 return bnResult.GetCompact();
734 unsigned int static GetNextWorkRequired(const CBlockIndex* pindexLast)
736 // Genesis block and first block
737 if (pindexLast == NULL || pindexLast->pprev == NULL)
738 return bnProofOfWorkLimit.GetCompact();
740 int64 nActualSpacing = pindexLast->GetBlockTime() - pindexLast->pprev->GetBlockTime();
742 // ppcoin: target change every block
743 // ppcoin: retarget with exponential moving toward target spacing
745 bnNew.SetCompact(pindexLast->nBits);
746 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
747 bnNew /= ((nInterval + 1) * nTargetSpacing);
749 if (bnNew > bnProofOfWorkLimit)
750 bnNew = bnProofOfWorkLimit;
752 return bnNew.GetCompact();
755 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
758 bnTarget.SetCompact(nBits);
761 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
762 return error("CheckProofOfWork() : nBits below minimum work");
764 // Check proof of work matches claimed amount
765 if (hash > bnTarget.getuint256())
766 return error("CheckProofOfWork() : hash doesn't match nBits");
771 // Return maximum amount of blocks that other nodes claim to have
772 int GetNumBlocksOfPeers()
774 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
777 bool IsInitialBlockDownload()
779 if (pindexBest == NULL || nBestHeight < (Checkpoints::GetTotalBlocksEstimate()-nInitialBlockThreshold))
781 static int64 nLastUpdate;
782 static CBlockIndex* pindexLastBest;
783 if (pindexBest != pindexLastBest)
785 pindexLastBest = pindexBest;
786 nLastUpdate = GetTime();
788 return (GetTime() - nLastUpdate < 10 &&
789 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
792 void static InvalidChainFound(CBlockIndex* pindexNew)
794 if (pindexNew->nChainTrust > nBestInvalidTrust)
796 nBestInvalidTrust = pindexNew->nChainTrust;
797 CTxDB().WriteBestInvalidTrust(nBestInvalidTrust);
800 printf("InvalidChainFound: invalid block=%s height=%d trust=%s\n", pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight, CBigNum(pindexNew->nChainTrust).ToString().c_str());
801 printf("InvalidChainFound: current best=%s height=%d trust=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, CBigNum(nBestChainTrust).ToString().c_str());
802 if (pindexBest && nBestInvalidTrust > nBestChainTrust + pindexBest->GetBlockTrust() * 6)
803 printf("InvalidChainFound: WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.\n");
816 bool CTransaction::DisconnectInputs(CTxDB& txdb)
818 // Relinquish previous transactions' spent pointers
821 BOOST_FOREACH(const CTxIn& txin, vin)
823 COutPoint prevout = txin.prevout;
825 // Get prev txindex from disk
827 if (!txdb.ReadTxIndex(prevout.hash, txindex))
828 return error("DisconnectInputs() : ReadTxIndex failed");
830 if (prevout.n >= txindex.vSpent.size())
831 return error("DisconnectInputs() : prevout.n out of range");
833 // Mark outpoint as not spent
834 txindex.vSpent[prevout.n].SetNull();
837 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
838 return error("DisconnectInputs() : UpdateTxIndex failed");
842 // Remove transaction from index
843 if (!txdb.EraseTxIndex(*this))
844 return error("DisconnectInputs() : EraseTxPos failed");
850 bool CTransaction::ConnectInputs(CTxDB& txdb, map<uint256, CTxIndex>& mapTestPool, CDiskTxPos posThisTx,
851 CBlockIndex* pindexBlock, int64& nFees, bool fBlock, bool fMiner, int64 nMinFee)
853 // Take over previous transactions' spent pointers
854 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
855 // fMiner is true when called from the internal bitcoin miner
856 // ... both are false when called from CTransaction::AcceptToMemoryPool
860 for (int i = 0; i < vin.size(); i++)
862 COutPoint prevout = vin[i].prevout;
867 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
869 // Get txindex from current proposed changes
870 txindex = mapTestPool[prevout.hash];
874 // Read txindex from txdb
875 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
877 if (!fFound && (fBlock || fMiner))
878 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());
882 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
884 // Get prev tx from single transactions in memory
885 CRITICAL_BLOCK(cs_mapTransactions)
887 if (!mapTransactions.count(prevout.hash))
888 return error("ConnectInputs() : %s mapTransactions prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
889 txPrev = mapTransactions[prevout.hash];
892 txindex.vSpent.resize(txPrev.vout.size());
896 // Get prev tx from disk
897 if (!txPrev.ReadFromDisk(txindex.pos))
898 return error("ConnectInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
901 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
902 return DoS(100, 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()));
904 // If prev is coinbase/coinstake, check that it's matured
905 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
906 for (CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < COINBASE_MATURITY; pindex = pindex->pprev)
907 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
908 return error("ConnectInputs() : tried to spend coinbase/coinstake at depth %d", pindexBlock->nHeight - pindex->nHeight);
910 // ppcoin: check transaction timestamp
911 if (txPrev.nTime > nTime)
912 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
914 // Skip ECDSA signature verification when connecting blocks (fBlock=true) during initial download
915 // (before the last blockchain checkpoint). This is safe because block merkle hashes are
916 // still computed and checked, and any change will be caught at the next checkpoint.
917 if (!(fBlock && IsInitialBlockDownload()))
919 if (!VerifySignature(txPrev, *this, i))
920 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
922 // Check for conflicts (double-spend)
923 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
924 // for an attacker to attempt to split the network.
925 if (!txindex.vSpent[prevout.n].IsNull())
926 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());
928 // Check for negative or overflow input values
929 nValueIn += txPrev.vout[prevout.n].nValue;
930 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
931 return DoS(100, error("ConnectInputs() : txin values out of range"));
933 // Mark outpoints as spent
934 txindex.vSpent[prevout.n] = posThisTx;
937 if (fBlock || fMiner)
939 mapTestPool[prevout.hash] = txindex;
945 // ppcoin: coin stake tx earns reward instead of paying fee
947 if (!GetCoinAge(txdb, nCoinAge))
948 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
949 int64 nStakeReward = GetValueOut() - nValueIn;
950 if (nStakeReward > GetProofOfStakeReward(nCoinAge))
951 return DoS(100, error("ConnectInputs() : %s stake reward exceeded", GetHash().ToString().substr(0,10).c_str()));
955 if (nValueIn < GetValueOut())
956 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
958 // Tally transaction fees
959 int64 nTxFee = nValueIn - GetValueOut();
961 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
962 // ppcoin: enforce transaction fees for every block
963 if (nTxFee < nMinFee)
964 return fBlock? DoS(100, error("ConnectInputs() : %s not paying required fee=%s, paid=%s", GetHash().ToString().substr(0,10).c_str(), FormatMoney(nMinFee).c_str(), FormatMoney(nTxFee).c_str())) : false;
966 if (!MoneyRange(nFees))
967 return DoS(100, error("ConnectInputs() : nFees out of range"));
973 // Add transaction to changes
974 mapTestPool[GetHash()] = CTxIndex(posThisTx, vout.size());
978 // Add transaction to test pool
979 mapTestPool[GetHash()] = CTxIndex(CDiskTxPos(1,1,1), vout.size());
986 bool CTransaction::ClientConnectInputs()
991 // Take over previous transactions' spent pointers
992 CRITICAL_BLOCK(cs_mapTransactions)
995 for (int i = 0; i < vin.size(); i++)
997 // Get prev tx from single transactions in memory
998 COutPoint prevout = vin[i].prevout;
999 if (!mapTransactions.count(prevout.hash))
1001 CTransaction& txPrev = mapTransactions[prevout.hash];
1003 if (prevout.n >= txPrev.vout.size())
1007 if (!VerifySignature(txPrev, *this, i))
1008 return error("ConnectInputs() : VerifySignature failed");
1010 ///// this is redundant with the mapNextTx stuff, not sure which I want to get rid of
1011 ///// this has to go away now that posNext is gone
1012 // // Check for conflicts
1013 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1014 // return error("ConnectInputs() : prev tx already used");
1016 // // Flag outpoints as used
1017 // txPrev.vout[prevout.n].posNext = posThisTx;
1019 nValueIn += txPrev.vout[prevout.n].nValue;
1021 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1022 return error("ClientConnectInputs() : txin values out of range");
1024 if (GetValueOut() > nValueIn)
1034 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1036 // Disconnect in reverse order
1037 for (int i = vtx.size()-1; i >= 0; i--)
1038 if (!vtx[i].DisconnectInputs(txdb))
1041 // Update block index on disk without changing it in memory.
1042 // The memory index structure will be changed after the db commits.
1045 CDiskBlockIndex blockindexPrev(pindex->pprev);
1046 blockindexPrev.hashNext = 0;
1047 if (!txdb.WriteBlockIndex(blockindexPrev))
1048 return error("DisconnectBlock() : WriteBlockIndex failed");
1051 // ppcoin: clean up wallet after disconnecting coinstake
1052 BOOST_FOREACH(CTransaction& tx, vtx)
1053 SyncWithWallets(tx, this, false, false);
1058 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1060 // Check it again in case a previous version let a bad block in
1064 //// issue here: it doesn't know the version
1065 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1067 map<uint256, CTxIndex> mapQueuedChanges;
1069 BOOST_FOREACH(CTransaction& tx, vtx)
1071 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1072 nTxPos += ::GetSerializeSize(tx, SER_DISK);
1074 if (!tx.ConnectInputs(txdb, mapQueuedChanges, posThisTx, pindex, nFees, true, false, tx.GetMinFee()))
1077 // Write queued txindex changes
1078 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1080 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1081 return error("ConnectBlock() : UpdateTxIndex failed");
1084 // ppcoin: fees are not collected by miners as in bitcoin
1085 // ppcoin: fees are destroyed to compensate the entire network
1086 if (vtx[0].GetValueOut() > GetProofOfWorkReward(nBits))
1088 if (fDebug && GetBoolArg("-printcreation"))
1089 printf("ConnectBlock() : destroy=%s nFees=%"PRI64d"\n", FormatMoney(nFees).c_str(), nFees);
1091 // Update block index on disk without changing it in memory.
1092 // The memory index structure will be changed after the db commits.
1095 CDiskBlockIndex blockindexPrev(pindex->pprev);
1096 blockindexPrev.hashNext = pindex->GetBlockHash();
1097 if (!txdb.WriteBlockIndex(blockindexPrev))
1098 return error("ConnectBlock() : WriteBlockIndex failed");
1101 // Watch for transactions paying to me
1102 BOOST_FOREACH(CTransaction& tx, vtx)
1103 SyncWithWallets(tx, this, true);
1108 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1110 printf("REORGANIZE\n");
1113 CBlockIndex* pfork = pindexBest;
1114 CBlockIndex* plonger = pindexNew;
1115 while (pfork != plonger)
1117 while (plonger->nHeight > pfork->nHeight)
1118 if (!(plonger = plonger->pprev))
1119 return error("Reorganize() : plonger->pprev is null");
1120 if (pfork == plonger)
1122 if (!(pfork = pfork->pprev))
1123 return error("Reorganize() : pfork->pprev is null");
1126 // List of what to disconnect
1127 vector<CBlockIndex*> vDisconnect;
1128 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1129 vDisconnect.push_back(pindex);
1131 // List of what to connect
1132 vector<CBlockIndex*> vConnect;
1133 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1134 vConnect.push_back(pindex);
1135 reverse(vConnect.begin(), vConnect.end());
1137 // Disconnect shorter branch
1138 vector<CTransaction> vResurrect;
1139 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1142 if (!block.ReadFromDisk(pindex))
1143 return error("Reorganize() : ReadFromDisk for disconnect failed");
1144 if (!block.DisconnectBlock(txdb, pindex))
1145 return error("Reorganize() : DisconnectBlock failed");
1147 // Queue memory transactions to resurrect
1148 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1149 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1150 vResurrect.push_back(tx);
1153 // Connect longer branch
1154 vector<CTransaction> vDelete;
1155 for (int i = 0; i < vConnect.size(); i++)
1157 CBlockIndex* pindex = vConnect[i];
1159 if (!block.ReadFromDisk(pindex))
1160 return error("Reorganize() : ReadFromDisk for connect failed");
1161 if (!block.ConnectBlock(txdb, pindex))
1165 return error("Reorganize() : ConnectBlock failed");
1168 // Queue memory transactions to delete
1169 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1170 vDelete.push_back(tx);
1172 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1173 return error("Reorganize() : WriteHashBestChain failed");
1174 if (!txdb.WriteAutoCheckpoint(Checkpoints::GetNextAutoCheckpoint(pindexNew->nCheckpoint)))
1175 return error("Reorganize() : WriteAutoCheckpoint failed");
1177 // Make sure it's successfully written to disk before changing memory structure
1178 if (!txdb.TxnCommit())
1179 return error("Reorganize() : TxnCommit failed");
1181 // Disconnect shorter branch
1182 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1184 pindex->pprev->pnext = NULL;
1186 // Connect longer branch
1187 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1189 pindex->pprev->pnext = pindex;
1191 // Resurrect memory transactions that were in the disconnected branch
1192 BOOST_FOREACH(CTransaction& tx, vResurrect)
1193 tx.AcceptToMemoryPool(txdb, false);
1195 // Delete redundant memory transactions that are in the connected branch
1196 BOOST_FOREACH(CTransaction& tx, vDelete)
1197 tx.RemoveFromMemoryPool();
1203 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1205 uint256 hash = GetHash();
1208 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1210 txdb.WriteHashBestChain(hash);
1211 txdb.WriteAutoCheckpoint(Checkpoints::GetNextAutoCheckpoint(pindexNew->nCheckpoint));
1212 if (!txdb.TxnCommit())
1213 return error("SetBestChain() : TxnCommit failed");
1214 pindexGenesisBlock = pindexNew;
1216 else if (hashPrevBlock == hashBestChain)
1218 // Adding to current best branch
1219 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash) || !txdb.WriteAutoCheckpoint(Checkpoints::GetNextAutoCheckpoint(pindexNew->nCheckpoint)))
1222 InvalidChainFound(pindexNew);
1223 return error("SetBestChain() : ConnectBlock failed");
1225 if (!txdb.TxnCommit())
1226 return error("SetBestChain() : TxnCommit failed");
1228 // Add to current best branch
1229 pindexNew->pprev->pnext = pindexNew;
1231 // Delete redundant memory transactions
1232 BOOST_FOREACH(CTransaction& tx, vtx)
1233 tx.RemoveFromMemoryPool();
1238 if (!Reorganize(txdb, pindexNew))
1241 InvalidChainFound(pindexNew);
1242 return error("SetBestChain() : Reorganize failed");
1246 // Update best block in wallet (so we can detect restored wallets)
1247 if (!IsInitialBlockDownload())
1249 const CBlockLocator locator(pindexNew);
1250 ::SetBestChain(locator);
1254 hashBestChain = hash;
1255 pindexBest = pindexNew;
1256 nBestHeight = pindexBest->nHeight;
1257 nBestChainTrust = pindexNew->nChainTrust;
1258 nTimeBestReceived = GetTime();
1259 nTransactionsUpdated++;
1260 Checkpoints::AdvanceAutoCheckpoint(pindexBest->nCheckpoint);
1261 printf("SetBestChain: new best=%s height=%d trust=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, CBigNum(nBestChainTrust).ToString().c_str());
1267 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
1268 // Only those coins last spent at least a week ago count. As those
1269 // transactions not in main chain are not currently indexed so we
1270 // might not find out about their coin age. Older transactions are
1271 // guaranteed to be in main chain by auto checkpoint. This rule is
1272 // introduced to help nodes establish a consistent view of the coin
1273 // age (trust score) of competing branches.
1274 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64& nCoinAge) const
1276 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
1282 BOOST_FOREACH(const CTxIn& txin, vin)
1284 // First try finding the previous transaction in database
1285 CTransaction txPrev;
1287 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
1288 continue; // previous transaction not in main chain
1289 if (nTime < txPrev.nTime)
1290 return false; // Transaction timestamp violation
1292 // Read block header
1294 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
1295 return false; // unable to read block of previous transaction
1296 if (block.GetBlockTime() + AUTO_CHECKPOINT_TRUST_SPAN > nTime)
1297 continue; // only count coins from at least one week ago
1299 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
1300 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
1302 if (fDebug && GetBoolArg("-printcoinage"))
1303 printf("coin age nValueIn=%-12I64d nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
1306 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
1307 if (fDebug && GetBoolArg("-printcoinage"))
1308 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
1309 nCoinAge = bnCoinDay.getuint64();
1313 // ppcoin: total coin age spent in block, in the unit of coin-days.
1314 bool CBlock::GetCoinAge(uint64& nCoinAge) const
1319 BOOST_FOREACH(const CTransaction& tx, vtx)
1322 if (tx.GetCoinAge(txdb, nTxCoinAge))
1323 nCoinAge += nTxCoinAge;
1328 if (nCoinAge == 0) // block coin age minimum 1 coin-day
1330 if (fDebug && GetBoolArg("-printcoinage"))
1331 printf("block coin age total nCoinDays=%"PRI64d"\n", nCoinAge);
1336 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1338 // Check for duplicate
1339 uint256 hash = GetHash();
1340 if (mapBlockIndex.count(hash))
1341 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1343 // Construct new block index object
1344 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1346 return error("AddToBlockIndex() : new CBlockIndex failed");
1347 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1349 pindexNew->phashBlock = &((*mi).first);
1350 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1351 if (miPrev != mapBlockIndex.end())
1353 pindexNew->pprev = (*miPrev).second;
1354 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1356 // ppcoin: compute chain checkpoint
1357 pindexNew->nCheckpoint = Checkpoints::GetNextChainCheckpoint(pindexNew->pprev);
1358 assert (pindexNew->nCheckpoint >= pindexNew->pprev->nCheckpoint);
1361 // ppcoin: compute chain trust score
1363 if (!GetCoinAge(nCoinAge))
1364 return error("AddToBlockIndex() : invalid transaction in block");
1365 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + nCoinAge;
1369 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1370 if (!txdb.TxnCommit())
1374 if (pindexNew->nChainTrust > nBestChainTrust)
1375 if (!SetBestChain(txdb, pindexNew))
1380 if (pindexNew == pindexBest)
1382 // Notify UI to display prev block's coinbase if it was ours
1383 static uint256 hashPrevBestCoinBase;
1384 UpdatedTransaction(hashPrevBestCoinBase);
1385 hashPrevBestCoinBase = vtx[0].GetHash();
1395 bool CBlock::CheckBlock() const
1397 // These are checks that are independent of context
1398 // that can be verified before saving an orphan block.
1401 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK) > MAX_BLOCK_SIZE)
1402 return DoS(100, error("CheckBlock() : size limits failed"));
1404 // Check proof of work matches claimed amount
1405 if (!CheckProofOfWork(GetHash(), nBits))
1406 return DoS(50, error("CheckBlock() : proof of work failed"));
1409 if (GetBlockTime() > GetAdjustedTime() + nMaxClockDrift)
1410 return error("CheckBlock() : block timestamp too far in the future");
1412 // First transaction must be coinbase, the rest must not be
1413 if (vtx.empty() || !vtx[0].IsCoinBase())
1414 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1415 for (int i = 1; i < vtx.size(); i++)
1416 if (vtx[i].IsCoinBase())
1417 return DoS(100, error("CheckBlock() : more than one coinbase"));
1419 // ppcoin: only the second transaction can be the optional coinstake
1420 for (int i = 2; i < vtx.size(); i++)
1421 if (vtx[i].IsCoinStake())
1422 return DoS(100, error("CheckBlock() : coinstake in wrong position"));
1424 // Check coinbase timestamp
1425 if (GetBlockTime() > (int64)vtx[0].nTime + nMaxClockDrift)
1426 return DoS(50, error("CheckBlock() : coinbase timestamp is too early"));
1428 // Check transactions
1429 BOOST_FOREACH(const CTransaction& tx, vtx)
1431 if (!tx.CheckTransaction())
1432 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1433 // ppcoin: check transaction timestamp
1434 if (GetBlockTime() < (int64)tx.nTime)
1435 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
1438 // Check that it's not full of nonstandard transactions
1439 if (GetSigOpCount() > MAX_BLOCK_SIGOPS)
1440 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1443 if (hashMerkleRoot != BuildMerkleTree())
1444 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1446 // Coin base vout[0] scriptPubKey must be the same as coin stake vout[1]
1448 if (vtx.size() > 1 && vtx[1].IsCoinStake() &&
1449 vtx[0].vout[0].scriptPubKey != vtx[1].vout[1].scriptPubKey)
1450 return DoS(100, error("CheckBlock() : block key mismatch"));
1453 // Check block signature
1454 if (!CheckBlockSignature())
1455 return DoS(100, error("CheckBlock() : bad block signature"));
1460 bool CBlock::AcceptBlock()
1462 // Check for duplicate
1463 uint256 hash = GetHash();
1464 if (mapBlockIndex.count(hash))
1465 return error("AcceptBlock() : block already in mapBlockIndex");
1467 // Get prev block index
1468 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1469 if (mi == mapBlockIndex.end())
1470 return DoS(10, error("AcceptBlock() : prev block not found"));
1471 CBlockIndex* pindexPrev = (*mi).second;
1472 int nHeight = pindexPrev->nHeight+1;
1474 // Check proof of work
1475 if (nBits != GetNextWorkRequired(pindexPrev))
1476 return DoS(100, error("AcceptBlock() : incorrect proof of work"));
1478 // Check timestamp against prev
1479 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || GetBlockTime() + nMaxClockDrift < pindexPrev->GetBlockTime())
1480 return error("AcceptBlock() : block's timestamp is too early");
1482 // Check that all transactions are finalized
1483 BOOST_FOREACH(const CTransaction& tx, vtx)
1484 if (!tx.IsFinal(nHeight, GetBlockTime()))
1485 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1487 // Check that the block chain matches the known block chain up to a hardened checkpoint
1488 if (!Checkpoints::CheckHardened(nHeight, hash))
1489 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lockin at %d", nHeight));
1491 // ppcoin: check that the block satisfies automatic checkpoint
1492 if (!Checkpoints::CheckAuto(pindexPrev))
1493 return DoS(100, error("AcceptBlock() : rejected by automatic checkpoint at %d", Checkpoints::nAutoCheckpoint));
1495 // Write block to history file
1496 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK)))
1497 return error("AcceptBlock() : out of disk space");
1498 unsigned int nFile = -1;
1499 unsigned int nBlockPos = 0;
1500 if (!WriteToDisk(nFile, nBlockPos))
1501 return error("AcceptBlock() : WriteToDisk failed");
1502 if (!AddToBlockIndex(nFile, nBlockPos))
1503 return error("AcceptBlock() : AddToBlockIndex failed");
1505 // Relay inventory, but don't relay old inventory during initial block download
1506 if (hashBestChain == hash)
1507 CRITICAL_BLOCK(cs_vNodes)
1508 BOOST_FOREACH(CNode* pnode, vNodes)
1509 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : 140700))
1510 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1515 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
1517 // Check for duplicate
1518 uint256 hash = pblock->GetHash();
1519 if (mapBlockIndex.count(hash))
1520 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
1521 if (mapOrphanBlocks.count(hash))
1522 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
1524 // Preliminary checks
1525 if (!pblock->CheckBlock())
1526 return error("ProcessBlock() : CheckBlock FAILED");
1528 CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(mapBlockIndex);
1529 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain)
1531 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
1532 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
1535 pfrom->Misbehaving(100);
1536 return error("ProcessBlock() : block with timestamp before last checkpoint");
1539 bnNewBlock.SetCompact(pblock->nBits);
1541 bnRequired.SetCompact(ComputeMinWork(pcheckpoint->nBits, deltaTime));
1542 if (bnNewBlock > bnRequired)
1544 pfrom->Misbehaving(100);
1545 return error("ProcessBlock() : block with too little proof-of-work");
1550 // If don't already have its previous block, shunt it off to holding area until we get it
1551 if (!mapBlockIndex.count(pblock->hashPrevBlock))
1553 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
1554 CBlock* pblock2 = new CBlock(*pblock);
1555 mapOrphanBlocks.insert(make_pair(hash, pblock2));
1556 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
1558 // Ask this guy to fill in what we're missing
1560 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
1565 if (!pblock->AcceptBlock())
1566 return error("ProcessBlock() : AcceptBlock FAILED");
1568 // Recursively process any orphan blocks that depended on this one
1569 vector<uint256> vWorkQueue;
1570 vWorkQueue.push_back(hash);
1571 for (int i = 0; i < vWorkQueue.size(); i++)
1573 uint256 hashPrev = vWorkQueue[i];
1574 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
1575 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
1578 CBlock* pblockOrphan = (*mi).second;
1579 if (pblockOrphan->AcceptBlock())
1580 vWorkQueue.push_back(pblockOrphan->GetHash());
1581 mapOrphanBlocks.erase(pblockOrphan->GetHash());
1582 delete pblockOrphan;
1584 mapOrphanBlocksByPrev.erase(hashPrev);
1587 printf("ProcessBlock: ACCEPTED\n");
1598 bool CheckDiskSpace(uint64 nAdditionalBytes)
1600 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
1602 // Check for 15MB because database could create another 10MB log file at any time
1603 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
1606 string strMessage = _("Warning: Disk space is low ");
1607 strMiscWarning = strMessage;
1608 printf("*** %s\n", strMessage.c_str());
1609 ThreadSafeMessageBox(strMessage, "Bitcoin", wxOK | wxICON_EXCLAMATION);
1610 CreateThread(Shutdown, NULL);
1616 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
1620 FILE* file = fopen(strprintf("%s/blk%04d.dat", GetDataDir().c_str(), nFile).c_str(), pszMode);
1623 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
1625 if (fseek(file, nBlockPos, SEEK_SET) != 0)
1634 static unsigned int nCurrentBlockFile = 1;
1636 FILE* AppendBlockFile(unsigned int& nFileRet)
1641 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
1644 if (fseek(file, 0, SEEK_END) != 0)
1646 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
1647 if (ftell(file) < 0x7F000000 - MAX_SIZE)
1649 nFileRet = nCurrentBlockFile;
1653 nCurrentBlockFile++;
1657 bool LoadBlockIndex(bool fAllowNew)
1661 hashGenesisBlock = uint256("0x00000007199508e34a9ff81e6ec0c477a4cccff2a4767a8eee39c11db367b008");
1662 bnProofOfWorkLimit = CBigNum(~uint256(0) >> 28);
1663 pchMessageStart[0] = 0xfa;
1664 pchMessageStart[1] = 0xbf;
1665 pchMessageStart[2] = 0xb5;
1666 pchMessageStart[3] = 0xda;
1673 if (!txdb.LoadBlockIndex())
1678 // Init with genesis block
1680 if (mapBlockIndex.empty())
1686 // CBlock(hash=000000000019d6, ver=1, hashPrevBlock=00000000000000, hashMerkleRoot=4a5e1e, nTime=1231006505, nBits=1d00ffff, nNonce=2083236893, vtx=1)
1687 // CTransaction(hash=4a5e1e, ver=1, vin.size=1, vout.size=1, nLockTime=0)
1688 // CTxIn(COutPoint(000000, -1), coinbase 04ffff001d0104455468652054696d65732030332f4a616e2f32303039204368616e63656c6c6f72206f6e206272696e6b206f66207365636f6e64206261696c6f757420666f722062616e6b73)
1689 // CTxOut(nValue=50.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
1690 // vMerkleTree: 4a5e1e
1693 const char* pszTimestamp = "MarketWatch 07/Nov/2011 Gold tops $1,790 to end at over six-week high";
1695 txNew.nTime = 1325878371;
1696 txNew.vin.resize(1);
1697 txNew.vout.resize(1);
1698 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(4) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
1699 txNew.vout[0].nValue = GetProofOfWorkReward(bnProofOfWorkLimit.GetCompact());
1700 txNew.vout[0].scriptPubKey = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
1702 block.vtx.push_back(txNew);
1703 block.hashPrevBlock = 0;
1704 block.hashMerkleRoot = block.BuildMerkleTree();
1706 block.nTime = 1325882536;
1707 block.nBits = bnProofOfWorkLimit.GetCompact();
1708 block.nNonce = 2081920190;
1712 block.nTime = 1296688602;
1713 block.nBits = 0x1d07fff8;
1714 block.nNonce = 384568319;
1718 printf("%s\n", block.GetHash().ToString().c_str());
1719 printf("%s\n", hashGenesisBlock.ToString().c_str());
1720 printf("%s\n", block.hashMerkleRoot.ToString().c_str());
1721 assert(block.hashMerkleRoot == uint256("0xc7311b56de266580cca65be108ae53d7100b5c3b17da8b1106044103abd7a521"));
1723 assert(block.GetHash() == hashGenesisBlock);
1724 assert(block.CheckBlock());
1726 // Start new block file
1728 unsigned int nBlockPos;
1729 if (!block.WriteToDisk(nFile, nBlockPos))
1730 return error("LoadBlockIndex() : writing genesis block to disk failed");
1731 if (!block.AddToBlockIndex(nFile, nBlockPos))
1732 return error("LoadBlockIndex() : genesis block not accepted");
1740 void PrintBlockTree()
1742 // precompute tree structure
1743 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
1744 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
1746 CBlockIndex* pindex = (*mi).second;
1747 mapNext[pindex->pprev].push_back(pindex);
1749 //while (rand() % 3 == 0)
1750 // mapNext[pindex->pprev].push_back(pindex);
1753 vector<pair<int, CBlockIndex*> > vStack;
1754 vStack.push_back(make_pair(0, pindexGenesisBlock));
1757 while (!vStack.empty())
1759 int nCol = vStack.back().first;
1760 CBlockIndex* pindex = vStack.back().second;
1763 // print split or gap
1764 if (nCol > nPrevCol)
1766 for (int i = 0; i < nCol-1; i++)
1770 else if (nCol < nPrevCol)
1772 for (int i = 0; i < nCol; i++)
1779 for (int i = 0; i < nCol; i++)
1784 block.ReadFromDisk(pindex);
1785 printf("%d (%u,%u) %s %s tx %d",
1789 block.GetHash().ToString().substr(0,20).c_str(),
1790 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
1793 PrintWallets(block);
1795 // put the main timechain first
1796 vector<CBlockIndex*>& vNext = mapNext[pindex];
1797 for (int i = 0; i < vNext.size(); i++)
1799 if (vNext[i]->pnext)
1801 swap(vNext[0], vNext[i]);
1807 for (int i = 0; i < vNext.size(); i++)
1808 vStack.push_back(make_pair(nCol+i, vNext[i]));
1821 //////////////////////////////////////////////////////////////////////////////
1826 map<uint256, CAlert> mapAlerts;
1827 CCriticalSection cs_mapAlerts;
1829 string GetWarnings(string strFor)
1832 string strStatusBar;
1834 if (GetBoolArg("-testsafemode"))
1837 // Misc warnings like out of disk space and clock is wrong
1838 if (strMiscWarning != "")
1841 strStatusBar = strMiscWarning;
1844 // Longer invalid proof-of-work chain
1845 if (pindexBest && nBestInvalidTrust > nBestChainTrust + pindexBest->GetBlockTrust() * 6)
1848 strStatusBar = strRPC = "WARNING: Displayed transactions may not be correct! You may need to upgrade, or other nodes may need to upgrade.";
1852 CRITICAL_BLOCK(cs_mapAlerts)
1854 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1856 const CAlert& alert = item.second;
1857 if (alert.AppliesToMe() && alert.nPriority > nPriority)
1859 nPriority = alert.nPriority;
1860 strStatusBar = alert.strStatusBar;
1865 if (strFor == "statusbar")
1866 return strStatusBar;
1867 else if (strFor == "rpc")
1869 assert(!"GetWarnings() : invalid parameter");
1873 bool CAlert::ProcessAlert()
1875 if (!CheckSignature())
1880 CRITICAL_BLOCK(cs_mapAlerts)
1882 // Cancel previous alerts
1883 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
1885 const CAlert& alert = (*mi).second;
1888 printf("cancelling alert %d\n", alert.nID);
1889 mapAlerts.erase(mi++);
1891 else if (!alert.IsInEffect())
1893 printf("expiring alert %d\n", alert.nID);
1894 mapAlerts.erase(mi++);
1900 // Check if this alert has been cancelled
1901 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
1903 const CAlert& alert = item.second;
1904 if (alert.Cancels(*this))
1906 printf("alert already cancelled by %d\n", alert.nID);
1912 mapAlerts.insert(make_pair(GetHash(), *this));
1915 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
1927 //////////////////////////////////////////////////////////////////////////////
1933 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
1937 case MSG_TX: return mapTransactions.count(inv.hash) || mapOrphanTransactions.count(inv.hash) || txdb.ContainsTx(inv.hash);
1938 case MSG_BLOCK: return mapBlockIndex.count(inv.hash) || mapOrphanBlocks.count(inv.hash);
1940 // Don't know what it is, just say we already got one
1947 // The message start string is designed to be unlikely to occur in normal data.
1948 // The characters are rarely used upper ascii, not valid as UTF-8, and produce
1949 // a large 4-byte int at any alignment.
1950 unsigned char pchMessageStart[4] = { 0xf9, 0xbe, 0xb4, 0xd9 };
1953 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
1955 static map<unsigned int, vector<unsigned char> > mapReuseKey;
1956 RandAddSeedPerfmon();
1958 printf("%s ", DateTimeStrFormat("%x %H:%M:%S", GetTime()).c_str());
1959 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
1961 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
1963 printf("dropmessagestest DROPPING RECV MESSAGE\n");
1971 if (strCommand == "version")
1973 // Each connection can only send one version message
1974 if (pfrom->nVersion != 0)
1976 pfrom->Misbehaving(1);
1984 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
1985 if (pfrom->nVersion == 10300)
1986 pfrom->nVersion = 300;
1987 if (pfrom->nVersion >= 106 && !vRecv.empty())
1988 vRecv >> addrFrom >> nNonce;
1989 if (pfrom->nVersion >= 106 && !vRecv.empty())
1990 vRecv >> pfrom->strSubVer;
1991 if (pfrom->nVersion >= 209 && !vRecv.empty())
1992 vRecv >> pfrom->nStartingHeight;
1994 if (pfrom->nVersion == 0)
1997 // Disconnect if we connected to ourself
1998 if (nNonce == nLocalHostNonce && nNonce > 1)
2000 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2001 pfrom->fDisconnect = true;
2005 // ppcoin: record my external IP reported by peer
2006 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
2007 addrSeenByPeer = addrMe;
2009 // Be shy and don't send version until we hear
2010 if (pfrom->fInbound)
2011 pfrom->PushVersion();
2013 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2015 AddTimeData(pfrom->addr.ip, nTime);
2018 if (pfrom->nVersion >= 209)
2019 pfrom->PushMessage("verack");
2020 pfrom->vSend.SetVersion(min(pfrom->nVersion, VERSION));
2021 if (pfrom->nVersion < 209)
2022 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2024 if (!pfrom->fInbound)
2026 // Advertise our address
2027 if (addrLocalHost.IsRoutable() && !fUseProxy)
2029 CAddress addr(addrLocalHost);
2030 addr.nTime = GetAdjustedTime();
2031 pfrom->PushAddress(addr);
2034 // Get recent addresses
2035 if (pfrom->nVersion >= 31402 || mapAddresses.size() < 1000)
2037 pfrom->PushMessage("getaddr");
2038 pfrom->fGetAddr = true;
2042 // Ask the first connected node for block updates
2043 static int nAskedForBlocks;
2044 if (!pfrom->fClient &&
2045 (pfrom->nVersion < 32000 || pfrom->nVersion >= 32400) &&
2046 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2049 pfrom->PushGetBlocks(pindexBest, uint256(0));
2053 CRITICAL_BLOCK(cs_mapAlerts)
2054 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2055 item.second.RelayTo(pfrom);
2057 pfrom->fSuccessfullyConnected = true;
2059 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2061 cPeerBlockCounts.input(pfrom->nStartingHeight);
2065 else if (pfrom->nVersion == 0)
2067 // Must have a version message before anything else
2068 pfrom->Misbehaving(1);
2073 else if (strCommand == "verack")
2075 pfrom->vRecv.SetVersion(min(pfrom->nVersion, VERSION));
2079 else if (strCommand == "addr")
2081 vector<CAddress> vAddr;
2084 // Don't want addr from older versions unless seeding
2085 if (pfrom->nVersion < 209)
2087 if (pfrom->nVersion < 31402 && mapAddresses.size() > 1000)
2089 if (vAddr.size() > 1000)
2091 pfrom->Misbehaving(20);
2092 return error("message addr size() = %d", vAddr.size());
2095 // Store the new addresses
2098 int64 nNow = GetAdjustedTime();
2099 int64 nSince = nNow - 10 * 60;
2100 BOOST_FOREACH(CAddress& addr, vAddr)
2104 // ignore IPv6 for now, since it isn't implemented anyway
2107 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2108 addr.nTime = nNow - 5 * 24 * 60 * 60;
2109 AddAddress(addr, 2 * 60 * 60, &addrDB);
2110 pfrom->AddAddressKnown(addr);
2111 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2113 // Relay to a limited number of other nodes
2114 CRITICAL_BLOCK(cs_vNodes)
2116 // Use deterministic randomness to send to the same nodes for 24 hours
2117 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2118 static uint256 hashSalt;
2120 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2121 uint256 hashRand = hashSalt ^ (((int64)addr.ip)<<32) ^ ((GetTime()+addr.ip)/(24*60*60));
2122 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2123 multimap<uint256, CNode*> mapMix;
2124 BOOST_FOREACH(CNode* pnode, vNodes)
2126 if (pnode->nVersion < 31402)
2128 unsigned int nPointer;
2129 memcpy(&nPointer, &pnode, sizeof(nPointer));
2130 uint256 hashKey = hashRand ^ nPointer;
2131 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2132 mapMix.insert(make_pair(hashKey, pnode));
2134 int nRelayNodes = 2;
2135 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2136 ((*mi).second)->PushAddress(addr);
2140 addrDB.TxnCommit(); // Save addresses (it's ok if this fails)
2141 if (vAddr.size() < 1000)
2142 pfrom->fGetAddr = false;
2146 else if (strCommand == "inv")
2150 if (vInv.size() > 50000)
2152 pfrom->Misbehaving(20);
2153 return error("message inv size() = %d", vInv.size());
2157 BOOST_FOREACH(const CInv& inv, vInv)
2161 pfrom->AddInventoryKnown(inv);
2163 bool fAlreadyHave = AlreadyHave(txdb, inv);
2165 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2169 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash))
2170 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2172 // Track requests for our stuff
2173 Inventory(inv.hash);
2178 else if (strCommand == "getdata")
2182 if (vInv.size() > 50000)
2184 pfrom->Misbehaving(20);
2185 return error("message getdata size() = %d", vInv.size());
2188 BOOST_FOREACH(const CInv& inv, vInv)
2192 printf("received getdata for: %s\n", inv.ToString().c_str());
2194 if (inv.type == MSG_BLOCK)
2196 // Send block from disk
2197 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2198 if (mi != mapBlockIndex.end())
2201 block.ReadFromDisk((*mi).second);
2202 pfrom->PushMessage("block", block);
2204 // Trigger them to send a getblocks request for the next batch of inventory
2205 if (inv.hash == pfrom->hashContinue)
2207 // Bypass PushInventory, this must send even if redundant,
2208 // and we want it right after the last block so they don't
2209 // wait for other stuff first.
2211 vInv.push_back(CInv(MSG_BLOCK, hashBestChain));
2212 pfrom->PushMessage("inv", vInv);
2213 pfrom->hashContinue = 0;
2217 else if (inv.IsKnownType())
2219 // Send stream from relay memory
2220 CRITICAL_BLOCK(cs_mapRelay)
2222 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2223 if (mi != mapRelay.end())
2224 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2228 // Track requests for our stuff
2229 Inventory(inv.hash);
2234 else if (strCommand == "getblocks")
2236 CBlockLocator locator;
2238 vRecv >> locator >> hashStop;
2240 // Find the last block the caller has in the main chain
2241 CBlockIndex* pindex = locator.GetBlockIndex();
2243 // Send the rest of the chain
2245 pindex = pindex->pnext;
2246 int nLimit = 500 + locator.GetDistanceBack();
2247 unsigned int nBytes = 0;
2248 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2249 for (; pindex; pindex = pindex->pnext)
2251 if (pindex->GetBlockHash() == hashStop)
2253 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2256 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2258 block.ReadFromDisk(pindex, true);
2259 nBytes += block.GetSerializeSize(SER_NETWORK);
2260 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2262 // When this block is requested, we'll send an inv that'll make them
2263 // getblocks the next batch of inventory.
2264 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2265 pfrom->hashContinue = pindex->GetBlockHash();
2272 else if (strCommand == "getheaders")
2274 CBlockLocator locator;
2276 vRecv >> locator >> hashStop;
2278 CBlockIndex* pindex = NULL;
2279 if (locator.IsNull())
2281 // If locator is null, return the hashStop block
2282 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
2283 if (mi == mapBlockIndex.end())
2285 pindex = (*mi).second;
2289 // Find the last block the caller has in the main chain
2290 pindex = locator.GetBlockIndex();
2292 pindex = pindex->pnext;
2295 vector<CBlock> vHeaders;
2296 int nLimit = 2000 + locator.GetDistanceBack();
2297 printf("getheaders %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2298 for (; pindex; pindex = pindex->pnext)
2300 vHeaders.push_back(pindex->GetBlockHeader());
2301 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
2304 pfrom->PushMessage("headers", vHeaders);
2308 else if (strCommand == "tx")
2310 vector<uint256> vWorkQueue;
2311 CDataStream vMsg(vRecv);
2315 CInv inv(MSG_TX, tx.GetHash());
2316 pfrom->AddInventoryKnown(inv);
2318 bool fMissingInputs = false;
2319 if (tx.AcceptToMemoryPool(true, &fMissingInputs))
2321 SyncWithWallets(tx, NULL, true);
2322 RelayMessage(inv, vMsg);
2323 mapAlreadyAskedFor.erase(inv);
2324 vWorkQueue.push_back(inv.hash);
2326 // Recursively process any orphan transactions that depended on this one
2327 for (int i = 0; i < vWorkQueue.size(); i++)
2329 uint256 hashPrev = vWorkQueue[i];
2330 for (multimap<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev.lower_bound(hashPrev);
2331 mi != mapOrphanTransactionsByPrev.upper_bound(hashPrev);
2334 const CDataStream& vMsg = *((*mi).second);
2336 CDataStream(vMsg) >> tx;
2337 CInv inv(MSG_TX, tx.GetHash());
2339 if (tx.AcceptToMemoryPool(true))
2341 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2342 SyncWithWallets(tx, NULL, true);
2343 RelayMessage(inv, vMsg);
2344 mapAlreadyAskedFor.erase(inv);
2345 vWorkQueue.push_back(inv.hash);
2350 BOOST_FOREACH(uint256 hash, vWorkQueue)
2351 EraseOrphanTx(hash);
2353 else if (fMissingInputs)
2355 printf("storing orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
2358 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
2362 else if (strCommand == "block")
2367 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
2370 CInv inv(MSG_BLOCK, block.GetHash());
2371 pfrom->AddInventoryKnown(inv);
2373 if (ProcessBlock(pfrom, &block))
2374 mapAlreadyAskedFor.erase(inv);
2375 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
2379 else if (strCommand == "getaddr")
2381 // Nodes rebroadcast an addr every 24 hours
2382 pfrom->vAddrToSend.clear();
2383 int64 nSince = GetAdjustedTime() - 3 * 60 * 60; // in the last 3 hours
2384 CRITICAL_BLOCK(cs_mapAddresses)
2386 unsigned int nCount = 0;
2387 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2389 const CAddress& addr = item.second;
2390 if (addr.nTime > nSince)
2393 BOOST_FOREACH(const PAIRTYPE(vector<unsigned char>, CAddress)& item, mapAddresses)
2395 const CAddress& addr = item.second;
2396 if (addr.nTime > nSince && GetRand(nCount) < 2500)
2397 pfrom->PushAddress(addr);
2403 else if (strCommand == "checkorder")
2408 if (!GetBoolArg("-allowreceivebyip"))
2410 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
2417 /// we have a chance to check the order here
2419 // Keep giving the same key to the same ip until they use it
2420 if (!mapReuseKey.count(pfrom->addr.ip))
2421 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr.ip], true);
2423 // Send back approval of order and pubkey to use
2424 CScript scriptPubKey;
2425 scriptPubKey << mapReuseKey[pfrom->addr.ip] << OP_CHECKSIG;
2426 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
2430 else if (strCommand == "reply")
2435 CRequestTracker tracker;
2436 CRITICAL_BLOCK(pfrom->cs_mapRequests)
2438 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
2439 if (mi != pfrom->mapRequests.end())
2441 tracker = (*mi).second;
2442 pfrom->mapRequests.erase(mi);
2445 if (!tracker.IsNull())
2446 tracker.fn(tracker.param1, vRecv);
2450 else if (strCommand == "ping")
2455 else if (strCommand == "alert")
2460 if (alert.ProcessAlert())
2463 pfrom->setKnown.insert(alert.GetHash());
2464 CRITICAL_BLOCK(cs_vNodes)
2465 BOOST_FOREACH(CNode* pnode, vNodes)
2466 alert.RelayTo(pnode);
2473 // Ignore unknown commands for extensibility
2477 // Update the last seen time for this node's address
2478 if (pfrom->fNetworkNode)
2479 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
2480 AddressCurrentlyConnected(pfrom->addr);
2486 bool ProcessMessages(CNode* pfrom)
2488 CDataStream& vRecv = pfrom->vRecv;
2492 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
2496 // (4) message start
2505 // Scan for message start
2506 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
2507 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
2508 if (vRecv.end() - pstart < nHeaderSize)
2510 if (vRecv.size() > nHeaderSize)
2512 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
2513 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
2517 if (pstart - vRecv.begin() > 0)
2518 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
2519 vRecv.erase(vRecv.begin(), pstart);
2522 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
2527 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
2530 string strCommand = hdr.GetCommand();
2533 unsigned int nMessageSize = hdr.nMessageSize;
2534 if (nMessageSize > MAX_SIZE)
2536 printf("ProcessMessage(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
2539 if (nMessageSize > vRecv.size())
2541 // Rewind and wait for rest of message
2542 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
2547 if (vRecv.GetVersion() >= 209)
2549 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
2550 unsigned int nChecksum = 0;
2551 memcpy(&nChecksum, &hash, sizeof(nChecksum));
2552 if (nChecksum != hdr.nChecksum)
2554 printf("ProcessMessage(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
2555 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
2560 // Copy message to its own buffer
2561 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
2562 vRecv.ignore(nMessageSize);
2568 CRITICAL_BLOCK(cs_main)
2569 fRet = ProcessMessage(pfrom, strCommand, vMsg);
2573 catch (std::ios_base::failure& e)
2575 if (strstr(e.what(), "end of data"))
2577 // Allow exceptions from underlength message on vRecv
2578 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());
2580 else if (strstr(e.what(), "size too large"))
2582 // Allow exceptions from overlong size
2583 printf("ProcessMessage(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
2587 PrintExceptionContinue(&e, "ProcessMessage()");
2590 catch (std::exception& e) {
2591 PrintExceptionContinue(&e, "ProcessMessage()");
2593 PrintExceptionContinue(NULL, "ProcessMessage()");
2597 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
2605 bool SendMessages(CNode* pto, bool fSendTrickle)
2607 CRITICAL_BLOCK(cs_main)
2609 // Don't send anything until we get their version message
2610 if (pto->nVersion == 0)
2614 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty())
2615 pto->PushMessage("ping");
2617 // Resend wallet transactions that haven't gotten in a block yet
2618 ResendWalletTransactions();
2620 // Address refresh broadcast
2621 static int64 nLastRebroadcast;
2622 if (GetTime() - nLastRebroadcast > 24 * 60 * 60)
2624 nLastRebroadcast = GetTime();
2625 CRITICAL_BLOCK(cs_vNodes)
2627 BOOST_FOREACH(CNode* pnode, vNodes)
2629 // Periodically clear setAddrKnown to allow refresh broadcasts
2630 pnode->setAddrKnown.clear();
2632 // Rebroadcast our address
2633 if (addrLocalHost.IsRoutable() && !fUseProxy)
2635 CAddress addr(addrLocalHost);
2636 addr.nTime = GetAdjustedTime();
2637 pnode->PushAddress(addr);
2643 // Clear out old addresses periodically so it's not too much work at once
2644 static int64 nLastClear;
2645 if (nLastClear == 0)
2646 nLastClear = GetTime();
2647 if (GetTime() - nLastClear > 10 * 60 && vNodes.size() >= 3)
2649 nLastClear = GetTime();
2650 CRITICAL_BLOCK(cs_mapAddresses)
2653 int64 nSince = GetAdjustedTime() - 14 * 24 * 60 * 60;
2654 for (map<vector<unsigned char>, CAddress>::iterator mi = mapAddresses.begin();
2655 mi != mapAddresses.end();)
2657 const CAddress& addr = (*mi).second;
2658 if (addr.nTime < nSince)
2660 if (mapAddresses.size() < 1000 || GetTime() > nLastClear + 20)
2662 addrdb.EraseAddress(addr);
2663 mapAddresses.erase(mi++);
2677 vector<CAddress> vAddr;
2678 vAddr.reserve(pto->vAddrToSend.size());
2679 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
2681 // returns true if wasn't already contained in the set
2682 if (pto->setAddrKnown.insert(addr).second)
2684 vAddr.push_back(addr);
2685 // receiver rejects addr messages larger than 1000
2686 if (vAddr.size() >= 1000)
2688 pto->PushMessage("addr", vAddr);
2693 pto->vAddrToSend.clear();
2695 pto->PushMessage("addr", vAddr);
2700 // Message: inventory
2703 vector<CInv> vInvWait;
2704 CRITICAL_BLOCK(pto->cs_inventory)
2706 vInv.reserve(pto->vInventoryToSend.size());
2707 vInvWait.reserve(pto->vInventoryToSend.size());
2708 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
2710 if (pto->setInventoryKnown.count(inv))
2713 // trickle out tx inv to protect privacy
2714 if (inv.type == MSG_TX && !fSendTrickle)
2716 // 1/4 of tx invs blast to all immediately
2717 static uint256 hashSalt;
2719 RAND_bytes((unsigned char*)&hashSalt, sizeof(hashSalt));
2720 uint256 hashRand = inv.hash ^ hashSalt;
2721 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2722 bool fTrickleWait = ((hashRand & 3) != 0);
2724 // always trickle our own transactions
2728 if (GetTransaction(inv.hash, wtx))
2730 fTrickleWait = true;
2735 vInvWait.push_back(inv);
2740 // returns true if wasn't already contained in the set
2741 if (pto->setInventoryKnown.insert(inv).second)
2743 vInv.push_back(inv);
2744 if (vInv.size() >= 1000)
2746 pto->PushMessage("inv", vInv);
2751 pto->vInventoryToSend = vInvWait;
2754 pto->PushMessage("inv", vInv);
2760 vector<CInv> vGetData;
2761 int64 nNow = GetTime() * 1000000;
2763 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
2765 const CInv& inv = (*pto->mapAskFor.begin()).second;
2766 if (!AlreadyHave(txdb, inv))
2768 printf("sending getdata: %s\n", inv.ToString().c_str());
2769 vGetData.push_back(inv);
2770 if (vGetData.size() >= 1000)
2772 pto->PushMessage("getdata", vGetData);
2776 mapAlreadyAskedFor[inv] = nNow;
2777 pto->mapAskFor.erase(pto->mapAskFor.begin());
2779 if (!vGetData.empty())
2780 pto->PushMessage("getdata", vGetData);
2799 //////////////////////////////////////////////////////////////////////////////
2804 int static FormatHashBlocks(void* pbuffer, unsigned int len)
2806 unsigned char* pdata = (unsigned char*)pbuffer;
2807 unsigned int blocks = 1 + ((len + 8) / 64);
2808 unsigned char* pend = pdata + 64 * blocks;
2809 memset(pdata + len, 0, 64 * blocks - len);
2811 unsigned int bits = len * 8;
2812 pend[-1] = (bits >> 0) & 0xff;
2813 pend[-2] = (bits >> 8) & 0xff;
2814 pend[-3] = (bits >> 16) & 0xff;
2815 pend[-4] = (bits >> 24) & 0xff;
2819 static const unsigned int pSHA256InitState[8] =
2820 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
2822 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
2825 unsigned char data[64];
2829 for (int i = 0; i < 16; i++)
2830 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
2832 for (int i = 0; i < 8; i++)
2833 ctx.h[i] = ((uint32_t*)pinit)[i];
2835 SHA256_Update(&ctx, data, sizeof(data));
2836 for (int i = 0; i < 8; i++)
2837 ((uint32_t*)pstate)[i] = ctx.h[i];
2841 // ScanHash scans nonces looking for a hash with at least some zero bits.
2842 // It operates on big endian data. Caller does the byte reversing.
2843 // All input buffers are 16-byte aligned. nNonce is usually preserved
2844 // between calls, but periodically or if nNonce is 0xffff0000 or above,
2845 // the block is rebuilt and nNonce starts over at zero.
2847 unsigned int static ScanHash_CryptoPP(char* pmidstate, char* pdata, char* phash1, char* phash, unsigned int& nHashesDone)
2849 unsigned int& nNonce = *(unsigned int*)(pdata + 12);
2853 // Hash pdata using pmidstate as the starting state into
2854 // preformatted buffer phash1, then hash phash1 into phash
2856 SHA256Transform(phash1, pdata, pmidstate);
2857 SHA256Transform(phash, phash1, pSHA256InitState);
2859 // Return the nonce if the hash has at least some zero bits,
2860 // caller will check if it has enough to reach the target
2861 if (((unsigned short*)phash)[14] == 0)
2864 // If nothing found after trying for a while, return -1
2865 if ((nNonce & 0xffff) == 0)
2867 nHashesDone = 0xffff+1;
2873 // Some explaining would be appreciated
2878 set<uint256> setDependsOn;
2881 COrphan(CTransaction* ptxIn)
2889 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
2890 BOOST_FOREACH(uint256 hash, setDependsOn)
2891 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
2896 CBlock* CreateNewBlock(CWallet* pwallet)
2898 CBlockIndex* pindexPrev = pindexBest;
2899 CReserveKey reservekey(pwallet);
2902 auto_ptr<CBlock> pblock(new CBlock());
2906 // Create coinbase tx
2908 txNew.vin.resize(1);
2909 txNew.vin[0].prevout.SetNull();
2910 txNew.vout.resize(1);
2911 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
2913 // Add our coinbase tx as first transaction
2914 pblock->vtx.push_back(txNew);
2916 // ppcoin: if coinstake available add coinstake tx
2917 CTransaction txCoinStake;
2918 if (pwallet->CreateCoinStake(txNew.vout[0].scriptPubKey, txCoinStake))
2919 pblock->vtx.push_back(txCoinStake);
2921 // Collect memory pool transactions into the block
2923 CRITICAL_BLOCK(cs_main)
2924 CRITICAL_BLOCK(cs_mapTransactions)
2928 // Priority order to process transactions
2929 list<COrphan> vOrphan; // list memory doesn't move
2930 map<uint256, vector<COrphan*> > mapDependers;
2931 multimap<double, CTransaction*> mapPriority;
2932 for (map<uint256, CTransaction>::iterator mi = mapTransactions.begin(); mi != mapTransactions.end(); ++mi)
2934 CTransaction& tx = (*mi).second;
2935 if (tx.IsCoinBase() || tx.IsCoinStake() || !tx.IsFinal())
2938 COrphan* porphan = NULL;
2939 double dPriority = 0;
2940 BOOST_FOREACH(const CTxIn& txin, tx.vin)
2942 // Read prev transaction
2943 CTransaction txPrev;
2945 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2947 // Has to wait for dependencies
2950 // Use list for automatic deletion
2951 vOrphan.push_back(COrphan(&tx));
2952 porphan = &vOrphan.back();
2954 mapDependers[txin.prevout.hash].push_back(porphan);
2955 porphan->setDependsOn.insert(txin.prevout.hash);
2958 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2960 // Read block header
2961 int nConf = txindex.GetDepthInMainChain();
2963 dPriority += (double)nValueIn * nConf;
2965 if (fDebug && GetBoolArg("-printpriority"))
2966 printf("priority nValueIn=%-12I64d nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
2969 // Priority is sum(valuein * age) / txsize
2970 dPriority /= ::GetSerializeSize(tx, SER_NETWORK);
2973 porphan->dPriority = dPriority;
2975 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
2977 if (fDebug && GetBoolArg("-printpriority"))
2979 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
2986 // Collect transactions into block
2987 map<uint256, CTxIndex> mapTestPool;
2988 uint64 nBlockSize = 1000;
2989 int nBlockSigOps = 100;
2990 while (!mapPriority.empty())
2992 // Take highest priority transaction off priority queue
2993 double dPriority = -(*mapPriority.begin()).first;
2994 CTransaction& tx = *(*mapPriority.begin()).second;
2995 mapPriority.erase(mapPriority.begin());
2998 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK);
2999 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3001 int nTxSigOps = tx.GetSigOpCount();
3002 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3006 if (tx.nTime > GetAdjustedTime())
3009 // ppcoin: simplify transaction fee - allow free = false
3010 int64 nMinFee = tx.GetMinFee(nBlockSize, false, true);
3012 // Connecting shouldn't fail due to dependency on other memory pool transactions
3013 // because we're already processing them in order of dependency
3014 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3015 if (!tx.ConnectInputs(txdb, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, nFees, false, true, nMinFee))
3017 swap(mapTestPool, mapTestPoolTmp);
3020 pblock->vtx.push_back(tx);
3021 nBlockSize += nTxSize;
3022 nBlockSigOps += nTxSigOps;
3024 // Add transactions that depend on this one to the priority queue
3025 uint256 hash = tx.GetHash();
3026 if (mapDependers.count(hash))
3028 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3030 if (!porphan->setDependsOn.empty())
3032 porphan->setDependsOn.erase(hash);
3033 if (porphan->setDependsOn.empty())
3034 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3040 pblock->nBits = GetNextWorkRequired(pindexPrev);
3041 pblock->vtx[0].vout[0].nValue = GetProofOfWorkReward(pblock->nBits);
3044 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3045 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3046 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3047 pblock->nTime = max(pblock->GetBlockTime(), pblock->GetMaxTransactionTime());
3048 pblock->nTime = max(pblock->GetBlockTime(), pindexPrev->GetBlockTime() - nMaxClockDrift);
3051 return pblock.release();
3055 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3057 // Update nExtraNonce
3058 static uint256 hashPrevBlock;
3059 if (hashPrevBlock != pblock->hashPrevBlock)
3062 hashPrevBlock = pblock->hashPrevBlock;
3065 pblock->vtx[0].vin[0].scriptSig = CScript() << pblock->nTime << CBigNum(nExtraNonce);
3066 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3070 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3073 // Prebuild hash buffers
3080 uint256 hashPrevBlock;
3081 uint256 hashMerkleRoot;
3084 unsigned int nNonce;
3087 unsigned char pchPadding0[64];
3089 unsigned char pchPadding1[64];
3092 memset(&tmp, 0, sizeof(tmp));
3094 tmp.block.nVersion = pblock->nVersion;
3095 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3096 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3097 tmp.block.nTime = pblock->nTime;
3098 tmp.block.nBits = pblock->nBits;
3099 tmp.block.nNonce = pblock->nNonce;
3101 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3102 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3104 // Byte swap all the input buffer
3105 for (int i = 0; i < sizeof(tmp)/4; i++)
3106 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3108 // Precalc the first half of the first hash, which stays constant
3109 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3111 memcpy(pdata, &tmp.block, 128);
3112 memcpy(phash1, &tmp.hash1, 64);
3116 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3118 uint256 hash = pblock->GetHash();
3119 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3121 if (hash > hashTarget)
3125 printf("BitcoinMiner:\n");
3126 printf("proof-of-work found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3128 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3129 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3132 CRITICAL_BLOCK(cs_main)
3134 if (pblock->hashPrevBlock != hashBestChain)
3135 return error("BitcoinMiner : generated block is stale");
3137 // Remove key from key pool
3138 reservekey.KeepKey();
3140 // Track how many getdata requests this block gets
3141 CRITICAL_BLOCK(wallet.cs_wallet)
3142 wallet.mapRequestCount[pblock->GetHash()] = 0;
3144 // Process this block the same as if we had received it from another node
3145 if (!ProcessBlock(NULL, pblock))
3146 return error("BitcoinMiner : ProcessBlock, block not accepted");
3152 void static ThreadBitcoinMiner(void* parg);
3154 void static BitcoinMiner(CWallet *pwallet)
3156 printf("BitcoinMiner started\n");
3157 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3159 // Each thread has its own key and counter
3160 CReserveKey reservekey(pwallet);
3161 unsigned int nExtraNonce = 0;
3163 while (fGenerateBitcoins)
3165 if (AffinityBugWorkaround(ThreadBitcoinMiner))
3169 while (vNodes.empty() || IsInitialBlockDownload())
3174 if (!fGenerateBitcoins)
3182 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3183 CBlockIndex* pindexPrev = pindexBest;
3185 auto_ptr<CBlock> pblock(CreateNewBlock(pwallet));
3188 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3190 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3194 // Prebuild hash buffers
3196 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
3197 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
3198 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
3200 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
3202 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
3203 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
3209 int64 nStart = GetTime();
3210 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3212 uint256& hash = *alignup<16>(hashbuf);
3215 unsigned int nHashesDone = 0;
3216 unsigned int nNonceFound;
3219 nNonceFound = ScanHash_CryptoPP(pmidstate, pdata + 64, phash1,
3220 (char*)&hash, nHashesDone);
3222 // Check if something found
3223 if (nNonceFound != -1)
3225 for (int i = 0; i < sizeof(hash)/4; i++)
3226 ((unsigned int*)&hash)[i] = ByteReverse(((unsigned int*)&hash)[i]);
3228 if (hash <= hashTarget)
3231 pblock->nNonce = ByteReverse(nNonceFound);
3232 assert(hash == pblock->GetHash());
3233 // should be able to sign block - assert here for now
3234 assert(pblock->SignBlock(*pwalletMain));
3236 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3237 CheckWork(pblock.get(), *pwalletMain, reservekey);
3238 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3244 static int64 nHashCounter;
3245 if (nHPSTimerStart == 0)
3247 nHPSTimerStart = GetTimeMillis();
3251 nHashCounter += nHashesDone;
3252 if (GetTimeMillis() - nHPSTimerStart > 4000)
3254 static CCriticalSection cs;
3257 if (GetTimeMillis() - nHPSTimerStart > 4000)
3259 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
3260 nHPSTimerStart = GetTimeMillis();
3262 string strStatus = strprintf(" %.0f khash/s", dHashesPerSec/1000.0);
3263 UIThreadCall(boost::bind(CalledSetStatusBar, strStatus, 0));
3264 static int64 nLogTime;
3265 if (GetTime() - nLogTime > 30 * 60)
3267 nLogTime = GetTime();
3268 printf("%s ", DateTimeStrFormat("%x %H:%M", GetTime()).c_str());
3269 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[3], dHashesPerSec/1000.0);
3275 // Check for stop or if block needs to be rebuilt
3278 if (!fGenerateBitcoins)
3280 if (fLimitProcessors && vnThreadsRunning[3] > nLimitProcessors)
3284 if (nBlockNonce >= 0xffff0000)
3286 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
3288 if (pindexPrev != pindexBest)
3291 // Update nTime every few seconds
3292 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, GetAdjustedTime());
3293 pblock->nTime = max(pblock->GetBlockTime(), pblock->GetMaxTransactionTime());
3294 pblock->nTime = max(pblock->GetBlockTime(), pindexPrev->GetBlockTime() - nMaxClockDrift);
3295 nBlockTime = ByteReverse(pblock->nTime);
3296 if (pblock->GetBlockTime() >= (int64)pblock->vtx[0].nTime + nMaxClockDrift)
3297 break; // need to update coinbase timestamp
3302 void static ThreadBitcoinMiner(void* parg)
3304 CWallet* pwallet = (CWallet*)parg;
3307 vnThreadsRunning[3]++;
3308 BitcoinMiner(pwallet);
3309 vnThreadsRunning[3]--;
3311 catch (std::exception& e) {
3312 vnThreadsRunning[3]--;
3313 PrintException(&e, "ThreadBitcoinMiner()");
3315 vnThreadsRunning[3]--;
3316 PrintException(NULL, "ThreadBitcoinMiner()");
3318 UIThreadCall(boost::bind(CalledSetStatusBar, "", 0));
3320 if (vnThreadsRunning[3] == 0)
3322 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[3]);
3326 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
3328 if (fGenerateBitcoins != fGenerate)
3330 fGenerateBitcoins = fGenerate;
3331 WriteSetting("fGenerateBitcoins", fGenerateBitcoins);
3334 if (fGenerateBitcoins)
3336 int nProcessors = boost::thread::hardware_concurrency();
3337 printf("%d processors\n", nProcessors);
3338 if (nProcessors < 1)
3340 if (fLimitProcessors && nProcessors > nLimitProcessors)
3341 nProcessors = nLimitProcessors;
3342 int nAddThreads = nProcessors - vnThreadsRunning[3];
3343 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
3344 for (int i = 0; i < nAddThreads; i++)
3346 if (!CreateThread(ThreadBitcoinMiner, pwallet))
3347 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");