1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Copyright (c) 2011-2013 The PPCoin developers
4 // Distributed under the MIT/X11 software license, see the accompanying
5 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
7 #include "checkpoints.h"
11 #include "ui_interface.h"
13 #include "scrypt_mine.h"
14 #include <boost/algorithm/string/replace.hpp>
15 #include <boost/filesystem.hpp>
16 #include <boost/filesystem/fstream.hpp>
19 using namespace boost;
25 CCriticalSection cs_setpwalletRegistered;
26 set<CWallet*> setpwalletRegistered;
28 CCriticalSection cs_main;
31 unsigned int nTransactionsUpdated = 0;
33 map<uint256, CBlockIndex*> mapBlockIndex;
34 set<pair<COutPoint, unsigned int> > setStakeSeen;
35 uint256 hashGenesisBlock = hashGenesisBlockOfficial;
36 static CBigNum bnProofOfWorkLimit(~uint256(0) >> 20);
37 static CBigNum bnProofOfStakeLimit(~uint256(0) >> 30);
38 static CBigNum bnInitialHashTarget(~uint256(0) >> 20);
39 unsigned int nStakeMinAge = STAKE_MIN_AGE;
40 int nCoinbaseMaturity = COINBASE_MATURITY_PPC;
41 CBlockIndex* pindexGenesisBlock = NULL;
43 CBigNum bnBestChainTrust = 0;
44 CBigNum bnBestInvalidTrust = 0;
45 uint256 hashBestChain = 0;
46 CBlockIndex* pindexBest = NULL;
47 int64 nTimeBestReceived = 0;
49 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
51 map<uint256, CBlock*> mapOrphanBlocks;
52 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
53 set<pair<COutPoint, unsigned int> > setStakeSeenOrphan;
54 map<uint256, uint256> mapProofOfStake;
56 map<uint256, CDataStream*> mapOrphanTransactions;
57 map<uint256, map<uint256, CDataStream*> > mapOrphanTransactionsByPrev;
59 // Constant stuff for coinbase transactions we create:
60 CScript COINBASE_FLAGS;
62 const string strMessageMagic = "NovaCoin Signed Message:\n";
68 int64 nTransactionFee = MIN_TX_FEE;
72 //////////////////////////////////////////////////////////////////////////////
74 // dispatching functions
77 // These functions dispatch to one or all registered wallets
80 void RegisterWallet(CWallet* pwalletIn)
83 LOCK(cs_setpwalletRegistered);
84 setpwalletRegistered.insert(pwalletIn);
88 void UnregisterWallet(CWallet* pwalletIn)
91 LOCK(cs_setpwalletRegistered);
92 setpwalletRegistered.erase(pwalletIn);
96 // check whether the passed transaction is from us
97 bool static IsFromMe(CTransaction& tx)
99 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
100 if (pwallet->IsFromMe(tx))
105 // get the wallet transaction with the given hash (if it exists)
106 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
108 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
109 if (pwallet->GetTransaction(hashTx,wtx))
114 // erases transaction with the given hash from all wallets
115 void static EraseFromWallets(uint256 hash)
117 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
118 pwallet->EraseFromWallet(hash);
121 // make sure all wallets know about the given transaction, in the given block
122 void static SyncWithWallets(const CTransaction& tx, const CBlock* pblock = NULL, bool fUpdate = false, bool fConnect = true)
126 // ppcoin: wallets need to refund inputs when disconnecting coinstake
127 if (tx.IsCoinStake())
129 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
130 if (pwallet->IsFromMe(tx))
131 pwallet->DisableTransaction(tx);
136 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
137 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
140 // notify wallets about a new best chain
141 void static SetBestChain(const CBlockLocator& loc)
143 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
144 pwallet->SetBestChain(loc);
147 // notify wallets about an updated transaction
148 void static UpdatedTransaction(const uint256& hashTx)
150 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
151 pwallet->UpdatedTransaction(hashTx);
155 void static PrintWallets(const CBlock& block)
157 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
158 pwallet->PrintWallet(block);
161 // notify wallets about an incoming inventory (for request counts)
162 void static Inventory(const uint256& hash)
164 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
165 pwallet->Inventory(hash);
168 // ask wallets to resend their transactions
169 void ResendWalletTransactions()
171 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
172 pwallet->ResendWalletTransactions();
181 //////////////////////////////////////////////////////////////////////////////
183 // mapOrphanTransactions
186 bool AddOrphanTx(const CDataStream& vMsg)
189 CDataStream(vMsg) >> tx;
190 uint256 hash = tx.GetHash();
191 if (mapOrphanTransactions.count(hash))
194 CDataStream* pvMsg = new CDataStream(vMsg);
196 // Ignore big transactions, to avoid a
197 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
198 // large transaction with a missing parent then we assume
199 // it will rebroadcast it later, after the parent transaction(s)
200 // have been mined or received.
201 // 10,000 orphans, each of which is at most 5,000 bytes big is
202 // at most 500 megabytes of orphans:
203 if (pvMsg->size() > 5000)
205 printf("ignoring large orphan tx (size: %u, hash: %s)\n", pvMsg->size(), hash.ToString().substr(0,10).c_str());
210 mapOrphanTransactions[hash] = pvMsg;
211 BOOST_FOREACH(const CTxIn& txin, tx.vin)
212 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(make_pair(hash, pvMsg));
214 printf("stored orphan tx %s (mapsz %u)\n", hash.ToString().substr(0,10).c_str(),
215 mapOrphanTransactions.size());
219 void static EraseOrphanTx(uint256 hash)
221 if (!mapOrphanTransactions.count(hash))
223 const CDataStream* pvMsg = mapOrphanTransactions[hash];
225 CDataStream(*pvMsg) >> tx;
226 BOOST_FOREACH(const CTxIn& txin, tx.vin)
228 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
229 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
230 mapOrphanTransactionsByPrev.erase(txin.prevout.hash);
233 mapOrphanTransactions.erase(hash);
236 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
238 unsigned int nEvicted = 0;
239 while (mapOrphanTransactions.size() > nMaxOrphans)
241 // Evict a random orphan:
242 uint256 randomhash = GetRandHash();
243 map<uint256, CDataStream*>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
244 if (it == mapOrphanTransactions.end())
245 it = mapOrphanTransactions.begin();
246 EraseOrphanTx(it->first);
258 //////////////////////////////////////////////////////////////////////////////
260 // CTransaction and CTxIndex
263 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
266 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
268 if (!ReadFromDisk(txindexRet.pos))
270 if (prevout.n >= vout.size())
278 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
281 return ReadFromDisk(txdb, prevout, txindex);
284 bool CTransaction::ReadFromDisk(COutPoint prevout)
288 return ReadFromDisk(txdb, prevout, txindex);
291 bool CTransaction::IsStandard() const
293 BOOST_FOREACH(const CTxIn& txin, vin)
295 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
296 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
297 // ~65-byte public keys, plus a few script ops.
298 if (txin.scriptSig.size() > 500)
300 if (!txin.scriptSig.IsPushOnly())
303 BOOST_FOREACH(const CTxOut& txout, vout)
304 if (!::IsStandard(txout.scriptPubKey))
310 // Check transaction inputs, and make sure any
311 // pay-to-script-hash transactions are evaluating IsStandard scripts
313 // Why bother? To avoid denial-of-service attacks; an attacker
314 // can submit a standard HASH... OP_EQUAL transaction,
315 // which will get accepted into blocks. The redemption
316 // script can be anything; an attacker could use a very
317 // expensive-to-check-upon-redemption script like:
318 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
320 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
323 return true; // Coinbases don't use vin normally
325 for (unsigned int i = 0; i < vin.size(); i++)
327 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
329 vector<vector<unsigned char> > vSolutions;
330 txnouttype whichType;
331 // get the scriptPubKey corresponding to this input:
332 const CScript& prevScript = prev.scriptPubKey;
333 if (!Solver(prevScript, whichType, vSolutions))
335 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
336 if (nArgsExpected < 0)
339 // Transactions with extra stuff in their scriptSigs are
340 // non-standard. Note that this EvalScript() call will
341 // be quick, because if there are any operations
342 // beside "push data" in the scriptSig the
343 // IsStandard() call returns false
344 vector<vector<unsigned char> > stack;
345 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
348 if (whichType == TX_SCRIPTHASH)
352 CScript subscript(stack.back().begin(), stack.back().end());
353 vector<vector<unsigned char> > vSolutions2;
354 txnouttype whichType2;
355 if (!Solver(subscript, whichType2, vSolutions2))
357 if (whichType2 == TX_SCRIPTHASH)
361 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
364 nArgsExpected += tmpExpected;
367 if (stack.size() != (unsigned int)nArgsExpected)
375 CTransaction::GetLegacySigOpCount() const
377 unsigned int nSigOps = 0;
378 BOOST_FOREACH(const CTxIn& txin, vin)
380 nSigOps += txin.scriptSig.GetSigOpCount(false);
382 BOOST_FOREACH(const CTxOut& txout, vout)
384 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
390 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
402 // Load the block this tx is in
404 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
406 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
411 // Update the tx's hashBlock
412 hashBlock = pblock->GetHash();
414 // Locate the transaction
415 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
416 if (pblock->vtx[nIndex] == *(CTransaction*)this)
418 if (nIndex == (int)pblock->vtx.size())
420 vMerkleBranch.clear();
422 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
426 // Fill in merkle branch
427 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
430 // Is the tx in a block that's in the main chain
431 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
432 if (mi == mapBlockIndex.end())
434 CBlockIndex* pindex = (*mi).second;
435 if (!pindex || !pindex->IsInMainChain())
438 return pindexBest->nHeight - pindex->nHeight + 1;
447 bool CTransaction::CheckTransaction() const
449 // Basic checks that don't depend on any context
451 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
453 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
455 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
456 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
458 // Check for negative or overflow output values
460 for (int i = 0; i < vout.size(); i++)
462 const CTxOut& txout = vout[i];
463 if (txout.IsEmpty() && (!IsCoinBase()) && (!IsCoinStake()))
464 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
465 // ppcoin: enforce minimum output amount
466 if ((!txout.IsEmpty()) && txout.nValue < MIN_TXOUT_AMOUNT)
467 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue below minimum"));
468 if (txout.nValue > MAX_MONEY)
469 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
470 nValueOut += txout.nValue;
471 if (!MoneyRange(nValueOut))
472 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
475 // Check for duplicate inputs
476 set<COutPoint> vInOutPoints;
477 BOOST_FOREACH(const CTxIn& txin, vin)
479 if (vInOutPoints.count(txin.prevout))
481 vInOutPoints.insert(txin.prevout);
486 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
487 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size"));
491 BOOST_FOREACH(const CTxIn& txin, vin)
492 if (txin.prevout.IsNull())
493 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
499 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
500 bool* pfMissingInputs)
503 *pfMissingInputs = false;
505 if (!tx.CheckTransaction())
506 return error("CTxMemPool::accept() : CheckTransaction failed");
508 // Coinbase is only valid in a block, not as a loose transaction
510 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
511 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
512 if (tx.IsCoinStake())
513 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
515 // To help v0.1.5 clients who would see it as a negative number
516 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
517 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
519 // Rather not work on nonstandard transactions (unless -testnet)
520 if (!fTestNet && !tx.IsStandard())
521 return error("CTxMemPool::accept() : nonstandard transaction type");
523 // Do we already have it?
524 uint256 hash = tx.GetHash();
527 if (mapTx.count(hash))
531 if (txdb.ContainsTx(hash))
534 // Check for conflicts with in-memory transactions
535 CTransaction* ptxOld = NULL;
536 for (unsigned int i = 0; i < tx.vin.size(); i++)
538 COutPoint outpoint = tx.vin[i].prevout;
539 if (mapNextTx.count(outpoint))
541 // Disable replacement feature for now
544 // Allow replacing with a newer version of the same transaction
547 ptxOld = mapNextTx[outpoint].ptx;
548 if (ptxOld->IsFinal())
550 if (!tx.IsNewerThan(*ptxOld))
552 for (unsigned int i = 0; i < tx.vin.size(); i++)
554 COutPoint outpoint = tx.vin[i].prevout;
555 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
565 map<uint256, CTxIndex> mapUnused;
566 bool fInvalid = false;
567 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
570 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
572 *pfMissingInputs = true;
573 return error("CTxMemPool::accept() : FetchInputs failed %s", hash.ToString().substr(0,10).c_str());
576 // Check for non-standard pay-to-script-hash in inputs
577 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
578 return error("CTxMemPool::accept() : nonstandard transaction input");
580 // Note: if you modify this code to accept non-standard transactions, then
581 // you should add code here to check that the transaction does a
582 // reasonable number of ECDSA signature verifications.
584 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
585 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
587 // Don't accept it if it can't get into a block
588 if (nFees < tx.GetMinFee(1000, false, GMF_RELAY))
589 return error("CTxMemPool::accept() : not enough fees");
591 // Continuously rate-limit free transactions
592 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
593 // be annoying or make other's transactions take longer to confirm.
594 if (nFees < MIN_RELAY_TX_FEE)
596 static CCriticalSection cs;
597 static double dFreeCount;
598 static int64 nLastTime;
599 int64 nNow = GetTime();
603 // Use an exponentially decaying ~10-minute window:
604 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
606 // -limitfreerelay unit is thousand-bytes-per-minute
607 // At default rate it would take over a month to fill 1GB
608 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
609 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
611 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
616 // Check against previous transactions
617 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
618 if (!tx.ConnectInputs(txdb, mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
620 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
624 // Store transaction in memory
629 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
635 ///// are we sure this is ok when loading transactions or restoring block txes
636 // If updated, erase old tx from wallet
638 EraseFromWallets(ptxOld->GetHash());
640 printf("CTxMemPool::accept() : accepted %s\n", hash.ToString().substr(0,10).c_str());
644 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
646 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
649 bool CTxMemPool::addUnchecked(CTransaction &tx)
651 printf("addUnchecked(): size %lu\n", mapTx.size());
652 // Add to memory pool without checking anything. Don't call this directly,
653 // call CTxMemPool::accept to properly check the transaction first.
656 uint256 hash = tx.GetHash();
658 for (unsigned int i = 0; i < tx.vin.size(); i++)
659 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
660 nTransactionsUpdated++;
666 bool CTxMemPool::remove(CTransaction &tx)
668 // Remove transaction from memory pool
671 uint256 hash = tx.GetHash();
672 if (mapTx.count(hash))
674 BOOST_FOREACH(const CTxIn& txin, tx.vin)
675 mapNextTx.erase(txin.prevout);
677 nTransactionsUpdated++;
683 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
685 if (hashBlock == 0 || nIndex == -1)
688 // Find the block it claims to be in
689 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
690 if (mi == mapBlockIndex.end())
692 CBlockIndex* pindex = (*mi).second;
693 if (!pindex || !pindex->IsInMainChain())
696 // Make sure the merkle branch connects to this block
697 if (!fMerkleVerified)
699 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
701 fMerkleVerified = true;
705 return pindexBest->nHeight - pindex->nHeight + 1;
709 int CMerkleTx::GetBlocksToMaturity() const
711 if (!(IsCoinBase() || IsCoinStake()))
713 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
717 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
721 if (!IsInMainChain() && !ClientConnectInputs())
723 return CTransaction::AcceptToMemoryPool(txdb, false);
727 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
731 bool CMerkleTx::AcceptToMemoryPool()
734 return AcceptToMemoryPool(txdb);
737 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
742 // Add previous supporting transactions first
743 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
745 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
747 uint256 hash = tx.GetHash();
748 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
749 tx.AcceptToMemoryPool(txdb, fCheckInputs);
752 return AcceptToMemoryPool(txdb, fCheckInputs);
757 bool CWalletTx::AcceptWalletTransaction()
760 return AcceptWalletTransaction(txdb);
763 int CTxIndex::GetDepthInMainChain() const
767 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
769 // Find the block in the index
770 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
771 if (mi == mapBlockIndex.end())
773 CBlockIndex* pindex = (*mi).second;
774 if (!pindex || !pindex->IsInMainChain())
776 return 1 + nBestHeight - pindex->nHeight;
779 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
780 bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock)
786 if (mempool.exists(hash))
788 tx = mempool.lookup(hash);
794 if (tx.ReadFromDisk(txdb, COutPoint(hash, 0), txindex))
797 if (block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
798 hashBlock = block.GetHash();
805 //////////////////////////////////////////////////////////////////////////////
807 // CBlock and CBlockIndex
810 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
812 if (!fReadTransactions)
814 *this = pindex->GetBlockHeader();
817 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
819 if (GetHash() != pindex->GetBlockHash())
820 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
824 uint256 static GetOrphanRoot(const CBlock* pblock)
826 // Work back to the first block in the orphan chain
827 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
828 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
829 return pblock->GetHash();
832 // ppcoin: find block wanted by given orphan block
833 uint256 WantedByOrphan(const CBlock* pblockOrphan)
835 // Work back to the first block in the orphan chain
836 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
837 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
838 return pblockOrphan->hashPrevBlock;
841 int64 GetProofOfWorkReward(unsigned int nBits)
843 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
845 bnTarget.SetCompact(nBits);
846 CBigNum bnTargetLimit = bnProofOfWorkLimit;
847 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
849 // ppcoin: subsidy is cut in half every 64x multiply of difficulty
850 // A reasonably continuous curve is used to avoid shock to market
851 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
853 // Human readable form:
855 // nSubsidy = 100 / (diff ^ 1/6)
856 CBigNum bnLowerBound = CENT;
857 CBigNum bnUpperBound = bnSubsidyLimit;
858 while (bnLowerBound + CENT <= bnUpperBound)
860 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
861 if (fDebug && GetBoolArg("-printcreation"))
862 printf("GetProofOfWorkReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
863 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
864 bnUpperBound = bnMidValue;
866 bnLowerBound = bnMidValue;
869 int64 nSubsidy = bnUpperBound.getuint64();
870 nSubsidy = (nSubsidy / CENT) * CENT;
871 if (fDebug && GetBoolArg("-printcreation"))
872 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
874 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK);
877 // ppcoin: miner's coin stake is rewarded based on coin age spent (coin-days)
878 int64 GetProofOfStakeReward(int64 nCoinAge)
880 static int64 nRewardCoinYear = 5 * CENT; // creation amount per coin-year
881 int64 nSubsidy = nCoinAge * 33 / (365 * 33 + 8) * nRewardCoinYear;
882 if (fDebug && GetBoolArg("-printcreation"))
883 printf("GetProofOfStakeReward(): create=%s nCoinAge=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nCoinAge);
887 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
888 static const int64 nTargetSpacingWorkMax = 12 * STAKE_TARGET_SPACING; // 2-hour
891 // minimum amount of work that could possibly be required nTime after
892 // minimum work required was nBase
894 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
897 bnResult.SetCompact(nBase);
899 while (nTime > 0 && bnResult < bnProofOfWorkLimit)
901 // Maximum 200% adjustment per day...
903 nTime -= 24 * 60 * 60;
905 if (bnResult > bnProofOfWorkLimit)
906 bnResult = bnProofOfWorkLimit;
907 return bnResult.GetCompact();
910 // ppcoin: find last block index up to pindex
911 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
913 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
914 pindex = pindex->pprev;
918 unsigned int static GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
920 CBigNum bnTargetLimit = (fProofOfStake && CBlockIndex::IsSuperMajority(3, pindexLast, 950, 1000)) ? bnProofOfStakeLimit : bnProofOfWorkLimit;
922 if (pindexLast == NULL)
923 return bnTargetLimit.GetCompact(); // genesis block
925 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
926 if (pindexPrev->pprev == NULL)
927 return bnInitialHashTarget.GetCompact(); // first block
928 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
929 if (pindexPrevPrev->pprev == NULL)
930 return bnInitialHashTarget.GetCompact(); // second block
932 int64 nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
934 // ppcoin: target change every block
935 // ppcoin: retarget with exponential moving toward target spacing
937 bnNew.SetCompact(pindexPrev->nBits);
938 int64 nTargetSpacing = fProofOfStake? STAKE_TARGET_SPACING : min(nTargetSpacingWorkMax, (int64) STAKE_TARGET_SPACING * (1 + pindexLast->nHeight - pindexPrev->nHeight));
939 int64 nInterval = nTargetTimespan / nTargetSpacing;
940 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
941 bnNew /= ((nInterval + 1) * nTargetSpacing);
943 if (bnNew > bnTargetLimit)
944 bnNew = bnTargetLimit;
946 return bnNew.GetCompact();
949 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
952 bnTarget.SetCompact(nBits);
955 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
956 return error("CheckProofOfWork() : nBits below minimum work");
958 // Check proof of work matches claimed amount
959 if (hash > bnTarget.getuint256())
960 return error("CheckProofOfWork() : hash doesn't match nBits");
965 // Return maximum amount of blocks that other nodes claim to have
966 int GetNumBlocksOfPeers()
968 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
971 bool IsInitialBlockDownload()
973 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
975 static int64 nLastUpdate;
976 static CBlockIndex* pindexLastBest;
977 if (pindexBest != pindexLastBest)
979 pindexLastBest = pindexBest;
980 nLastUpdate = GetTime();
982 return (GetTime() - nLastUpdate < 10 &&
983 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
986 void static InvalidChainFound(CBlockIndex* pindexNew)
988 if (pindexNew->bnChainTrust > bnBestInvalidTrust)
990 bnBestInvalidTrust = pindexNew->bnChainTrust;
991 CTxDB().WriteBestInvalidTrust(bnBestInvalidTrust);
994 printf("InvalidChainFound: invalid block=%s height=%d trust=%s\n", pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight, CBigNum(pindexNew->bnChainTrust).ToString().c_str());
995 printf("InvalidChainFound: current best=%s height=%d trust=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, CBigNum(bnBestChainTrust).ToString().c_str());
996 // ppcoin: should not enter safe mode for longer invalid chain
999 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1001 nTime = max(GetBlockTime(), GetAdjustedTime());
1014 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1016 // Relinquish previous transactions' spent pointers
1019 BOOST_FOREACH(const CTxIn& txin, vin)
1021 COutPoint prevout = txin.prevout;
1023 // Get prev txindex from disk
1025 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1026 return error("DisconnectInputs() : ReadTxIndex failed");
1028 if (prevout.n >= txindex.vSpent.size())
1029 return error("DisconnectInputs() : prevout.n out of range");
1031 // Mark outpoint as not spent
1032 txindex.vSpent[prevout.n].SetNull();
1035 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1036 return error("DisconnectInputs() : UpdateTxIndex failed");
1040 // Remove transaction from index
1041 // This can fail if a duplicate of this transaction was in a chain that got
1042 // reorganized away. This is only possible if this transaction was completely
1043 // spent, so erasing it would be a no-op anway.
1044 txdb.EraseTxIndex(*this);
1050 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1051 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1053 // FetchInputs can return false either because we just haven't seen some inputs
1054 // (in which case the transaction should be stored as an orphan)
1055 // or because the transaction is malformed (in which case the transaction should
1056 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1060 return true; // Coinbase transactions have no inputs to fetch.
1062 for (unsigned int i = 0; i < vin.size(); i++)
1064 COutPoint prevout = vin[i].prevout;
1065 if (inputsRet.count(prevout.hash))
1066 continue; // Got it already
1069 CTxIndex& txindex = inputsRet[prevout.hash].first;
1071 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1073 // Get txindex from current proposed changes
1074 txindex = mapTestPool.find(prevout.hash)->second;
1078 // Read txindex from txdb
1079 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1081 if (!fFound && (fBlock || fMiner))
1082 return fMiner ? false : error("FetchInputs() : %s prev tx %s index entry not found", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1085 CTransaction& txPrev = inputsRet[prevout.hash].second;
1086 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1088 // Get prev tx from single transactions in memory
1091 if (!mempool.exists(prevout.hash))
1092 return error("FetchInputs() : %s mempool Tx prev not found %s", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1093 txPrev = mempool.lookup(prevout.hash);
1096 txindex.vSpent.resize(txPrev.vout.size());
1100 // Get prev tx from disk
1101 if (!txPrev.ReadFromDisk(txindex.pos))
1102 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1106 // Make sure all prevout.n's are valid:
1107 for (unsigned int i = 0; i < vin.size(); i++)
1109 const COutPoint prevout = vin[i].prevout;
1110 assert(inputsRet.count(prevout.hash) != 0);
1111 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1112 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1113 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1115 // Revisit this if/when transaction replacement is implemented and allows
1118 return DoS(100, error("FetchInputs() : %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()));
1125 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1127 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1128 if (mi == inputs.end())
1129 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1131 const CTransaction& txPrev = (mi->second).second;
1132 if (input.prevout.n >= txPrev.vout.size())
1133 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1135 return txPrev.vout[input.prevout.n];
1138 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1144 for (unsigned int i = 0; i < vin.size(); i++)
1146 nResult += GetOutputFor(vin[i], inputs).nValue;
1152 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1157 unsigned int nSigOps = 0;
1158 for (unsigned int i = 0; i < vin.size(); i++)
1160 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1161 if (prevout.scriptPubKey.IsPayToScriptHash())
1162 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1167 bool CTransaction::ConnectInputs(CTxDB& txdb, MapPrevTx inputs,
1168 map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1169 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1171 // Take over previous transactions' spent pointers
1172 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1173 // fMiner is true when called from the internal bitcoin miner
1174 // ... both are false when called from CTransaction::AcceptToMemoryPool
1179 for (unsigned int i = 0; i < vin.size(); i++)
1181 COutPoint prevout = vin[i].prevout;
1182 assert(inputs.count(prevout.hash) > 0);
1183 CTxIndex& txindex = inputs[prevout.hash].first;
1184 CTransaction& txPrev = inputs[prevout.hash].second;
1186 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1187 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()));
1189 // If prev is coinbase/coinstake, check that it's matured
1190 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
1191 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < nCoinbaseMaturity; pindex = pindex->pprev)
1192 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1193 return error("ConnectInputs() : tried to spend coinbase/coinstake at depth %d", pindexBlock->nHeight - pindex->nHeight);
1195 // ppcoin: check transaction timestamp
1196 if (txPrev.nTime > nTime)
1197 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
1199 // Check for negative or overflow input values
1200 nValueIn += txPrev.vout[prevout.n].nValue;
1201 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1202 return DoS(100, error("ConnectInputs() : txin values out of range"));
1205 // The first loop above does all the inexpensive checks.
1206 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1207 // Helps prevent CPU exhaustion attacks.
1208 for (unsigned int i = 0; i < vin.size(); i++)
1210 COutPoint prevout = vin[i].prevout;
1211 assert(inputs.count(prevout.hash) > 0);
1212 CTxIndex& txindex = inputs[prevout.hash].first;
1213 CTransaction& txPrev = inputs[prevout.hash].second;
1215 // Check for conflicts (double-spend)
1216 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1217 // for an attacker to attempt to split the network.
1218 if (!txindex.vSpent[prevout.n].IsNull())
1219 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());
1221 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1222 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1223 // still computed and checked, and any change will be caught at the next checkpoint.
1224 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1227 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1229 // only during transition phase for P2SH: do not invoke anti-DoS code for
1230 // potentially old clients relaying bad P2SH transactions
1231 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1232 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1234 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1238 // Mark outpoints as spent
1239 txindex.vSpent[prevout.n] = posThisTx;
1242 if (fBlock || fMiner)
1244 mapTestPool[prevout.hash] = txindex;
1250 // ppcoin: coin stake tx earns reward instead of paying fee
1252 if (!GetCoinAge(txdb, nCoinAge))
1253 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1254 int64 nStakeReward = GetValueOut() - nValueIn;
1255 if (nStakeReward > GetProofOfStakeReward(nCoinAge) - GetMinFee() + MIN_TX_FEE)
1256 return DoS(100, error("ConnectInputs() : %s stake reward exceeded", GetHash().ToString().substr(0,10).c_str()));
1260 if (nValueIn < GetValueOut())
1261 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1263 // Tally transaction fees
1264 int64 nTxFee = nValueIn - GetValueOut();
1266 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1267 // ppcoin: enforce transaction fees for every block
1268 if (nTxFee < GetMinFee())
1269 return fBlock? DoS(100, error("ConnectInputs() : %s not paying required fee=%s, paid=%s", GetHash().ToString().substr(0,10).c_str(), FormatMoney(GetMinFee()).c_str(), FormatMoney(nTxFee).c_str())) : false;
1271 if (!MoneyRange(nFees))
1272 return DoS(100, error("ConnectInputs() : nFees out of range"));
1280 bool CTransaction::ClientConnectInputs()
1285 // Take over previous transactions' spent pointers
1289 for (unsigned int i = 0; i < vin.size(); i++)
1291 // Get prev tx from single transactions in memory
1292 COutPoint prevout = vin[i].prevout;
1293 if (!mempool.exists(prevout.hash))
1295 CTransaction& txPrev = mempool.lookup(prevout.hash);
1297 if (prevout.n >= txPrev.vout.size())
1301 if (!VerifySignature(txPrev, *this, i, true, 0))
1302 return error("ConnectInputs() : VerifySignature failed");
1304 ///// this is redundant with the mempool.mapNextTx stuff,
1305 ///// not sure which I want to get rid of
1306 ///// this has to go away now that posNext is gone
1307 // // Check for conflicts
1308 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1309 // return error("ConnectInputs() : prev tx already used");
1311 // // Flag outpoints as used
1312 // txPrev.vout[prevout.n].posNext = posThisTx;
1314 nValueIn += txPrev.vout[prevout.n].nValue;
1316 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1317 return error("ClientConnectInputs() : txin values out of range");
1319 if (GetValueOut() > nValueIn)
1329 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1331 // Disconnect in reverse order
1332 for (int i = vtx.size()-1; i >= 0; i--)
1333 if (!vtx[i].DisconnectInputs(txdb))
1336 // Update block index on disk without changing it in memory.
1337 // The memory index structure will be changed after the db commits.
1340 CDiskBlockIndex blockindexPrev(pindex->pprev);
1341 blockindexPrev.hashNext = 0;
1342 if (!txdb.WriteBlockIndex(blockindexPrev))
1343 return error("DisconnectBlock() : WriteBlockIndex failed");
1346 // ppcoin: clean up wallet after disconnecting coinstake
1347 BOOST_FOREACH(CTransaction& tx, vtx)
1348 SyncWithWallets(tx, this, false, false);
1353 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1355 // Check it again in case a previous version let a bad block in
1359 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1360 // unless those are already completely spent.
1361 // If such overwrites are allowed, coinbases and transactions depending upon those
1362 // can be duplicated to remove the ability to spend the first instance -- even after
1363 // being sent to another address.
1364 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1365 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1366 // already refuses previously-known transaction id's entirely.
1367 BOOST_FOREACH(CTransaction& tx, vtx)
1369 CTxIndex txindexOld;
1370 if (txdb.ReadTxIndex(tx.GetHash(), txindexOld))
1372 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1378 // BIP16 always active
1379 bool fStrictPayToScriptHash = true;
1381 //// issue here: it doesn't know the version
1382 unsigned int nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1384 map<uint256, CTxIndex> mapQueuedChanges;
1387 int64 nValueOut = 0;
1388 unsigned int nSigOps = 0;
1389 BOOST_FOREACH(CTransaction& tx, vtx)
1391 nSigOps += tx.GetLegacySigOpCount();
1392 if (nSigOps > MAX_BLOCK_SIGOPS)
1393 return DoS(100, error("ConnectBlock() : too many sigops"));
1395 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1396 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1398 MapPrevTx mapInputs;
1399 if (tx.IsCoinBase())
1400 nValueOut += tx.GetValueOut();
1404 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1407 if (fStrictPayToScriptHash)
1409 // Add in sigops done by pay-to-script-hash inputs;
1410 // this is to prevent a "rogue miner" from creating
1411 // an incredibly-expensive-to-validate block.
1412 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1413 if (nSigOps > MAX_BLOCK_SIGOPS)
1414 return DoS(100, error("ConnectBlock() : too many sigops"));
1417 int64 nTxValueIn = tx.GetValueIn(mapInputs);
1418 int64 nTxValueOut = tx.GetValueOut();
1419 nValueIn += nTxValueIn;
1420 nValueOut += nTxValueOut;
1421 if (!tx.IsCoinStake())
1422 nFees += nTxValueIn - nTxValueOut;
1424 if (!tx.ConnectInputs(txdb, mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1428 mapQueuedChanges[tx.GetHash()] = CTxIndex(posThisTx, tx.vout.size());
1431 // ppcoin: track money supply and mint amount info
1432 pindex->nMint = nValueOut - nValueIn + nFees;
1433 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1434 if (!txdb.WriteBlockIndex(CDiskBlockIndex(pindex)))
1435 return error("Connect() : WriteBlockIndex for pindex failed");
1437 // Write queued txindex changes
1438 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1440 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1441 return error("ConnectBlock() : UpdateTxIndex failed");
1444 // ppcoin: fees are not collected by miners as in bitcoin
1445 // ppcoin: fees are destroyed to compensate the entire network
1446 if (fDebug && GetBoolArg("-printcreation"))
1447 printf("ConnectBlock() : destroy=%s nFees=%"PRI64d"\n", FormatMoney(nFees).c_str(), nFees);
1449 // Update block index on disk without changing it in memory.
1450 // The memory index structure will be changed after the db commits.
1453 CDiskBlockIndex blockindexPrev(pindex->pprev);
1454 blockindexPrev.hashNext = pindex->GetBlockHash();
1455 if (!txdb.WriteBlockIndex(blockindexPrev))
1456 return error("ConnectBlock() : WriteBlockIndex for blockindexPrev failed");
1459 // Watch for transactions paying to me
1460 BOOST_FOREACH(CTransaction& tx, vtx)
1461 SyncWithWallets(tx, this, true);
1466 bool Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1468 printf("REORGANIZE\n");
1471 CBlockIndex* pfork = pindexBest;
1472 CBlockIndex* plonger = pindexNew;
1473 while (pfork != plonger)
1475 while (plonger->nHeight > pfork->nHeight)
1476 if (!(plonger = plonger->pprev))
1477 return error("Reorganize() : plonger->pprev is null");
1478 if (pfork == plonger)
1480 if (!(pfork = pfork->pprev))
1481 return error("Reorganize() : pfork->pprev is null");
1484 // List of what to disconnect
1485 vector<CBlockIndex*> vDisconnect;
1486 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1487 vDisconnect.push_back(pindex);
1489 // List of what to connect
1490 vector<CBlockIndex*> vConnect;
1491 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1492 vConnect.push_back(pindex);
1493 reverse(vConnect.begin(), vConnect.end());
1495 printf("REORGANIZE: Disconnect %i blocks; %s..%s\n", vDisconnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexBest->GetBlockHash().ToString().substr(0,20).c_str());
1496 printf("REORGANIZE: Connect %i blocks; %s..%s\n", vConnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->GetBlockHash().ToString().substr(0,20).c_str());
1498 // Disconnect shorter branch
1499 vector<CTransaction> vResurrect;
1500 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1503 if (!block.ReadFromDisk(pindex))
1504 return error("Reorganize() : ReadFromDisk for disconnect failed");
1505 if (!block.DisconnectBlock(txdb, pindex))
1506 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1508 // Queue memory transactions to resurrect
1509 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1510 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1511 vResurrect.push_back(tx);
1514 // Connect longer branch
1515 vector<CTransaction> vDelete;
1516 for (unsigned int i = 0; i < vConnect.size(); i++)
1518 CBlockIndex* pindex = vConnect[i];
1520 if (!block.ReadFromDisk(pindex))
1521 return error("Reorganize() : ReadFromDisk for connect failed");
1522 if (!block.ConnectBlock(txdb, pindex))
1526 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1529 // Queue memory transactions to delete
1530 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1531 vDelete.push_back(tx);
1533 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1534 return error("Reorganize() : WriteHashBestChain failed");
1536 // Make sure it's successfully written to disk before changing memory structure
1537 if (!txdb.TxnCommit())
1538 return error("Reorganize() : TxnCommit failed");
1540 // Disconnect shorter branch
1541 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1543 pindex->pprev->pnext = NULL;
1545 // Connect longer branch
1546 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1548 pindex->pprev->pnext = pindex;
1550 // Resurrect memory transactions that were in the disconnected branch
1551 BOOST_FOREACH(CTransaction& tx, vResurrect)
1552 tx.AcceptToMemoryPool(txdb, false);
1554 // Delete redundant memory transactions that are in the connected branch
1555 BOOST_FOREACH(CTransaction& tx, vDelete)
1558 printf("REORGANIZE: done\n");
1565 runCommand(std::string strCommand)
1567 int nErr = ::system(strCommand.c_str());
1569 printf("runCommand error: system(%s) returned %d\n", strCommand.c_str(), nErr);
1572 // Called from inside SetBestChain: attaches a block to the new best chain being built
1573 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1575 uint256 hash = GetHash();
1577 // Adding to current best branch
1578 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1581 InvalidChainFound(pindexNew);
1584 if (!txdb.TxnCommit())
1585 return error("SetBestChain() : TxnCommit failed");
1587 // Add to current best branch
1588 pindexNew->pprev->pnext = pindexNew;
1590 // Delete redundant memory transactions
1591 BOOST_FOREACH(CTransaction& tx, vtx)
1597 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1599 uint256 hash = GetHash();
1601 if (!txdb.TxnBegin())
1602 return error("SetBestChain() : TxnBegin failed");
1604 if (pindexGenesisBlock == NULL && hash == hashGenesisBlock)
1606 txdb.WriteHashBestChain(hash);
1607 if (!txdb.TxnCommit())
1608 return error("SetBestChain() : TxnCommit failed");
1609 pindexGenesisBlock = pindexNew;
1611 else if (hashPrevBlock == hashBestChain)
1613 if (!SetBestChainInner(txdb, pindexNew))
1614 return error("SetBestChain() : SetBestChainInner failed");
1618 // the first block in the new chain that will cause it to become the new best chain
1619 CBlockIndex *pindexIntermediate = pindexNew;
1621 // list of blocks that need to be connected afterwards
1622 std::vector<CBlockIndex*> vpindexSecondary;
1624 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1625 // Try to limit how much needs to be done inside
1626 while (pindexIntermediate->pprev && pindexIntermediate->pprev->bnChainTrust > pindexBest->bnChainTrust)
1628 vpindexSecondary.push_back(pindexIntermediate);
1629 pindexIntermediate = pindexIntermediate->pprev;
1632 if (!vpindexSecondary.empty())
1633 printf("Postponing %i reconnects\n", vpindexSecondary.size());
1635 // Switch to new best branch
1636 if (!Reorganize(txdb, pindexIntermediate))
1639 InvalidChainFound(pindexNew);
1640 return error("SetBestChain() : Reorganize failed");
1643 // Connect futher blocks
1644 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1647 if (!block.ReadFromDisk(pindex))
1649 printf("SetBestChain() : ReadFromDisk failed\n");
1652 if (!txdb.TxnBegin()) {
1653 printf("SetBestChain() : TxnBegin 2 failed\n");
1656 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1657 if (!block.SetBestChainInner(txdb, pindex))
1662 // Update best block in wallet (so we can detect restored wallets)
1663 bool fIsInitialDownload = IsInitialBlockDownload();
1664 if (!fIsInitialDownload)
1666 const CBlockLocator locator(pindexNew);
1667 ::SetBestChain(locator);
1671 hashBestChain = hash;
1672 pindexBest = pindexNew;
1673 nBestHeight = pindexBest->nHeight;
1674 bnBestChainTrust = pindexNew->bnChainTrust;
1675 nTimeBestReceived = GetTime();
1676 nTransactionsUpdated++;
1677 printf("SetBestChain: new best=%s height=%d trust=%s moneysupply=%s\n", hashBestChain.ToString().substr(0,20).c_str(), nBestHeight, bnBestChainTrust.ToString().c_str(), FormatMoney(pindexBest->nMoneySupply).c_str());
1679 std::string strCmd = GetArg("-blocknotify", "");
1681 if (!fIsInitialDownload && !strCmd.empty())
1683 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1684 boost::thread t(runCommand, strCmd); // thread runs free
1691 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
1692 // Only those coins meeting minimum age requirement counts. As those
1693 // transactions not in main chain are not currently indexed so we
1694 // might not find out about their coin age. Older transactions are
1695 // guaranteed to be in main chain by sync-checkpoint. This rule is
1696 // introduced to help nodes establish a consistent view of the coin
1697 // age (trust score) of competing branches.
1698 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64& nCoinAge) const
1700 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
1706 BOOST_FOREACH(const CTxIn& txin, vin)
1708 // First try finding the previous transaction in database
1709 CTransaction txPrev;
1711 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
1712 continue; // previous transaction not in main chain
1713 if (nTime < txPrev.nTime)
1714 return false; // Transaction timestamp violation
1716 // Read block header
1718 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
1719 return false; // unable to read block of previous transaction
1720 if (block.GetBlockTime() + nStakeMinAge > nTime)
1721 continue; // only count coins meeting min age requirement
1723 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
1724 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
1726 if (fDebug && GetBoolArg("-printcoinage"))
1727 printf("coin age nValueIn=%-12I64d nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
1730 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
1731 if (fDebug && GetBoolArg("-printcoinage"))
1732 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
1733 nCoinAge = bnCoinDay.getuint64();
1737 // ppcoin: total coin age spent in block, in the unit of coin-days.
1738 bool CBlock::GetCoinAge(uint64& nCoinAge) const
1743 BOOST_FOREACH(const CTransaction& tx, vtx)
1746 if (tx.GetCoinAge(txdb, nTxCoinAge))
1747 nCoinAge += nTxCoinAge;
1752 if (nCoinAge == 0) // block coin age minimum 1 coin-day
1754 if (fDebug && GetBoolArg("-printcoinage"))
1755 printf("block coin age total nCoinDays=%"PRI64d"\n", nCoinAge);
1760 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
1762 // Check for duplicate
1763 uint256 hash = GetHash();
1764 if (mapBlockIndex.count(hash))
1765 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
1767 // Construct new block index object
1768 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
1770 return error("AddToBlockIndex() : new CBlockIndex failed");
1772 pindexNew->phashBlock = &hash;
1773 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
1774 if (miPrev != mapBlockIndex.end())
1776 pindexNew->pprev = (*miPrev).second;
1777 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
1780 // ppcoin: compute chain trust score
1781 pindexNew->bnChainTrust = (pindexNew->pprev ? pindexNew->pprev->bnChainTrust : 0) + pindexNew->GetBlockTrust();
1783 // ppcoin: compute stake entropy bit for stake modifier
1784 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nHeight)))
1785 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
1787 // ppcoin: record proof-of-stake hash value
1788 if (pindexNew->IsProofOfStake())
1790 if (!mapProofOfStake.count(hash))
1791 return error("AddToBlockIndex() : hashProofOfStake not found in map");
1792 pindexNew->hashProofOfStake = mapProofOfStake[hash];
1795 // ppcoin: compute stake modifier
1796 uint64 nStakeModifier = 0;
1797 bool fGeneratedStakeModifier = false;
1798 if (!ComputeNextStakeModifier(pindexNew->pprev, nStakeModifier, fGeneratedStakeModifier))
1799 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
1800 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
1801 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
1802 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
1803 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016"PRI64x, pindexNew->nHeight, nStakeModifier);
1805 // Add to mapBlockIndex
1806 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
1807 if (pindexNew->IsProofOfStake())
1808 setStakeSeen.insert(make_pair(pindexNew->prevoutStake, pindexNew->nStakeTime));
1809 pindexNew->phashBlock = &((*mi).first);
1811 // Write to disk block index
1813 if (!txdb.TxnBegin())
1815 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
1816 if (!txdb.TxnCommit())
1820 if (pindexNew->bnChainTrust > bnBestChainTrust)
1821 if (!SetBestChain(txdb, pindexNew))
1826 if (pindexNew == pindexBest)
1828 // Notify UI to display prev block's coinbase if it was ours
1829 static uint256 hashPrevBestCoinBase;
1830 UpdatedTransaction(hashPrevBestCoinBase);
1831 hashPrevBestCoinBase = vtx[0].GetHash();
1841 bool CBlock::CheckBlock() const
1843 // These are checks that are independent of context
1844 // that can be verified before saving an orphan block.
1847 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
1848 return DoS(100, error("CheckBlock() : size limits failed"));
1850 // Check proof of work matches claimed amount
1851 if (IsProofOfWork() && !CheckProofOfWork(GetHash(), nBits))
1852 return DoS(50, error("CheckBlock() : proof of work failed"));
1855 if (GetBlockTime() > GetAdjustedTime() + nMaxClockDrift)
1856 return error("CheckBlock() : block timestamp too far in the future");
1858 // First transaction must be coinbase, the rest must not be
1859 if (vtx.empty() || !vtx[0].IsCoinBase())
1860 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
1861 for (unsigned int i = 1; i < vtx.size(); i++)
1862 if (vtx[i].IsCoinBase())
1863 return DoS(100, error("CheckBlock() : more than one coinbase"));
1865 // ppcoin: only the second transaction can be the optional coinstake
1866 for (int i = 2; i < vtx.size(); i++)
1867 if (vtx[i].IsCoinStake())
1868 return DoS(100, error("CheckBlock() : coinstake in wrong position"));
1870 // ppcoin: coinbase output should be empty if proof-of-stake block
1871 if (IsProofOfStake() && (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty()))
1872 return error("CheckBlock() : coinbase output not empty for proof-of-stake block");
1874 // Check coinbase timestamp
1875 if (GetBlockTime() > (int64)vtx[0].nTime + nMaxClockDrift)
1876 return DoS(50, error("CheckBlock() : coinbase timestamp is too early"));
1878 // Check coinstake timestamp
1879 if (IsProofOfStake() && !CheckCoinStakeTimestamp(GetBlockTime(), (int64)vtx[1].nTime))
1880 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%u nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
1882 // Check coinbase reward
1883 if (vtx[0].GetValueOut() > (IsProofOfWork()? (GetProofOfWorkReward(nBits) - vtx[0].GetMinFee() + MIN_TX_FEE) : 0))
1884 return DoS(50, error("CheckBlock() : coinbase reward exceeded %s > %s",
1885 FormatMoney(vtx[0].GetValueOut()).c_str(),
1886 FormatMoney(IsProofOfWork()? GetProofOfWorkReward(nBits) : 0).c_str()));
1888 // Check transactions
1889 BOOST_FOREACH(const CTransaction& tx, vtx)
1891 if (!tx.CheckTransaction())
1892 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
1893 // ppcoin: check transaction timestamp
1894 if (GetBlockTime() < (int64)tx.nTime)
1895 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
1898 // Check for duplicate txids. This is caught by ConnectInputs(),
1899 // but catching it earlier avoids a potential DoS attack:
1900 set<uint256> uniqueTx;
1901 BOOST_FOREACH(const CTransaction& tx, vtx)
1903 uniqueTx.insert(tx.GetHash());
1905 if (uniqueTx.size() != vtx.size())
1906 return DoS(100, error("CheckBlock() : duplicate transaction"));
1908 unsigned int nSigOps = 0;
1909 BOOST_FOREACH(const CTransaction& tx, vtx)
1911 nSigOps += tx.GetLegacySigOpCount();
1913 if (nSigOps > MAX_BLOCK_SIGOPS)
1914 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
1917 if (hashMerkleRoot != BuildMerkleTree())
1918 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
1920 // ppcoin: check block signature
1921 if (!CheckBlockSignature())
1922 return DoS(100, error("CheckBlock() : bad block signature"));
1927 bool CBlock::AcceptBlock()
1929 // Check for duplicate
1930 uint256 hash = GetHash();
1931 if (mapBlockIndex.count(hash))
1932 return error("AcceptBlock() : block already in mapBlockIndex");
1934 // Get prev block index
1935 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
1936 if (mi == mapBlockIndex.end())
1937 return DoS(10, error("AcceptBlock() : prev block not found"));
1938 CBlockIndex* pindexPrev = (*mi).second;
1939 int nHeight = pindexPrev->nHeight+1;
1941 // Check proof-of-work or proof-of-stake
1942 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
1943 return DoS(100, error("AcceptBlock() : incorrect proof-of-work/proof-of-stake"));
1945 // Check timestamp against prev
1946 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || GetBlockTime() + nMaxClockDrift < pindexPrev->GetBlockTime())
1947 return error("AcceptBlock() : block's timestamp is too early");
1949 // Check that all transactions are finalized
1950 BOOST_FOREACH(const CTransaction& tx, vtx)
1951 if (!tx.IsFinal(nHeight, GetBlockTime()))
1952 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
1954 // Check that the block chain matches the known block chain up to a hardened checkpoint
1955 if (!Checkpoints::CheckHardened(nHeight, hash))
1956 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lockin at %d", nHeight));
1958 // ppcoin: check that the block satisfies synchronized checkpoint
1959 if (!Checkpoints::CheckSync(hash, pindexPrev))
1960 return error("AcceptBlock() : rejected by synchronized checkpoint");
1962 // Reject block.nVersion < 3 blocks when 95% (75% on testnet) of the network has upgraded:
1965 if ((!fTestNet && CBlockIndex::IsSuperMajority(3, pindexPrev, 950, 1000)) || (fTestNet && CBlockIndex::IsSuperMajority(3, pindexPrev, 75, 100)))
1967 return error("CheckBlock() : rejected nVersion < 3 block");
1973 CScript expect = CScript() << nHeight;
1975 if (!std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
1976 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
1979 // Write block to history file
1980 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
1981 return error("AcceptBlock() : out of disk space");
1982 unsigned int nFile = -1;
1983 unsigned int nBlockPos = 0;
1984 if (!WriteToDisk(nFile, nBlockPos))
1985 return error("AcceptBlock() : WriteToDisk failed");
1986 if (!AddToBlockIndex(nFile, nBlockPos))
1987 return error("AcceptBlock() : AddToBlockIndex failed");
1989 // Relay inventory, but don't relay old inventory during initial block download
1990 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
1991 if (hashBestChain == hash)
1994 BOOST_FOREACH(CNode* pnode, vNodes)
1995 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
1996 pnode->PushInventory(CInv(MSG_BLOCK, hash));
1999 // ppcoin: check pending sync-checkpoint
2000 Checkpoints::AcceptPendingSyncCheckpoint();
2005 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2007 // Check for duplicate
2008 uint256 hash = pblock->GetHash();
2009 if (mapBlockIndex.count(hash))
2010 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2011 if (mapOrphanBlocks.count(hash))
2012 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2014 // ppcoin: check proof-of-stake
2015 // Limited duplicity on stake: prevents block flood attack
2016 // Duplicate stake allowed only when there is orphan child block
2017 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2018 return error("ProcessBlock() : duplicate proof-of-stake (%s, %d) for block %s", pblock->GetProofOfStake().first.ToString().c_str(), pblock->GetProofOfStake().second, hash.ToString().c_str());
2020 // Preliminary checks
2021 if (!pblock->CheckBlock())
2022 return error("ProcessBlock() : CheckBlock FAILED");
2024 // ppcoin: verify hash target and signature of coinstake tx
2025 if (pblock->IsProofOfStake())
2027 uint256 hashProofOfStake = 0;
2028 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake))
2030 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2031 return false; // do not error here as we expect this during initial block download
2033 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2034 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2037 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2038 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2040 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2041 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2043 bnNewBlock.SetCompact(pblock->nBits);
2045 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, pblock->IsProofOfStake())->nBits, deltaTime));
2047 if (bnNewBlock > bnRequired)
2050 pfrom->Misbehaving(100);
2051 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2055 // ppcoin: ask for pending sync-checkpoint if any
2056 if (!IsInitialBlockDownload())
2057 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2059 // If don't already have its previous block, shunt it off to holding area until we get it
2060 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2062 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2063 CBlock* pblock2 = new CBlock(*pblock);
2064 // ppcoin: check proof-of-stake
2065 if (pblock2->IsProofOfStake())
2067 // Limited duplicity on stake: prevents block flood attack
2068 // Duplicate stake allowed only when there is orphan child block
2069 if (setStakeSeenOrphan.count(pblock2->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2070 return error("ProcessBlock() : duplicate proof-of-stake (%s, %d) for orphan block %s", pblock2->GetProofOfStake().first.ToString().c_str(), pblock2->GetProofOfStake().second, hash.ToString().c_str());
2072 setStakeSeenOrphan.insert(pblock2->GetProofOfStake());
2074 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2075 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2077 // Ask this guy to fill in what we're missing
2080 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2081 // ppcoin: getblocks may not obtain the ancestor block rejected
2082 // earlier by duplicate-stake check so we ask for it again directly
2083 if (!IsInitialBlockDownload())
2084 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2090 if (!pblock->AcceptBlock())
2091 return error("ProcessBlock() : AcceptBlock FAILED");
2093 // Recursively process any orphan blocks that depended on this one
2094 vector<uint256> vWorkQueue;
2095 vWorkQueue.push_back(hash);
2096 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2098 uint256 hashPrev = vWorkQueue[i];
2099 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2100 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2103 CBlock* pblockOrphan = (*mi).second;
2104 if (pblockOrphan->AcceptBlock())
2105 vWorkQueue.push_back(pblockOrphan->GetHash());
2106 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2107 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2108 delete pblockOrphan;
2110 mapOrphanBlocksByPrev.erase(hashPrev);
2113 printf("ProcessBlock: ACCEPTED\n");
2115 // ppcoin: if responsible for sync-checkpoint send it
2116 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2117 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2122 // ppcoin: sign block
2123 bool CBlock::SignBlock(const CKeyStore& keystore)
2125 vector<valtype> vSolutions;
2126 txnouttype whichType;
2127 int nVouts = nTime < 1361664000 ? 1 : vtx[0].vout.size();
2129 if(!IsProofOfStake())
2131 for(int i = 0; i < nVouts; i++)
2133 const CTxOut& txout = vtx[0].vout[i];
2135 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2138 if (whichType == TX_PUBKEY)
2141 valtype& vchPubKey = vSolutions[0];
2144 if (!keystore.GetKey(Hash160(vchPubKey), key))
2146 if (key.GetPubKey() != vchPubKey)
2148 if(!key.Sign(GetHash(), vchBlockSig))
2157 const CTxOut& txout = vtx[1].vout[1];
2159 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2162 if (whichType == TX_PUBKEY)
2165 valtype& vchPubKey = vSolutions[0];
2168 if (!keystore.GetKey(Hash160(vchPubKey), key))
2170 if (key.GetPubKey() != vchPubKey)
2173 return key.Sign(GetHash(), vchBlockSig);
2177 printf("Sign failed\n");
2181 // ppcoin: check block signature
2182 bool CBlock::CheckBlockSignature() const
2184 if (GetHash() == hashGenesisBlock)
2185 return vchBlockSig.empty();
2187 vector<valtype> vSolutions;
2188 txnouttype whichType;
2189 int nVouts = nTime < 1361664000 ? 1 : vtx[0].vout.size();
2191 if(IsProofOfStake())
2193 const CTxOut& txout = vtx[1].vout[1];
2195 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2197 if (whichType == TX_PUBKEY)
2199 valtype& vchPubKey = vSolutions[0];
2201 if (!key.SetPubKey(vchPubKey))
2203 if (vchBlockSig.empty())
2205 return key.Verify(GetHash(), vchBlockSig);
2210 for(int i = 0; i < nVouts; i++)
2212 const CTxOut& txout = vtx[0].vout[i];
2214 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2217 if (whichType == TX_PUBKEY)
2220 valtype& vchPubKey = vSolutions[0];
2222 if (!key.SetPubKey(vchPubKey))
2224 if (vchBlockSig.empty())
2226 if(!key.Verify(GetHash(), vchBlockSig))
2241 bool CheckDiskSpace(uint64 nAdditionalBytes)
2243 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2245 // Check for 15MB because database could create another 10MB log file at any time
2246 if (nFreeBytesAvailable < (uint64)15000000 + nAdditionalBytes)
2249 string strMessage = _("Warning: Disk space is low");
2250 strMiscWarning = strMessage;
2251 printf("*** %s\n", strMessage.c_str());
2252 ThreadSafeMessageBox(strMessage, "NovaCoin", wxOK | wxICON_EXCLAMATION | wxMODAL);
2259 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
2263 FILE* file = fopen((GetDataDir() / strprintf("blk%04d.dat", nFile)).string().c_str(), pszMode);
2266 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
2268 if (fseek(file, nBlockPos, SEEK_SET) != 0)
2277 static unsigned int nCurrentBlockFile = 1;
2279 FILE* AppendBlockFile(unsigned int& nFileRet)
2284 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
2287 if (fseek(file, 0, SEEK_END) != 0)
2289 // FAT32 filesize max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
2290 if (ftell(file) < 0x7F000000 - MAX_SIZE)
2292 nFileRet = nCurrentBlockFile;
2296 nCurrentBlockFile++;
2300 bool LoadBlockIndex(bool fAllowNew)
2304 hashGenesisBlock = hashGenesisBlockTestNet;
2305 nStakeMinAge = 60 * 60 * 24; // test net min age is 1 day
2306 nCoinbaseMaturity = 60;
2309 printf("%s Network: genesis=0x%s nBitsLimit=0x%08x nBitsInitial=0x%08x nStakeMinAge=%d nCoinbaseMaturity=%d nModifierInterval=%d\n",
2310 fTestNet? "Test" : "NovaCoin", hashGenesisBlock.ToString().substr(0, 20).c_str(), bnProofOfWorkLimit.GetCompact(), bnInitialHashTarget.GetCompact(), nStakeMinAge, nCoinbaseMaturity, nModifierInterval);
2316 if (!txdb.LoadBlockIndex())
2321 // Init with genesis block
2323 if (mapBlockIndex.empty())
2329 const char* pszTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
2331 txNew.nTime = 1360105017;
2332 txNew.vin.resize(1);
2333 txNew.vout.resize(1);
2334 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
2335 txNew.vout[0].SetEmpty();
2337 block.vtx.push_back(txNew);
2338 block.hashPrevBlock = 0;
2339 block.hashMerkleRoot = block.BuildMerkleTree();
2341 block.nTime = 1360105017;
2342 block.nBits = bnProofOfWorkLimit.GetCompact();
2343 block.nNonce = 1575379;
2346 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
2348 assert(block.GetHash() == hashGenesisBlock);
2349 assert(block.CheckBlock());
2351 // Start new block file
2353 unsigned int nBlockPos;
2354 if (!block.WriteToDisk(nFile, nBlockPos))
2355 return error("LoadBlockIndex() : writing genesis block to disk failed");
2356 if (!block.AddToBlockIndex(nFile, nBlockPos))
2357 return error("LoadBlockIndex() : genesis block not accepted");
2359 // ppcoin: initialize synchronized checkpoint
2360 if (!Checkpoints::WriteSyncCheckpoint(hashGenesisBlock))
2361 return error("LoadBlockIndex() : failed to init sync checkpoint");
2364 // ppcoin: if checkpoint master key changed must reset sync-checkpoint
2367 string strPubKey = "";
2368 if (!txdb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
2370 // write checkpoint master key to db
2372 if (!txdb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
2373 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
2374 if (!txdb.TxnCommit())
2375 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
2376 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
2377 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
2387 void PrintBlockTree()
2389 // precompute tree structure
2390 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2391 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2393 CBlockIndex* pindex = (*mi).second;
2394 mapNext[pindex->pprev].push_back(pindex);
2396 //while (rand() % 3 == 0)
2397 // mapNext[pindex->pprev].push_back(pindex);
2400 vector<pair<int, CBlockIndex*> > vStack;
2401 vStack.push_back(make_pair(0, pindexGenesisBlock));
2404 while (!vStack.empty())
2406 int nCol = vStack.back().first;
2407 CBlockIndex* pindex = vStack.back().second;
2410 // print split or gap
2411 if (nCol > nPrevCol)
2413 for (int i = 0; i < nCol-1; i++)
2417 else if (nCol < nPrevCol)
2419 for (int i = 0; i < nCol; i++)
2426 for (int i = 0; i < nCol; i++)
2431 block.ReadFromDisk(pindex);
2432 printf("%d (%u,%u) %s %08lx %s mint %7s tx %d",
2436 block.GetHash().ToString().c_str(),
2438 DateTimeStrFormat(block.GetBlockTime()).c_str(),
2439 FormatMoney(pindex->nMint).c_str(),
2442 PrintWallets(block);
2444 // put the main timechain first
2445 vector<CBlockIndex*>& vNext = mapNext[pindex];
2446 for (unsigned int i = 0; i < vNext.size(); i++)
2448 if (vNext[i]->pnext)
2450 swap(vNext[0], vNext[i]);
2456 for (unsigned int i = 0; i < vNext.size(); i++)
2457 vStack.push_back(make_pair(nCol+i, vNext[i]));
2470 //////////////////////////////////////////////////////////////////////////////
2475 map<uint256, CAlert> mapAlerts;
2476 CCriticalSection cs_mapAlerts;
2478 static string strMintMessage = _("Info: Minting suspended due to locked wallet.");
2479 static string strMintWarning;
2481 string GetWarnings(string strFor)
2484 string strStatusBar;
2486 if (GetBoolArg("-testsafemode"))
2489 // ppcoin: wallet lock warning for minting
2490 if (strMintWarning != "")
2493 strStatusBar = strMintWarning;
2496 // Misc warnings like out of disk space and clock is wrong
2497 if (strMiscWarning != "")
2500 strStatusBar = strMiscWarning;
2503 // ppcoin: should not enter safe mode for longer invalid chain
2504 // ppcoin: if sync-checkpoint is too old do not enter safe mode
2505 if (Checkpoints::IsSyncCheckpointTooOld(60 * 60 * 24 * 10) && !fTestNet && !IsInitialBlockDownload())
2508 strStatusBar = "WARNING: Checkpoint is too old. Wait for block chain to download, or notify developers.";
2511 // ppcoin: if detected invalid checkpoint enter safe mode
2512 if (Checkpoints::hashInvalidCheckpoint != 0)
2515 strStatusBar = strRPC = "WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.";
2521 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2523 const CAlert& alert = item.second;
2524 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2526 nPriority = alert.nPriority;
2527 strStatusBar = alert.strStatusBar;
2528 if (nPriority > 1000)
2529 strRPC = strStatusBar; // ppcoin: safe mode for high alert
2534 if (strFor == "statusbar")
2535 return strStatusBar;
2536 else if (strFor == "rpc")
2538 assert(!"GetWarnings() : invalid parameter");
2542 bool CAlert::ProcessAlert()
2544 if (!CheckSignature())
2551 // Cancel previous alerts
2552 for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
2554 const CAlert& alert = (*mi).second;
2557 printf("cancelling alert %d\n", alert.nID);
2558 mapAlerts.erase(mi++);
2560 else if (!alert.IsInEffect())
2562 printf("expiring alert %d\n", alert.nID);
2563 mapAlerts.erase(mi++);
2569 // Check if this alert has been cancelled
2570 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2572 const CAlert& alert = item.second;
2573 if (alert.Cancels(*this))
2575 printf("alert already cancelled by %d\n", alert.nID);
2581 mapAlerts.insert(make_pair(GetHash(), *this));
2584 printf("accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
2596 //////////////////////////////////////////////////////////////////////////////
2602 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
2608 bool txInMap = false;
2611 txInMap = (mempool.exists(inv.hash));
2614 mapOrphanTransactions.count(inv.hash) ||
2615 txdb.ContainsTx(inv.hash);
2619 return mapBlockIndex.count(inv.hash) ||
2620 mapOrphanBlocks.count(inv.hash);
2622 // Don't know what it is, just say we already got one
2629 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
2631 static map<CService, vector<unsigned char> > mapReuseKey;
2632 RandAddSeedPerfmon();
2634 printf("%s ", DateTimeStrFormat(GetTime()).c_str());
2635 printf("received: %s (%d bytes)\n", strCommand.c_str(), vRecv.size());
2637 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
2639 printf("dropmessagestest DROPPING RECV MESSAGE\n");
2647 if (strCommand == "version")
2649 // Each connection can only send one version message
2650 if (pfrom->nVersion != 0)
2652 pfrom->Misbehaving(1);
2660 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
2661 if (pfrom->nVersion < MIN_PROTO_VERSION)
2663 // Since February 20, 2012, the protocol is initiated at version 209,
2664 // and earlier versions are no longer supported
2665 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
2666 pfrom->fDisconnect = true;
2670 if (pfrom->nVersion == 10300)
2671 pfrom->nVersion = 300;
2673 vRecv >> addrFrom >> nNonce;
2675 vRecv >> pfrom->strSubVer;
2677 vRecv >> pfrom->nStartingHeight;
2679 // Disconnect if we connected to ourself
2680 if (nNonce == nLocalHostNonce && nNonce > 1)
2682 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
2683 pfrom->fDisconnect = true;
2687 // ppcoin: record my external IP reported by peer
2688 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
2689 addrSeenByPeer = addrMe;
2691 // Be shy and don't send version until we hear
2692 if (pfrom->fInbound)
2693 pfrom->PushVersion();
2695 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
2697 AddTimeData(pfrom->addr, nTime);
2700 pfrom->PushMessage("verack");
2701 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2703 if (!pfrom->fInbound)
2705 // Advertise our address
2706 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable() &&
2707 !IsInitialBlockDownload())
2709 CAddress addr(addrLocalHost);
2710 addr.nTime = GetAdjustedTime();
2711 pfrom->PushAddress(addr);
2714 // Get recent addresses
2715 if (pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
2717 pfrom->PushMessage("getaddr");
2718 pfrom->fGetAddr = true;
2720 addrman.Good(pfrom->addr);
2722 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
2724 addrman.Add(addrFrom, addrFrom);
2725 addrman.Good(addrFrom);
2729 // Ask the first connected node for block updates
2730 static int nAskedForBlocks = 0;
2731 if (!pfrom->fClient &&
2732 (pfrom->nVersion < NOBLKS_VERSION_START ||
2733 pfrom->nVersion >= NOBLKS_VERSION_END) &&
2734 (nAskedForBlocks < 1 || vNodes.size() <= 1))
2737 pfrom->PushGetBlocks(pindexBest, uint256(0));
2743 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2744 item.second.RelayTo(pfrom);
2747 // ppcoin: relay sync-checkpoint
2749 LOCK(Checkpoints::cs_hashSyncCheckpoint);
2750 if (!Checkpoints::checkpointMessage.IsNull())
2751 Checkpoints::checkpointMessage.RelayTo(pfrom);
2754 pfrom->fSuccessfullyConnected = true;
2756 printf("version message: version %d, blocks=%d\n", pfrom->nVersion, pfrom->nStartingHeight);
2758 cPeerBlockCounts.input(pfrom->nStartingHeight);
2760 // ppcoin: ask for pending sync-checkpoint if any
2761 if (!IsInitialBlockDownload())
2762 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2766 else if (pfrom->nVersion == 0)
2768 // Must have a version message before anything else
2769 pfrom->Misbehaving(1);
2774 else if (strCommand == "verack")
2776 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
2780 else if (strCommand == "addr")
2782 vector<CAddress> vAddr;
2785 // Don't want addr from older versions unless seeding
2786 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
2788 if (vAddr.size() > 1000)
2790 pfrom->Misbehaving(20);
2791 return error("message addr size() = %d", vAddr.size());
2794 // Store the new addresses
2795 int64 nNow = GetAdjustedTime();
2796 int64 nSince = nNow - 10 * 60;
2797 BOOST_FOREACH(CAddress& addr, vAddr)
2801 // ignore IPv6 for now, since it isn't implemented anyway
2804 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
2805 addr.nTime = nNow - 5 * 24 * 60 * 60;
2806 pfrom->AddAddressKnown(addr);
2807 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
2809 // Relay to a limited number of other nodes
2812 // Use deterministic randomness to send to the same nodes for 24 hours
2813 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
2814 static uint256 hashSalt;
2816 hashSalt = GetRandHash();
2817 int64 hashAddr = addr.GetHash();
2818 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
2819 hashRand = Hash(BEGIN(hashRand), END(hashRand));
2820 multimap<uint256, CNode*> mapMix;
2821 BOOST_FOREACH(CNode* pnode, vNodes)
2823 if (pnode->nVersion < CADDR_TIME_VERSION)
2825 unsigned int nPointer;
2826 memcpy(&nPointer, &pnode, sizeof(nPointer));
2827 uint256 hashKey = hashRand ^ nPointer;
2828 hashKey = Hash(BEGIN(hashKey), END(hashKey));
2829 mapMix.insert(make_pair(hashKey, pnode));
2831 int nRelayNodes = 2;
2832 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
2833 ((*mi).second)->PushAddress(addr);
2837 addrman.Add(vAddr, pfrom->addr, 2 * 60 * 60);
2838 if (vAddr.size() < 1000)
2839 pfrom->fGetAddr = false;
2843 else if (strCommand == "inv")
2847 if (vInv.size() > 50000)
2849 pfrom->Misbehaving(20);
2850 return error("message inv size() = %d", vInv.size());
2853 // find last block in inv vector
2854 unsigned int nLastBlock = (unsigned int)(-1);
2855 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++) {
2856 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
2857 nLastBlock = vInv.size() - 1 - nInv;
2862 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
2864 const CInv &inv = vInv[nInv];
2868 pfrom->AddInventoryKnown(inv);
2870 bool fAlreadyHave = AlreadyHave(txdb, inv);
2872 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
2876 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
2877 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
2878 } else if (nInv == nLastBlock) {
2879 // In case we are on a very long side-chain, it is possible that we already have
2880 // the last block in an inv bundle sent in response to getblocks. Try to detect
2881 // this situation and push another getblocks to continue.
2882 std::vector<CInv> vGetData(1,inv);
2883 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
2885 printf("force request: %s\n", inv.ToString().c_str());
2888 // Track requests for our stuff
2889 Inventory(inv.hash);
2894 else if (strCommand == "getdata")
2898 if (vInv.size() > 50000)
2900 pfrom->Misbehaving(20);
2901 return error("message getdata size() = %d", vInv.size());
2904 BOOST_FOREACH(const CInv& inv, vInv)
2908 printf("received getdata for: %s\n", inv.ToString().c_str());
2910 if (inv.type == MSG_BLOCK)
2912 // Send block from disk
2913 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
2914 if (mi != mapBlockIndex.end())
2917 block.ReadFromDisk((*mi).second);
2918 pfrom->PushMessage("block", block);
2920 // Trigger them to send a getblocks request for the next batch of inventory
2921 if (inv.hash == pfrom->hashContinue)
2923 // Bypass PushInventory, this must send even if redundant,
2924 // and we want it right after the last block so they don't
2925 // wait for other stuff first.
2926 // ppcoin: send latest proof-of-work block to allow the
2927 // download node to accept as orphan (proof-of-stake
2928 // block might be rejected by stake connection check)
2930 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
2931 pfrom->PushMessage("inv", vInv);
2932 pfrom->hashContinue = 0;
2936 else if (inv.IsKnownType())
2938 // Send stream from relay memory
2941 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
2942 if (mi != mapRelay.end())
2943 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
2947 // Track requests for our stuff
2948 Inventory(inv.hash);
2953 else if (strCommand == "getblocks")
2955 CBlockLocator locator;
2957 vRecv >> locator >> hashStop;
2959 // Find the last block the caller has in the main chain
2960 CBlockIndex* pindex = locator.GetBlockIndex();
2962 // Send the rest of the chain
2964 pindex = pindex->pnext;
2965 int nLimit = 500 + locator.GetDistanceBack();
2966 unsigned int nBytes = 0;
2967 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
2968 for (; pindex; pindex = pindex->pnext)
2970 if (pindex->GetBlockHash() == hashStop)
2972 printf(" getblocks stopping at %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2973 // ppcoin: tell downloading node about the latest block if it's
2974 // without risk being rejected due to stake connection check
2975 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
2976 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
2979 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
2981 block.ReadFromDisk(pindex, true);
2982 nBytes += block.GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION);
2983 if (--nLimit <= 0 || nBytes >= SendBufferSize()/2)
2985 // When this block is requested, we'll send an inv that'll make them
2986 // getblocks the next batch of inventory.
2987 printf(" getblocks stopping at limit %d %s (%u bytes)\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str(), nBytes);
2988 pfrom->hashContinue = pindex->GetBlockHash();
2995 else if (strCommand == "getheaders")
2997 CBlockLocator locator;
2999 vRecv >> locator >> hashStop;
3001 CBlockIndex* pindex = NULL;
3002 if (locator.IsNull())
3004 // If locator is null, return the hashStop block
3005 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
3006 if (mi == mapBlockIndex.end())
3008 pindex = (*mi).second;
3012 // Find the last block the caller has in the main chain
3013 pindex = locator.GetBlockIndex();
3015 pindex = pindex->pnext;
3018 vector<CBlock> vHeaders;
3020 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3021 for (; pindex; pindex = pindex->pnext)
3023 vHeaders.push_back(pindex->GetBlockHeader());
3024 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3027 pfrom->PushMessage("headers", vHeaders);
3031 else if (strCommand == "tx")
3033 vector<uint256> vWorkQueue;
3034 vector<uint256> vEraseQueue;
3035 CDataStream vMsg(vRecv);
3040 CInv inv(MSG_TX, tx.GetHash());
3041 pfrom->AddInventoryKnown(inv);
3043 bool fMissingInputs = false;
3044 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
3046 SyncWithWallets(tx, NULL, true);
3047 RelayMessage(inv, vMsg);
3048 mapAlreadyAskedFor.erase(inv);
3049 vWorkQueue.push_back(inv.hash);
3050 vEraseQueue.push_back(inv.hash);
3052 // Recursively process any orphan transactions that depended on this one
3053 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3055 uint256 hashPrev = vWorkQueue[i];
3056 for (map<uint256, CDataStream*>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3057 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3060 const CDataStream& vMsg = *((*mi).second);
3062 CDataStream(vMsg) >> tx;
3063 CInv inv(MSG_TX, tx.GetHash());
3064 bool fMissingInputs2 = false;
3066 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
3068 printf(" accepted orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
3069 SyncWithWallets(tx, NULL, true);
3070 RelayMessage(inv, vMsg);
3071 mapAlreadyAskedFor.erase(inv);
3072 vWorkQueue.push_back(inv.hash);
3073 vEraseQueue.push_back(inv.hash);
3075 else if (!fMissingInputs2)
3078 vEraseQueue.push_back(inv.hash);
3079 printf(" removed invalid orphan tx %s\n", inv.hash.ToString().substr(0,10).c_str());
3084 BOOST_FOREACH(uint256 hash, vEraseQueue)
3085 EraseOrphanTx(hash);
3087 else if (fMissingInputs)
3091 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3092 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3094 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3096 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3100 else if (strCommand == "block")
3105 printf("received block %s\n", block.GetHash().ToString().substr(0,20).c_str());
3108 CInv inv(MSG_BLOCK, block.GetHash());
3109 pfrom->AddInventoryKnown(inv);
3111 if (ProcessBlock(pfrom, &block))
3112 mapAlreadyAskedFor.erase(inv);
3113 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3117 else if (strCommand == "getaddr")
3119 pfrom->vAddrToSend.clear();
3120 vector<CAddress> vAddr = addrman.GetAddr();
3121 BOOST_FOREACH(const CAddress &addr, vAddr)
3122 pfrom->PushAddress(addr);
3126 else if (strCommand == "checkorder")
3131 if (!GetBoolArg("-allowreceivebyip"))
3133 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
3140 /// we have a chance to check the order here
3142 // Keep giving the same key to the same ip until they use it
3143 if (!mapReuseKey.count(pfrom->addr))
3144 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3146 // Send back approval of order and pubkey to use
3147 CScript scriptPubKey;
3148 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3149 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
3153 else if (strCommand == "reply")
3158 CRequestTracker tracker;
3160 LOCK(pfrom->cs_mapRequests);
3161 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
3162 if (mi != pfrom->mapRequests.end())
3164 tracker = (*mi).second;
3165 pfrom->mapRequests.erase(mi);
3168 if (!tracker.IsNull())
3169 tracker.fn(tracker.param1, vRecv);
3173 else if (strCommand == "ping")
3175 if (pfrom->nVersion > BIP0031_VERSION)
3179 // Echo the message back with the nonce. This allows for two useful features:
3181 // 1) A remote node can quickly check if the connection is operational
3182 // 2) Remote nodes can measure the latency of the network thread. If this node
3183 // is overloaded it won't respond to pings quickly and the remote node can
3184 // avoid sending us more work, like chain download requests.
3186 // The nonce stops the remote getting confused between different pings: without
3187 // it, if the remote node sends a ping once per second and this node takes 5
3188 // seconds to respond to each, the 5th ping the remote sends would appear to
3189 // return very quickly.
3190 pfrom->PushMessage("pong", nonce);
3195 else if (strCommand == "alert")
3200 if (alert.ProcessAlert())
3203 pfrom->setKnown.insert(alert.GetHash());
3206 BOOST_FOREACH(CNode* pnode, vNodes)
3207 alert.RelayTo(pnode);
3212 else if (strCommand == "checkpoint")
3214 CSyncCheckpoint checkpoint;
3215 vRecv >> checkpoint;
3217 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3220 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3222 BOOST_FOREACH(CNode* pnode, vNodes)
3223 checkpoint.RelayTo(pnode);
3229 // Ignore unknown commands for extensibility
3233 // Update the last seen time for this node's address
3234 if (pfrom->fNetworkNode)
3235 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3236 AddressCurrentlyConnected(pfrom->addr);
3242 bool ProcessMessages(CNode* pfrom)
3244 CDataStream& vRecv = pfrom->vRecv;
3248 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3252 // (4) message start
3259 unsigned char pchMessageStart[4];
3260 GetMessageStart(pchMessageStart);
3261 static int64 nTimeLastPrintMessageStart = 0;
3262 if (fDebug && GetBoolArg("-printmessagestart") && nTimeLastPrintMessageStart + 30 < GetAdjustedTime())
3264 string strMessageStart((const char *)pchMessageStart, sizeof(pchMessageStart));
3265 vector<unsigned char> vchMessageStart(strMessageStart.begin(), strMessageStart.end());
3266 printf("ProcessMessages : AdjustedTime=%"PRI64d" MessageStart=%s\n", GetAdjustedTime(), HexStr(vchMessageStart).c_str());
3267 nTimeLastPrintMessageStart = GetAdjustedTime();
3272 // Scan for message start
3273 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
3274 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3275 if (vRecv.end() - pstart < nHeaderSize)
3277 if ((int)vRecv.size() > nHeaderSize)
3279 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
3280 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
3284 if (pstart - vRecv.begin() > 0)
3285 printf("\n\nPROCESSMESSAGE SKIPPED %d BYTES\n\n", pstart - vRecv.begin());
3286 vRecv.erase(vRecv.begin(), pstart);
3289 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
3294 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
3297 string strCommand = hdr.GetCommand();
3300 unsigned int nMessageSize = hdr.nMessageSize;
3301 if (nMessageSize > MAX_SIZE)
3303 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
3306 if (nMessageSize > vRecv.size())
3308 // Rewind and wait for rest of message
3309 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
3314 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
3315 unsigned int nChecksum = 0;
3316 memcpy(&nChecksum, &hash, sizeof(nChecksum));
3317 if (nChecksum != hdr.nChecksum)
3319 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
3320 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
3324 // Copy message to its own buffer
3325 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
3326 vRecv.ignore(nMessageSize);
3334 fRet = ProcessMessage(pfrom, strCommand, vMsg);
3339 catch (std::ios_base::failure& e)
3341 if (strstr(e.what(), "end of data"))
3343 // Allow exceptions from underlength message on vRecv
3344 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught, normally caused by a message being shorter than its stated length\n", strCommand.c_str(), nMessageSize, e.what());
3346 else if (strstr(e.what(), "size too large"))
3348 // Allow exceptions from overlong size
3349 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
3353 PrintExceptionContinue(&e, "ProcessMessages()");
3356 catch (std::exception& e) {
3357 PrintExceptionContinue(&e, "ProcessMessages()");
3359 PrintExceptionContinue(NULL, "ProcessMessages()");
3363 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
3371 bool SendMessages(CNode* pto, bool fSendTrickle)
3373 TRY_LOCK(cs_main, lockMain);
3375 // Don't send anything until we get their version message
3376 if (pto->nVersion == 0)
3379 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
3381 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
3383 if (pto->nVersion > BIP0031_VERSION)
3384 pto->PushMessage("ping", nonce);
3386 pto->PushMessage("ping");
3389 // Resend wallet transactions that haven't gotten in a block yet
3390 ResendWalletTransactions();
3392 // Address refresh broadcast
3393 static int64 nLastRebroadcast;
3394 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
3398 BOOST_FOREACH(CNode* pnode, vNodes)
3400 // Periodically clear setAddrKnown to allow refresh broadcasts
3401 if (nLastRebroadcast)
3402 pnode->setAddrKnown.clear();
3404 // Rebroadcast our address
3405 if (!fNoListen && !fUseProxy && addrLocalHost.IsRoutable())
3407 CAddress addr(addrLocalHost);
3408 addr.nTime = GetAdjustedTime();
3409 pnode->PushAddress(addr);
3413 nLastRebroadcast = GetTime();
3421 vector<CAddress> vAddr;
3422 vAddr.reserve(pto->vAddrToSend.size());
3423 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
3425 // returns true if wasn't already contained in the set
3426 if (pto->setAddrKnown.insert(addr).second)
3428 vAddr.push_back(addr);
3429 // receiver rejects addr messages larger than 1000
3430 if (vAddr.size() >= 1000)
3432 pto->PushMessage("addr", vAddr);
3437 pto->vAddrToSend.clear();
3439 pto->PushMessage("addr", vAddr);
3444 // Message: inventory
3447 vector<CInv> vInvWait;
3449 LOCK(pto->cs_inventory);
3450 vInv.reserve(pto->vInventoryToSend.size());
3451 vInvWait.reserve(pto->vInventoryToSend.size());
3452 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
3454 if (pto->setInventoryKnown.count(inv))
3457 // trickle out tx inv to protect privacy
3458 if (inv.type == MSG_TX && !fSendTrickle)
3460 // 1/4 of tx invs blast to all immediately
3461 static uint256 hashSalt;
3463 hashSalt = GetRandHash();
3464 uint256 hashRand = inv.hash ^ hashSalt;
3465 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3466 bool fTrickleWait = ((hashRand & 3) != 0);
3468 // always trickle our own transactions
3472 if (GetTransaction(inv.hash, wtx))
3474 fTrickleWait = true;
3479 vInvWait.push_back(inv);
3484 // returns true if wasn't already contained in the set
3485 if (pto->setInventoryKnown.insert(inv).second)
3487 vInv.push_back(inv);
3488 if (vInv.size() >= 1000)
3490 pto->PushMessage("inv", vInv);
3495 pto->vInventoryToSend = vInvWait;
3498 pto->PushMessage("inv", vInv);
3504 vector<CInv> vGetData;
3505 int64 nNow = GetTime() * 1000000;
3507 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
3509 const CInv& inv = (*pto->mapAskFor.begin()).second;
3510 if (!AlreadyHave(txdb, inv))
3512 printf("sending getdata: %s\n", inv.ToString().c_str());
3513 vGetData.push_back(inv);
3514 if (vGetData.size() >= 1000)
3516 pto->PushMessage("getdata", vGetData);
3520 mapAlreadyAskedFor[inv] = nNow;
3521 pto->mapAskFor.erase(pto->mapAskFor.begin());
3523 if (!vGetData.empty())
3524 pto->PushMessage("getdata", vGetData);
3543 //////////////////////////////////////////////////////////////////////////////
3548 int static FormatHashBlocks(void* pbuffer, unsigned int len)
3550 unsigned char* pdata = (unsigned char*)pbuffer;
3551 unsigned int blocks = 1 + ((len + 8) / 64);
3552 unsigned char* pend = pdata + 64 * blocks;
3553 memset(pdata + len, 0, 64 * blocks - len);
3555 unsigned int bits = len * 8;
3556 pend[-1] = (bits >> 0) & 0xff;
3557 pend[-2] = (bits >> 8) & 0xff;
3558 pend[-3] = (bits >> 16) & 0xff;
3559 pend[-4] = (bits >> 24) & 0xff;
3563 static const unsigned int pSHA256InitState[8] =
3564 {0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19};
3566 void SHA256Transform(void* pstate, void* pinput, const void* pinit)
3569 unsigned char data[64];
3573 for (int i = 0; i < 16; i++)
3574 ((uint32_t*)data)[i] = ByteReverse(((uint32_t*)pinput)[i]);
3576 for (int i = 0; i < 8; i++)
3577 ctx.h[i] = ((uint32_t*)pinit)[i];
3579 SHA256_Update(&ctx, data, sizeof(data));
3580 for (int i = 0; i < 8; i++)
3581 ((uint32_t*)pstate)[i] = ctx.h[i];
3584 // Some explaining would be appreciated
3589 set<uint256> setDependsOn;
3592 COrphan(CTransaction* ptxIn)
3600 printf("COrphan(hash=%s, dPriority=%.1f)\n", ptx->GetHash().ToString().substr(0,10).c_str(), dPriority);
3601 BOOST_FOREACH(uint256 hash, setDependsOn)
3602 printf(" setDependsOn %s\n", hash.ToString().substr(0,10).c_str());
3607 uint64 nLastBlockTx = 0;
3608 uint64 nLastBlockSize = 0;
3609 int64 nLastCoinStakeSearchInterval = 0;
3612 // fProofOfStake: try (best effort) to make a proof-of-stake block
3613 CBlock* CreateNewBlock(CWallet* pwallet, bool fProofOfStake)
3615 CReserveKey reservekey(pwallet);
3618 auto_ptr<CBlock> pblock(new CBlock());
3622 // Create coinbase tx
3624 txNew.vin.resize(1);
3625 txNew.vin[0].prevout.SetNull();
3626 txNew.vout.resize(1);
3627 txNew.vout[0].scriptPubKey << reservekey.GetReservedKey() << OP_CHECKSIG;
3629 // Add our coinbase tx as first transaction
3630 pblock->vtx.push_back(txNew);
3632 // ppcoin: if coinstake available add coinstake tx
3633 static int64 nLastCoinStakeSearchTime = GetAdjustedTime(); // only initialized at startup
3634 CBlockIndex* pindexPrev = pindexBest;
3636 if (fProofOfStake) // attemp to find a coinstake
3638 pblock->nBits = GetNextTargetRequired(pindexPrev, true);
3639 CTransaction txCoinStake;
3640 int64 nSearchTime = txCoinStake.nTime; // search to current time
3641 if (nSearchTime > nLastCoinStakeSearchTime)
3643 if (pwallet->CreateCoinStake(*pwallet, pblock->nBits, nSearchTime-nLastCoinStakeSearchTime, txCoinStake))
3645 if (txCoinStake.nTime >= max(pindexPrev->GetMedianTimePast()+1, pindexPrev->GetBlockTime() - nMaxClockDrift))
3646 { // make sure coinstake would meet timestamp protocol
3647 // as it would be the same as the block timestamp
3648 pblock->vtx[0].vout[0].SetEmpty();
3649 pblock->vtx[0].nTime = txCoinStake.nTime;
3650 pblock->vtx.push_back(txCoinStake);
3653 nLastCoinStakeSearchInterval = nSearchTime - nLastCoinStakeSearchTime;
3654 nLastCoinStakeSearchTime = nSearchTime;
3658 pblock->nBits = GetNextTargetRequired(pindexPrev, pblock->IsProofOfStake());
3660 // Collect memory pool transactions into the block
3663 LOCK2(cs_main, mempool.cs);
3666 // Priority order to process transactions
3667 list<COrphan> vOrphan; // list memory doesn't move
3668 map<uint256, vector<COrphan*> > mapDependers;
3669 multimap<double, CTransaction*> mapPriority;
3670 for (map<uint256, CTransaction>::iterator mi = mempool.mapTx.begin(); mi != mempool.mapTx.end(); ++mi)
3672 CTransaction& tx = (*mi).second;
3673 if (tx.IsCoinBase() || tx.IsCoinStake() || !tx.IsFinal())
3676 COrphan* porphan = NULL;
3677 double dPriority = 0;
3678 BOOST_FOREACH(const CTxIn& txin, tx.vin)
3680 // Read prev transaction
3681 CTransaction txPrev;
3683 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
3685 // Has to wait for dependencies
3688 // Use list for automatic deletion
3689 vOrphan.push_back(COrphan(&tx));
3690 porphan = &vOrphan.back();
3692 mapDependers[txin.prevout.hash].push_back(porphan);
3693 porphan->setDependsOn.insert(txin.prevout.hash);
3696 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
3698 // Read block header
3699 int nConf = txindex.GetDepthInMainChain();
3701 dPriority += (double)nValueIn * nConf;
3703 if (fDebug && GetBoolArg("-printpriority"))
3704 printf("priority nValueIn=%-12"PRI64d" nConf=%-5d dPriority=%-20.1f\n", nValueIn, nConf, dPriority);
3707 // Priority is sum(valuein * age) / txsize
3708 dPriority /= ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
3711 porphan->dPriority = dPriority;
3713 mapPriority.insert(make_pair(-dPriority, &(*mi).second));
3715 if (fDebug && GetBoolArg("-printpriority"))
3717 printf("priority %-20.1f %s\n%s", dPriority, tx.GetHash().ToString().substr(0,10).c_str(), tx.ToString().c_str());
3724 // Collect transactions into block
3725 map<uint256, CTxIndex> mapTestPool;
3726 uint64 nBlockSize = 1000;
3727 uint64 nBlockTx = 0;
3728 int nBlockSigOps = 100;
3729 while (!mapPriority.empty())
3731 // Take highest priority transaction off priority queue
3732 CTransaction& tx = *(*mapPriority.begin()).second;
3733 mapPriority.erase(mapPriority.begin());
3736 unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
3737 if (nBlockSize + nTxSize >= MAX_BLOCK_SIZE_GEN)
3740 // Legacy limits on sigOps:
3741 unsigned int nTxSigOps = tx.GetLegacySigOpCount();
3742 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3746 if (tx.nTime > GetAdjustedTime() || (pblock->IsProofOfStake() && tx.nTime > pblock->vtx[1].nTime))
3749 // ppcoin: simplify transaction fee - allow free = false
3750 int64 nMinFee = tx.GetMinFee(nBlockSize, false, GMF_BLOCK);
3752 // Connecting shouldn't fail due to dependency on other memory pool transactions
3753 // because we're already processing them in order of dependency
3754 map<uint256, CTxIndex> mapTestPoolTmp(mapTestPool);
3755 MapPrevTx mapInputs;
3757 if (!tx.FetchInputs(txdb, mapTestPoolTmp, false, true, mapInputs, fInvalid))
3760 int64 nTxFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
3761 if (nTxFees < nMinFee)
3764 nTxSigOps += tx.GetP2SHSigOpCount(mapInputs);
3765 if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS)
3768 if (!tx.ConnectInputs(txdb, mapInputs, mapTestPoolTmp, CDiskTxPos(1,1,1), pindexPrev, false, true))
3770 mapTestPoolTmp[tx.GetHash()] = CTxIndex(CDiskTxPos(1,1,1), tx.vout.size());
3771 swap(mapTestPool, mapTestPoolTmp);
3774 pblock->vtx.push_back(tx);
3775 nBlockSize += nTxSize;
3777 nBlockSigOps += nTxSigOps;
3780 // Add transactions that depend on this one to the priority queue
3781 uint256 hash = tx.GetHash();
3782 if (mapDependers.count(hash))
3784 BOOST_FOREACH(COrphan* porphan, mapDependers[hash])
3786 if (!porphan->setDependsOn.empty())
3788 porphan->setDependsOn.erase(hash);
3789 if (porphan->setDependsOn.empty())
3790 mapPriority.insert(make_pair(-porphan->dPriority, porphan->ptx));
3796 nLastBlockTx = nBlockTx;
3797 nLastBlockSize = nBlockSize;
3798 if (fDebug && GetBoolArg("-printpriority"))
3799 printf("CreateNewBlock(): total size %lu\n", nBlockSize);
3802 if (pblock->IsProofOfWork())
3803 pblock->vtx[0].vout[0].nValue = GetProofOfWorkReward(pblock->nBits);
3806 pblock->hashPrevBlock = pindexPrev->GetBlockHash();
3807 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3808 if (pblock->IsProofOfStake())
3809 pblock->nTime = pblock->vtx[1].nTime; //same as coinstake timestamp
3810 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, pblock->GetMaxTransactionTime());
3811 pblock->nTime = max(pblock->GetBlockTime(), pindexPrev->GetBlockTime() - nMaxClockDrift);
3812 if (pblock->IsProofOfWork())
3813 pblock->UpdateTime(pindexPrev);
3816 return pblock.release();
3820 void IncrementExtraNonce(CBlock* pblock, CBlockIndex* pindexPrev, unsigned int& nExtraNonce)
3822 // Update nExtraNonce
3823 static uint256 hashPrevBlock;
3824 if (hashPrevBlock != pblock->hashPrevBlock)
3827 hashPrevBlock = pblock->hashPrevBlock;
3831 unsigned int nHeight = pindexPrev->nHeight+1; // Height first in coinbase required for block.version=2
3832 pblock->vtx[0].vin[0].scriptSig = (CScript() << nHeight << CBigNum(nExtraNonce)) + COINBASE_FLAGS;
3834 assert(pblock->vtx[0].vin[0].scriptSig.size() <= 100);
3836 pblock->hashMerkleRoot = pblock->BuildMerkleTree();
3840 void FormatHashBuffers(CBlock* pblock, char* pmidstate, char* pdata, char* phash1)
3843 // Prebuild hash buffers
3850 uint256 hashPrevBlock;
3851 uint256 hashMerkleRoot;
3854 unsigned int nNonce;
3857 unsigned char pchPadding0[64];
3859 unsigned char pchPadding1[64];
3862 memset(&tmp, 0, sizeof(tmp));
3864 tmp.block.nVersion = pblock->nVersion;
3865 tmp.block.hashPrevBlock = pblock->hashPrevBlock;
3866 tmp.block.hashMerkleRoot = pblock->hashMerkleRoot;
3867 tmp.block.nTime = pblock->nTime;
3868 tmp.block.nBits = pblock->nBits;
3869 tmp.block.nNonce = pblock->nNonce;
3871 FormatHashBlocks(&tmp.block, sizeof(tmp.block));
3872 FormatHashBlocks(&tmp.hash1, sizeof(tmp.hash1));
3874 // Byte swap all the input buffer
3875 for (unsigned int i = 0; i < sizeof(tmp)/4; i++)
3876 ((unsigned int*)&tmp)[i] = ByteReverse(((unsigned int*)&tmp)[i]);
3878 // Precalc the first half of the first hash, which stays constant
3879 SHA256Transform(pmidstate, &tmp.block, pSHA256InitState);
3881 memcpy(pdata, &tmp.block, 128);
3882 memcpy(phash1, &tmp.hash1, 64);
3886 bool CheckWork(CBlock* pblock, CWallet& wallet, CReserveKey& reservekey)
3888 uint256 hash = pblock->GetHash();
3889 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
3891 if (hash > hashTarget && pblock->IsProofOfWork())
3892 return error("BitcoinMiner : proof-of-work not meeting target");
3895 printf("BitcoinMiner:\n");
3896 printf("new block found \n hash: %s \ntarget: %s\n", hash.GetHex().c_str(), hashTarget.GetHex().c_str());
3898 printf("%s ", DateTimeStrFormat(GetTime()).c_str());
3899 printf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue).c_str());
3904 if (pblock->hashPrevBlock != hashBestChain)
3905 return error("BitcoinMiner : generated block is stale");
3907 // Remove key from key pool
3908 reservekey.KeepKey();
3910 // Track how many getdata requests this block gets
3912 LOCK(wallet.cs_wallet);
3913 wallet.mapRequestCount[pblock->GetHash()] = 0;
3916 // Process this block the same as if we had received it from another node
3917 if (!ProcessBlock(NULL, pblock))
3918 return error("BitcoinMiner : ProcessBlock, block not accepted");
3924 void static ThreadBitcoinMiner(void* parg);
3926 static bool fGenerateBitcoins = false;
3927 static bool fLimitProcessors = false;
3928 static int nLimitProcessors = -1;
3930 void BitcoinMiner(CWallet *pwallet, bool fProofOfStake)
3932 void *scratchbuf = scrypt_buffer_alloc();
3934 printf("CPUMiner started for proof-of-%s\n", fProofOfStake? "stake" : "work");
3935 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3937 // Each thread has its own key and counter
3938 CReserveKey reservekey(pwallet);
3939 unsigned int nExtraNonce = 0;
3941 while (fGenerateBitcoins || fProofOfStake)
3945 while (vNodes.empty() || IsInitialBlockDownload())
3950 if ((!fGenerateBitcoins) && !fProofOfStake)
3954 while (pwallet->IsLocked())
3956 strMintWarning = strMintMessage;
3959 strMintWarning = "";
3964 unsigned int nTransactionsUpdatedLast = nTransactionsUpdated;
3965 CBlockIndex* pindexPrev = pindexBest;
3967 auto_ptr<CBlock> pblock(CreateNewBlock(pwallet, fProofOfStake));
3971 IncrementExtraNonce(pblock.get(), pindexPrev, nExtraNonce);
3975 // ppcoin: if proof-of-stake block found then process block
3976 if (pblock->IsProofOfStake())
3978 if (!pblock->SignBlock(*pwalletMain))
3980 strMintWarning = strMintMessage;
3983 strMintWarning = "";
3984 printf("CPUMiner : proof-of-stake block found %s\n", pblock->GetHash().ToString().c_str());
3985 SetThreadPriority(THREAD_PRIORITY_NORMAL);
3986 CheckWork(pblock.get(), *pwalletMain, reservekey);
3987 SetThreadPriority(THREAD_PRIORITY_LOWEST);
3993 printf("Running BitcoinMiner with %d transactions in block\n", pblock->vtx.size());
3997 // Prebuild hash buffers
3999 char pmidstatebuf[32+16]; char* pmidstate = alignup<16>(pmidstatebuf);
4000 char pdatabuf[128+16]; char* pdata = alignup<16>(pdatabuf);
4001 char phash1buf[64+16]; char* phash1 = alignup<16>(phash1buf);
4003 FormatHashBuffers(pblock.get(), pmidstate, pdata, phash1);
4005 unsigned int& nBlockTime = *(unsigned int*)(pdata + 64 + 4);
4006 unsigned int& nBlockNonce = *(unsigned int*)(pdata + 64 + 12);
4012 int64 nStart = GetTime();
4013 uint256 hashTarget = CBigNum().SetCompact(pblock->nBits).getuint256();
4015 unsigned int max_nonce = 0xffff0000;
4016 block_header res_header;
4021 unsigned int nHashesDone = 0;
4022 unsigned int nNonceFound;
4024 nNonceFound = scanhash_scrypt(
4025 (block_header *)&pblock->nVersion,
4033 // Check if something found
4034 if (nNonceFound != (unsigned int) -1)
4036 if (result <= hashTarget)
4039 pblock->nNonce = nNonceFound;
4040 assert(result == pblock->GetHash());
4041 if (!pblock->SignBlock(*pwalletMain))
4043 strMintWarning = strMintMessage;
4046 strMintWarning = "";
4047 SetThreadPriority(THREAD_PRIORITY_NORMAL);
4048 CheckWork(pblock.get(), *pwalletMain, reservekey);
4049 SetThreadPriority(THREAD_PRIORITY_LOWEST);
4055 static int64 nHashCounter;
4056 if (nHPSTimerStart == 0)
4058 nHPSTimerStart = GetTimeMillis();
4062 nHashCounter += nHashesDone;
4063 if (GetTimeMillis() - nHPSTimerStart > 4000)
4065 static CCriticalSection cs;
4068 if (GetTimeMillis() - nHPSTimerStart > 4000)
4070 dHashesPerSec = 1000.0 * nHashCounter / (GetTimeMillis() - nHPSTimerStart);
4071 nHPSTimerStart = GetTimeMillis();
4073 static int64 nLogTime;
4074 if (GetTime() - nLogTime > 30 * 60)
4076 nLogTime = GetTime();
4077 printf("%s ", DateTimeStrFormat(GetTime()).c_str());
4078 printf("hashmeter %3d CPUs %6.0f khash/s\n", vnThreadsRunning[THREAD_MINER], dHashesPerSec/1000.0);
4084 // Check for stop or if block needs to be rebuilt
4087 if (!fGenerateBitcoins)
4089 if (fLimitProcessors && vnThreadsRunning[THREAD_MINER] > nLimitProcessors)
4093 if (nBlockNonce >= 0xffff0000)
4095 if (nTransactionsUpdated != nTransactionsUpdatedLast && GetTime() - nStart > 60)
4097 if (pindexPrev != pindexBest)
4100 // Update nTime every few seconds
4101 pblock->nTime = max(pindexPrev->GetMedianTimePast()+1, pblock->GetMaxTransactionTime());
4102 pblock->nTime = max(pblock->GetBlockTime(), pindexPrev->GetBlockTime() - nMaxClockDrift);
4103 pblock->UpdateTime(pindexPrev);
4104 nBlockTime = ByteReverse(pblock->nTime);
4105 if (pblock->GetBlockTime() >= (int64)pblock->vtx[0].nTime + nMaxClockDrift)
4106 break; // need to update coinbase timestamp
4110 scrypt_buffer_free(scratchbuf);
4113 void static ThreadBitcoinMiner(void* parg)
4115 CWallet* pwallet = (CWallet*)parg;
4118 vnThreadsRunning[THREAD_MINER]++;
4119 BitcoinMiner(pwallet, false);
4120 vnThreadsRunning[THREAD_MINER]--;
4122 catch (std::exception& e) {
4123 vnThreadsRunning[THREAD_MINER]--;
4124 PrintException(&e, "ThreadBitcoinMiner()");
4126 vnThreadsRunning[THREAD_MINER]--;
4127 PrintException(NULL, "ThreadBitcoinMiner()");
4130 if (vnThreadsRunning[THREAD_MINER] == 0)
4132 printf("ThreadBitcoinMiner exiting, %d threads remaining\n", vnThreadsRunning[THREAD_MINER]);
4136 void GenerateBitcoins(bool fGenerate, CWallet* pwallet)
4138 fGenerateBitcoins = fGenerate;
4139 nLimitProcessors = GetArg("-genproclimit", -1);
4140 if (nLimitProcessors == 0)
4141 fGenerateBitcoins = false;
4142 fLimitProcessors = (nLimitProcessors != -1);
4146 int nProcessors = boost::thread::hardware_concurrency();
4147 printf("%d processors\n", nProcessors);
4148 if (nProcessors < 1)
4150 if (fLimitProcessors && nProcessors > nLimitProcessors)
4151 nProcessors = nLimitProcessors;
4152 int nAddThreads = nProcessors - vnThreadsRunning[THREAD_MINER];
4153 printf("Starting %d BitcoinMiner threads\n", nAddThreads);
4154 for (int i = 0; i < nAddThreads; i++)
4156 if (!CreateThread(ThreadBitcoinMiner, pwallet))
4157 printf("Error: CreateThread(ThreadBitcoinMiner) failed\n");