1 // Copyright (c) 2009-2010 Satoshi Nakamoto
2 // Copyright (c) 2009-2012 The Bitcoin developers
3 // Distributed under the MIT/X11 software license, see the accompanying
4 // file COPYING or http://www.opensource.org/licenses/mit-license.php.
7 #include "checkpoints.h"
12 #include "ui_interface.h"
14 #include "zerocoin/Zerocoin.h"
15 #include <boost/algorithm/string/replace.hpp>
16 #include <boost/filesystem.hpp>
17 #include <boost/filesystem/fstream.hpp>
21 using namespace boost;
27 CCriticalSection cs_setpwalletRegistered;
28 set<CWallet*> setpwalletRegistered;
30 CCriticalSection cs_main;
33 unsigned int nTransactionsUpdated = 0;
35 map<uint256, CBlockIndex*> mapBlockIndex;
36 set<pair<COutPoint, unsigned int> > setStakeSeen;
37 libzerocoin::Params* ZCParams;
39 CBigNum bnProofOfWorkLimit(~uint256(0) >> 20); // "standard" scrypt target limit for proof of work, results with 0,000244140625 proof-of-work difficulty
40 CBigNum bnProofOfStakeLegacyLimit(~uint256(0) >> 24); // proof of stake target limit from block #15000 and until 20 June 2013, results with 0,00390625 proof of stake difficulty
41 CBigNum bnProofOfStakeLimit(~uint256(0) >> 27); // proof of stake target limit since 20 June 2013, equal to 0.03125 proof of stake difficulty
42 CBigNum bnProofOfStakeHardLimit(~uint256(0) >> 30); // disabled temporarily, will be used in the future to fix minimal proof of stake difficulty at 0.25
43 uint256 nPoWBase = uint256("0x00000000ffff0000000000000000000000000000000000000000000000000000"); // difficulty-1 target
45 CBigNum bnProofOfWorkLimitTestNet(~uint256(0) >> 16);
47 unsigned int nStakeMinAge = 60 * 60 * 24 * 30; // 30 days as zero time weight
48 unsigned int nStakeMaxAge = 60 * 60 * 24 * 90; // 90 days as full weight
49 unsigned int nStakeTargetSpacing = 10 * 60; // 10-minute stakes spacing
50 unsigned int nModifierInterval = 6 * 60 * 60; // time to elapse before new modifier is computed
52 int nCoinbaseMaturity = 500;
53 CBlockIndex* pindexGenesisBlock = NULL;
56 uint256 nBestChainTrust = 0;
57 uint256 nBestInvalidTrust = 0;
59 uint256 hashBestChain = 0;
60 CBlockIndex* pindexBest = NULL;
61 int64 nTimeBestReceived = 0;
63 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
65 map<uint256, CBlock*> mapOrphanBlocks;
66 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
67 set<pair<COutPoint, unsigned int> > setStakeSeenOrphan;
68 map<uint256, uint256> mapProofOfStake;
70 map<uint256, CTransaction> mapOrphanTransactions;
71 map<uint256, set<uint256> > mapOrphanTransactionsByPrev;
73 // Constant stuff for coinbase transactions we create:
74 CScript COINBASE_FLAGS;
76 const string strMessageMagic = "NovaCoin Signed Message:\n";
79 int64 nTransactionFee = MIN_TX_FEE;
80 int64 nMinimumInputValue = MIN_TX_FEE;
82 extern enum Checkpoints::CPMode CheckpointsMode;
84 //////////////////////////////////////////////////////////////////////////////
86 // dispatching functions
89 // These functions dispatch to one or all registered wallets
92 void RegisterWallet(CWallet* pwalletIn)
95 LOCK(cs_setpwalletRegistered);
96 setpwalletRegistered.insert(pwalletIn);
100 void UnregisterWallet(CWallet* pwalletIn)
103 LOCK(cs_setpwalletRegistered);
104 setpwalletRegistered.erase(pwalletIn);
108 // check whether the passed transaction is from us
109 bool static IsFromMe(CTransaction& tx)
111 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
112 if (pwallet->IsFromMe(tx))
117 // get the wallet transaction with the given hash (if it exists)
118 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
120 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
121 if (pwallet->GetTransaction(hashTx,wtx))
126 // erases transaction with the given hash from all wallets
127 void static EraseFromWallets(uint256 hash)
129 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
130 pwallet->EraseFromWallet(hash);
133 // make sure all wallets know about the given transaction, in the given block
134 void SyncWithWallets(const CTransaction& tx, const CBlock* pblock, bool fUpdate, bool fConnect)
138 // ppcoin: wallets need to refund inputs when disconnecting coinstake
139 if (tx.IsCoinStake())
141 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
142 if (pwallet->IsFromMe(tx))
143 pwallet->DisableTransaction(tx);
148 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
149 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
152 // notify wallets about a new best chain
153 void static SetBestChain(const CBlockLocator& loc)
155 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
156 pwallet->SetBestChain(loc);
159 // notify wallets about an updated transaction
160 void static UpdatedTransaction(const uint256& hashTx)
162 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
163 pwallet->UpdatedTransaction(hashTx);
167 void static PrintWallets(const CBlock& block)
169 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
170 pwallet->PrintWallet(block);
173 // notify wallets about an incoming inventory (for request counts)
174 void static Inventory(const uint256& hash)
176 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
177 pwallet->Inventory(hash);
180 // ask wallets to resend their transactions
181 void ResendWalletTransactions()
183 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
184 pwallet->ResendWalletTransactions();
193 //////////////////////////////////////////////////////////////////////////////
195 // mapOrphanTransactions
198 bool AddOrphanTx(const CTransaction& tx)
200 uint256 hash = tx.GetHash();
201 if (mapOrphanTransactions.count(hash))
204 // Ignore big transactions, to avoid a
205 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
206 // large transaction with a missing parent then we assume
207 // it will rebroadcast it later, after the parent transaction(s)
208 // have been mined or received.
209 // 10,000 orphans, each of which is at most 5,000 bytes big is
210 // at most 500 megabytes of orphans:
212 size_t nSize = tx.GetSerializeSize(SER_NETWORK, CTransaction::CURRENT_VERSION);
216 printf("ignoring large orphan tx (size: %"PRIszu", hash: %s)\n", nSize, hash.ToString().substr(0,10).c_str());
220 mapOrphanTransactions[hash] = tx;
221 BOOST_FOREACH(const CTxIn& txin, tx.vin)
222 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(hash);
224 printf("stored orphan tx %s (mapsz %"PRIszu")\n", hash.ToString().substr(0,10).c_str(),
225 mapOrphanTransactions.size());
229 void static EraseOrphanTx(uint256 hash)
231 if (!mapOrphanTransactions.count(hash))
233 const CTransaction& tx = mapOrphanTransactions[hash];
234 BOOST_FOREACH(const CTxIn& txin, tx.vin)
236 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
237 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
238 mapOrphanTransactionsByPrev.erase(txin.prevout.hash);
240 mapOrphanTransactions.erase(hash);
243 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
245 unsigned int nEvicted = 0;
246 while (mapOrphanTransactions.size() > nMaxOrphans)
248 // Evict a random orphan:
249 uint256 randomhash = GetRandHash();
250 map<uint256, CTransaction>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
251 if (it == mapOrphanTransactions.end())
252 it = mapOrphanTransactions.begin();
253 EraseOrphanTx(it->first);
265 //////////////////////////////////////////////////////////////////////////////
267 // CTransaction and CTxIndex
270 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
273 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
275 if (!ReadFromDisk(txindexRet.pos))
277 if (prevout.n >= vout.size())
285 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
288 return ReadFromDisk(txdb, prevout, txindex);
291 bool CTransaction::ReadFromDisk(COutPoint prevout)
295 return ReadFromDisk(txdb, prevout, txindex);
298 bool CTransaction::IsStandard() const
300 if (nVersion > CTransaction::CURRENT_VERSION)
303 BOOST_FOREACH(const CTxIn& txin, vin)
305 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
306 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
307 // ~65-byte public keys, plus a few script ops.
308 if (txin.scriptSig.size() > 500)
310 if (!txin.scriptSig.IsPushOnly())
312 if (fEnforceCanonical && !txin.scriptSig.HasCanonicalPushes()) {
316 BOOST_FOREACH(const CTxOut& txout, vout) {
317 if (!::IsStandard(txout.scriptPubKey))
319 if (txout.nValue == 0)
321 if (fEnforceCanonical && !txout.scriptPubKey.HasCanonicalPushes()) {
329 // Check transaction inputs, and make sure any
330 // pay-to-script-hash transactions are evaluating IsStandard scripts
332 // Why bother? To avoid denial-of-service attacks; an attacker
333 // can submit a standard HASH... OP_EQUAL transaction,
334 // which will get accepted into blocks. The redemption
335 // script can be anything; an attacker could use a very
336 // expensive-to-check-upon-redemption script like:
337 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
339 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
342 return true; // Coinbases don't use vin normally
344 for (unsigned int i = 0; i < vin.size(); i++)
346 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
348 vector<vector<unsigned char> > vSolutions;
349 txnouttype whichType;
350 // get the scriptPubKey corresponding to this input:
351 const CScript& prevScript = prev.scriptPubKey;
352 if (!Solver(prevScript, whichType, vSolutions))
354 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
355 if (nArgsExpected < 0)
358 // Transactions with extra stuff in their scriptSigs are
359 // non-standard. Note that this EvalScript() call will
360 // be quick, because if there are any operations
361 // beside "push data" in the scriptSig the
362 // IsStandard() call returns false
363 vector<vector<unsigned char> > stack;
364 if (!EvalScript(stack, vin[i].scriptSig, *this, i, 0))
367 if (whichType == TX_SCRIPTHASH)
371 CScript subscript(stack.back().begin(), stack.back().end());
372 vector<vector<unsigned char> > vSolutions2;
373 txnouttype whichType2;
374 if (!Solver(subscript, whichType2, vSolutions2))
376 if (whichType2 == TX_SCRIPTHASH)
380 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
383 nArgsExpected += tmpExpected;
386 if (stack.size() != (unsigned int)nArgsExpected)
394 CTransaction::GetLegacySigOpCount() const
396 unsigned int nSigOps = 0;
397 BOOST_FOREACH(const CTxIn& txin, vin)
399 nSigOps += txin.scriptSig.GetSigOpCount(false);
401 BOOST_FOREACH(const CTxOut& txout, vout)
403 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
409 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
421 // Load the block this tx is in
423 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
425 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
430 // Update the tx's hashBlock
431 hashBlock = pblock->GetHash();
433 // Locate the transaction
434 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
435 if (pblock->vtx[nIndex] == *(CTransaction*)this)
437 if (nIndex == (int)pblock->vtx.size())
439 vMerkleBranch.clear();
441 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
445 // Fill in merkle branch
446 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
449 // Is the tx in a block that's in the main chain
450 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
451 if (mi == mapBlockIndex.end())
453 CBlockIndex* pindex = (*mi).second;
454 if (!pindex || !pindex->IsInMainChain())
457 return pindexBest->nHeight - pindex->nHeight + 1;
466 bool CTransaction::CheckTransaction() const
468 // Basic checks that don't depend on any context
470 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
472 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
474 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
475 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
477 // Check for negative or overflow output values
479 for (unsigned int i = 0; i < vout.size(); i++)
481 const CTxOut& txout = vout[i];
482 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
483 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
485 // NovaCoin: enforce minimum output amount for user transactions until 1 May 2014 04:00:00 GMT
486 if (!fTestNet && !IsCoinBase() && !txout.IsEmpty() && nTime < OUTPUT_SWITCH_TIME && txout.nValue < MIN_TXOUT_AMOUNT)
487 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue below minimum"));
489 if (txout.nValue < 0)
490 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue is negative"));
491 if (txout.nValue > MAX_MONEY)
492 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
493 nValueOut += txout.nValue;
494 if (!MoneyRange(nValueOut))
495 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
498 // Check for duplicate inputs
499 set<COutPoint> vInOutPoints;
500 BOOST_FOREACH(const CTxIn& txin, vin)
502 if (vInOutPoints.count(txin.prevout))
504 vInOutPoints.insert(txin.prevout);
509 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
510 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
514 BOOST_FOREACH(const CTxIn& txin, vin)
515 if (txin.prevout.IsNull())
516 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
522 int64 CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree,
523 enum GetMinFee_mode mode, unsigned int nBytes) const
525 // Base fee is either MIN_TX_FEE or MIN_RELAY_TX_FEE
526 int64 nBaseFee = (mode == GMF_RELAY) ? MIN_RELAY_TX_FEE : MIN_TX_FEE;
528 unsigned int nNewBlockSize = nBlockSize + nBytes;
529 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
531 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if any output is less than 0.01
532 if (nMinFee < nBaseFee)
534 BOOST_FOREACH(const CTxOut& txout, vout)
535 if (txout.nValue < CENT)
539 // Raise the price as the block approaches full
540 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
542 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
544 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
547 if (!MoneyRange(nMinFee))
553 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
554 bool* pfMissingInputs)
557 *pfMissingInputs = false;
559 if (!tx.CheckTransaction())
560 return error("CTxMemPool::accept() : CheckTransaction failed");
562 // Coinbase is only valid in a block, not as a loose transaction
564 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
566 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
567 if (tx.IsCoinStake())
568 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
570 // To help v0.1.5 clients who would see it as a negative number
571 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
572 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
574 // Rather not work on nonstandard transactions (unless -testnet)
575 if (!fTestNet && !tx.IsStandard())
576 return error("CTxMemPool::accept() : nonstandard transaction type");
578 // Do we already have it?
579 uint256 hash = tx.GetHash();
582 if (mapTx.count(hash))
586 if (txdb.ContainsTx(hash))
589 // Check for conflicts with in-memory transactions
590 CTransaction* ptxOld = NULL;
591 for (unsigned int i = 0; i < tx.vin.size(); i++)
593 COutPoint outpoint = tx.vin[i].prevout;
594 if (mapNextTx.count(outpoint))
596 // Disable replacement feature for now
599 // Allow replacing with a newer version of the same transaction
602 ptxOld = mapNextTx[outpoint].ptx;
603 if (ptxOld->IsFinal())
605 if (!tx.IsNewerThan(*ptxOld))
607 for (unsigned int i = 0; i < tx.vin.size(); i++)
609 COutPoint outpoint = tx.vin[i].prevout;
610 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
620 map<uint256, CTxIndex> mapUnused;
621 bool fInvalid = false;
622 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
625 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
627 *pfMissingInputs = true;
631 // Check for non-standard pay-to-script-hash in inputs
632 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
633 return error("CTxMemPool::accept() : nonstandard transaction input");
635 // Note: if you modify this code to accept non-standard transactions, then
636 // you should add code here to check that the transaction does a
637 // reasonable number of ECDSA signature verifications.
639 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
640 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
642 // Don't accept it if it can't get into a block
643 int64 txMinFee = tx.GetMinFee(1000, false, GMF_RELAY, nSize);
644 if (nFees < txMinFee)
645 return error("CTxMemPool::accept() : not enough fees %s, %"PRI64d" < %"PRI64d,
646 hash.ToString().c_str(),
649 // Continuously rate-limit free transactions
650 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
651 // be annoying or make others' transactions take longer to confirm.
652 if (nFees < MIN_RELAY_TX_FEE)
654 static CCriticalSection cs;
655 static double dFreeCount;
656 static int64 nLastTime;
657 int64 nNow = GetTime();
661 // Use an exponentially decaying ~10-minute window:
662 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
664 // -limitfreerelay unit is thousand-bytes-per-minute
665 // At default rate it would take over a month to fill 1GB
666 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
667 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
669 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
674 // Check against previous transactions
675 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
676 if (!tx.ConnectInputs(txdb, mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false))
678 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
682 // Store transaction in memory
687 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
690 addUnchecked(hash, tx);
693 ///// are we sure this is ok when loading transactions or restoring block txes
694 // If updated, erase old tx from wallet
696 EraseFromWallets(ptxOld->GetHash());
698 printf("CTxMemPool::accept() : accepted %s (poolsz %"PRIszu")\n",
699 hash.ToString().substr(0,10).c_str(),
704 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
706 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
709 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
711 // Add to memory pool without checking anything. Don't call this directly,
712 // call CTxMemPool::accept to properly check the transaction first.
715 for (unsigned int i = 0; i < tx.vin.size(); i++)
716 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
717 nTransactionsUpdated++;
723 bool CTxMemPool::remove(CTransaction &tx)
725 // Remove transaction from memory pool
728 uint256 hash = tx.GetHash();
729 if (mapTx.count(hash))
731 BOOST_FOREACH(const CTxIn& txin, tx.vin)
732 mapNextTx.erase(txin.prevout);
734 nTransactionsUpdated++;
740 void CTxMemPool::clear()
745 ++nTransactionsUpdated;
748 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
753 vtxid.reserve(mapTx.size());
754 for (map<uint256, CTransaction>::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi)
755 vtxid.push_back((*mi).first);
761 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
763 if (hashBlock == 0 || nIndex == -1)
766 // Find the block it claims to be in
767 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
768 if (mi == mapBlockIndex.end())
770 CBlockIndex* pindex = (*mi).second;
771 if (!pindex || !pindex->IsInMainChain())
774 // Make sure the merkle branch connects to this block
775 if (!fMerkleVerified)
777 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
779 fMerkleVerified = true;
783 return pindexBest->nHeight - pindex->nHeight + 1;
787 int CMerkleTx::GetBlocksToMaturity() const
789 if (!(IsCoinBase() || IsCoinStake()))
791 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
795 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
799 if (!IsInMainChain() && !ClientConnectInputs())
801 return CTransaction::AcceptToMemoryPool(txdb, false);
805 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
809 bool CMerkleTx::AcceptToMemoryPool()
812 return AcceptToMemoryPool(txdb);
817 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
822 // Add previous supporting transactions first
823 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
825 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
827 uint256 hash = tx.GetHash();
828 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
829 tx.AcceptToMemoryPool(txdb, fCheckInputs);
832 return AcceptToMemoryPool(txdb, fCheckInputs);
837 bool CWalletTx::AcceptWalletTransaction()
840 return AcceptWalletTransaction(txdb);
843 int CTxIndex::GetDepthInMainChain() const
847 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
849 // Find the block in the index
850 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
851 if (mi == mapBlockIndex.end())
853 CBlockIndex* pindex = (*mi).second;
854 if (!pindex || !pindex->IsInMainChain())
856 return 1 + nBestHeight - pindex->nHeight;
859 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
860 bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock)
866 if (mempool.exists(hash))
868 tx = mempool.lookup(hash);
874 if (tx.ReadFromDisk(txdb, COutPoint(hash, 0), txindex))
877 if (block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
878 hashBlock = block.GetHash();
892 //////////////////////////////////////////////////////////////////////////////
894 // CBlock and CBlockIndex
897 static CBlockIndex* pblockindexFBBHLast;
898 CBlockIndex* FindBlockByHeight(int nHeight)
900 CBlockIndex *pblockindex;
901 if (nHeight < nBestHeight / 2)
902 pblockindex = pindexGenesisBlock;
904 pblockindex = pindexBest;
905 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
906 pblockindex = pblockindexFBBHLast;
907 while (pblockindex->nHeight > nHeight)
908 pblockindex = pblockindex->pprev;
909 while (pblockindex->nHeight < nHeight)
910 pblockindex = pblockindex->pnext;
911 pblockindexFBBHLast = pblockindex;
915 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
917 if (!fReadTransactions)
919 *this = pindex->GetBlockHeader();
922 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
924 if (GetHash() != pindex->GetBlockHash())
925 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
929 uint256 static GetOrphanRoot(const CBlock* pblock)
931 // Work back to the first block in the orphan chain
932 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
933 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
934 return pblock->GetHash();
937 // ppcoin: find block wanted by given orphan block
938 uint256 WantedByOrphan(const CBlock* pblockOrphan)
940 // Work back to the first block in the orphan chain
941 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
942 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
943 return pblockOrphan->hashPrevBlock;
946 // select stake target limit according to hard-coded conditions
947 CBigNum inline GetProofOfStakeLimit(int nHeight, unsigned int nTime)
949 if(fTestNet) // separate proof of stake target limit for testnet
950 return bnProofOfStakeLimit;
951 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
952 return bnProofOfStakeLimit;
953 if(nHeight + 1 > 15000) // 24 bits since block 15000
954 return bnProofOfStakeLegacyLimit;
955 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
956 return bnProofOfStakeHardLimit;
958 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
961 // miner's coin base reward based on nBits
962 int64 GetProofOfWorkReward(unsigned int nBits)
964 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
967 bnTarget.SetCompact(nBits);
968 CBigNum bnTargetLimit = bnProofOfWorkLimit;
969 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
971 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
972 // A reasonably continuous curve is used to avoid shock to market
973 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
975 // Human readable form:
977 // nSubsidy = 100 / (diff ^ 1/6)
978 CBigNum bnLowerBound = CENT;
979 CBigNum bnUpperBound = bnSubsidyLimit;
980 while (bnLowerBound + CENT <= bnUpperBound)
982 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
983 if (fDebug && GetBoolArg("-printcreation"))
984 printf("GetProofOfWorkReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
985 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
986 bnUpperBound = bnMidValue;
988 bnLowerBound = bnMidValue;
991 int64 nSubsidy = bnUpperBound.getuint64();
993 nSubsidy = (nSubsidy / CENT) * CENT;
994 if (fDebug && GetBoolArg("-printcreation"))
995 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
997 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK);
1000 // miner's coin stake reward based on nBits and coin age spent (coin-days)
1001 int64 GetProofOfStakeReward(int64 nCoinAge, unsigned int nBits, unsigned int nTime, bool bCoinYearOnly)
1003 int64 nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * COIN;
1005 if(fTestNet || nTime > STAKE_SWITCH_TIME)
1007 // Stage 2 of emission process is PoS-based. It will be active on mainNet since 20 Jun 2013.
1009 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1011 bnTarget.SetCompact(nBits);
1012 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1013 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1015 // NovaCoin: A reasonably continuous curve is used to avoid shock to market
1017 CBigNum bnLowerBound = 1 * CENT, // Lower interest bound is 1% per year
1018 bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year
1019 bnMidPart, bnRewardPart;
1021 while (bnLowerBound + CENT <= bnUpperBound)
1023 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1024 if (fDebug && GetBoolArg("-printcreation"))
1025 printf("GetProofOfStakeReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1027 if(!fTestNet && nTime < STAKECURVE_SWITCH_TIME)
1030 // Until 20 Oct 2013: reward for coin-year is cut in half every 64x multiply of PoS difficulty
1032 // (nRewardCoinYearLimit / nRewardCoinYear) ** 6 == bnProofOfStakeLimit / bnTarget
1034 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/6)
1037 bnMidPart = bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue;
1038 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1043 // Since 20 Oct 2013: reward for coin-year is cut in half every 8x multiply of PoS difficulty
1045 // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget
1047 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3)
1050 bnMidPart = bnMidValue * bnMidValue * bnMidValue;
1051 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1054 if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget)
1055 bnUpperBound = bnMidValue;
1057 bnLowerBound = bnMidValue;
1060 nRewardCoinYear = bnUpperBound.getuint64();
1061 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1065 // Old creation amount per coin-year, 5% fixed stake mint rate
1066 nRewardCoinYear = 5 * CENT;
1070 return nRewardCoinYear;
1072 nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
1074 // Set reasonable reward limit for large inputs since 20 Oct 2013
1076 // This will stimulate large holders to use smaller inputs, that's good for the network protection
1077 if(fTestNet || STAKECURVE_SWITCH_TIME < nTime)
1079 if (fDebug && GetBoolArg("-printcreation") && nSubsidyLimit < nSubsidy)
1080 printf("GetProofOfStakeReward(): %s is greater than %s, coinstake reward will be truncated\n", FormatMoney(nSubsidy).c_str(), FormatMoney(nSubsidyLimit).c_str());
1082 nSubsidy = min(nSubsidy, nSubsidyLimit);
1085 if (fDebug && GetBoolArg("-printcreation"))
1086 printf("GetProofOfStakeReward(): create=%s nCoinAge=%"PRI64d" nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1090 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
1092 // get proof of work blocks max spacing according to hard-coded conditions
1093 int64 inline GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1095 if(nTime > TARGETS_SWITCH_TIME)
1096 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1099 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1101 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1105 // maximum nBits value could possible be required nTime after
1107 unsigned int ComputeMaxBits(CBigNum bnTargetLimit, unsigned int nBase, int64 nTime)
1110 bnResult.SetCompact(nBase);
1112 while (nTime > 0 && bnResult < bnTargetLimit)
1114 // Maximum 200% adjustment per day...
1116 nTime -= 24 * 60 * 60;
1118 if (bnResult > bnTargetLimit)
1119 bnResult = bnTargetLimit;
1120 return bnResult.GetCompact();
1124 // minimum amount of work that could possibly be required nTime after
1125 // minimum proof-of-work required was nBase
1127 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
1129 return ComputeMaxBits(bnProofOfWorkLimit, nBase, nTime);
1133 // minimum amount of stake that could possibly be required nTime after
1134 // minimum proof-of-stake required was nBase
1136 unsigned int ComputeMinStake(unsigned int nBase, int64 nTime, unsigned int nBlockTime)
1138 return ComputeMaxBits(GetProofOfStakeLimit(0, nBlockTime), nBase, nTime);
1142 // ppcoin: find last block index up to pindex
1143 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1145 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1146 pindex = pindex->pprev;
1150 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1152 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1154 if (pindexLast == NULL)
1155 return bnTargetLimit.GetCompact(); // genesis block
1157 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1158 if (pindexPrev->pprev == NULL)
1159 return bnTargetLimit.GetCompact(); // first block
1160 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1161 if (pindexPrevPrev->pprev == NULL)
1162 return bnTargetLimit.GetCompact(); // second block
1164 int64 nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1166 // ppcoin: target change every block
1167 // ppcoin: retarget with exponential moving toward target spacing
1169 bnNew.SetCompact(pindexPrev->nBits);
1170 int64 nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1171 int64 nInterval = nTargetTimespan / nTargetSpacing;
1172 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1173 bnNew /= ((nInterval + 1) * nTargetSpacing);
1175 if (bnNew > bnTargetLimit)
1176 bnNew = bnTargetLimit;
1178 return bnNew.GetCompact();
1181 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1184 bnTarget.SetCompact(nBits);
1187 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1188 return error("CheckProofOfWork() : nBits below minimum work");
1190 // Check proof of work matches claimed amount
1191 if (hash > bnTarget.getuint256())
1192 return error("CheckProofOfWork() : hash doesn't match nBits");
1197 // Return maximum amount of blocks that other nodes claim to have
1198 int GetNumBlocksOfPeers()
1200 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1203 bool IsInitialBlockDownload()
1205 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1207 static int64 nLastUpdate;
1208 static CBlockIndex* pindexLastBest;
1209 if (pindexBest != pindexLastBest)
1211 pindexLastBest = pindexBest;
1212 nLastUpdate = GetTime();
1214 return (GetTime() - nLastUpdate < 10 &&
1215 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
1218 void static InvalidChainFound(CBlockIndex* pindexNew)
1220 if (pindexNew->nChainTrust > nBestInvalidTrust)
1222 nBestInvalidTrust = pindexNew->nChainTrust;
1223 CTxDB().WriteBestInvalidTrust(CBigNum(nBestInvalidTrust));
1224 uiInterface.NotifyBlocksChanged();
1227 uint256 nBestInvalidBlockTrust = pindexNew->nChainTrust - pindexNew->pprev->nChainTrust;
1228 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1230 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1231 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1232 CBigNum(pindexNew->nChainTrust).ToString().c_str(), nBestInvalidBlockTrust.Get64(),
1233 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1234 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1235 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1236 CBigNum(pindexBest->nChainTrust).ToString().c_str(),
1237 nBestBlockTrust.Get64(),
1238 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1242 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1244 nTime = max(GetBlockTime(), GetAdjustedTime());
1257 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1259 // Relinquish previous transactions' spent pointers
1262 BOOST_FOREACH(const CTxIn& txin, vin)
1264 COutPoint prevout = txin.prevout;
1266 // Get prev txindex from disk
1268 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1269 return error("DisconnectInputs() : ReadTxIndex failed");
1271 if (prevout.n >= txindex.vSpent.size())
1272 return error("DisconnectInputs() : prevout.n out of range");
1274 // Mark outpoint as not spent
1275 txindex.vSpent[prevout.n].SetNull();
1278 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1279 return error("DisconnectInputs() : UpdateTxIndex failed");
1283 // Remove transaction from index
1284 // This can fail if a duplicate of this transaction was in a chain that got
1285 // reorganized away. This is only possible if this transaction was completely
1286 // spent, so erasing it would be a no-op anyway.
1287 txdb.EraseTxIndex(*this);
1293 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1294 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1296 // FetchInputs can return false either because we just haven't seen some inputs
1297 // (in which case the transaction should be stored as an orphan)
1298 // or because the transaction is malformed (in which case the transaction should
1299 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1303 return true; // Coinbase transactions have no inputs to fetch.
1305 for (unsigned int i = 0; i < vin.size(); i++)
1307 COutPoint prevout = vin[i].prevout;
1308 if (inputsRet.count(prevout.hash))
1309 continue; // Got it already
1312 CTxIndex& txindex = inputsRet[prevout.hash].first;
1314 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1316 // Get txindex from current proposed changes
1317 txindex = mapTestPool.find(prevout.hash)->second;
1321 // Read txindex from txdb
1322 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1324 if (!fFound && (fBlock || fMiner))
1325 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());
1328 CTransaction& txPrev = inputsRet[prevout.hash].second;
1329 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1331 // Get prev tx from single transactions in memory
1334 if (!mempool.exists(prevout.hash))
1335 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());
1336 txPrev = mempool.lookup(prevout.hash);
1339 txindex.vSpent.resize(txPrev.vout.size());
1343 // Get prev tx from disk
1344 if (!txPrev.ReadFromDisk(txindex.pos))
1345 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1349 // Make sure all prevout.n indexes are valid:
1350 for (unsigned int i = 0; i < vin.size(); i++)
1352 const COutPoint prevout = vin[i].prevout;
1353 assert(inputsRet.count(prevout.hash) != 0);
1354 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1355 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1356 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1358 // Revisit this if/when transaction replacement is implemented and allows
1361 return DoS(100, error("FetchInputs() : %s prevout.n out of range %d %"PRIszu" %"PRIszu" 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()));
1368 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1370 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1371 if (mi == inputs.end())
1372 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1374 const CTransaction& txPrev = (mi->second).second;
1375 if (input.prevout.n >= txPrev.vout.size())
1376 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1378 return txPrev.vout[input.prevout.n];
1381 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1387 for (unsigned int i = 0; i < vin.size(); i++)
1389 nResult += GetOutputFor(vin[i], inputs).nValue;
1395 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1400 unsigned int nSigOps = 0;
1401 for (unsigned int i = 0; i < vin.size(); i++)
1403 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1404 if (prevout.scriptPubKey.IsPayToScriptHash())
1405 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1410 bool CTransaction::ConnectInputs(CTxDB& txdb, MapPrevTx inputs, map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1411 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, bool fStrictPayToScriptHash)
1413 // Take over previous transactions' spent pointers
1414 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1415 // fMiner is true when called from the internal bitcoin miner
1416 // ... both are false when called from CTransaction::AcceptToMemoryPool
1421 for (unsigned int i = 0; i < vin.size(); i++)
1423 COutPoint prevout = vin[i].prevout;
1424 assert(inputs.count(prevout.hash) > 0);
1425 CTxIndex& txindex = inputs[prevout.hash].first;
1426 CTransaction& txPrev = inputs[prevout.hash].second;
1428 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1429 return DoS(100, error("ConnectInputs() : %s prevout.n out of range %d %"PRIszu" %"PRIszu" 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()));
1431 // If prev is coinbase or coinstake, check that it's matured
1432 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
1433 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < nCoinbaseMaturity; pindex = pindex->pprev)
1434 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1435 return error("ConnectInputs() : tried to spend %s at depth %d", txPrev.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - pindex->nHeight);
1437 // ppcoin: check transaction timestamp
1438 if (txPrev.nTime > nTime)
1439 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
1441 // Check for negative or overflow input values
1442 nValueIn += txPrev.vout[prevout.n].nValue;
1443 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1444 return DoS(100, error("ConnectInputs() : txin values out of range"));
1447 // The first loop above does all the inexpensive checks.
1448 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1449 // Helps prevent CPU exhaustion attacks.
1450 for (unsigned int i = 0; i < vin.size(); i++)
1452 COutPoint prevout = vin[i].prevout;
1453 assert(inputs.count(prevout.hash) > 0);
1454 CTxIndex& txindex = inputs[prevout.hash].first;
1455 CTransaction& txPrev = inputs[prevout.hash].second;
1457 // Check for conflicts (double-spend)
1458 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1459 // for an attacker to attempt to split the network.
1460 if (!txindex.vSpent[prevout.n].IsNull())
1461 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());
1463 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1464 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1465 // still computed and checked, and any change will be caught at the next checkpoint.
1466 if (!(fBlock && (nBestHeight < Checkpoints::GetTotalBlocksEstimate())))
1469 if (!VerifySignature(txPrev, *this, i, fStrictPayToScriptHash, 0))
1471 // only during transition phase for P2SH: do not invoke anti-DoS code for
1472 // potentially old clients relaying bad P2SH transactions
1473 if (fStrictPayToScriptHash && VerifySignature(txPrev, *this, i, false, 0))
1474 return error("ConnectInputs() : %s P2SH VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1476 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1480 // Mark outpoints as spent
1481 txindex.vSpent[prevout.n] = posThisTx;
1484 if (fBlock || fMiner)
1486 mapTestPool[prevout.hash] = txindex;
1492 // ppcoin: coin stake tx earns reward instead of paying fee
1494 if (!GetCoinAge(txdb, nCoinAge))
1495 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1497 int64 nStakeReward = GetValueOut() - nValueIn;
1498 int64 nCalculatedStakeReward = GetProofOfStakeReward(nCoinAge, pindexBlock->nBits, nTime) - GetMinFee() + MIN_TX_FEE;
1500 if (nStakeReward > nCalculatedStakeReward)
1501 return DoS(100, error("ConnectInputs() : coinstake pays too much(actual=%"PRI64d" vs calculated=%"PRI64d")", nStakeReward, nCalculatedStakeReward));
1505 if (nValueIn < GetValueOut())
1506 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1508 // Tally transaction fees
1509 int64 nTxFee = nValueIn - GetValueOut();
1511 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1513 // enforce transaction fees for every block until 1 May 2014 04:00:00 GMT
1514 if (!fTestNet && nTxFee < GetMinFee() && nTime < OUTPUT_SWITCH_TIME)
1515 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;
1518 if (!MoneyRange(nFees))
1519 return DoS(100, error("ConnectInputs() : nFees out of range"));
1527 bool CTransaction::ClientConnectInputs()
1532 // Take over previous transactions' spent pointers
1536 for (unsigned int i = 0; i < vin.size(); i++)
1538 // Get prev tx from single transactions in memory
1539 COutPoint prevout = vin[i].prevout;
1540 if (!mempool.exists(prevout.hash))
1542 CTransaction& txPrev = mempool.lookup(prevout.hash);
1544 if (prevout.n >= txPrev.vout.size())
1548 if (!VerifySignature(txPrev, *this, i, true, 0))
1549 return error("ConnectInputs() : VerifySignature failed");
1551 ///// this is redundant with the mempool.mapNextTx stuff,
1552 ///// not sure which I want to get rid of
1553 ///// this has to go away now that posNext is gone
1554 // // Check for conflicts
1555 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1556 // return error("ConnectInputs() : prev tx already used");
1558 // // Flag outpoints as used
1559 // txPrev.vout[prevout.n].posNext = posThisTx;
1561 nValueIn += txPrev.vout[prevout.n].nValue;
1563 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1564 return error("ClientConnectInputs() : txin values out of range");
1566 if (GetValueOut() > nValueIn)
1576 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1578 // Disconnect in reverse order
1579 for (int i = vtx.size()-1; i >= 0; i--)
1580 if (!vtx[i].DisconnectInputs(txdb))
1583 // Update block index on disk without changing it in memory.
1584 // The memory index structure will be changed after the db commits.
1587 CDiskBlockIndex blockindexPrev(pindex->pprev);
1588 blockindexPrev.hashNext = 0;
1589 if (!txdb.WriteBlockIndex(blockindexPrev))
1590 return error("DisconnectBlock() : WriteBlockIndex failed");
1593 // ppcoin: clean up wallet after disconnecting coinstake
1594 BOOST_FOREACH(CTransaction& tx, vtx)
1595 SyncWithWallets(tx, this, false, false);
1600 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex, bool fJustCheck)
1602 // Check it again in case a previous version let a bad block in, but skip BlockSig checking
1603 if (!CheckBlock(!fJustCheck, !fJustCheck, false))
1606 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1607 // unless those are already completely spent.
1608 // If such overwrites are allowed, coinbases and transactions depending upon those
1609 // can be duplicated to remove the ability to spend the first instance -- even after
1610 // being sent to another address.
1611 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1612 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1613 // already refuses previously-known transaction ids entirely.
1614 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1615 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1616 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1617 // initial block download.
1618 bool fEnforceBIP30 = true; // Always active in NovaCoin
1619 bool fStrictPayToScriptHash = true; // Always active in NovaCoin
1621 //// issue here: it doesn't know the version
1622 unsigned int nTxPos;
1624 // FetchInputs treats CDiskTxPos(1,1,1) as a special "refer to memorypool" indicator
1625 // Since we're just checking the block and not actually connecting it, it might not (and probably shouldn't) be on the disk to get the transaction from
1628 nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1630 map<uint256, CTxIndex> mapQueuedChanges;
1633 int64 nValueOut = 0;
1634 unsigned int nSigOps = 0;
1635 BOOST_FOREACH(CTransaction& tx, vtx)
1637 uint256 hashTx = tx.GetHash();
1639 if (fEnforceBIP30) {
1640 CTxIndex txindexOld;
1641 if (txdb.ReadTxIndex(hashTx, txindexOld)) {
1642 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1648 nSigOps += tx.GetLegacySigOpCount();
1649 if (nSigOps > MAX_BLOCK_SIGOPS)
1650 return DoS(100, error("ConnectBlock() : too many sigops"));
1652 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1654 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1656 MapPrevTx mapInputs;
1657 if (tx.IsCoinBase())
1658 nValueOut += tx.GetValueOut();
1662 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1665 if (fStrictPayToScriptHash)
1667 // Add in sigops done by pay-to-script-hash inputs;
1668 // this is to prevent a "rogue miner" from creating
1669 // an incredibly-expensive-to-validate block.
1670 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1671 if (nSigOps > MAX_BLOCK_SIGOPS)
1672 return DoS(100, error("ConnectBlock() : too many sigops"));
1675 int64 nTxValueIn = tx.GetValueIn(mapInputs);
1676 int64 nTxValueOut = tx.GetValueOut();
1677 nValueIn += nTxValueIn;
1678 nValueOut += nTxValueOut;
1679 if (!tx.IsCoinStake())
1680 nFees += nTxValueIn - nTxValueOut;
1682 if (!tx.ConnectInputs(txdb, mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fStrictPayToScriptHash))
1686 mapQueuedChanges[hashTx] = CTxIndex(posThisTx, tx.vout.size());
1689 // ppcoin: track money supply and mint amount info
1690 pindex->nMint = nValueOut - nValueIn + nFees;
1691 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1692 if (!txdb.WriteBlockIndex(CDiskBlockIndex(pindex)))
1693 return error("Connect() : WriteBlockIndex for pindex failed");
1695 // ppcoin: fees are not collected by miners as in bitcoin
1696 // ppcoin: fees are destroyed to compensate the entire network
1697 if (fDebug && GetBoolArg("-printcreation"))
1698 printf("ConnectBlock() : destroy=%s nFees=%"PRI64d"\n", FormatMoney(nFees).c_str(), nFees);
1703 // Write queued txindex changes
1704 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1706 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1707 return error("ConnectBlock() : UpdateTxIndex failed");
1710 // Update block index on disk without changing it in memory.
1711 // The memory index structure will be changed after the db commits.
1714 CDiskBlockIndex blockindexPrev(pindex->pprev);
1715 blockindexPrev.hashNext = pindex->GetBlockHash();
1716 if (!txdb.WriteBlockIndex(blockindexPrev))
1717 return error("ConnectBlock() : WriteBlockIndex failed");
1720 // Watch for transactions paying to me
1721 BOOST_FOREACH(CTransaction& tx, vtx)
1722 SyncWithWallets(tx, this, true);
1727 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1729 printf("REORGANIZE\n");
1732 CBlockIndex* pfork = pindexBest;
1733 CBlockIndex* plonger = pindexNew;
1734 while (pfork != plonger)
1736 while (plonger->nHeight > pfork->nHeight)
1737 if (!(plonger = plonger->pprev))
1738 return error("Reorganize() : plonger->pprev is null");
1739 if (pfork == plonger)
1741 if (!(pfork = pfork->pprev))
1742 return error("Reorganize() : pfork->pprev is null");
1745 // List of what to disconnect
1746 vector<CBlockIndex*> vDisconnect;
1747 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1748 vDisconnect.push_back(pindex);
1750 // List of what to connect
1751 vector<CBlockIndex*> vConnect;
1752 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1753 vConnect.push_back(pindex);
1754 reverse(vConnect.begin(), vConnect.end());
1756 printf("REORGANIZE: Disconnect %"PRIszu" blocks; %s..%s\n", vDisconnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexBest->GetBlockHash().ToString().substr(0,20).c_str());
1757 printf("REORGANIZE: Connect %"PRIszu" blocks; %s..%s\n", vConnect.size(), pfork->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->GetBlockHash().ToString().substr(0,20).c_str());
1759 // Disconnect shorter branch
1760 vector<CTransaction> vResurrect;
1761 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1764 if (!block.ReadFromDisk(pindex))
1765 return error("Reorganize() : ReadFromDisk for disconnect failed");
1766 if (!block.DisconnectBlock(txdb, pindex))
1767 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1769 // Queue memory transactions to resurrect
1770 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1771 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1772 vResurrect.push_back(tx);
1775 // Connect longer branch
1776 vector<CTransaction> vDelete;
1777 for (unsigned int i = 0; i < vConnect.size(); i++)
1779 CBlockIndex* pindex = vConnect[i];
1781 if (!block.ReadFromDisk(pindex))
1782 return error("Reorganize() : ReadFromDisk for connect failed");
1783 if (!block.ConnectBlock(txdb, pindex))
1786 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1789 // Queue memory transactions to delete
1790 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1791 vDelete.push_back(tx);
1793 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1794 return error("Reorganize() : WriteHashBestChain failed");
1796 // Make sure it's successfully written to disk before changing memory structure
1797 if (!txdb.TxnCommit())
1798 return error("Reorganize() : TxnCommit failed");
1800 // Disconnect shorter branch
1801 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1803 pindex->pprev->pnext = NULL;
1805 // Connect longer branch
1806 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1808 pindex->pprev->pnext = pindex;
1810 // Resurrect memory transactions that were in the disconnected branch
1811 BOOST_FOREACH(CTransaction& tx, vResurrect)
1812 tx.AcceptToMemoryPool(txdb, false);
1814 // Delete redundant memory transactions that are in the connected branch
1815 BOOST_FOREACH(CTransaction& tx, vDelete)
1818 printf("REORGANIZE: done\n");
1824 // Called from inside SetBestChain: attaches a block to the new best chain being built
1825 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1827 uint256 hash = GetHash();
1829 // Adding to current best branch
1830 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1833 InvalidChainFound(pindexNew);
1836 if (!txdb.TxnCommit())
1837 return error("SetBestChain() : TxnCommit failed");
1839 // Add to current best branch
1840 pindexNew->pprev->pnext = pindexNew;
1842 // Delete redundant memory transactions
1843 BOOST_FOREACH(CTransaction& tx, vtx)
1849 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1851 uint256 hash = GetHash();
1853 if (!txdb.TxnBegin())
1854 return error("SetBestChain() : TxnBegin failed");
1856 if (pindexGenesisBlock == NULL && hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1858 txdb.WriteHashBestChain(hash);
1859 if (!txdb.TxnCommit())
1860 return error("SetBestChain() : TxnCommit failed");
1861 pindexGenesisBlock = pindexNew;
1863 else if (hashPrevBlock == hashBestChain)
1865 if (!SetBestChainInner(txdb, pindexNew))
1866 return error("SetBestChain() : SetBestChainInner failed");
1870 // the first block in the new chain that will cause it to become the new best chain
1871 CBlockIndex *pindexIntermediate = pindexNew;
1873 // list of blocks that need to be connected afterwards
1874 std::vector<CBlockIndex*> vpindexSecondary;
1876 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1877 // Try to limit how much needs to be done inside
1878 while (pindexIntermediate->pprev && pindexIntermediate->pprev->nChainTrust > pindexBest->nChainTrust)
1880 vpindexSecondary.push_back(pindexIntermediate);
1881 pindexIntermediate = pindexIntermediate->pprev;
1884 if (!vpindexSecondary.empty())
1885 printf("Postponing %"PRIszu" reconnects\n", vpindexSecondary.size());
1887 // Switch to new best branch
1888 if (!Reorganize(txdb, pindexIntermediate))
1891 InvalidChainFound(pindexNew);
1892 return error("SetBestChain() : Reorganize failed");
1895 // Connect further blocks
1896 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1899 if (!block.ReadFromDisk(pindex))
1901 printf("SetBestChain() : ReadFromDisk failed\n");
1904 if (!txdb.TxnBegin()) {
1905 printf("SetBestChain() : TxnBegin 2 failed\n");
1908 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1909 if (!block.SetBestChainInner(txdb, pindex))
1914 // Update best block in wallet (so we can detect restored wallets)
1915 bool fIsInitialDownload = IsInitialBlockDownload();
1916 if (!fIsInitialDownload)
1918 const CBlockLocator locator(pindexNew);
1919 ::SetBestChain(locator);
1923 hashBestChain = hash;
1924 pindexBest = pindexNew;
1925 pblockindexFBBHLast = NULL;
1926 nBestHeight = pindexBest->nHeight;
1927 nBestChainTrust = pindexNew->nChainTrust;
1928 nTimeBestReceived = GetTime();
1929 nTransactionsUpdated++;
1931 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1933 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1934 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1935 CBigNum(nBestChainTrust).ToString().c_str(),
1936 nBestBlockTrust.Get64(),
1937 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1939 // Check the version of the last 100 blocks to see if we need to upgrade:
1940 if (!fIsInitialDownload)
1943 const CBlockIndex* pindex = pindexBest;
1944 for (int i = 0; i < 100 && pindex != NULL; i++)
1946 if (pindex->nVersion > CBlock::CURRENT_VERSION)
1948 pindex = pindex->pprev;
1951 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
1952 if (nUpgraded > 100/2)
1953 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
1954 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
1957 std::string strCmd = GetArg("-blocknotify", "");
1959 if (!fIsInitialDownload && !strCmd.empty())
1961 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
1962 boost::thread t(runCommand, strCmd); // thread runs free
1968 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
1969 // Only those coins meeting minimum age requirement counts. As those
1970 // transactions not in main chain are not currently indexed so we
1971 // might not find out about their coin age. Older transactions are
1972 // guaranteed to be in main chain by sync-checkpoint. This rule is
1973 // introduced to help nodes establish a consistent view of the coin
1974 // age (trust score) of competing branches.
1975 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64& nCoinAge) const
1977 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
1983 BOOST_FOREACH(const CTxIn& txin, vin)
1985 // First try finding the previous transaction in database
1986 CTransaction txPrev;
1988 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
1989 continue; // previous transaction not in main chain
1990 if (nTime < txPrev.nTime)
1991 return false; // Transaction timestamp violation
1993 // Read block header
1995 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
1996 return false; // unable to read block of previous transaction
1997 if (block.GetBlockTime() + nStakeMinAge > nTime)
1998 continue; // only count coins meeting min age requirement
2000 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2001 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
2003 if (fDebug && GetBoolArg("-printcoinage"))
2004 printf("coin age nValueIn=%"PRI64d" nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
2007 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
2008 if (fDebug && GetBoolArg("-printcoinage"))
2009 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
2010 nCoinAge = bnCoinDay.getuint64();
2014 // ppcoin: total coin age spent in block, in the unit of coin-days.
2015 bool CBlock::GetCoinAge(uint64& nCoinAge) const
2020 BOOST_FOREACH(const CTransaction& tx, vtx)
2023 if (tx.GetCoinAge(txdb, nTxCoinAge))
2024 nCoinAge += nTxCoinAge;
2029 if (nCoinAge == 0) // block coin age minimum 1 coin-day
2031 if (fDebug && GetBoolArg("-printcoinage"))
2032 printf("block coin age total nCoinDays=%"PRI64d"\n", nCoinAge);
2036 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
2038 // Check for duplicate
2039 uint256 hash = GetHash();
2040 if (mapBlockIndex.count(hash))
2041 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
2043 // Construct new block index object
2044 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
2046 return error("AddToBlockIndex() : new CBlockIndex failed");
2047 pindexNew->phashBlock = &hash;
2048 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
2049 if (miPrev != mapBlockIndex.end())
2051 pindexNew->pprev = (*miPrev).second;
2052 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
2055 // ppcoin: compute chain trust score
2056 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + pindexNew->GetBlockTrust();
2058 // ppcoin: compute stake entropy bit for stake modifier
2059 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nTime)))
2060 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
2062 // ppcoin: record proof-of-stake hash value
2063 if (pindexNew->IsProofOfStake())
2065 if (!mapProofOfStake.count(hash))
2066 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2067 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2070 // ppcoin: compute stake modifier
2071 uint64 nStakeModifier = 0;
2072 bool fGeneratedStakeModifier = false;
2073 if (!ComputeNextStakeModifier(pindexNew->pprev, nStakeModifier, fGeneratedStakeModifier))
2074 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2075 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2076 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2077 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2078 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016"PRI64x, pindexNew->nHeight, nStakeModifier);
2080 // Add to mapBlockIndex
2081 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2082 if (pindexNew->IsProofOfStake())
2083 setStakeSeen.insert(make_pair(pindexNew->prevoutStake, pindexNew->nStakeTime));
2084 pindexNew->phashBlock = &((*mi).first);
2086 // Write to disk block index
2088 if (!txdb.TxnBegin())
2090 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
2091 if (!txdb.TxnCommit())
2095 if (pindexNew->nChainTrust > nBestChainTrust)
2096 if (!SetBestChain(txdb, pindexNew))
2099 if (pindexNew == pindexBest)
2101 // Notify UI to display prev block's coinbase if it was ours
2102 static uint256 hashPrevBestCoinBase;
2103 UpdatedTransaction(hashPrevBestCoinBase);
2104 hashPrevBestCoinBase = vtx[0].GetHash();
2107 uiInterface.NotifyBlocksChanged();
2114 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot, bool fCheckSig) const
2116 // These are checks that are independent of context
2117 // that can be verified before saving an orphan block.
2120 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2121 return DoS(100, error("CheckBlock() : size limits failed"));
2123 // Check proof of work matches claimed amount
2124 if (fCheckPOW && IsProofOfWork() && !CheckProofOfWork(GetHash(), nBits))
2125 return DoS(50, error("CheckBlock() : proof of work failed"));
2128 if (GetBlockTime() > FutureDrift(GetAdjustedTime()))
2129 return error("CheckBlock() : block timestamp too far in the future");
2131 // First transaction must be coinbase, the rest must not be
2132 if (vtx.empty() || !vtx[0].IsCoinBase())
2133 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2134 for (unsigned int i = 1; i < vtx.size(); i++)
2135 if (vtx[i].IsCoinBase())
2136 return DoS(100, error("CheckBlock() : more than one coinbase"));
2138 // Check coinbase timestamp
2139 if (GetBlockTime() > FutureDrift((int64)vtx[0].nTime))
2140 return DoS(50, error("CheckBlock() : coinbase timestamp is too early"));
2142 if (IsProofOfStake())
2144 // Coinbase output should be empty if proof-of-stake block
2145 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2146 return DoS(100, error("CheckBlock() : coinbase output not empty for proof-of-stake block"));
2148 // Second transaction must be coinstake, the rest must not be
2149 if (vtx.empty() || !vtx[1].IsCoinStake())
2150 return DoS(100, error("CheckBlock() : second tx is not coinstake"));
2151 for (unsigned int i = 2; i < vtx.size(); i++)
2152 if (vtx[i].IsCoinStake())
2153 return DoS(100, error("CheckBlock() : more than one coinstake"));
2155 // Check coinstake timestamp
2156 if (!CheckCoinStakeTimestamp(GetBlockTime(), (int64)vtx[1].nTime))
2157 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%"PRI64d" nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2159 // NovaCoin: check proof-of-stake block signature
2160 if (fCheckSig && !CheckBlockSignature(true))
2161 return DoS(100, error("CheckBlock() : bad proof-of-stake block signature"));
2165 int64 nReward = GetProofOfWorkReward(nBits);
2166 // Check coinbase reward
2167 if (vtx[0].GetValueOut() > nReward)
2168 return DoS(50, error("CheckBlock() : coinbase reward exceeded (actual=%"PRI64d" vs calculated=%"PRI64d")",
2169 vtx[0].GetValueOut(),
2172 // Should we check proof-of-work block signature or not?
2174 // * Always skip on TestNet
2175 // * Perform checking for the first 9689 blocks
2176 // * Perform checking since last checkpoint until 20 Sep 2013 (will be removed after)
2178 if(!fTestNet && fCheckSig)
2180 bool checkEntropySig = (GetBlockTime() < ENTROPY_SWITCH_TIME);
2182 // NovaCoin: check proof-of-work block signature
2183 if (checkEntropySig && !CheckBlockSignature(false))
2184 return DoS(100, error("CheckBlock() : bad proof-of-work block signature"));
2188 // Check transactions
2189 BOOST_FOREACH(const CTransaction& tx, vtx)
2191 if (!tx.CheckTransaction())
2192 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2194 // ppcoin: check transaction timestamp
2195 if (GetBlockTime() < (int64)tx.nTime)
2196 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2199 // Check for duplicate txids. This is caught by ConnectInputs(),
2200 // but catching it earlier avoids a potential DoS attack:
2201 set<uint256> uniqueTx;
2202 BOOST_FOREACH(const CTransaction& tx, vtx)
2204 uniqueTx.insert(tx.GetHash());
2206 if (uniqueTx.size() != vtx.size())
2207 return DoS(100, error("CheckBlock() : duplicate transaction"));
2209 unsigned int nSigOps = 0;
2210 BOOST_FOREACH(const CTransaction& tx, vtx)
2212 nSigOps += tx.GetLegacySigOpCount();
2214 if (nSigOps > MAX_BLOCK_SIGOPS)
2215 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2217 // Check merkle root
2218 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2219 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2225 bool CBlock::AcceptBlock()
2227 // Check for duplicate
2228 uint256 hash = GetHash();
2229 if (mapBlockIndex.count(hash))
2230 return error("AcceptBlock() : block already in mapBlockIndex");
2232 // Get prev block index
2233 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
2234 if (mi == mapBlockIndex.end())
2235 return DoS(10, error("AcceptBlock() : prev block not found"));
2236 CBlockIndex* pindexPrev = (*mi).second;
2237 int nHeight = pindexPrev->nHeight+1;
2239 // Check proof-of-work or proof-of-stake
2240 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2241 return DoS(100, error("AcceptBlock() : incorrect %s", IsProofOfWork() ? "proof-of-work" : "proof-of-stake"));
2243 // Check timestamp against prev
2244 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || FutureDrift(GetBlockTime()) < pindexPrev->GetBlockTime())
2245 return error("AcceptBlock() : block's timestamp is too early");
2247 // Check that all transactions are finalized
2248 BOOST_FOREACH(const CTransaction& tx, vtx)
2249 if (!tx.IsFinal(nHeight, GetBlockTime()))
2250 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2252 // Check that the block chain matches the known block chain up to a checkpoint
2253 if (!Checkpoints::CheckHardened(nHeight, hash))
2254 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2256 bool cpSatisfies = Checkpoints::CheckSync(hash, pindexPrev);
2258 // Check that the block satisfies synchronized checkpoint
2259 if (CheckpointsMode == Checkpoints::STRICT && !cpSatisfies)
2260 return error("AcceptBlock() : rejected by synchronized checkpoint");
2262 if (CheckpointsMode == Checkpoints::ADVISORY && !cpSatisfies)
2263 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2265 // Enforce rule that the coinbase starts with serialized block height
2266 CScript expect = CScript() << nHeight;
2267 if (vtx[0].vin[0].scriptSig.size() < expect.size() ||
2268 !std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2269 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2271 // Write block to history file
2272 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2273 return error("AcceptBlock() : out of disk space");
2274 unsigned int nFile = -1;
2275 unsigned int nBlockPos = 0;
2276 if (!WriteToDisk(nFile, nBlockPos))
2277 return error("AcceptBlock() : WriteToDisk failed");
2278 if (!AddToBlockIndex(nFile, nBlockPos))
2279 return error("AcceptBlock() : AddToBlockIndex failed");
2281 // Relay inventory, but don't relay old inventory during initial block download
2282 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2283 if (hashBestChain == hash)
2286 BOOST_FOREACH(CNode* pnode, vNodes)
2287 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2288 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2291 // ppcoin: check pending sync-checkpoint
2292 Checkpoints::AcceptPendingSyncCheckpoint();
2297 uint256 CBlockIndex::GetBlockTrust() const
2300 bnTarget.SetCompact(nBits);
2306 if (!fTestNet && GetBlockTime() < CHAINCHECKS_SWITCH_TIME)
2307 return (IsProofOfStake()? ((CBigNum(1)<<256) / (bnTarget+1)).getuint256() : 1);
2311 // Calculate work amount for block
2312 uint256 nPoWTrust = (CBigNum(nPoWBase) / (bnTarget+1)).getuint256();
2314 // Set nPowTrust to 1 if we are checking PoS block or PoW difficulty is too low
2315 nPoWTrust = (IsProofOfStake() || nPoWTrust < 1) ? 1 : nPoWTrust;
2317 // Return nPoWTrust for the first 12 blocks
2318 if (pprev == NULL || pprev->nHeight < 12)
2321 const CBlockIndex* currentIndex = pprev;
2323 if(IsProofOfStake())
2325 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2327 // Return 1/3 of score if parent block is not the PoW block
2328 if (!pprev->IsProofOfWork())
2329 return (bnNewTrust / 3).getuint256();
2333 // Check last 12 blocks type
2334 while (pprev->nHeight - currentIndex->nHeight < 12)
2336 if (currentIndex->IsProofOfWork())
2338 currentIndex = currentIndex->pprev;
2341 // Return 1/3 of score if less than 3 PoW blocks found
2343 return (bnNewTrust / 3).getuint256();
2345 return bnNewTrust.getuint256();
2349 CBigNum bnLastBlockTrust = CBigNum(pprev->nChainTrust - pprev->pprev->nChainTrust);
2351 // Return nPoWTrust + 2/3 of previous block score if two parent blocks are not PoS blocks
2352 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2353 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2357 // Check last 12 blocks type
2358 while (pprev->nHeight - currentIndex->nHeight < 12)
2360 if (currentIndex->IsProofOfStake())
2362 currentIndex = currentIndex->pprev;
2365 // Return nPoWTrust + 2/3 of previous block score if less than 7 PoS blocks found
2367 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2369 bnTarget.SetCompact(pprev->nBits);
2374 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2376 // Return nPoWTrust + full trust score for previous block nBits
2377 return nPoWTrust + bnNewTrust.getuint256();
2381 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2383 unsigned int nFound = 0;
2384 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2386 if (pstart->nVersion >= minVersion)
2388 pstart = pstart->pprev;
2390 return (nFound >= nRequired);
2393 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2395 // Check for duplicate
2396 uint256 hash = pblock->GetHash();
2397 if (mapBlockIndex.count(hash))
2398 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2399 if (mapOrphanBlocks.count(hash))
2400 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2402 // ppcoin: check proof-of-stake
2403 // Limited duplicity on stake: prevents block flood attack
2404 // Duplicate stake allowed only when there is orphan child block
2405 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2406 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());
2408 // Preliminary checks
2409 if (!pblock->CheckBlock())
2410 return error("ProcessBlock() : CheckBlock FAILED");
2412 // ppcoin: verify hash target and signature of coinstake tx
2413 if (pblock->IsProofOfStake())
2415 uint256 hashProofOfStake = 0, targetProofOfStake = 0;
2416 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake, targetProofOfStake))
2418 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2419 return false; // do not error here as we expect this during initial block download
2421 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2422 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2425 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2426 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2428 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2429 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2431 bnNewBlock.SetCompact(pblock->nBits);
2434 if (pblock->IsProofOfStake())
2435 bnRequired.SetCompact(ComputeMinStake(GetLastBlockIndex(pcheckpoint, true)->nBits, deltaTime, pblock->nTime));
2437 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, false)->nBits, deltaTime));
2439 if (bnNewBlock > bnRequired)
2442 pfrom->Misbehaving(100);
2443 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2447 // ppcoin: ask for pending sync-checkpoint if any
2448 if (!IsInitialBlockDownload())
2449 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2451 // If don't already have its previous block, shunt it off to holding area until we get it
2452 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2454 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2455 CBlock* pblock2 = new CBlock(*pblock);
2456 // ppcoin: check proof-of-stake
2457 if (pblock2->IsProofOfStake())
2459 // Limited duplicity on stake: prevents block flood attack
2460 // Duplicate stake allowed only when there is orphan child block
2461 if (setStakeSeenOrphan.count(pblock2->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2462 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());
2464 setStakeSeenOrphan.insert(pblock2->GetProofOfStake());
2466 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2467 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2469 // Ask this guy to fill in what we're missing
2472 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2473 // ppcoin: getblocks may not obtain the ancestor block rejected
2474 // earlier by duplicate-stake check so we ask for it again directly
2475 if (!IsInitialBlockDownload())
2476 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2482 if (!pblock->AcceptBlock())
2483 return error("ProcessBlock() : AcceptBlock FAILED");
2485 // Recursively process any orphan blocks that depended on this one
2486 vector<uint256> vWorkQueue;
2487 vWorkQueue.push_back(hash);
2488 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2490 uint256 hashPrev = vWorkQueue[i];
2491 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2492 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2495 CBlock* pblockOrphan = (*mi).second;
2496 if (pblockOrphan->AcceptBlock())
2497 vWorkQueue.push_back(pblockOrphan->GetHash());
2498 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2499 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2500 delete pblockOrphan;
2502 mapOrphanBlocksByPrev.erase(hashPrev);
2505 printf("ProcessBlock: ACCEPTED\n");
2507 // ppcoin: if responsible for sync-checkpoint send it
2508 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2509 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2514 // novacoin: attempt to generate suitable proof-of-stake
2515 bool CBlock::SignBlock(CWallet& wallet)
2517 // if we are trying to sign
2518 // something except proof-of-stake block template
2519 if (!vtx[0].vout[0].IsEmpty())
2522 // if we are trying to sign
2523 // a complete proof-of-stake block
2524 if (IsProofOfStake())
2527 static int64 nLastCoinStakeSearchTime = GetAdjustedTime(); // startup timestamp
2530 CTransaction txCoinStake;
2531 int64 nSearchTime = txCoinStake.nTime; // search to current time
2533 if (nSearchTime > nLastCoinStakeSearchTime)
2535 if (wallet.CreateCoinStake(wallet, nBits, nSearchTime-nLastCoinStakeSearchTime, txCoinStake, key))
2537 if (txCoinStake.nTime >= max(pindexBest->GetMedianTimePast()+1, PastDrift(pindexBest->GetBlockTime())))
2539 // make sure coinstake would meet timestamp protocol
2540 // as it would be the same as the block timestamp
2541 vtx[0].nTime = nTime = txCoinStake.nTime;
2542 nTime = max(pindexBest->GetMedianTimePast()+1, GetMaxTransactionTime());
2543 nTime = max(GetBlockTime(), PastDrift(pindexBest->GetBlockTime()));
2545 // we have to make sure that we have no future timestamps in
2546 // our transactions set
2547 for (vector<CTransaction>::iterator it = vtx.begin(); it != vtx.end();)
2548 if (it->nTime > nTime) { it = vtx.erase(it); } else { ++it; }
2550 vtx.insert(vtx.begin() + 1, txCoinStake);
2551 hashMerkleRoot = BuildMerkleTree();
2553 // append a signature to our block
2554 return key.Sign(GetHash(), vchBlockSig);
2557 nLastCoinStakeSearchInterval = nSearchTime - nLastCoinStakeSearchTime;
2558 nLastCoinStakeSearchTime = nSearchTime;
2564 // ppcoin: check block signature
2565 bool CBlock::CheckBlockSignature(bool fProofOfStake) const
2567 if (GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
2568 return vchBlockSig.empty();
2570 vector<valtype> vSolutions;
2571 txnouttype whichType;
2575 const CTxOut& txout = vtx[1].vout[1];
2577 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2579 if (whichType == TX_PUBKEY)
2581 valtype& vchPubKey = vSolutions[0];
2583 if (!key.SetPubKey(vchPubKey))
2585 if (vchBlockSig.empty())
2587 return key.Verify(GetHash(), vchBlockSig);
2592 for(unsigned int i = 0; i < vtx[0].vout.size(); i++)
2594 const CTxOut& txout = vtx[0].vout[i];
2596 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2599 if (whichType == TX_PUBKEY)
2602 valtype& vchPubKey = vSolutions[0];
2604 if (!key.SetPubKey(vchPubKey))
2606 if (vchBlockSig.empty())
2608 if(!key.Verify(GetHash(), vchBlockSig))
2618 bool CheckDiskSpace(uint64 nAdditionalBytes)
2620 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2622 // Check for nMinDiskSpace bytes (currently 50MB)
2623 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2626 string strMessage = _("Warning: Disk space is low!");
2627 strMiscWarning = strMessage;
2628 printf("*** %s\n", strMessage.c_str());
2629 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2636 static filesystem::path BlockFilePath(unsigned int nFile)
2638 string strBlockFn = strprintf("blk%04u.dat", nFile);
2639 return GetDataDir() / strBlockFn;
2642 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
2644 if ((nFile < 1) || (nFile == (unsigned int) -1))
2646 FILE* file = fopen(BlockFilePath(nFile).string().c_str(), pszMode);
2649 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
2651 if (fseek(file, nBlockPos, SEEK_SET) != 0)
2660 static unsigned int nCurrentBlockFile = 1;
2662 FILE* AppendBlockFile(unsigned int& nFileRet)
2667 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
2670 if (fseek(file, 0, SEEK_END) != 0)
2672 // FAT32 file size max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
2673 if (ftell(file) < (long)(0x7F000000 - MAX_SIZE))
2675 nFileRet = nCurrentBlockFile;
2679 nCurrentBlockFile++;
2683 bool LoadBlockIndex(bool fAllowNew)
2685 CBigNum bnTrustedModulus;
2689 pchMessageStart[0] = 0xcd;
2690 pchMessageStart[1] = 0xf2;
2691 pchMessageStart[2] = 0xc0;
2692 pchMessageStart[3] = 0xef;
2694 bnTrustedModulus.SetHex("f0d14cf72623dacfe738d0892b599be0f31052239cddd95a3f25101c801dc990453b38c9434efe3f372db39a32c2bb44cbaea72d62c8931fa785b0ec44531308df3e46069be5573e49bb29f4d479bfc3d162f57a5965db03810be7636da265bfced9c01a6b0296c77910ebdc8016f70174f0f18a57b3b971ac43a934c6aedbc5c866764a3622b5b7e3f9832b8b3f133c849dbcc0396588abcd1e41048555746e4823fb8aba5b3d23692c6857fccce733d6bb6ec1d5ea0afafecea14a0f6f798b6b27f77dc989c557795cc39a0940ef6bb29a7fc84135193a55bcfc2f01dd73efad1b69f45a55198bd0e6bef4d338e452f6a420f1ae2b1167b923f76633ab6e55");
2695 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2696 nStakeMinAge = 2 * 60 * 60; // test net min age is 2 hours
2697 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2698 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2699 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
2703 bnTrustedModulus.SetHex("d01f952e1090a5a72a3eda261083256596ccc192935ae1454c2bafd03b09e6ed11811be9f3a69f5783bbbced8c6a0c56621f42c2d19087416facf2f13cc7ed7159d1c5253119612b8449f0c7f54248e382d30ecab1928dbf075c5425dcaee1a819aa13550e0f3227b8c685b14e0eae094d65d8a610a6f49fff8145259d1187e4c6a472fa5868b2b67f957cb74b787f4311dbc13c97a2ca13acdb876ff506ebecbb904548c267d68868e07a32cd9ed461fbc2f920e9940e7788fed2e4817f274df5839c2196c80abe5c486df39795186d7bc86314ae1e8342f3c884b158b4b05b4302754bf351477d35370bad6639b2195d30006b77bf3dbb28b848fd9ecff5662bf39dde0c974e83af51b0d3d642d43834827b8c3b189065514636b8f2a59c42ba9b4fc4975d4827a5d89617a3873e4b377b4d559ad165748632bd928439cfbc5a8ef49bc2220e0b15fb0aa302367d5e99e379a961c1bc8cf89825da5525e3c8f14d7d8acca2fa9c133a2176ae69874d8b1d38b26b9c694e211018005a97b40848681b9dd38feb2de141626fb82591aad20dc629b2b6421cef1227809551a0e4e943ab99841939877f18f2d9c0addc93cf672e26b02ed94da3e6d329e8ac8f3736eebbf37bb1a21e5aadf04ee8e3b542f876aa88b2adf2608bd86329b7f7a56fd0dc1c40b48188731d11082aea360c62a0840c2db3dad7178fd7e359317ae081");
2706 // Set up the Zerocoin Params object
2707 ZCParams = new libzerocoin::Params(bnTrustedModulus);
2713 if (!txdb.LoadBlockIndex())
2717 // Init with genesis block
2719 if (mapBlockIndex.empty())
2728 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
2729 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2730 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2732 // vMerkleTree: 4cb33b3b6a
2736 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
2737 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2738 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2740 // vMerkleTree: 4cb33b3b6a
2742 const char* pszTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
2744 txNew.nTime = 1360105017;
2745 txNew.vin.resize(1);
2746 txNew.vout.resize(1);
2747 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
2748 txNew.vout[0].SetEmpty();
2750 block.vtx.push_back(txNew);
2751 block.hashPrevBlock = 0;
2752 block.hashMerkleRoot = block.BuildMerkleTree();
2754 block.nTime = 1360105017;
2755 block.nBits = bnProofOfWorkLimit.GetCompact();
2756 block.nNonce = !fTestNet ? 1575379 : 46534;
2759 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
2761 assert(block.GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
2762 assert(block.CheckBlock());
2764 // Start new block file
2766 unsigned int nBlockPos;
2767 if (!block.WriteToDisk(nFile, nBlockPos))
2768 return error("LoadBlockIndex() : writing genesis block to disk failed");
2769 if (!block.AddToBlockIndex(nFile, nBlockPos))
2770 return error("LoadBlockIndex() : genesis block not accepted");
2772 // ppcoin: initialize synchronized checkpoint
2773 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
2774 return error("LoadBlockIndex() : failed to init sync checkpoint");
2777 string strPubKey = "";
2779 // if checkpoint master key changed must reset sync-checkpoint
2780 if (!txdb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
2782 // write checkpoint master key to db
2784 if (!txdb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
2785 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
2786 if (!txdb.TxnCommit())
2787 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
2788 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
2789 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
2797 void PrintBlockTree()
2799 // pre-compute tree structure
2800 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2801 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2803 CBlockIndex* pindex = (*mi).second;
2804 mapNext[pindex->pprev].push_back(pindex);
2806 //while (rand() % 3 == 0)
2807 // mapNext[pindex->pprev].push_back(pindex);
2810 vector<pair<int, CBlockIndex*> > vStack;
2811 vStack.push_back(make_pair(0, pindexGenesisBlock));
2814 while (!vStack.empty())
2816 int nCol = vStack.back().first;
2817 CBlockIndex* pindex = vStack.back().second;
2820 // print split or gap
2821 if (nCol > nPrevCol)
2823 for (int i = 0; i < nCol-1; i++)
2827 else if (nCol < nPrevCol)
2829 for (int i = 0; i < nCol; i++)
2836 for (int i = 0; i < nCol; i++)
2841 block.ReadFromDisk(pindex);
2842 printf("%d (%u,%u) %s %08x %s mint %7s tx %"PRIszu"",
2846 block.GetHash().ToString().c_str(),
2848 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2849 FormatMoney(pindex->nMint).c_str(),
2852 PrintWallets(block);
2854 // put the main time-chain first
2855 vector<CBlockIndex*>& vNext = mapNext[pindex];
2856 for (unsigned int i = 0; i < vNext.size(); i++)
2858 if (vNext[i]->pnext)
2860 swap(vNext[0], vNext[i]);
2866 for (unsigned int i = 0; i < vNext.size(); i++)
2867 vStack.push_back(make_pair(nCol+i, vNext[i]));
2871 bool LoadExternalBlockFile(FILE* fileIn)
2873 int64 nStart = GetTimeMillis();
2879 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
2880 unsigned int nPos = 0;
2881 while (nPos != (unsigned int)-1 && blkdat.good() && !fRequestShutdown)
2883 unsigned char pchData[65536];
2885 fseek(blkdat, nPos, SEEK_SET);
2886 int nRead = fread(pchData, 1, sizeof(pchData), blkdat);
2889 nPos = (unsigned int)-1;
2892 void* nFind = memchr(pchData, pchMessageStart[0], nRead+1-sizeof(pchMessageStart));
2895 if (memcmp(nFind, pchMessageStart, sizeof(pchMessageStart))==0)
2897 nPos += ((unsigned char*)nFind - pchData) + sizeof(pchMessageStart);
2900 nPos += ((unsigned char*)nFind - pchData) + 1;
2903 nPos += sizeof(pchData) - sizeof(pchMessageStart) + 1;
2904 } while(!fRequestShutdown);
2905 if (nPos == (unsigned int)-1)
2907 fseek(blkdat, nPos, SEEK_SET);
2910 if (nSize > 0 && nSize <= MAX_BLOCK_SIZE)
2914 if (ProcessBlock(NULL,&block))
2922 catch (std::exception &e) {
2923 printf("%s() : Deserialize or I/O error caught during load\n",
2924 __PRETTY_FUNCTION__);
2927 printf("Loaded %i blocks from external file in %"PRI64d"ms\n", nLoaded, GetTimeMillis() - nStart);
2931 //////////////////////////////////////////////////////////////////////////////
2936 extern map<uint256, CAlert> mapAlerts;
2937 extern CCriticalSection cs_mapAlerts;
2939 extern string strMintMessage;
2940 extern string strMintWarning;
2942 string GetWarnings(string strFor)
2945 string strStatusBar;
2948 if (GetBoolArg("-testsafemode"))
2951 // wallet lock warning for minting
2952 if (strMintWarning != "")
2955 strStatusBar = strMintWarning;
2958 // Misc warnings like out of disk space and clock is wrong
2959 if (strMiscWarning != "")
2962 strStatusBar = strMiscWarning;
2965 // if detected invalid checkpoint enter safe mode
2966 if (Checkpoints::hashInvalidCheckpoint != 0)
2969 strStatusBar = strRPC = _("WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.");
2975 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
2977 const CAlert& alert = item.second;
2978 if (alert.AppliesToMe() && alert.nPriority > nPriority)
2980 nPriority = alert.nPriority;
2981 strStatusBar = alert.strStatusBar;
2982 if (nPriority > 1000)
2983 strRPC = strStatusBar;
2988 if (strFor == "statusbar")
2989 return strStatusBar;
2990 else if (strFor == "rpc")
2992 assert(!"GetWarnings() : invalid parameter");
3003 //////////////////////////////////////////////////////////////////////////////
3009 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
3015 bool txInMap = false;
3018 txInMap = (mempool.exists(inv.hash));
3021 mapOrphanTransactions.count(inv.hash) ||
3022 txdb.ContainsTx(inv.hash);
3026 return mapBlockIndex.count(inv.hash) ||
3027 mapOrphanBlocks.count(inv.hash);
3029 // Don't know what it is, just say we already got one
3036 // The message start string is designed to be unlikely to occur in normal data.
3037 // The characters are rarely used upper ASCII, not valid as UTF-8, and produce
3038 // a large 4-byte int at any alignment.
3039 unsigned char pchMessageStart[4] = { 0xe4, 0xe8, 0xe9, 0xe5 };
3041 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
3043 static map<CService, CPubKey> mapReuseKey;
3044 RandAddSeedPerfmon();
3046 printf("received: %s (%"PRIszu" bytes)\n", strCommand.c_str(), vRecv.size());
3047 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
3049 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3053 if (strCommand == "version")
3055 // Each connection can only send one version message
3056 if (pfrom->nVersion != 0)
3058 pfrom->Misbehaving(1);
3066 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3067 if (pfrom->nVersion < MIN_PROTO_VERSION)
3069 // Since February 20, 2012, the protocol is initiated at version 209,
3070 // and earlier versions are no longer supported
3071 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3072 pfrom->fDisconnect = true;
3076 if (pfrom->nVersion == 10300)
3077 pfrom->nVersion = 300;
3079 vRecv >> addrFrom >> nNonce;
3081 vRecv >> pfrom->strSubVer;
3083 vRecv >> pfrom->nStartingHeight;
3085 if (pfrom->fInbound && addrMe.IsRoutable())
3087 pfrom->addrLocal = addrMe;
3091 // Disconnect if we connected to ourself
3092 if (nNonce == nLocalHostNonce && nNonce > 1)
3094 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3095 pfrom->fDisconnect = true;
3099 // record my external IP reported by peer
3100 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3101 addrSeenByPeer = addrMe;
3103 // Be shy and don't send version until we hear
3104 if (pfrom->fInbound)
3105 pfrom->PushVersion();
3107 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3109 AddTimeData(pfrom->addr, nTime);
3112 pfrom->PushMessage("verack");
3113 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3115 if (!pfrom->fInbound)
3117 // Advertise our address
3118 if (!fNoListen && !IsInitialBlockDownload())
3120 CAddress addr = GetLocalAddress(&pfrom->addr);
3121 if (addr.IsRoutable())
3122 pfrom->PushAddress(addr);
3125 // Get recent addresses
3126 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3128 pfrom->PushMessage("getaddr");
3129 pfrom->fGetAddr = true;
3131 addrman.Good(pfrom->addr);
3133 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3135 addrman.Add(addrFrom, addrFrom);
3136 addrman.Good(addrFrom);
3140 // Ask the first connected node for block updates
3141 static int nAskedForBlocks = 0;
3142 if (!pfrom->fClient && !pfrom->fOneShot &&
3143 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3144 (pfrom->nVersion < NOBLKS_VERSION_START ||
3145 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3146 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3149 pfrom->PushGetBlocks(pindexBest, uint256(0));
3155 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3156 item.second.RelayTo(pfrom);
3159 // Relay sync-checkpoint
3161 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3162 if (!Checkpoints::checkpointMessage.IsNull())
3163 Checkpoints::checkpointMessage.RelayTo(pfrom);
3166 pfrom->fSuccessfullyConnected = true;
3168 printf("receive version message: version %d, blocks=%d, us=%s, them=%s, peer=%s\n", pfrom->nVersion, pfrom->nStartingHeight, addrMe.ToString().c_str(), addrFrom.ToString().c_str(), pfrom->addr.ToString().c_str());
3170 cPeerBlockCounts.input(pfrom->nStartingHeight);
3172 // ppcoin: ask for pending sync-checkpoint if any
3173 if (!IsInitialBlockDownload())
3174 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3178 else if (pfrom->nVersion == 0)
3180 // Must have a version message before anything else
3181 pfrom->Misbehaving(1);
3186 else if (strCommand == "verack")
3188 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3192 else if (strCommand == "addr")
3194 vector<CAddress> vAddr;
3197 // Don't want addr from older versions unless seeding
3198 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3200 if (vAddr.size() > 1000)
3202 pfrom->Misbehaving(20);
3203 return error("message addr size() = %"PRIszu"", vAddr.size());
3206 // Store the new addresses
3207 vector<CAddress> vAddrOk;
3208 int64 nNow = GetAdjustedTime();
3209 int64 nSince = nNow - 10 * 60;
3210 BOOST_FOREACH(CAddress& addr, vAddr)
3214 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3215 addr.nTime = nNow - 5 * 24 * 60 * 60;
3216 pfrom->AddAddressKnown(addr);
3217 bool fReachable = IsReachable(addr);
3218 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3220 // Relay to a limited number of other nodes
3223 // Use deterministic randomness to send to the same nodes for 24 hours
3224 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3225 static uint256 hashSalt;
3227 hashSalt = GetRandHash();
3228 uint64 hashAddr = addr.GetHash();
3229 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
3230 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3231 multimap<uint256, CNode*> mapMix;
3232 BOOST_FOREACH(CNode* pnode, vNodes)
3234 if (pnode->nVersion < CADDR_TIME_VERSION)
3236 unsigned int nPointer;
3237 memcpy(&nPointer, &pnode, sizeof(nPointer));
3238 uint256 hashKey = hashRand ^ nPointer;
3239 hashKey = Hash(BEGIN(hashKey), END(hashKey));
3240 mapMix.insert(make_pair(hashKey, pnode));
3242 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3243 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3244 ((*mi).second)->PushAddress(addr);
3247 // Do not store addresses outside our network
3249 vAddrOk.push_back(addr);
3251 addrman.Add(vAddrOk, pfrom->addr, 2 * 60 * 60);
3252 if (vAddr.size() < 1000)
3253 pfrom->fGetAddr = false;
3254 if (pfrom->fOneShot)
3255 pfrom->fDisconnect = true;
3258 else if (strCommand == "inv")
3262 if (vInv.size() > MAX_INV_SZ)
3264 pfrom->Misbehaving(20);
3265 return error("message inv size() = %"PRIszu"", vInv.size());
3268 // find last block in inv vector
3269 unsigned int nLastBlock = (unsigned int)(-1);
3270 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++) {
3271 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
3272 nLastBlock = vInv.size() - 1 - nInv;
3277 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
3279 const CInv &inv = vInv[nInv];
3283 pfrom->AddInventoryKnown(inv);
3285 bool fAlreadyHave = AlreadyHave(txdb, inv);
3287 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3291 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
3292 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
3293 } else if (nInv == nLastBlock) {
3294 // In case we are on a very long side-chain, it is possible that we already have
3295 // the last block in an inv bundle sent in response to getblocks. Try to detect
3296 // this situation and push another getblocks to continue.
3297 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
3299 printf("force request: %s\n", inv.ToString().c_str());
3302 // Track requests for our stuff
3303 Inventory(inv.hash);
3308 else if (strCommand == "getdata")
3312 if (vInv.size() > MAX_INV_SZ)
3314 pfrom->Misbehaving(20);
3315 return error("message getdata size() = %"PRIszu"", vInv.size());
3318 if (fDebugNet || (vInv.size() != 1))
3319 printf("received getdata (%"PRIszu" invsz)\n", vInv.size());
3321 BOOST_FOREACH(const CInv& inv, vInv)
3325 if (fDebugNet || (vInv.size() == 1))
3326 printf("received getdata for: %s\n", inv.ToString().c_str());
3328 if (inv.type == MSG_BLOCK)
3330 // Send block from disk
3331 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
3332 if (mi != mapBlockIndex.end())
3335 block.ReadFromDisk((*mi).second);
3336 pfrom->PushMessage("block", block);
3338 // Trigger them to send a getblocks request for the next batch of inventory
3339 if (inv.hash == pfrom->hashContinue)
3341 // ppcoin: send latest proof-of-work block to allow the
3342 // download node to accept as orphan (proof-of-stake
3343 // block might be rejected by stake connection check)
3345 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3346 pfrom->PushMessage("inv", vInv);
3347 pfrom->hashContinue = 0;
3351 else if (inv.IsKnownType())
3353 // Send stream from relay memory
3354 bool pushed = false;
3357 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
3358 if (mi != mapRelay.end()) {
3359 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3363 if (!pushed && inv.type == MSG_TX) {
3365 if (mempool.exists(inv.hash)) {
3366 CTransaction tx = mempool.lookup(inv.hash);
3367 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3370 pfrom->PushMessage("tx", ss);
3375 // Track requests for our stuff
3376 Inventory(inv.hash);
3381 else if (strCommand == "getblocks")
3383 CBlockLocator locator;
3385 vRecv >> locator >> hashStop;
3387 // Find the last block the caller has in the main chain
3388 CBlockIndex* pindex = locator.GetBlockIndex();
3390 // Send the rest of the chain
3392 pindex = pindex->pnext;
3394 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3395 for (; pindex; pindex = pindex->pnext)
3397 if (pindex->GetBlockHash() == hashStop)
3399 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3400 // ppcoin: tell downloading node about the latest block if it's
3401 // without risk being rejected due to stake connection check
3402 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3403 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3406 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3409 // When this block is requested, we'll send an inv that'll make them
3410 // getblocks the next batch of inventory.
3411 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3412 pfrom->hashContinue = pindex->GetBlockHash();
3417 else if (strCommand == "checkpoint")
3419 CSyncCheckpoint checkpoint;
3420 vRecv >> checkpoint;
3422 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3425 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3427 BOOST_FOREACH(CNode* pnode, vNodes)
3428 checkpoint.RelayTo(pnode);
3432 else if (strCommand == "getheaders")
3434 CBlockLocator locator;
3436 vRecv >> locator >> hashStop;
3438 CBlockIndex* pindex = NULL;
3439 if (locator.IsNull())
3441 // If locator is null, return the hashStop block
3442 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
3443 if (mi == mapBlockIndex.end())
3445 pindex = (*mi).second;
3449 // Find the last block the caller has in the main chain
3450 pindex = locator.GetBlockIndex();
3452 pindex = pindex->pnext;
3455 vector<CBlock> vHeaders;
3457 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3458 for (; pindex; pindex = pindex->pnext)
3460 vHeaders.push_back(pindex->GetBlockHeader());
3461 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3464 pfrom->PushMessage("headers", vHeaders);
3468 else if (strCommand == "tx")
3470 vector<uint256> vWorkQueue;
3471 vector<uint256> vEraseQueue;
3472 CDataStream vMsg(vRecv);
3477 CInv inv(MSG_TX, tx.GetHash());
3478 pfrom->AddInventoryKnown(inv);
3480 bool fMissingInputs = false;
3481 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
3483 SyncWithWallets(tx, NULL, true);
3484 RelayTransaction(tx, inv.hash);
3485 mapAlreadyAskedFor.erase(inv);
3486 vWorkQueue.push_back(inv.hash);
3487 vEraseQueue.push_back(inv.hash);
3489 // Recursively process any orphan transactions that depended on this one
3490 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3492 uint256 hashPrev = vWorkQueue[i];
3493 for (set<uint256>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3494 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3497 const uint256& orphanTxHash = *mi;
3498 CTransaction& orphanTx = mapOrphanTransactions[orphanTxHash];
3499 bool fMissingInputs2 = false;
3501 if (orphanTx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
3503 printf(" accepted orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3504 SyncWithWallets(tx, NULL, true);
3505 RelayTransaction(orphanTx, orphanTxHash);
3506 mapAlreadyAskedFor.erase(CInv(MSG_TX, orphanTxHash));
3507 vWorkQueue.push_back(orphanTxHash);
3508 vEraseQueue.push_back(orphanTxHash);
3510 else if (!fMissingInputs2)
3513 vEraseQueue.push_back(orphanTxHash);
3514 printf(" removed invalid orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3519 BOOST_FOREACH(uint256 hash, vEraseQueue)
3520 EraseOrphanTx(hash);
3522 else if (fMissingInputs)
3526 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3527 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3529 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3531 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3535 else if (strCommand == "block")
3539 uint256 hashBlock = block.GetHash();
3541 printf("received block %s\n", hashBlock.ToString().substr(0,20).c_str());
3544 CInv inv(MSG_BLOCK, hashBlock);
3545 pfrom->AddInventoryKnown(inv);
3547 if (ProcessBlock(pfrom, &block))
3548 mapAlreadyAskedFor.erase(inv);
3549 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3553 else if (strCommand == "getaddr")
3555 // Don't return addresses older than nCutOff timestamp
3556 int64 nCutOff = GetTime() - (nNodeLifespan * 24 * 60 * 60);
3557 pfrom->vAddrToSend.clear();
3558 vector<CAddress> vAddr = addrman.GetAddr();
3559 BOOST_FOREACH(const CAddress &addr, vAddr)
3560 if(addr.nTime > nCutOff)
3561 pfrom->PushAddress(addr);
3565 else if (strCommand == "mempool")
3567 std::vector<uint256> vtxid;
3568 mempool.queryHashes(vtxid);
3570 for (unsigned int i = 0; i < vtxid.size(); i++) {
3571 CInv inv(MSG_TX, vtxid[i]);
3572 vInv.push_back(inv);
3573 if (i == (MAX_INV_SZ - 1))
3576 if (vInv.size() > 0)
3577 pfrom->PushMessage("inv", vInv);
3581 else if (strCommand == "checkorder")
3586 if (!GetBoolArg("-allowreceivebyip"))
3588 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
3595 /// we have a chance to check the order here
3597 // Keep giving the same key to the same ip until they use it
3598 if (!mapReuseKey.count(pfrom->addr))
3599 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3601 // Send back approval of order and pubkey to use
3602 CScript scriptPubKey;
3603 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3604 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
3608 else if (strCommand == "reply")
3613 CRequestTracker tracker;
3615 LOCK(pfrom->cs_mapRequests);
3616 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
3617 if (mi != pfrom->mapRequests.end())
3619 tracker = (*mi).second;
3620 pfrom->mapRequests.erase(mi);
3623 if (!tracker.IsNull())
3624 tracker.fn(tracker.param1, vRecv);
3628 else if (strCommand == "ping")
3630 if (pfrom->nVersion > BIP0031_VERSION)
3634 // Echo the message back with the nonce. This allows for two useful features:
3636 // 1) A remote node can quickly check if the connection is operational
3637 // 2) Remote nodes can measure the latency of the network thread. If this node
3638 // is overloaded it won't respond to pings quickly and the remote node can
3639 // avoid sending us more work, like chain download requests.
3641 // The nonce stops the remote getting confused between different pings: without
3642 // it, if the remote node sends a ping once per second and this node takes 5
3643 // seconds to respond to each, the 5th ping the remote sends would appear to
3644 // return very quickly.
3645 pfrom->PushMessage("pong", nonce);
3650 else if (strCommand == "alert")
3655 uint256 alertHash = alert.GetHash();
3656 if (pfrom->setKnown.count(alertHash) == 0)
3658 if (alert.ProcessAlert())
3661 pfrom->setKnown.insert(alertHash);
3664 BOOST_FOREACH(CNode* pnode, vNodes)
3665 alert.RelayTo(pnode);
3669 // Small DoS penalty so peers that send us lots of
3670 // duplicate/expired/invalid-signature/whatever alerts
3671 // eventually get banned.
3672 // This isn't a Misbehaving(100) (immediate ban) because the
3673 // peer might be an older or different implementation with
3674 // a different signature key, etc.
3675 pfrom->Misbehaving(10);
3683 // Ignore unknown commands for extensibility
3687 // Update the last seen time for this node's address
3688 if (pfrom->fNetworkNode)
3689 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3690 AddressCurrentlyConnected(pfrom->addr);
3696 bool ProcessMessages(CNode* pfrom)
3698 CDataStream& vRecv = pfrom->vRecv;
3702 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3706 // (4) message start
3715 // Don't bother if send buffer is too full to respond anyway
3716 if (pfrom->vSend.size() >= SendBufferSize())
3719 // Scan for message start
3720 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
3721 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3722 if (vRecv.end() - pstart < nHeaderSize)
3724 if ((int)vRecv.size() > nHeaderSize)
3726 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
3727 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
3731 if (pstart - vRecv.begin() > 0)
3732 printf("\n\nPROCESSMESSAGE SKIPPED %"PRIpdd" BYTES\n\n", pstart - vRecv.begin());
3733 vRecv.erase(vRecv.begin(), pstart);
3736 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
3741 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
3744 string strCommand = hdr.GetCommand();
3747 unsigned int nMessageSize = hdr.nMessageSize;
3748 if (nMessageSize > MAX_SIZE)
3750 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
3753 if (nMessageSize > vRecv.size())
3755 // Rewind and wait for rest of message
3756 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
3761 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
3762 unsigned int nChecksum = 0;
3763 memcpy(&nChecksum, &hash, sizeof(nChecksum));
3764 if (nChecksum != hdr.nChecksum)
3766 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
3767 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
3771 // Copy message to its own buffer
3772 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
3773 vRecv.ignore(nMessageSize);
3781 fRet = ProcessMessage(pfrom, strCommand, vMsg);
3786 catch (std::ios_base::failure& e)
3788 if (strstr(e.what(), "end of data"))
3790 // Allow exceptions from under-length message on vRecv
3791 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());
3793 else if (strstr(e.what(), "size too large"))
3795 // Allow exceptions from over-long size
3796 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
3800 PrintExceptionContinue(&e, "ProcessMessages()");
3803 catch (std::exception& e) {
3804 PrintExceptionContinue(&e, "ProcessMessages()");
3806 PrintExceptionContinue(NULL, "ProcessMessages()");
3810 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
3818 bool SendMessages(CNode* pto, bool fSendTrickle)
3820 TRY_LOCK(cs_main, lockMain);
3822 // Don't send anything until we get their version message
3823 if (pto->nVersion == 0)
3826 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
3828 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
3830 if (pto->nVersion > BIP0031_VERSION)
3831 pto->PushMessage("ping", nonce);
3833 pto->PushMessage("ping");
3836 // Resend wallet transactions that haven't gotten in a block yet
3837 ResendWalletTransactions();
3839 // Address refresh broadcast
3840 static int64 nLastRebroadcast;
3841 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
3845 BOOST_FOREACH(CNode* pnode, vNodes)
3847 // Periodically clear setAddrKnown to allow refresh broadcasts
3848 if (nLastRebroadcast)
3849 pnode->setAddrKnown.clear();
3851 // Rebroadcast our address
3854 CAddress addr = GetLocalAddress(&pnode->addr);
3855 if (addr.IsRoutable())
3856 pnode->PushAddress(addr);
3860 nLastRebroadcast = GetTime();
3868 vector<CAddress> vAddr;
3869 vAddr.reserve(pto->vAddrToSend.size());
3870 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
3872 // returns true if wasn't already contained in the set
3873 if (pto->setAddrKnown.insert(addr).second)
3875 vAddr.push_back(addr);
3876 // receiver rejects addr messages larger than 1000
3877 if (vAddr.size() >= 1000)
3879 pto->PushMessage("addr", vAddr);
3884 pto->vAddrToSend.clear();
3886 pto->PushMessage("addr", vAddr);
3891 // Message: inventory
3894 vector<CInv> vInvWait;
3896 LOCK(pto->cs_inventory);
3897 vInv.reserve(pto->vInventoryToSend.size());
3898 vInvWait.reserve(pto->vInventoryToSend.size());
3899 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
3901 if (pto->setInventoryKnown.count(inv))
3904 // trickle out tx inv to protect privacy
3905 if (inv.type == MSG_TX && !fSendTrickle)
3907 // 1/4 of tx invs blast to all immediately
3908 static uint256 hashSalt;
3910 hashSalt = GetRandHash();
3911 uint256 hashRand = inv.hash ^ hashSalt;
3912 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3913 bool fTrickleWait = ((hashRand & 3) != 0);
3915 // always trickle our own transactions
3919 if (GetTransaction(inv.hash, wtx))
3921 fTrickleWait = true;
3926 vInvWait.push_back(inv);
3931 // returns true if wasn't already contained in the set
3932 if (pto->setInventoryKnown.insert(inv).second)
3934 vInv.push_back(inv);
3935 if (vInv.size() >= 1000)
3937 pto->PushMessage("inv", vInv);
3942 pto->vInventoryToSend = vInvWait;
3945 pto->PushMessage("inv", vInv);
3951 vector<CInv> vGetData;
3952 int64 nNow = GetTime() * 1000000;
3954 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
3956 const CInv& inv = (*pto->mapAskFor.begin()).second;
3957 if (!AlreadyHave(txdb, inv))
3960 printf("sending getdata: %s\n", inv.ToString().c_str());
3961 vGetData.push_back(inv);
3962 if (vGetData.size() >= 1000)
3964 pto->PushMessage("getdata", vGetData);
3967 mapAlreadyAskedFor[inv] = nNow;
3969 pto->mapAskFor.erase(pto->mapAskFor.begin());
3971 if (!vGetData.empty())
3972 pto->PushMessage("getdata", vGetData);