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 unsigned int nDataOut = 0;
304 txnouttype whichType;
305 BOOST_FOREACH(const CTxIn& txin, vin)
307 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
308 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
309 // ~65-byte public keys, plus a few script ops.
310 if (txin.scriptSig.size() > 500)
312 if (!txin.scriptSig.IsPushOnly())
314 if (!txin.scriptSig.HasCanonicalPushes()) {
318 BOOST_FOREACH(const CTxOut& txout, vout) {
319 if (!::IsStandard(txout.scriptPubKey, whichType)) {
322 if (whichType == TX_NULL_DATA)
325 if (txout.nValue == 0) {
328 if (!txout.scriptPubKey.HasCanonicalPushes()) {
334 // only one OP_RETURN txout is permitted
343 // Check transaction inputs, and make sure any
344 // pay-to-script-hash transactions are evaluating IsStandard scripts
346 // Why bother? To avoid denial-of-service attacks; an attacker
347 // can submit a standard HASH... OP_EQUAL transaction,
348 // which will get accepted into blocks. The redemption
349 // script can be anything; an attacker could use a very
350 // expensive-to-check-upon-redemption script like:
351 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
353 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
356 return true; // Coinbases don't use vin normally
358 for (unsigned int i = 0; i < vin.size(); i++)
360 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
362 vector<vector<unsigned char> > vSolutions;
363 txnouttype whichType;
364 // get the scriptPubKey corresponding to this input:
365 const CScript& prevScript = prev.scriptPubKey;
366 if (!Solver(prevScript, whichType, vSolutions))
368 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
369 if (nArgsExpected < 0)
372 // Transactions with extra stuff in their scriptSigs are
373 // non-standard. Note that this EvalScript() call will
374 // be quick, because if there are any operations
375 // beside "push data" in the scriptSig the
376 // IsStandard() call returns false
377 vector<vector<unsigned char> > stack;
378 if (!EvalScript(stack, vin[i].scriptSig, *this, i, false, 0))
381 if (whichType == TX_SCRIPTHASH)
385 CScript subscript(stack.back().begin(), stack.back().end());
386 vector<vector<unsigned char> > vSolutions2;
387 txnouttype whichType2;
388 if (!Solver(subscript, whichType2, vSolutions2))
390 if (whichType2 == TX_SCRIPTHASH)
394 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
397 nArgsExpected += tmpExpected;
400 if (stack.size() != (unsigned int)nArgsExpected)
408 CTransaction::GetLegacySigOpCount() const
410 unsigned int nSigOps = 0;
411 BOOST_FOREACH(const CTxIn& txin, vin)
413 nSigOps += txin.scriptSig.GetSigOpCount(false);
415 BOOST_FOREACH(const CTxOut& txout, vout)
417 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
423 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
435 // Load the block this tx is in
437 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
439 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
444 // Update the tx's hashBlock
445 hashBlock = pblock->GetHash();
447 // Locate the transaction
448 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
449 if (pblock->vtx[nIndex] == *(CTransaction*)this)
451 if (nIndex == (int)pblock->vtx.size())
453 vMerkleBranch.clear();
455 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
459 // Fill in merkle branch
460 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
463 // Is the tx in a block that's in the main chain
464 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
465 if (mi == mapBlockIndex.end())
467 CBlockIndex* pindex = (*mi).second;
468 if (!pindex || !pindex->IsInMainChain())
471 return pindexBest->nHeight - pindex->nHeight + 1;
480 bool CTransaction::CheckTransaction() const
482 // Basic checks that don't depend on any context
484 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
486 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
488 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
489 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
491 // Check for negative or overflow output values
493 for (unsigned int i = 0; i < vout.size(); i++)
495 const CTxOut& txout = vout[i];
496 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
497 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
499 if (txout.nValue < 0)
500 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue is negative"));
501 if (txout.nValue > MAX_MONEY)
502 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
503 nValueOut += txout.nValue;
504 if (!MoneyRange(nValueOut))
505 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
508 // Check for duplicate inputs
509 set<COutPoint> vInOutPoints;
510 BOOST_FOREACH(const CTxIn& txin, vin)
512 if (vInOutPoints.count(txin.prevout))
514 vInOutPoints.insert(txin.prevout);
519 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
520 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
524 BOOST_FOREACH(const CTxIn& txin, vin)
525 if (txin.prevout.IsNull())
526 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
532 int64 CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree, enum GetMinFee_mode mode, unsigned int nBytes) const
534 // Use new fees approach if we are on test network or
535 // switch date has been reached
536 bool fNewApproach = fTestNet || nTime > FEE_SWITCH_TIME;
538 int64 nMinTxFee = MIN_TX_FEE, nMinRelayTxFee = MIN_RELAY_TX_FEE;
540 if(!fNewApproach || IsCoinStake())
542 // Enforce 0.01 as minimum fee for old approach or coinstake
544 nMinRelayTxFee = CENT;
547 // Base fee is either nMinTxFee or nMinRelayTxFee
548 int64 nBaseFee = (mode == GMF_RELAY) ? nMinRelayTxFee : nMinTxFee;
550 unsigned int nNewBlockSize = nBlockSize + nBytes;
551 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
559 // Transactions under 1K are free
565 // Free transaction area
566 if (nNewBlockSize < 27000)
571 // To limit dust spam, require additional MIN_TX_FEE/MIN_RELAY_TX_FEE for
572 // each non empty output which is less than 0.01
574 // It's safe to ignore empty outputs here, because these inputs are allowed
575 // only for coinbase and coinstake transactions.
576 BOOST_FOREACH(const CTxOut& txout, vout)
577 if (txout.nValue < CENT && !txout.IsEmpty())
580 else if (nMinFee < nBaseFee)
582 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if
583 // any output is less than 0.01
584 BOOST_FOREACH(const CTxOut& txout, vout)
585 if (txout.nValue < CENT)
589 // Raise the price as the block approaches full
590 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
592 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
594 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
597 if (!MoneyRange(nMinFee))
604 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
605 bool* pfMissingInputs)
608 *pfMissingInputs = false;
610 if (!tx.CheckTransaction())
611 return error("CTxMemPool::accept() : CheckTransaction failed");
613 // Coinbase is only valid in a block, not as a loose transaction
615 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
617 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
618 if (tx.IsCoinStake())
619 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
621 // To help v0.1.5 clients who would see it as a negative number
622 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
623 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
625 // Rather not work on nonstandard transactions (unless -testnet)
626 if (!fTestNet && !tx.IsStandard())
627 return error("CTxMemPool::accept() : nonstandard transaction type");
629 // Do we already have it?
630 uint256 hash = tx.GetHash();
633 if (mapTx.count(hash))
637 if (txdb.ContainsTx(hash))
640 // Check for conflicts with in-memory transactions
641 CTransaction* ptxOld = NULL;
642 for (unsigned int i = 0; i < tx.vin.size(); i++)
644 COutPoint outpoint = tx.vin[i].prevout;
645 if (mapNextTx.count(outpoint))
647 // Disable replacement feature for now
650 // Allow replacing with a newer version of the same transaction
653 ptxOld = mapNextTx[outpoint].ptx;
654 if (ptxOld->IsFinal())
656 if (!tx.IsNewerThan(*ptxOld))
658 for (unsigned int i = 0; i < tx.vin.size(); i++)
660 COutPoint outpoint = tx.vin[i].prevout;
661 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
671 map<uint256, CTxIndex> mapUnused;
672 bool fInvalid = false;
673 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
676 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
678 *pfMissingInputs = true;
682 // Check for non-standard pay-to-script-hash in inputs
683 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
684 return error("CTxMemPool::accept() : nonstandard transaction input");
686 // Note: if you modify this code to accept non-standard transactions, then
687 // you should add code here to check that the transaction does a
688 // reasonable number of ECDSA signature verifications.
690 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
691 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
693 // Don't accept it if it can't get into a block
694 int64 txMinFee = tx.GetMinFee(1000, true, GMF_RELAY, nSize);
695 if (nFees < txMinFee)
696 return error("CTxMemPool::accept() : not enough fees %s, %"PRI64d" < %"PRI64d,
697 hash.ToString().c_str(),
700 // Continuously rate-limit free transactions
701 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
702 // be annoying or make others' transactions take longer to confirm.
703 if (nFees < MIN_RELAY_TX_FEE)
705 static CCriticalSection cs;
706 static double dFreeCount;
707 static int64 nLastTime;
708 int64 nNow = GetTime();
712 // Use an exponentially decaying ~10-minute window:
713 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
715 // -limitfreerelay unit is thousand-bytes-per-minute
716 // At default rate it would take over a month to fill 1GB
717 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
718 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
720 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
725 // Check against previous transactions
726 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
727 if (!tx.ConnectInputs(txdb, mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false, STANDARD_SCRIPT_VERIFY_FLAGS))
729 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
733 // Store transaction in memory
738 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
741 addUnchecked(hash, tx);
744 ///// are we sure this is ok when loading transactions or restoring block txes
745 // If updated, erase old tx from wallet
747 EraseFromWallets(ptxOld->GetHash());
749 printf("CTxMemPool::accept() : accepted %s (poolsz %"PRIszu")\n",
750 hash.ToString().substr(0,10).c_str(),
755 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
757 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
760 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
762 // Add to memory pool without checking anything. Don't call this directly,
763 // call CTxMemPool::accept to properly check the transaction first.
766 for (unsigned int i = 0; i < tx.vin.size(); i++)
767 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
768 nTransactionsUpdated++;
774 bool CTxMemPool::remove(CTransaction &tx)
776 // Remove transaction from memory pool
779 uint256 hash = tx.GetHash();
780 if (mapTx.count(hash))
782 BOOST_FOREACH(const CTxIn& txin, tx.vin)
783 mapNextTx.erase(txin.prevout);
785 nTransactionsUpdated++;
791 void CTxMemPool::clear()
796 ++nTransactionsUpdated;
799 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
804 vtxid.reserve(mapTx.size());
805 for (map<uint256, CTransaction>::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi)
806 vtxid.push_back((*mi).first);
812 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
814 if (hashBlock == 0 || nIndex == -1)
817 // Find the block it claims to be in
818 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
819 if (mi == mapBlockIndex.end())
821 CBlockIndex* pindex = (*mi).second;
822 if (!pindex || !pindex->IsInMainChain())
825 // Make sure the merkle branch connects to this block
826 if (!fMerkleVerified)
828 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
830 fMerkleVerified = true;
834 return pindexBest->nHeight - pindex->nHeight + 1;
838 int CMerkleTx::GetBlocksToMaturity() const
840 if (!(IsCoinBase() || IsCoinStake()))
842 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
846 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
850 if (!IsInMainChain() && !ClientConnectInputs())
852 return CTransaction::AcceptToMemoryPool(txdb, false);
856 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
860 bool CMerkleTx::AcceptToMemoryPool()
863 return AcceptToMemoryPool(txdb);
868 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
873 // Add previous supporting transactions first
874 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
876 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
878 uint256 hash = tx.GetHash();
879 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
880 tx.AcceptToMemoryPool(txdb, fCheckInputs);
883 return AcceptToMemoryPool(txdb, fCheckInputs);
888 bool CWalletTx::AcceptWalletTransaction()
891 return AcceptWalletTransaction(txdb);
894 int CTxIndex::GetDepthInMainChain() const
898 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
900 // Find the block in the index
901 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
902 if (mi == mapBlockIndex.end())
904 CBlockIndex* pindex = (*mi).second;
905 if (!pindex || !pindex->IsInMainChain())
907 return 1 + nBestHeight - pindex->nHeight;
910 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
911 bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock)
917 if (mempool.exists(hash))
919 tx = mempool.lookup(hash);
925 if (tx.ReadFromDisk(txdb, COutPoint(hash, 0), txindex))
928 if (block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
929 hashBlock = block.GetHash();
943 //////////////////////////////////////////////////////////////////////////////
945 // CBlock and CBlockIndex
948 static CBlockIndex* pblockindexFBBHLast;
949 CBlockIndex* FindBlockByHeight(int nHeight)
951 CBlockIndex *pblockindex;
952 if (nHeight < nBestHeight / 2)
953 pblockindex = pindexGenesisBlock;
955 pblockindex = pindexBest;
956 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
957 pblockindex = pblockindexFBBHLast;
958 while (pblockindex->nHeight > nHeight)
959 pblockindex = pblockindex->pprev;
960 while (pblockindex->nHeight < nHeight)
961 pblockindex = pblockindex->pnext;
962 pblockindexFBBHLast = pblockindex;
966 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
968 if (!fReadTransactions)
970 *this = pindex->GetBlockHeader();
973 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
975 if (GetHash() != pindex->GetBlockHash())
976 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
980 uint256 static GetOrphanRoot(const CBlock* pblock)
982 // Work back to the first block in the orphan chain
983 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
984 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
985 return pblock->GetHash();
988 // ppcoin: find block wanted by given orphan block
989 uint256 WantedByOrphan(const CBlock* pblockOrphan)
991 // Work back to the first block in the orphan chain
992 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
993 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
994 return pblockOrphan->hashPrevBlock;
997 // select stake target limit according to hard-coded conditions
998 CBigNum inline GetProofOfStakeLimit(int nHeight, unsigned int nTime)
1000 if(fTestNet) // separate proof of stake target limit for testnet
1001 return bnProofOfStakeLimit;
1002 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
1003 return bnProofOfStakeLimit;
1004 if(nHeight + 1 > 15000) // 24 bits since block 15000
1005 return bnProofOfStakeLegacyLimit;
1006 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
1007 return bnProofOfStakeHardLimit;
1009 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
1012 // miner's coin base reward based on nBits
1013 int64 GetProofOfWorkReward(unsigned int nBits, int64 nFees)
1015 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
1018 bnTarget.SetCompact(nBits);
1019 CBigNum bnTargetLimit = bnProofOfWorkLimit;
1020 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1022 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
1023 // A reasonably continuous curve is used to avoid shock to market
1024 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
1026 // Human readable form:
1028 // nSubsidy = 100 / (diff ^ 1/6)
1029 CBigNum bnLowerBound = CENT;
1030 CBigNum bnUpperBound = bnSubsidyLimit;
1031 while (bnLowerBound + CENT <= bnUpperBound)
1033 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1034 if (fDebug && GetBoolArg("-printcreation"))
1035 printf("GetProofOfWorkReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1036 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
1037 bnUpperBound = bnMidValue;
1039 bnLowerBound = bnMidValue;
1042 int64 nSubsidy = bnUpperBound.getuint64();
1044 nSubsidy = (nSubsidy / CENT) * CENT;
1045 if (fDebug && GetBoolArg("-printcreation"))
1046 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
1048 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK) + nFees;
1051 // miner's coin stake reward based on nBits and coin age spent (coin-days)
1052 int64 GetProofOfStakeReward(int64 nCoinAge, unsigned int nBits, unsigned int nTime, bool bCoinYearOnly)
1054 int64 nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * COIN;
1056 if(fTestNet || nTime > STAKE_SWITCH_TIME)
1058 // Stage 2 of emission process is PoS-based. It will be active on mainNet since 20 Jun 2013.
1060 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1062 bnTarget.SetCompact(nBits);
1063 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1064 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1066 // NovaCoin: A reasonably continuous curve is used to avoid shock to market
1068 CBigNum bnLowerBound = 1 * CENT, // Lower interest bound is 1% per year
1069 bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year
1070 bnMidPart, bnRewardPart;
1072 while (bnLowerBound + CENT <= bnUpperBound)
1074 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1075 if (fDebug && GetBoolArg("-printcreation"))
1076 printf("GetProofOfStakeReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1078 if(!fTestNet && nTime < STAKECURVE_SWITCH_TIME)
1081 // Until 20 Oct 2013: reward for coin-year is cut in half every 64x multiply of PoS difficulty
1083 // (nRewardCoinYearLimit / nRewardCoinYear) ** 6 == bnProofOfStakeLimit / bnTarget
1085 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/6)
1088 bnMidPart = bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue;
1089 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1094 // Since 20 Oct 2013: reward for coin-year is cut in half every 8x multiply of PoS difficulty
1096 // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget
1098 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3)
1101 bnMidPart = bnMidValue * bnMidValue * bnMidValue;
1102 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1105 if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget)
1106 bnUpperBound = bnMidValue;
1108 bnLowerBound = bnMidValue;
1111 nRewardCoinYear = bnUpperBound.getuint64();
1112 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1116 // Old creation amount per coin-year, 5% fixed stake mint rate
1117 nRewardCoinYear = 5 * CENT;
1121 return nRewardCoinYear;
1123 nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
1125 // Set reasonable reward limit for large inputs since 20 Oct 2013
1127 // This will stimulate large holders to use smaller inputs, that's good for the network protection
1128 if(fTestNet || STAKECURVE_SWITCH_TIME < nTime)
1130 if (fDebug && GetBoolArg("-printcreation") && nSubsidyLimit < nSubsidy)
1131 printf("GetProofOfStakeReward(): %s is greater than %s, coinstake reward will be truncated\n", FormatMoney(nSubsidy).c_str(), FormatMoney(nSubsidyLimit).c_str());
1133 nSubsidy = min(nSubsidy, nSubsidyLimit);
1136 if (fDebug && GetBoolArg("-printcreation"))
1137 printf("GetProofOfStakeReward(): create=%s nCoinAge=%"PRI64d" nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1141 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
1143 // get proof of work blocks max spacing according to hard-coded conditions
1144 int64 inline GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1146 if(nTime > TARGETS_SWITCH_TIME)
1147 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1150 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1152 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1156 // maximum nBits value could possible be required nTime after
1158 unsigned int ComputeMaxBits(CBigNum bnTargetLimit, unsigned int nBase, int64 nTime)
1161 bnResult.SetCompact(nBase);
1163 while (nTime > 0 && bnResult < bnTargetLimit)
1165 // Maximum 200% adjustment per day...
1167 nTime -= 24 * 60 * 60;
1169 if (bnResult > bnTargetLimit)
1170 bnResult = bnTargetLimit;
1171 return bnResult.GetCompact();
1175 // minimum amount of work that could possibly be required nTime after
1176 // minimum proof-of-work required was nBase
1178 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
1180 return ComputeMaxBits(bnProofOfWorkLimit, nBase, nTime);
1184 // minimum amount of stake that could possibly be required nTime after
1185 // minimum proof-of-stake required was nBase
1187 unsigned int ComputeMinStake(unsigned int nBase, int64 nTime, unsigned int nBlockTime)
1189 return ComputeMaxBits(GetProofOfStakeLimit(0, nBlockTime), nBase, nTime);
1193 // ppcoin: find last block index up to pindex
1194 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1196 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1197 pindex = pindex->pprev;
1201 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1203 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1205 if (pindexLast == NULL)
1206 return bnTargetLimit.GetCompact(); // genesis block
1208 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1209 if (pindexPrev->pprev == NULL)
1210 return bnTargetLimit.GetCompact(); // first block
1211 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1212 if (pindexPrevPrev->pprev == NULL)
1213 return bnTargetLimit.GetCompact(); // second block
1215 int64 nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1217 // ppcoin: target change every block
1218 // ppcoin: retarget with exponential moving toward target spacing
1220 bnNew.SetCompact(pindexPrev->nBits);
1221 int64 nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1222 int64 nInterval = nTargetTimespan / nTargetSpacing;
1223 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1224 bnNew /= ((nInterval + 1) * nTargetSpacing);
1226 if (bnNew > bnTargetLimit)
1227 bnNew = bnTargetLimit;
1229 return bnNew.GetCompact();
1232 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1235 bnTarget.SetCompact(nBits);
1238 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1239 return error("CheckProofOfWork() : nBits below minimum work");
1241 // Check proof of work matches claimed amount
1242 if (hash > bnTarget.getuint256())
1243 return error("CheckProofOfWork() : hash doesn't match nBits");
1248 // Return maximum amount of blocks that other nodes claim to have
1249 int GetNumBlocksOfPeers()
1251 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1254 bool IsInitialBlockDownload()
1256 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1258 static int64 nLastUpdate;
1259 static CBlockIndex* pindexLastBest;
1260 if (pindexBest != pindexLastBest)
1262 pindexLastBest = pindexBest;
1263 nLastUpdate = GetTime();
1265 return (GetTime() - nLastUpdate < 10 &&
1266 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
1269 void static InvalidChainFound(CBlockIndex* pindexNew)
1271 if (pindexNew->nChainTrust > nBestInvalidTrust)
1273 nBestInvalidTrust = pindexNew->nChainTrust;
1274 CTxDB().WriteBestInvalidTrust(CBigNum(nBestInvalidTrust));
1275 uiInterface.NotifyBlocksChanged();
1278 uint256 nBestInvalidBlockTrust = pindexNew->nChainTrust - pindexNew->pprev->nChainTrust;
1279 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1281 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1282 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1283 CBigNum(pindexNew->nChainTrust).ToString().c_str(), nBestInvalidBlockTrust.Get64(),
1284 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1285 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1286 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1287 CBigNum(pindexBest->nChainTrust).ToString().c_str(),
1288 nBestBlockTrust.Get64(),
1289 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1293 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1295 nTime = max(GetBlockTime(), GetAdjustedTime());
1308 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1310 // Relinquish previous transactions' spent pointers
1313 BOOST_FOREACH(const CTxIn& txin, vin)
1315 COutPoint prevout = txin.prevout;
1317 // Get prev txindex from disk
1319 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1320 return error("DisconnectInputs() : ReadTxIndex failed");
1322 if (prevout.n >= txindex.vSpent.size())
1323 return error("DisconnectInputs() : prevout.n out of range");
1325 // Mark outpoint as not spent
1326 txindex.vSpent[prevout.n].SetNull();
1329 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1330 return error("DisconnectInputs() : UpdateTxIndex failed");
1334 // Remove transaction from index
1335 // This can fail if a duplicate of this transaction was in a chain that got
1336 // reorganized away. This is only possible if this transaction was completely
1337 // spent, so erasing it would be a no-op anyway.
1338 txdb.EraseTxIndex(*this);
1344 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1345 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1347 // FetchInputs can return false either because we just haven't seen some inputs
1348 // (in which case the transaction should be stored as an orphan)
1349 // or because the transaction is malformed (in which case the transaction should
1350 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1354 return true; // Coinbase transactions have no inputs to fetch.
1356 for (unsigned int i = 0; i < vin.size(); i++)
1358 COutPoint prevout = vin[i].prevout;
1359 if (inputsRet.count(prevout.hash))
1360 continue; // Got it already
1363 CTxIndex& txindex = inputsRet[prevout.hash].first;
1365 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1367 // Get txindex from current proposed changes
1368 txindex = mapTestPool.find(prevout.hash)->second;
1372 // Read txindex from txdb
1373 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1375 if (!fFound && (fBlock || fMiner))
1376 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());
1379 CTransaction& txPrev = inputsRet[prevout.hash].second;
1380 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1382 // Get prev tx from single transactions in memory
1385 if (!mempool.exists(prevout.hash))
1386 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());
1387 txPrev = mempool.lookup(prevout.hash);
1390 txindex.vSpent.resize(txPrev.vout.size());
1394 // Get prev tx from disk
1395 if (!txPrev.ReadFromDisk(txindex.pos))
1396 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1400 // Make sure all prevout.n indexes are valid:
1401 for (unsigned int i = 0; i < vin.size(); i++)
1403 const COutPoint prevout = vin[i].prevout;
1404 assert(inputsRet.count(prevout.hash) != 0);
1405 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1406 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1407 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1409 // Revisit this if/when transaction replacement is implemented and allows
1412 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()));
1419 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1421 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1422 if (mi == inputs.end())
1423 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1425 const CTransaction& txPrev = (mi->second).second;
1426 if (input.prevout.n >= txPrev.vout.size())
1427 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1429 return txPrev.vout[input.prevout.n];
1432 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1438 for (unsigned int i = 0; i < vin.size(); i++)
1440 nResult += GetOutputFor(vin[i], inputs).nValue;
1446 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1451 unsigned int nSigOps = 0;
1452 for (unsigned int i = 0; i < vin.size(); i++)
1454 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1455 if (prevout.scriptPubKey.IsPayToScriptHash())
1456 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1461 bool VerifySignature(const CTransaction& txFrom, const CTransaction& txTo, unsigned int nIn, unsigned int flags, int nHashType)
1463 assert(nIn < txTo.vin.size());
1464 const CTxIn& txin = txTo.vin[nIn];
1465 if (txin.prevout.n >= txFrom.vout.size())
1467 const CTxOut& txout = txFrom.vout[txin.prevout.n];
1469 if (txin.prevout.hash != txFrom.GetHash())
1472 return VerifyScript(txin.scriptSig, txout.scriptPubKey, txTo, nIn, flags, nHashType);
1475 bool CTransaction::ConnectInputs(CTxDB& txdb, MapPrevTx inputs, map<uint256, CTxIndex>& mapTestPool, const CDiskTxPos& posThisTx,
1476 const CBlockIndex* pindexBlock, bool fBlock, bool fMiner, unsigned int flags)
1478 // Take over previous transactions' spent pointers
1479 // fBlock is true when this is called from AcceptBlock when a new best-block is added to the blockchain
1480 // fMiner is true when called from the internal bitcoin miner
1481 // ... both are false when called from CTransaction::AcceptToMemoryPool
1482 bool fScriptChecks = !(fBlock && pindexBlock->nHeight >= Checkpoints::GetTotalBlocksEstimate());
1488 for (unsigned int i = 0; i < vin.size(); i++)
1490 COutPoint prevout = vin[i].prevout;
1491 assert(inputs.count(prevout.hash) > 0);
1492 CTxIndex& txindex = inputs[prevout.hash].first;
1493 CTransaction& txPrev = inputs[prevout.hash].second;
1495 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1496 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()));
1498 // If prev is coinbase or coinstake, check that it's matured
1499 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
1500 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < nCoinbaseMaturity; pindex = pindex->pprev)
1501 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1502 return error("ConnectInputs() : tried to spend %s at depth %d", txPrev.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - pindex->nHeight);
1504 // ppcoin: check transaction timestamp
1505 if (txPrev.nTime > nTime)
1506 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
1508 // Check for negative or overflow input values
1509 nValueIn += txPrev.vout[prevout.n].nValue;
1510 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1511 return DoS(100, error("ConnectInputs() : txin values out of range"));
1514 // The first loop above does all the inexpensive checks.
1515 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1516 // Helps prevent CPU exhaustion attacks.
1517 for (unsigned int i = 0; i < vin.size(); i++)
1519 COutPoint prevout = vin[i].prevout;
1520 assert(inputs.count(prevout.hash) > 0);
1521 CTxIndex& txindex = inputs[prevout.hash].first;
1522 CTransaction& txPrev = inputs[prevout.hash].second;
1524 // Check for conflicts (double-spend)
1525 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1526 // for an attacker to attempt to split the network.
1527 if (!txindex.vSpent[prevout.n].IsNull())
1528 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());
1530 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1531 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1532 // still computed and checked, and any change will be caught at the next checkpoint.
1536 if (!VerifySignature(txPrev, *this, i, flags, 0))
1538 if (flags & STANDARD_NOT_MANDATORY_VERIFY_FLAGS)
1540 if (VerifySignature(txPrev, *this, i, flags & ~STANDARD_NOT_MANDATORY_VERIFY_FLAGS, 0))
1541 return error("ConnectInputs() : %s STANDARD_NOT_MANDATORY_VERIFY_FLAGS VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1543 return DoS(100,error("ConnectInputs() : %s STANDARD_MANDATORY_VERIFY_FLAGS VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1547 // Mark outpoints as spent
1548 txindex.vSpent[prevout.n] = posThisTx;
1551 if (fBlock || fMiner)
1553 mapTestPool[prevout.hash] = txindex;
1559 // ppcoin: coin stake tx earns reward instead of paying fee
1561 if (!GetCoinAge(txdb, nCoinAge))
1562 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1564 unsigned int nTxSize = (nTime > VALIDATION_SWITCH_TIME || fTestNet) ? GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION) : 0;
1566 int64 nReward = GetValueOut() - nValueIn;
1567 int64 nCalculatedReward = GetProofOfStakeReward(nCoinAge, pindexBlock->nBits, nTime) - GetMinFee(1, false, GMF_BLOCK, nTxSize) + CENT;
1569 if (nReward > nCalculatedReward)
1570 return DoS(100, error("ConnectInputs() : coinstake pays too much(actual=%"PRI64d" vs calculated=%"PRI64d")", nReward, nCalculatedReward));
1574 if (nValueIn < GetValueOut())
1575 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1577 // Tally transaction fees
1578 int64 nTxFee = nValueIn - GetValueOut();
1580 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1583 if (!MoneyRange(nFees))
1584 return DoS(100, error("ConnectInputs() : nFees out of range"));
1592 bool CTransaction::ClientConnectInputs()
1597 // Take over previous transactions' spent pointers
1601 for (unsigned int i = 0; i < vin.size(); i++)
1603 // Get prev tx from single transactions in memory
1604 COutPoint prevout = vin[i].prevout;
1605 if (!mempool.exists(prevout.hash))
1607 CTransaction& txPrev = mempool.lookup(prevout.hash);
1609 if (prevout.n >= txPrev.vout.size())
1613 if (!VerifySignature(txPrev, *this, i, SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH, 0))
1614 return error("ClientConnectInputs() : VerifySignature failed");
1616 ///// this is redundant with the mempool.mapNextTx stuff,
1617 ///// not sure which I want to get rid of
1618 ///// this has to go away now that posNext is gone
1619 // // Check for conflicts
1620 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1621 // return error("ConnectInputs() : prev tx already used");
1623 // // Flag outpoints as used
1624 // txPrev.vout[prevout.n].posNext = posThisTx;
1626 nValueIn += txPrev.vout[prevout.n].nValue;
1628 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1629 return error("ClientConnectInputs() : txin values out of range");
1631 if (GetValueOut() > nValueIn)
1641 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1643 // Disconnect in reverse order
1644 for (int i = vtx.size()-1; i >= 0; i--)
1645 if (!vtx[i].DisconnectInputs(txdb))
1648 // Update block index on disk without changing it in memory.
1649 // The memory index structure will be changed after the db commits.
1652 CDiskBlockIndex blockindexPrev(pindex->pprev);
1653 blockindexPrev.hashNext = 0;
1654 if (!txdb.WriteBlockIndex(blockindexPrev))
1655 return error("DisconnectBlock() : WriteBlockIndex failed");
1658 // ppcoin: clean up wallet after disconnecting coinstake
1659 BOOST_FOREACH(CTransaction& tx, vtx)
1660 SyncWithWallets(tx, this, false, false);
1665 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex, bool fJustCheck)
1667 // Check it again in case a previous version let a bad block in, but skip BlockSig checking
1668 if (!CheckBlock(!fJustCheck, !fJustCheck, false))
1671 bool fProtocol048 = fTestNet || VALIDATION_SWITCH_TIME < nTime;
1673 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1674 // unless those are already completely spent.
1675 // If such overwrites are allowed, coinbases and transactions depending upon those
1676 // can be duplicated to remove the ability to spend the first instance -- even after
1677 // being sent to another address.
1678 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1679 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1680 // already refuses previously-known transaction ids entirely.
1681 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1682 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1683 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1684 // initial block download.
1685 bool fEnforceBIP30 = true; // Always active in NovaCoin
1687 //// issue here: it doesn't know the version
1688 unsigned int nTxPos;
1690 // FetchInputs treats CDiskTxPos(1,1,1) as a special "refer to memorypool" indicator
1691 // 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
1694 nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1696 map<uint256, CTxIndex> mapQueuedChanges;
1699 int64 nValueOut = 0;
1700 unsigned int nSigOps = 0;
1701 BOOST_FOREACH(CTransaction& tx, vtx)
1703 uint256 hashTx = tx.GetHash();
1705 if (fEnforceBIP30) {
1706 CTxIndex txindexOld;
1707 if (txdb.ReadTxIndex(hashTx, txindexOld)) {
1708 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1714 nSigOps += tx.GetLegacySigOpCount();
1715 if (nSigOps > MAX_BLOCK_SIGOPS)
1716 return DoS(100, error("ConnectBlock() : too many sigops"));
1718 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1720 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1722 MapPrevTx mapInputs;
1723 if (tx.IsCoinBase())
1724 nValueOut += tx.GetValueOut();
1728 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1731 // Add in sigops done by pay-to-script-hash inputs;
1732 // this is to prevent a "rogue miner" from creating
1733 // an incredibly-expensive-to-validate block.
1734 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1735 if (nSigOps > MAX_BLOCK_SIGOPS)
1736 return DoS(100, error("ConnectBlock() : too many sigops"));
1738 int64 nTxValueIn = tx.GetValueIn(mapInputs);
1739 int64 nTxValueOut = tx.GetValueOut();
1740 nValueIn += nTxValueIn;
1741 nValueOut += nTxValueOut;
1742 if (!tx.IsCoinStake())
1743 nFees += nTxValueIn - nTxValueOut;
1745 if (!tx.ConnectInputs(txdb, mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH))
1749 mapQueuedChanges[hashTx] = CTxIndex(posThisTx, tx.vout.size());
1752 if (IsProofOfWork())
1754 int64 nBlockReward = GetProofOfWorkReward(nBits, fProtocol048 ? nFees : 0);
1756 // Check coinbase reward
1757 if (vtx[0].GetValueOut() > nBlockReward)
1758 return error("CheckBlock() : coinbase reward exceeded (actual=%"PRI64d" vs calculated=%"PRI64d")",
1759 vtx[0].GetValueOut(),
1763 // track money supply and mint amount info
1764 pindex->nMint = nValueOut - nValueIn + nFees;
1765 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1766 if (!txdb.WriteBlockIndex(CDiskBlockIndex(pindex)))
1767 return error("Connect() : WriteBlockIndex for pindex failed");
1769 // fees are not collected by proof-of-stake miners
1770 // fees are destroyed to compensate the entire network
1771 if (fProtocol048 && fDebug && IsProofOfStake() && GetBoolArg("-printcreation"))
1772 printf("ConnectBlock() : destroy=%s nFees=%"PRI64d"\n", FormatMoney(nFees).c_str(), nFees);
1777 // Write queued txindex changes
1778 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1780 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1781 return error("ConnectBlock() : UpdateTxIndex failed");
1784 // Update block index on disk without changing it in memory.
1785 // The memory index structure will be changed after the db commits.
1788 CDiskBlockIndex blockindexPrev(pindex->pprev);
1789 blockindexPrev.hashNext = pindex->GetBlockHash();
1790 if (!txdb.WriteBlockIndex(blockindexPrev))
1791 return error("ConnectBlock() : WriteBlockIndex failed");
1794 // Watch for transactions paying to me
1795 BOOST_FOREACH(CTransaction& tx, vtx)
1796 SyncWithWallets(tx, this, true);
1801 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1803 printf("REORGANIZE\n");
1806 CBlockIndex* pfork = pindexBest;
1807 CBlockIndex* plonger = pindexNew;
1808 while (pfork != plonger)
1810 while (plonger->nHeight > pfork->nHeight)
1811 if (!(plonger = plonger->pprev))
1812 return error("Reorganize() : plonger->pprev is null");
1813 if (pfork == plonger)
1815 if (!(pfork = pfork->pprev))
1816 return error("Reorganize() : pfork->pprev is null");
1819 // List of what to disconnect
1820 vector<CBlockIndex*> vDisconnect;
1821 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1822 vDisconnect.push_back(pindex);
1824 // List of what to connect
1825 vector<CBlockIndex*> vConnect;
1826 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1827 vConnect.push_back(pindex);
1828 reverse(vConnect.begin(), vConnect.end());
1830 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());
1831 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());
1833 // Disconnect shorter branch
1834 vector<CTransaction> vResurrect;
1835 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1838 if (!block.ReadFromDisk(pindex))
1839 return error("Reorganize() : ReadFromDisk for disconnect failed");
1840 if (!block.DisconnectBlock(txdb, pindex))
1841 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1843 // Queue memory transactions to resurrect
1844 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1845 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1846 vResurrect.push_back(tx);
1849 // Connect longer branch
1850 vector<CTransaction> vDelete;
1851 for (unsigned int i = 0; i < vConnect.size(); i++)
1853 CBlockIndex* pindex = vConnect[i];
1855 if (!block.ReadFromDisk(pindex))
1856 return error("Reorganize() : ReadFromDisk for connect failed");
1857 if (!block.ConnectBlock(txdb, pindex))
1860 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1863 // Queue memory transactions to delete
1864 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1865 vDelete.push_back(tx);
1867 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1868 return error("Reorganize() : WriteHashBestChain failed");
1870 // Make sure it's successfully written to disk before changing memory structure
1871 if (!txdb.TxnCommit())
1872 return error("Reorganize() : TxnCommit failed");
1874 // Disconnect shorter branch
1875 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1877 pindex->pprev->pnext = NULL;
1879 // Connect longer branch
1880 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1882 pindex->pprev->pnext = pindex;
1884 // Resurrect memory transactions that were in the disconnected branch
1885 BOOST_FOREACH(CTransaction& tx, vResurrect)
1886 tx.AcceptToMemoryPool(txdb, false);
1888 // Delete redundant memory transactions that are in the connected branch
1889 BOOST_FOREACH(CTransaction& tx, vDelete)
1892 printf("REORGANIZE: done\n");
1898 // Called from inside SetBestChain: attaches a block to the new best chain being built
1899 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1901 uint256 hash = GetHash();
1903 // Adding to current best branch
1904 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1907 InvalidChainFound(pindexNew);
1910 if (!txdb.TxnCommit())
1911 return error("SetBestChain() : TxnCommit failed");
1913 // Add to current best branch
1914 pindexNew->pprev->pnext = pindexNew;
1916 // Delete redundant memory transactions
1917 BOOST_FOREACH(CTransaction& tx, vtx)
1923 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1925 uint256 hash = GetHash();
1927 if (!txdb.TxnBegin())
1928 return error("SetBestChain() : TxnBegin failed");
1930 if (pindexGenesisBlock == NULL && hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1932 txdb.WriteHashBestChain(hash);
1933 if (!txdb.TxnCommit())
1934 return error("SetBestChain() : TxnCommit failed");
1935 pindexGenesisBlock = pindexNew;
1937 else if (hashPrevBlock == hashBestChain)
1939 if (!SetBestChainInner(txdb, pindexNew))
1940 return error("SetBestChain() : SetBestChainInner failed");
1944 // the first block in the new chain that will cause it to become the new best chain
1945 CBlockIndex *pindexIntermediate = pindexNew;
1947 // list of blocks that need to be connected afterwards
1948 std::vector<CBlockIndex*> vpindexSecondary;
1950 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1951 // Try to limit how much needs to be done inside
1952 while (pindexIntermediate->pprev && pindexIntermediate->pprev->nChainTrust > pindexBest->nChainTrust)
1954 vpindexSecondary.push_back(pindexIntermediate);
1955 pindexIntermediate = pindexIntermediate->pprev;
1958 if (!vpindexSecondary.empty())
1959 printf("Postponing %"PRIszu" reconnects\n", vpindexSecondary.size());
1961 // Switch to new best branch
1962 if (!Reorganize(txdb, pindexIntermediate))
1965 InvalidChainFound(pindexNew);
1966 return error("SetBestChain() : Reorganize failed");
1969 // Connect further blocks
1970 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
1973 if (!block.ReadFromDisk(pindex))
1975 printf("SetBestChain() : ReadFromDisk failed\n");
1978 if (!txdb.TxnBegin()) {
1979 printf("SetBestChain() : TxnBegin 2 failed\n");
1982 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
1983 if (!block.SetBestChainInner(txdb, pindex))
1988 // Update best block in wallet (so we can detect restored wallets)
1989 bool fIsInitialDownload = IsInitialBlockDownload();
1990 if (!fIsInitialDownload)
1992 const CBlockLocator locator(pindexNew);
1993 ::SetBestChain(locator);
1997 hashBestChain = hash;
1998 pindexBest = pindexNew;
1999 pblockindexFBBHLast = NULL;
2000 nBestHeight = pindexBest->nHeight;
2001 nBestChainTrust = pindexNew->nChainTrust;
2002 nTimeBestReceived = GetTime();
2003 nTransactionsUpdated++;
2005 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
2007 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
2008 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
2009 CBigNum(nBestChainTrust).ToString().c_str(),
2010 nBestBlockTrust.Get64(),
2011 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
2013 // Check the version of the last 100 blocks to see if we need to upgrade:
2014 if (!fIsInitialDownload)
2017 const CBlockIndex* pindex = pindexBest;
2018 for (int i = 0; i < 100 && pindex != NULL; i++)
2020 if (pindex->nVersion > CBlock::CURRENT_VERSION)
2022 pindex = pindex->pprev;
2025 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
2026 if (nUpgraded > 100/2)
2027 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
2028 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
2031 std::string strCmd = GetArg("-blocknotify", "");
2033 if (!fIsInitialDownload && !strCmd.empty())
2035 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
2036 boost::thread t(runCommand, strCmd); // thread runs free
2042 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
2043 // Only those coins meeting minimum age requirement counts. As those
2044 // transactions not in main chain are not currently indexed so we
2045 // might not find out about their coin age. Older transactions are
2046 // guaranteed to be in main chain by sync-checkpoint. This rule is
2047 // introduced to help nodes establish a consistent view of the coin
2048 // age (trust score) of competing branches.
2049 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64& nCoinAge) const
2051 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
2057 BOOST_FOREACH(const CTxIn& txin, vin)
2059 // First try finding the previous transaction in database
2060 CTransaction txPrev;
2062 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2063 continue; // previous transaction not in main chain
2064 if (nTime < txPrev.nTime)
2065 return false; // Transaction timestamp violation
2067 // Read block header
2069 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
2070 return false; // unable to read block of previous transaction
2071 if (block.GetBlockTime() + nStakeMinAge > nTime)
2072 continue; // only count coins meeting min age requirement
2074 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2075 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
2077 if (fDebug && GetBoolArg("-printcoinage"))
2078 printf("coin age nValueIn=%"PRI64d" nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
2081 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
2082 if (fDebug && GetBoolArg("-printcoinage"))
2083 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
2084 nCoinAge = bnCoinDay.getuint64();
2088 // ppcoin: total coin age spent in block, in the unit of coin-days.
2089 bool CBlock::GetCoinAge(uint64& nCoinAge) const
2094 BOOST_FOREACH(const CTransaction& tx, vtx)
2097 if (tx.GetCoinAge(txdb, nTxCoinAge))
2098 nCoinAge += nTxCoinAge;
2103 if (nCoinAge == 0) // block coin age minimum 1 coin-day
2105 if (fDebug && GetBoolArg("-printcoinage"))
2106 printf("block coin age total nCoinDays=%"PRI64d"\n", nCoinAge);
2110 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
2112 // Check for duplicate
2113 uint256 hash = GetHash();
2114 if (mapBlockIndex.count(hash))
2115 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
2117 // Construct new block index object
2118 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
2120 return error("AddToBlockIndex() : new CBlockIndex failed");
2121 pindexNew->phashBlock = &hash;
2122 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
2123 if (miPrev != mapBlockIndex.end())
2125 pindexNew->pprev = (*miPrev).second;
2126 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
2129 // ppcoin: compute chain trust score
2130 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + pindexNew->GetBlockTrust();
2132 // ppcoin: compute stake entropy bit for stake modifier
2133 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nTime)))
2134 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
2136 // ppcoin: record proof-of-stake hash value
2137 if (pindexNew->IsProofOfStake())
2139 if (!mapProofOfStake.count(hash))
2140 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2141 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2144 // ppcoin: compute stake modifier
2145 uint64 nStakeModifier = 0;
2146 bool fGeneratedStakeModifier = false;
2147 if (!ComputeNextStakeModifier(pindexNew, nStakeModifier, fGeneratedStakeModifier))
2148 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2149 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2150 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2151 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2152 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016"PRI64x, pindexNew->nHeight, nStakeModifier);
2154 // Add to mapBlockIndex
2155 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2156 if (pindexNew->IsProofOfStake())
2157 setStakeSeen.insert(make_pair(pindexNew->prevoutStake, pindexNew->nStakeTime));
2158 pindexNew->phashBlock = &((*mi).first);
2160 // Write to disk block index
2162 if (!txdb.TxnBegin())
2164 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
2165 if (!txdb.TxnCommit())
2169 if (pindexNew->nChainTrust > nBestChainTrust)
2170 if (!SetBestChain(txdb, pindexNew))
2173 if (pindexNew == pindexBest)
2175 // Notify UI to display prev block's coinbase if it was ours
2176 static uint256 hashPrevBestCoinBase;
2177 UpdatedTransaction(hashPrevBestCoinBase);
2178 hashPrevBestCoinBase = vtx[0].GetHash();
2181 uiInterface.NotifyBlocksChanged();
2188 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot, bool fCheckSig) const
2190 // These are checks that are independent of context
2191 // that can be verified before saving an orphan block.
2194 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2195 return DoS(100, error("CheckBlock() : size limits failed"));
2197 bool fProtocol048 = fTestNet || VALIDATION_SWITCH_TIME < nTime;
2199 // Check proof of work matches claimed amount
2200 if (fCheckPOW && IsProofOfWork() && !CheckProofOfWork(GetHash(), nBits))
2201 return DoS(50, error("CheckBlock() : proof of work failed"));
2204 if (GetBlockTime() > FutureDrift(GetAdjustedTime()))
2205 return error("CheckBlock() : block timestamp too far in the future");
2207 // First transaction must be coinbase, the rest must not be
2208 if (vtx.empty() || !vtx[0].IsCoinBase())
2209 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2213 // Check coinbase timestamp
2214 if (GetBlockTime() < (int64)vtx[0].nTime)
2215 return DoS(100, error("CheckBlock() : coinbase timestamp violation"));
2219 // Check coinbase timestamp
2220 if (GetBlockTime() < PastDrift((int64)vtx[0].nTime))
2221 return DoS(50, error("CheckBlock() : coinbase timestamp is too late"));
2224 for (unsigned int i = 1; i < vtx.size(); i++)
2226 if (vtx[i].IsCoinBase())
2227 return DoS(100, error("CheckBlock() : more than one coinbase"));
2229 // Check transaction timestamp
2230 if (GetBlockTime() < (int64)vtx[i].nTime)
2231 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2234 if (IsProofOfStake())
2239 return DoS(100, error("CheckBlock() : non-zero nonce in proof-of-stake block"));
2242 // Coinbase output should be empty if proof-of-stake block
2243 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2244 return DoS(100, error("CheckBlock() : coinbase output not empty for proof-of-stake block"));
2246 // Second transaction must be coinstake, the rest must not be
2247 if (vtx.empty() || !vtx[1].IsCoinStake())
2248 return DoS(100, error("CheckBlock() : second tx is not coinstake"));
2249 for (unsigned int i = 2; i < vtx.size(); i++)
2250 if (vtx[i].IsCoinStake())
2251 return DoS(100, error("CheckBlock() : more than one coinstake"));
2253 // Check coinstake timestamp
2254 if (GetBlockTime() != (int64)vtx[1].nTime)
2255 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%"PRI64d" nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2257 // NovaCoin: check proof-of-stake block signature
2258 if (fCheckSig && !CheckBlockSignature(true))
2259 return DoS(100, error("CheckBlock() : bad proof-of-stake block signature"));
2263 // Should we check proof-of-work block signature or not?
2265 // * Always skip on TestNet
2266 // * Perform checking for the first 9689 blocks
2267 // * Perform checking since last checkpoint until 20 Sep 2013 (will be removed after)
2269 if(!fTestNet && fCheckSig)
2271 bool checkEntropySig = (GetBlockTime() < ENTROPY_SWITCH_TIME);
2273 // NovaCoin: check proof-of-work block signature
2274 if (checkEntropySig && !CheckBlockSignature(false))
2275 return DoS(100, error("CheckBlock() : bad proof-of-work block signature"));
2279 // Check transactions
2280 BOOST_FOREACH(const CTransaction& tx, vtx)
2282 if (!tx.CheckTransaction())
2283 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2286 // Check for duplicate txids. This is caught by ConnectInputs(),
2287 // but catching it earlier avoids a potential DoS attack:
2288 set<uint256> uniqueTx;
2289 BOOST_FOREACH(const CTransaction& tx, vtx)
2291 uniqueTx.insert(tx.GetHash());
2293 if (uniqueTx.size() != vtx.size())
2294 return DoS(100, error("CheckBlock() : duplicate transaction"));
2296 unsigned int nSigOps = 0;
2297 BOOST_FOREACH(const CTransaction& tx, vtx)
2299 nSigOps += tx.GetLegacySigOpCount();
2301 if (nSigOps > MAX_BLOCK_SIGOPS)
2302 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2304 // Check merkle root
2305 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2306 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2312 bool CBlock::AcceptBlock()
2314 // Check for duplicate
2315 uint256 hash = GetHash();
2316 if (mapBlockIndex.count(hash))
2317 return error("AcceptBlock() : block already in mapBlockIndex");
2319 // Get prev block index
2320 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
2321 if (mi == mapBlockIndex.end())
2322 return DoS(10, error("AcceptBlock() : prev block not found"));
2323 CBlockIndex* pindexPrev = (*mi).second;
2324 int nHeight = pindexPrev->nHeight+1;
2326 // Check proof-of-work or proof-of-stake
2327 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2328 return DoS(100, error("AcceptBlock() : incorrect %s", IsProofOfWork() ? "proof-of-work" : "proof-of-stake"));
2330 // Check timestamp against prev
2331 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || FutureDrift(GetBlockTime()) < pindexPrev->GetBlockTime())
2332 return error("AcceptBlock() : block's timestamp is too early");
2334 // Check that all transactions are finalized
2335 BOOST_FOREACH(const CTransaction& tx, vtx)
2336 if (!tx.IsFinal(nHeight, GetBlockTime()))
2337 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2339 // Check that the block chain matches the known block chain up to a checkpoint
2340 if (!Checkpoints::CheckHardened(nHeight, hash))
2341 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2343 bool cpSatisfies = Checkpoints::CheckSync(hash, pindexPrev);
2345 // Check that the block satisfies synchronized checkpoint
2346 if (CheckpointsMode == Checkpoints::STRICT && !cpSatisfies)
2347 return error("AcceptBlock() : rejected by synchronized checkpoint");
2349 if (CheckpointsMode == Checkpoints::ADVISORY && !cpSatisfies)
2350 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2352 // Enforce rule that the coinbase starts with serialized block height
2353 CScript expect = CScript() << nHeight;
2354 if (vtx[0].vin[0].scriptSig.size() < expect.size() ||
2355 !std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2356 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2358 // Write block to history file
2359 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2360 return error("AcceptBlock() : out of disk space");
2361 unsigned int nFile = -1;
2362 unsigned int nBlockPos = 0;
2363 if (!WriteToDisk(nFile, nBlockPos))
2364 return error("AcceptBlock() : WriteToDisk failed");
2365 if (!AddToBlockIndex(nFile, nBlockPos))
2366 return error("AcceptBlock() : AddToBlockIndex failed");
2368 // Relay inventory, but don't relay old inventory during initial block download
2369 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2370 if (hashBestChain == hash)
2373 BOOST_FOREACH(CNode* pnode, vNodes)
2374 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2375 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2378 // ppcoin: check pending sync-checkpoint
2379 Checkpoints::AcceptPendingSyncCheckpoint();
2384 uint256 CBlockIndex::GetBlockTrust() const
2387 bnTarget.SetCompact(nBits);
2393 if (!fTestNet && GetBlockTime() < CHAINCHECKS_SWITCH_TIME)
2394 return (IsProofOfStake()? ((CBigNum(1)<<256) / (bnTarget+1)).getuint256() : 1);
2398 // Calculate work amount for block
2399 uint256 nPoWTrust = (CBigNum(nPoWBase) / (bnTarget+1)).getuint256();
2401 // Set nPowTrust to 1 if we are checking PoS block or PoW difficulty is too low
2402 nPoWTrust = (IsProofOfStake() || nPoWTrust < 1) ? 1 : nPoWTrust;
2404 // Return nPoWTrust for the first 12 blocks
2405 if (pprev == NULL || pprev->nHeight < 12)
2408 const CBlockIndex* currentIndex = pprev;
2410 if(IsProofOfStake())
2412 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2414 // Return 1/3 of score if parent block is not the PoW block
2415 if (!pprev->IsProofOfWork())
2416 return (bnNewTrust / 3).getuint256();
2420 // Check last 12 blocks type
2421 while (pprev->nHeight - currentIndex->nHeight < 12)
2423 if (currentIndex->IsProofOfWork())
2425 currentIndex = currentIndex->pprev;
2428 // Return 1/3 of score if less than 3 PoW blocks found
2430 return (bnNewTrust / 3).getuint256();
2432 return bnNewTrust.getuint256();
2436 CBigNum bnLastBlockTrust = CBigNum(pprev->nChainTrust - pprev->pprev->nChainTrust);
2438 // Return nPoWTrust + 2/3 of previous block score if two parent blocks are not PoS blocks
2439 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2440 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2444 // Check last 12 blocks type
2445 while (pprev->nHeight - currentIndex->nHeight < 12)
2447 if (currentIndex->IsProofOfStake())
2449 currentIndex = currentIndex->pprev;
2452 // Return nPoWTrust + 2/3 of previous block score if less than 7 PoS blocks found
2454 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2456 bnTarget.SetCompact(pprev->nBits);
2461 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2463 // Return nPoWTrust + full trust score for previous block nBits
2464 return nPoWTrust + bnNewTrust.getuint256();
2468 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2470 unsigned int nFound = 0;
2471 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2473 if (pstart->nVersion >= minVersion)
2475 pstart = pstart->pprev;
2477 return (nFound >= nRequired);
2480 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2482 // Check for duplicate
2483 uint256 hash = pblock->GetHash();
2484 if (mapBlockIndex.count(hash))
2485 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2486 if (mapOrphanBlocks.count(hash))
2487 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2489 // ppcoin: check proof-of-stake
2490 // Limited duplicity on stake: prevents block flood attack
2491 // Duplicate stake allowed only when there is orphan child block
2492 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2493 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());
2495 // Preliminary checks
2496 if (!pblock->CheckBlock())
2497 return error("ProcessBlock() : CheckBlock FAILED");
2499 // ppcoin: verify hash target and signature of coinstake tx
2500 if (pblock->IsProofOfStake())
2502 uint256 hashProofOfStake = 0, targetProofOfStake = 0;
2503 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake, targetProofOfStake))
2505 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2506 return false; // do not error here as we expect this during initial block download
2508 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2509 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2512 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2513 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2515 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2516 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2518 bnNewBlock.SetCompact(pblock->nBits);
2521 if (pblock->IsProofOfStake())
2522 bnRequired.SetCompact(ComputeMinStake(GetLastBlockIndex(pcheckpoint, true)->nBits, deltaTime, pblock->nTime));
2524 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, false)->nBits, deltaTime));
2526 if (bnNewBlock > bnRequired)
2529 pfrom->Misbehaving(100);
2530 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2534 // ppcoin: ask for pending sync-checkpoint if any
2535 if (!IsInitialBlockDownload())
2536 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2538 // If don't already have its previous block, shunt it off to holding area until we get it
2539 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2541 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2542 CBlock* pblock2 = new CBlock(*pblock);
2543 // ppcoin: check proof-of-stake
2544 if (pblock2->IsProofOfStake())
2546 // Limited duplicity on stake: prevents block flood attack
2547 // Duplicate stake allowed only when there is orphan child block
2548 if (setStakeSeenOrphan.count(pblock2->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2549 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());
2551 setStakeSeenOrphan.insert(pblock2->GetProofOfStake());
2553 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2554 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2556 // Ask this guy to fill in what we're missing
2559 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2560 // ppcoin: getblocks may not obtain the ancestor block rejected
2561 // earlier by duplicate-stake check so we ask for it again directly
2562 if (!IsInitialBlockDownload())
2563 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2569 if (!pblock->AcceptBlock())
2570 return error("ProcessBlock() : AcceptBlock FAILED");
2572 // Recursively process any orphan blocks that depended on this one
2573 vector<uint256> vWorkQueue;
2574 vWorkQueue.push_back(hash);
2575 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2577 uint256 hashPrev = vWorkQueue[i];
2578 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2579 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2582 CBlock* pblockOrphan = (*mi).second;
2583 if (pblockOrphan->AcceptBlock())
2584 vWorkQueue.push_back(pblockOrphan->GetHash());
2585 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2586 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2587 delete pblockOrphan;
2589 mapOrphanBlocksByPrev.erase(hashPrev);
2592 printf("ProcessBlock: ACCEPTED\n");
2594 // ppcoin: if responsible for sync-checkpoint send it
2595 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2596 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2601 // novacoin: attempt to generate suitable proof-of-stake
2602 bool CBlock::SignBlock(CWallet& wallet)
2604 // if we are trying to sign
2605 // something except proof-of-stake block template
2606 if (!vtx[0].vout[0].IsEmpty())
2609 // if we are trying to sign
2610 // a complete proof-of-stake block
2611 if (IsProofOfStake())
2614 static int64 nLastCoinStakeSearchTime = GetAdjustedTime(); // startup timestamp
2617 CTransaction txCoinStake;
2618 int64 nSearchTime = txCoinStake.nTime; // search to current time
2620 if (nSearchTime > nLastCoinStakeSearchTime)
2622 if (wallet.CreateCoinStake(wallet, nBits, nSearchTime-nLastCoinStakeSearchTime, txCoinStake, key))
2624 if (txCoinStake.nTime >= max(pindexBest->GetMedianTimePast()+1, PastDrift(pindexBest->GetBlockTime())))
2626 // make sure coinstake would meet timestamp protocol
2627 // as it would be the same as the block timestamp
2628 vtx[0].nTime = nTime = txCoinStake.nTime;
2629 nTime = max(pindexBest->GetMedianTimePast()+1, GetMaxTransactionTime());
2630 nTime = max(GetBlockTime(), PastDrift(pindexBest->GetBlockTime()));
2632 // we have to make sure that we have no future timestamps in
2633 // our transactions set
2634 for (vector<CTransaction>::iterator it = vtx.begin(); it != vtx.end();)
2635 if (it->nTime > nTime) { it = vtx.erase(it); } else { ++it; }
2637 vtx.insert(vtx.begin() + 1, txCoinStake);
2638 hashMerkleRoot = BuildMerkleTree();
2640 // append a signature to our block
2641 return key.Sign(GetHash(), vchBlockSig);
2644 nLastCoinStakeSearchInterval = nSearchTime - nLastCoinStakeSearchTime;
2645 nLastCoinStakeSearchTime = nSearchTime;
2651 // ppcoin: check block signature
2652 bool CBlock::CheckBlockSignature(bool fProofOfStake) const
2654 if (GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
2655 return vchBlockSig.empty();
2657 vector<valtype> vSolutions;
2658 txnouttype whichType;
2662 const CTxOut& txout = vtx[1].vout[1];
2664 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2666 if (whichType == TX_PUBKEY)
2668 valtype& vchPubKey = vSolutions[0];
2670 if (!key.SetPubKey(vchPubKey))
2672 if (vchBlockSig.empty())
2674 return key.Verify(GetHash(), vchBlockSig);
2679 for(unsigned int i = 0; i < vtx[0].vout.size(); i++)
2681 const CTxOut& txout = vtx[0].vout[i];
2683 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2686 if (whichType == TX_PUBKEY)
2689 valtype& vchPubKey = vSolutions[0];
2691 if (!key.SetPubKey(vchPubKey))
2693 if (vchBlockSig.empty())
2695 if(!key.Verify(GetHash(), vchBlockSig))
2705 bool CheckDiskSpace(uint64 nAdditionalBytes)
2707 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2709 // Check for nMinDiskSpace bytes (currently 50MB)
2710 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2713 string strMessage = _("Warning: Disk space is low!");
2714 strMiscWarning = strMessage;
2715 printf("*** %s\n", strMessage.c_str());
2716 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2723 static filesystem::path BlockFilePath(unsigned int nFile)
2725 string strBlockFn = strprintf("blk%04u.dat", nFile);
2726 return GetDataDir() / strBlockFn;
2729 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
2731 if ((nFile < 1) || (nFile == (unsigned int) -1))
2733 FILE* file = fopen(BlockFilePath(nFile).string().c_str(), pszMode);
2736 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
2738 if (fseek(file, nBlockPos, SEEK_SET) != 0)
2747 static unsigned int nCurrentBlockFile = 1;
2749 FILE* AppendBlockFile(unsigned int& nFileRet)
2754 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
2757 if (fseek(file, 0, SEEK_END) != 0)
2759 // FAT32 file size max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
2760 if (ftell(file) < (long)(0x7F000000 - MAX_SIZE))
2762 nFileRet = nCurrentBlockFile;
2766 nCurrentBlockFile++;
2770 bool LoadBlockIndex(bool fAllowNew)
2772 CBigNum bnTrustedModulus;
2776 pchMessageStart[0] = 0xcd;
2777 pchMessageStart[1] = 0xf2;
2778 pchMessageStart[2] = 0xc0;
2779 pchMessageStart[3] = 0xef;
2781 bnTrustedModulus.SetHex("f0d14cf72623dacfe738d0892b599be0f31052239cddd95a3f25101c801dc990453b38c9434efe3f372db39a32c2bb44cbaea72d62c8931fa785b0ec44531308df3e46069be5573e49bb29f4d479bfc3d162f57a5965db03810be7636da265bfced9c01a6b0296c77910ebdc8016f70174f0f18a57b3b971ac43a934c6aedbc5c866764a3622b5b7e3f9832b8b3f133c849dbcc0396588abcd1e41048555746e4823fb8aba5b3d23692c6857fccce733d6bb6ec1d5ea0afafecea14a0f6f798b6b27f77dc989c557795cc39a0940ef6bb29a7fc84135193a55bcfc2f01dd73efad1b69f45a55198bd0e6bef4d338e452f6a420f1ae2b1167b923f76633ab6e55");
2782 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2783 nStakeMinAge = 2 * 60 * 60; // test net min age is 2 hours
2784 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2785 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2786 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
2790 bnTrustedModulus.SetHex("d01f952e1090a5a72a3eda261083256596ccc192935ae1454c2bafd03b09e6ed11811be9f3a69f5783bbbced8c6a0c56621f42c2d19087416facf2f13cc7ed7159d1c5253119612b8449f0c7f54248e382d30ecab1928dbf075c5425dcaee1a819aa13550e0f3227b8c685b14e0eae094d65d8a610a6f49fff8145259d1187e4c6a472fa5868b2b67f957cb74b787f4311dbc13c97a2ca13acdb876ff506ebecbb904548c267d68868e07a32cd9ed461fbc2f920e9940e7788fed2e4817f274df5839c2196c80abe5c486df39795186d7bc86314ae1e8342f3c884b158b4b05b4302754bf351477d35370bad6639b2195d30006b77bf3dbb28b848fd9ecff5662bf39dde0c974e83af51b0d3d642d43834827b8c3b189065514636b8f2a59c42ba9b4fc4975d4827a5d89617a3873e4b377b4d559ad165748632bd928439cfbc5a8ef49bc2220e0b15fb0aa302367d5e99e379a961c1bc8cf89825da5525e3c8f14d7d8acca2fa9c133a2176ae69874d8b1d38b26b9c694e211018005a97b40848681b9dd38feb2de141626fb82591aad20dc629b2b6421cef1227809551a0e4e943ab99841939877f18f2d9c0addc93cf672e26b02ed94da3e6d329e8ac8f3736eebbf37bb1a21e5aadf04ee8e3b542f876aa88b2adf2608bd86329b7f7a56fd0dc1c40b48188731d11082aea360c62a0840c2db3dad7178fd7e359317ae081");
2793 // Set up the Zerocoin Params object
2794 ZCParams = new libzerocoin::Params(bnTrustedModulus);
2800 if (!txdb.LoadBlockIndex())
2804 // Init with genesis block
2806 if (mapBlockIndex.empty())
2815 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
2816 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2817 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2819 // vMerkleTree: 4cb33b3b6a
2823 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
2824 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2825 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2827 // vMerkleTree: 4cb33b3b6a
2829 const char* pszTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
2831 txNew.nTime = 1360105017;
2832 txNew.vin.resize(1);
2833 txNew.vout.resize(1);
2834 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
2835 txNew.vout[0].SetEmpty();
2837 block.vtx.push_back(txNew);
2838 block.hashPrevBlock = 0;
2839 block.hashMerkleRoot = block.BuildMerkleTree();
2841 block.nTime = 1360105017;
2842 block.nBits = bnProofOfWorkLimit.GetCompact();
2843 block.nNonce = !fTestNet ? 1575379 : 46534;
2846 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
2848 assert(block.GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
2849 assert(block.CheckBlock());
2851 // Start new block file
2853 unsigned int nBlockPos;
2854 if (!block.WriteToDisk(nFile, nBlockPos))
2855 return error("LoadBlockIndex() : writing genesis block to disk failed");
2856 if (!block.AddToBlockIndex(nFile, nBlockPos))
2857 return error("LoadBlockIndex() : genesis block not accepted");
2859 // initialize synchronized checkpoint
2860 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
2861 return error("LoadBlockIndex() : failed to init sync checkpoint");
2863 // upgrade time set to zero if txdb initialized
2865 if (!txdb.WriteModifierUpgradeTime(0))
2866 return error("LoadBlockIndex() : failed to init upgrade info");
2867 printf(" Upgrade Info: ModifierUpgradeTime txdb initialization\n");
2871 string strPubKey = "";
2873 // if checkpoint master key changed must reset sync-checkpoint
2874 if (!txdb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
2876 // write checkpoint master key to db
2878 if (!txdb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
2879 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
2880 if (!txdb.TxnCommit())
2881 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
2882 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
2883 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
2886 // upgrade time set to zero if blocktreedb initialized
2887 if (txdb.ReadModifierUpgradeTime(nModifierUpgradeTime))
2889 if (nModifierUpgradeTime)
2890 printf(" Upgrade Info: blocktreedb upgrade detected at timestamp %d\n", nModifierUpgradeTime);
2892 printf(" Upgrade Info: no blocktreedb upgrade detected.\n");
2896 nModifierUpgradeTime = GetTime();
2897 printf(" Upgrade Info: upgrading blocktreedb at timestamp %u\n", nModifierUpgradeTime);
2898 if (!txdb.WriteModifierUpgradeTime(nModifierUpgradeTime))
2899 return error("LoadBlockIndex() : failed to write upgrade info");
2908 void PrintBlockTree()
2910 // pre-compute tree structure
2911 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2912 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2914 CBlockIndex* pindex = (*mi).second;
2915 mapNext[pindex->pprev].push_back(pindex);
2917 //while (rand() % 3 == 0)
2918 // mapNext[pindex->pprev].push_back(pindex);
2921 vector<pair<int, CBlockIndex*> > vStack;
2922 vStack.push_back(make_pair(0, pindexGenesisBlock));
2925 while (!vStack.empty())
2927 int nCol = vStack.back().first;
2928 CBlockIndex* pindex = vStack.back().second;
2931 // print split or gap
2932 if (nCol > nPrevCol)
2934 for (int i = 0; i < nCol-1; i++)
2938 else if (nCol < nPrevCol)
2940 for (int i = 0; i < nCol; i++)
2947 for (int i = 0; i < nCol; i++)
2952 block.ReadFromDisk(pindex);
2953 printf("%d (%u,%u) %s %08x %s mint %7s tx %"PRIszu"",
2957 block.GetHash().ToString().c_str(),
2959 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2960 FormatMoney(pindex->nMint).c_str(),
2963 PrintWallets(block);
2965 // put the main time-chain first
2966 vector<CBlockIndex*>& vNext = mapNext[pindex];
2967 for (unsigned int i = 0; i < vNext.size(); i++)
2969 if (vNext[i]->pnext)
2971 swap(vNext[0], vNext[i]);
2977 for (unsigned int i = 0; i < vNext.size(); i++)
2978 vStack.push_back(make_pair(nCol+i, vNext[i]));
2982 bool LoadExternalBlockFile(FILE* fileIn)
2984 int64 nStart = GetTimeMillis();
2990 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
2991 unsigned int nPos = 0;
2992 while (nPos != (unsigned int)-1 && blkdat.good() && !fRequestShutdown)
2994 unsigned char pchData[65536];
2996 fseek(blkdat, nPos, SEEK_SET);
2997 int nRead = fread(pchData, 1, sizeof(pchData), blkdat);
3000 nPos = (unsigned int)-1;
3003 void* nFind = memchr(pchData, pchMessageStart[0], nRead+1-sizeof(pchMessageStart));
3006 if (memcmp(nFind, pchMessageStart, sizeof(pchMessageStart))==0)
3008 nPos += ((unsigned char*)nFind - pchData) + sizeof(pchMessageStart);
3011 nPos += ((unsigned char*)nFind - pchData) + 1;
3014 nPos += sizeof(pchData) - sizeof(pchMessageStart) + 1;
3015 } while(!fRequestShutdown);
3016 if (nPos == (unsigned int)-1)
3018 fseek(blkdat, nPos, SEEK_SET);
3021 if (nSize > 0 && nSize <= MAX_BLOCK_SIZE)
3025 if (ProcessBlock(NULL,&block))
3033 catch (std::exception &e) {
3034 printf("%s() : Deserialize or I/O error caught during load\n",
3035 __PRETTY_FUNCTION__);
3038 printf("Loaded %i blocks from external file in %"PRI64d"ms\n", nLoaded, GetTimeMillis() - nStart);
3042 //////////////////////////////////////////////////////////////////////////////
3047 extern map<uint256, CAlert> mapAlerts;
3048 extern CCriticalSection cs_mapAlerts;
3050 string GetWarnings(string strFor)
3053 string strStatusBar;
3056 if (GetBoolArg("-testsafemode"))
3059 // Misc warnings like out of disk space and clock is wrong
3060 if (strMiscWarning != "")
3063 strStatusBar = strMiscWarning;
3066 // if detected unmet upgrade requirement enter safe mode
3067 // Note: Modifier upgrade requires blockchain redownload if past protocol switch
3068 if (IsFixedModifierInterval(nModifierUpgradeTime + 60*60*24)) // 1 day margin
3071 strStatusBar = strRPC = "WARNING: Blockchain redownload required approaching or past v.0.4.4.6u4 upgrade deadline.";
3074 // if detected invalid checkpoint enter safe mode
3075 if (Checkpoints::hashInvalidCheckpoint != 0)
3078 strStatusBar = strRPC = _("WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.");
3084 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3086 const CAlert& alert = item.second;
3087 if (alert.AppliesToMe() && alert.nPriority > nPriority)
3089 nPriority = alert.nPriority;
3090 strStatusBar = alert.strStatusBar;
3091 if (nPriority > 1000)
3092 strRPC = strStatusBar;
3097 if (strFor == "statusbar")
3098 return strStatusBar;
3099 else if (strFor == "rpc")
3101 assert(!"GetWarnings() : invalid parameter");
3112 //////////////////////////////////////////////////////////////////////////////
3118 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
3124 bool txInMap = false;
3127 txInMap = (mempool.exists(inv.hash));
3130 mapOrphanTransactions.count(inv.hash) ||
3131 txdb.ContainsTx(inv.hash);
3135 return mapBlockIndex.count(inv.hash) ||
3136 mapOrphanBlocks.count(inv.hash);
3138 // Don't know what it is, just say we already got one
3145 // The message start string is designed to be unlikely to occur in normal data.
3146 // The characters are rarely used upper ASCII, not valid as UTF-8, and produce
3147 // a large 4-byte int at any alignment.
3148 unsigned char pchMessageStart[4] = { 0xe4, 0xe8, 0xe9, 0xe5 };
3150 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
3152 static map<CService, CPubKey> mapReuseKey;
3153 RandAddSeedPerfmon();
3155 printf("received: %s (%"PRIszu" bytes)\n", strCommand.c_str(), vRecv.size());
3156 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
3158 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3162 if (strCommand == "version")
3164 // Each connection can only send one version message
3165 if (pfrom->nVersion != 0)
3167 pfrom->Misbehaving(1);
3175 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3176 if (pfrom->nVersion < MIN_PROTO_VERSION)
3178 // Since February 20, 2012, the protocol is initiated at version 209,
3179 // and earlier versions are no longer supported
3180 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3181 pfrom->fDisconnect = true;
3185 if (pfrom->nVersion == 10300)
3186 pfrom->nVersion = 300;
3188 vRecv >> addrFrom >> nNonce;
3190 vRecv >> pfrom->strSubVer;
3192 vRecv >> pfrom->nStartingHeight;
3194 if (pfrom->fInbound && addrMe.IsRoutable())
3196 pfrom->addrLocal = addrMe;
3200 // Disconnect if we connected to ourself
3201 if (nNonce == nLocalHostNonce && nNonce > 1)
3203 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3204 pfrom->fDisconnect = true;
3208 if (pfrom->nVersion < 60010)
3210 printf("partner %s using a buggy client %d, disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3211 pfrom->fDisconnect = true;
3215 // record my external IP reported by peer
3216 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3217 addrSeenByPeer = addrMe;
3219 // Be shy and don't send version until we hear
3220 if (pfrom->fInbound)
3221 pfrom->PushVersion();
3223 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3225 AddTimeData(pfrom->addr, nTime);
3228 pfrom->PushMessage("verack");
3229 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3231 if (!pfrom->fInbound)
3233 // Advertise our address
3234 if (!fNoListen && !IsInitialBlockDownload())
3236 CAddress addr = GetLocalAddress(&pfrom->addr);
3237 if (addr.IsRoutable())
3238 pfrom->PushAddress(addr);
3241 // Get recent addresses
3242 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3244 pfrom->PushMessage("getaddr");
3245 pfrom->fGetAddr = true;
3247 addrman.Good(pfrom->addr);
3249 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3251 addrman.Add(addrFrom, addrFrom);
3252 addrman.Good(addrFrom);
3256 // Ask the first connected node for block updates
3257 static int nAskedForBlocks = 0;
3258 if (!pfrom->fClient && !pfrom->fOneShot &&
3259 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3260 (pfrom->nVersion < NOBLKS_VERSION_START ||
3261 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3262 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3265 pfrom->PushGetBlocks(pindexBest, uint256(0));
3271 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3272 item.second.RelayTo(pfrom);
3275 // Relay sync-checkpoint
3277 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3278 if (!Checkpoints::checkpointMessage.IsNull())
3279 Checkpoints::checkpointMessage.RelayTo(pfrom);
3282 pfrom->fSuccessfullyConnected = true;
3284 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());
3286 cPeerBlockCounts.input(pfrom->nStartingHeight);
3288 // ppcoin: ask for pending sync-checkpoint if any
3289 if (!IsInitialBlockDownload())
3290 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3294 else if (pfrom->nVersion == 0)
3296 // Must have a version message before anything else
3297 pfrom->Misbehaving(1);
3302 else if (strCommand == "verack")
3304 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3308 else if (strCommand == "addr")
3310 vector<CAddress> vAddr;
3313 // Don't want addr from older versions unless seeding
3314 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3316 if (vAddr.size() > 1000)
3318 pfrom->Misbehaving(20);
3319 return error("message addr size() = %"PRIszu"", vAddr.size());
3322 // Store the new addresses
3323 vector<CAddress> vAddrOk;
3324 int64 nNow = GetAdjustedTime();
3325 int64 nSince = nNow - 10 * 60;
3326 BOOST_FOREACH(CAddress& addr, vAddr)
3330 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3331 addr.nTime = nNow - 5 * 24 * 60 * 60;
3332 pfrom->AddAddressKnown(addr);
3333 bool fReachable = IsReachable(addr);
3334 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3336 // Relay to a limited number of other nodes
3339 // Use deterministic randomness to send to the same nodes for 24 hours
3340 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3341 static uint256 hashSalt;
3343 hashSalt = GetRandHash();
3344 uint64 hashAddr = addr.GetHash();
3345 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
3346 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3347 multimap<uint256, CNode*> mapMix;
3348 BOOST_FOREACH(CNode* pnode, vNodes)
3350 if (pnode->nVersion < CADDR_TIME_VERSION)
3352 unsigned int nPointer;
3353 memcpy(&nPointer, &pnode, sizeof(nPointer));
3354 uint256 hashKey = hashRand ^ nPointer;
3355 hashKey = Hash(BEGIN(hashKey), END(hashKey));
3356 mapMix.insert(make_pair(hashKey, pnode));
3358 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3359 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3360 ((*mi).second)->PushAddress(addr);
3363 // Do not store addresses outside our network
3365 vAddrOk.push_back(addr);
3367 addrman.Add(vAddrOk, pfrom->addr, 2 * 60 * 60);
3368 if (vAddr.size() < 1000)
3369 pfrom->fGetAddr = false;
3370 if (pfrom->fOneShot)
3371 pfrom->fDisconnect = true;
3374 else if (strCommand == "inv")
3378 if (vInv.size() > MAX_INV_SZ)
3380 pfrom->Misbehaving(20);
3381 return error("message inv size() = %"PRIszu"", vInv.size());
3384 // find last block in inv vector
3385 unsigned int nLastBlock = (unsigned int)(-1);
3386 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++) {
3387 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
3388 nLastBlock = vInv.size() - 1 - nInv;
3393 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
3395 const CInv &inv = vInv[nInv];
3399 pfrom->AddInventoryKnown(inv);
3401 bool fAlreadyHave = AlreadyHave(txdb, inv);
3403 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3407 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
3408 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
3409 } else if (nInv == nLastBlock) {
3410 // In case we are on a very long side-chain, it is possible that we already have
3411 // the last block in an inv bundle sent in response to getblocks. Try to detect
3412 // this situation and push another getblocks to continue.
3413 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
3415 printf("force request: %s\n", inv.ToString().c_str());
3418 // Track requests for our stuff
3419 Inventory(inv.hash);
3424 else if (strCommand == "getdata")
3428 if (vInv.size() > MAX_INV_SZ)
3430 pfrom->Misbehaving(20);
3431 return error("message getdata size() = %"PRIszu"", vInv.size());
3434 if (fDebugNet || (vInv.size() != 1))
3435 printf("received getdata (%"PRIszu" invsz)\n", vInv.size());
3437 BOOST_FOREACH(const CInv& inv, vInv)
3441 if (fDebugNet || (vInv.size() == 1))
3442 printf("received getdata for: %s\n", inv.ToString().c_str());
3444 if (inv.type == MSG_BLOCK)
3446 // Send block from disk
3447 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
3448 if (mi != mapBlockIndex.end())
3451 block.ReadFromDisk((*mi).second);
3452 pfrom->PushMessage("block", block);
3454 // Trigger them to send a getblocks request for the next batch of inventory
3455 if (inv.hash == pfrom->hashContinue)
3457 // ppcoin: send latest proof-of-work block to allow the
3458 // download node to accept as orphan (proof-of-stake
3459 // block might be rejected by stake connection check)
3461 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3462 pfrom->PushMessage("inv", vInv);
3463 pfrom->hashContinue = 0;
3467 else if (inv.IsKnownType())
3469 // Send stream from relay memory
3470 bool pushed = false;
3473 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
3474 if (mi != mapRelay.end()) {
3475 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3479 if (!pushed && inv.type == MSG_TX) {
3481 if (mempool.exists(inv.hash)) {
3482 CTransaction tx = mempool.lookup(inv.hash);
3483 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3486 pfrom->PushMessage("tx", ss);
3491 // Track requests for our stuff
3492 Inventory(inv.hash);
3497 else if (strCommand == "getblocks")
3499 CBlockLocator locator;
3501 vRecv >> locator >> hashStop;
3503 // Find the last block the caller has in the main chain
3504 CBlockIndex* pindex = locator.GetBlockIndex();
3506 // Send the rest of the chain
3508 pindex = pindex->pnext;
3510 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3511 for (; pindex; pindex = pindex->pnext)
3513 if (pindex->GetBlockHash() == hashStop)
3515 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3516 // ppcoin: tell downloading node about the latest block if it's
3517 // without risk being rejected due to stake connection check
3518 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3519 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3522 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3525 // When this block is requested, we'll send an inv that'll make them
3526 // getblocks the next batch of inventory.
3527 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3528 pfrom->hashContinue = pindex->GetBlockHash();
3533 else if (strCommand == "checkpoint")
3535 CSyncCheckpoint checkpoint;
3536 vRecv >> checkpoint;
3538 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3541 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3543 BOOST_FOREACH(CNode* pnode, vNodes)
3544 checkpoint.RelayTo(pnode);
3548 else if (strCommand == "getheaders")
3550 CBlockLocator locator;
3552 vRecv >> locator >> hashStop;
3554 CBlockIndex* pindex = NULL;
3555 if (locator.IsNull())
3557 // If locator is null, return the hashStop block
3558 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
3559 if (mi == mapBlockIndex.end())
3561 pindex = (*mi).second;
3565 // Find the last block the caller has in the main chain
3566 pindex = locator.GetBlockIndex();
3568 pindex = pindex->pnext;
3571 vector<CBlock> vHeaders;
3573 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3574 for (; pindex; pindex = pindex->pnext)
3576 vHeaders.push_back(pindex->GetBlockHeader());
3577 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3580 pfrom->PushMessage("headers", vHeaders);
3584 else if (strCommand == "tx")
3586 vector<uint256> vWorkQueue;
3587 vector<uint256> vEraseQueue;
3588 CDataStream vMsg(vRecv);
3593 CInv inv(MSG_TX, tx.GetHash());
3594 pfrom->AddInventoryKnown(inv);
3596 bool fMissingInputs = false;
3597 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
3599 SyncWithWallets(tx, NULL, true);
3600 RelayTransaction(tx, inv.hash);
3601 mapAlreadyAskedFor.erase(inv);
3602 vWorkQueue.push_back(inv.hash);
3603 vEraseQueue.push_back(inv.hash);
3605 // Recursively process any orphan transactions that depended on this one
3606 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3608 uint256 hashPrev = vWorkQueue[i];
3609 for (set<uint256>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3610 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3613 const uint256& orphanTxHash = *mi;
3614 CTransaction& orphanTx = mapOrphanTransactions[orphanTxHash];
3615 bool fMissingInputs2 = false;
3617 if (orphanTx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
3619 printf(" accepted orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3620 SyncWithWallets(tx, NULL, true);
3621 RelayTransaction(orphanTx, orphanTxHash);
3622 mapAlreadyAskedFor.erase(CInv(MSG_TX, orphanTxHash));
3623 vWorkQueue.push_back(orphanTxHash);
3624 vEraseQueue.push_back(orphanTxHash);
3626 else if (!fMissingInputs2)
3629 vEraseQueue.push_back(orphanTxHash);
3630 printf(" removed invalid orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3635 BOOST_FOREACH(uint256 hash, vEraseQueue)
3636 EraseOrphanTx(hash);
3638 else if (fMissingInputs)
3642 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3643 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3645 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3647 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3651 else if (strCommand == "block")
3655 uint256 hashBlock = block.GetHash();
3657 printf("received block %s\n", hashBlock.ToString().substr(0,20).c_str());
3660 CInv inv(MSG_BLOCK, hashBlock);
3661 pfrom->AddInventoryKnown(inv);
3663 if (ProcessBlock(pfrom, &block))
3664 mapAlreadyAskedFor.erase(inv);
3665 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3669 else if (strCommand == "getaddr")
3671 // Don't return addresses older than nCutOff timestamp
3672 int64 nCutOff = GetTime() - (nNodeLifespan * 24 * 60 * 60);
3673 pfrom->vAddrToSend.clear();
3674 vector<CAddress> vAddr = addrman.GetAddr();
3675 BOOST_FOREACH(const CAddress &addr, vAddr)
3676 if(addr.nTime > nCutOff)
3677 pfrom->PushAddress(addr);
3681 else if (strCommand == "mempool")
3683 std::vector<uint256> vtxid;
3684 mempool.queryHashes(vtxid);
3686 for (unsigned int i = 0; i < vtxid.size(); i++) {
3687 CInv inv(MSG_TX, vtxid[i]);
3688 vInv.push_back(inv);
3689 if (i == (MAX_INV_SZ - 1))
3692 if (vInv.size() > 0)
3693 pfrom->PushMessage("inv", vInv);
3697 else if (strCommand == "checkorder")
3702 if (!GetBoolArg("-allowreceivebyip"))
3704 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
3711 /// we have a chance to check the order here
3713 // Keep giving the same key to the same ip until they use it
3714 if (!mapReuseKey.count(pfrom->addr))
3715 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3717 // Send back approval of order and pubkey to use
3718 CScript scriptPubKey;
3719 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3720 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
3724 else if (strCommand == "reply")
3729 CRequestTracker tracker;
3731 LOCK(pfrom->cs_mapRequests);
3732 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
3733 if (mi != pfrom->mapRequests.end())
3735 tracker = (*mi).second;
3736 pfrom->mapRequests.erase(mi);
3739 if (!tracker.IsNull())
3740 tracker.fn(tracker.param1, vRecv);
3744 else if (strCommand == "ping")
3746 if (pfrom->nVersion > BIP0031_VERSION)
3750 // Echo the message back with the nonce. This allows for two useful features:
3752 // 1) A remote node can quickly check if the connection is operational
3753 // 2) Remote nodes can measure the latency of the network thread. If this node
3754 // is overloaded it won't respond to pings quickly and the remote node can
3755 // avoid sending us more work, like chain download requests.
3757 // The nonce stops the remote getting confused between different pings: without
3758 // it, if the remote node sends a ping once per second and this node takes 5
3759 // seconds to respond to each, the 5th ping the remote sends would appear to
3760 // return very quickly.
3761 pfrom->PushMessage("pong", nonce);
3766 else if (strCommand == "alert")
3771 uint256 alertHash = alert.GetHash();
3772 if (pfrom->setKnown.count(alertHash) == 0)
3774 if (alert.ProcessAlert())
3777 pfrom->setKnown.insert(alertHash);
3780 BOOST_FOREACH(CNode* pnode, vNodes)
3781 alert.RelayTo(pnode);
3785 // Small DoS penalty so peers that send us lots of
3786 // duplicate/expired/invalid-signature/whatever alerts
3787 // eventually get banned.
3788 // This isn't a Misbehaving(100) (immediate ban) because the
3789 // peer might be an older or different implementation with
3790 // a different signature key, etc.
3791 pfrom->Misbehaving(10);
3799 // Ignore unknown commands for extensibility
3803 // Update the last seen time for this node's address
3804 if (pfrom->fNetworkNode)
3805 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3806 AddressCurrentlyConnected(pfrom->addr);
3812 bool ProcessMessages(CNode* pfrom)
3814 CDataStream& vRecv = pfrom->vRecv;
3818 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3822 // (4) message start
3831 // Don't bother if send buffer is too full to respond anyway
3832 if (pfrom->vSend.size() >= SendBufferSize())
3835 // Scan for message start
3836 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
3837 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3838 if (vRecv.end() - pstart < nHeaderSize)
3840 if ((int)vRecv.size() > nHeaderSize)
3842 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
3843 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
3847 if (pstart - vRecv.begin() > 0)
3848 printf("\n\nPROCESSMESSAGE SKIPPED %"PRIpdd" BYTES\n\n", pstart - vRecv.begin());
3849 vRecv.erase(vRecv.begin(), pstart);
3852 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
3857 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
3860 string strCommand = hdr.GetCommand();
3863 unsigned int nMessageSize = hdr.nMessageSize;
3864 if (nMessageSize > MAX_SIZE)
3866 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
3869 if (nMessageSize > vRecv.size())
3871 // Rewind and wait for rest of message
3872 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
3877 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
3878 unsigned int nChecksum = 0;
3879 memcpy(&nChecksum, &hash, sizeof(nChecksum));
3880 if (nChecksum != hdr.nChecksum)
3882 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
3883 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
3887 // Copy message to its own buffer
3888 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
3889 vRecv.ignore(nMessageSize);
3897 fRet = ProcessMessage(pfrom, strCommand, vMsg);
3902 catch (std::ios_base::failure& e)
3904 if (strstr(e.what(), "end of data"))
3906 // Allow exceptions from under-length message on vRecv
3907 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());
3909 else if (strstr(e.what(), "size too large"))
3911 // Allow exceptions from over-long size
3912 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
3916 PrintExceptionContinue(&e, "ProcessMessages()");
3919 catch (std::exception& e) {
3920 PrintExceptionContinue(&e, "ProcessMessages()");
3922 PrintExceptionContinue(NULL, "ProcessMessages()");
3926 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
3934 bool SendMessages(CNode* pto, bool fSendTrickle)
3936 TRY_LOCK(cs_main, lockMain);
3938 // Don't send anything until we get their version message
3939 if (pto->nVersion == 0)
3942 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
3944 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
3946 if (pto->nVersion > BIP0031_VERSION)
3947 pto->PushMessage("ping", nonce);
3949 pto->PushMessage("ping");
3952 // Resend wallet transactions that haven't gotten in a block yet
3953 ResendWalletTransactions();
3955 // Address refresh broadcast
3956 static int64 nLastRebroadcast;
3957 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
3961 BOOST_FOREACH(CNode* pnode, vNodes)
3963 // Periodically clear setAddrKnown to allow refresh broadcasts
3964 if (nLastRebroadcast)
3965 pnode->setAddrKnown.clear();
3967 // Rebroadcast our address
3970 CAddress addr = GetLocalAddress(&pnode->addr);
3971 if (addr.IsRoutable())
3972 pnode->PushAddress(addr);
3976 nLastRebroadcast = GetTime();
3984 vector<CAddress> vAddr;
3985 vAddr.reserve(pto->vAddrToSend.size());
3986 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
3988 // returns true if wasn't already contained in the set
3989 if (pto->setAddrKnown.insert(addr).second)
3991 vAddr.push_back(addr);
3992 // receiver rejects addr messages larger than 1000
3993 if (vAddr.size() >= 1000)
3995 pto->PushMessage("addr", vAddr);
4000 pto->vAddrToSend.clear();
4002 pto->PushMessage("addr", vAddr);
4007 // Message: inventory
4010 vector<CInv> vInvWait;
4012 LOCK(pto->cs_inventory);
4013 vInv.reserve(pto->vInventoryToSend.size());
4014 vInvWait.reserve(pto->vInventoryToSend.size());
4015 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
4017 if (pto->setInventoryKnown.count(inv))
4020 // trickle out tx inv to protect privacy
4021 if (inv.type == MSG_TX && !fSendTrickle)
4023 // 1/4 of tx invs blast to all immediately
4024 static uint256 hashSalt;
4026 hashSalt = GetRandHash();
4027 uint256 hashRand = inv.hash ^ hashSalt;
4028 hashRand = Hash(BEGIN(hashRand), END(hashRand));
4029 bool fTrickleWait = ((hashRand & 3) != 0);
4031 // always trickle our own transactions
4035 if (GetTransaction(inv.hash, wtx))
4037 fTrickleWait = true;
4042 vInvWait.push_back(inv);
4047 // returns true if wasn't already contained in the set
4048 if (pto->setInventoryKnown.insert(inv).second)
4050 vInv.push_back(inv);
4051 if (vInv.size() >= 1000)
4053 pto->PushMessage("inv", vInv);
4058 pto->vInventoryToSend = vInvWait;
4061 pto->PushMessage("inv", vInv);
4067 vector<CInv> vGetData;
4068 int64 nNow = GetTime() * 1000000;
4070 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
4072 const CInv& inv = (*pto->mapAskFor.begin()).second;
4073 if (!AlreadyHave(txdb, inv))
4076 printf("sending getdata: %s\n", inv.ToString().c_str());
4077 vGetData.push_back(inv);
4078 if (vGetData.size() >= 1000)
4080 pto->PushMessage("getdata", vGetData);
4083 mapAlreadyAskedFor[inv] = nNow;
4085 pto->mapAskFor.erase(pto->mapAskFor.begin());
4087 if (!vGetData.empty())
4088 pto->PushMessage("getdata", vGetData);