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"
13 #include "checkqueue.h"
15 #include "zerocoin/Zerocoin.h"
16 #include <boost/algorithm/string/replace.hpp>
17 #include <boost/filesystem.hpp>
18 #include <boost/filesystem/fstream.hpp>
22 using namespace boost;
28 CCriticalSection cs_setpwalletRegistered;
29 set<CWallet*> setpwalletRegistered;
31 CCriticalSection cs_main;
34 unsigned int nTransactionsUpdated = 0;
36 map<uint256, CBlockIndex*> mapBlockIndex;
37 set<pair<COutPoint, unsigned int> > setStakeSeen;
38 libzerocoin::Params* ZCParams;
40 CBigNum bnProofOfWorkLimit(~uint256(0) >> 20); // "standard" scrypt target limit for proof of work, results with 0,000244140625 proof-of-work difficulty
41 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
42 CBigNum bnProofOfStakeLimit(~uint256(0) >> 27); // proof of stake target limit since 20 June 2013, equal to 0.03125 proof of stake difficulty
43 CBigNum bnProofOfStakeHardLimit(~uint256(0) >> 30); // disabled temporarily, will be used in the future to fix minimal proof of stake difficulty at 0.25
44 uint256 nPoWBase = uint256("0x00000000ffff0000000000000000000000000000000000000000000000000000"); // difficulty-1 target
46 CBigNum bnProofOfWorkLimitTestNet(~uint256(0) >> 16);
48 unsigned int nStakeMinAge = 60 * 60 * 24 * 30; // 30 days as zero time weight
49 unsigned int nStakeMaxAge = 60 * 60 * 24 * 90; // 90 days as full weight
50 unsigned int nStakeTargetSpacing = 10 * 60; // 10-minute stakes spacing
51 unsigned int nModifierInterval = 6 * 60 * 60; // time to elapse before new modifier is computed
53 int nCoinbaseMaturity = 500;
54 CBlockIndex* pindexGenesisBlock = NULL;
57 uint256 nBestChainTrust = 0;
58 uint256 nBestInvalidTrust = 0;
60 uint256 hashBestChain = 0;
61 CBlockIndex* pindexBest = NULL;
62 int64 nTimeBestReceived = 0;
63 int nScriptCheckThreads = 0;
65 CMedianFilter<int> cPeerBlockCounts(5, 0); // Amount of blocks that other nodes claim to have
67 map<uint256, CBlock*> mapOrphanBlocks;
68 multimap<uint256, CBlock*> mapOrphanBlocksByPrev;
69 set<pair<COutPoint, unsigned int> > setStakeSeenOrphan;
70 map<uint256, uint256> mapProofOfStake;
72 map<uint256, CTransaction> mapOrphanTransactions;
73 map<uint256, set<uint256> > mapOrphanTransactionsByPrev;
75 // Constant stuff for coinbase transactions we create:
76 CScript COINBASE_FLAGS;
78 const string strMessageMagic = "NovaCoin Signed Message:\n";
81 int64 nTransactionFee = MIN_TX_FEE;
82 int64 nMinimumInputValue = MIN_TX_FEE;
84 extern enum Checkpoints::CPMode CheckpointsMode;
86 //////////////////////////////////////////////////////////////////////////////
88 // dispatching functions
91 // These functions dispatch to one or all registered wallets
94 void RegisterWallet(CWallet* pwalletIn)
97 LOCK(cs_setpwalletRegistered);
98 setpwalletRegistered.insert(pwalletIn);
102 void UnregisterWallet(CWallet* pwalletIn)
105 LOCK(cs_setpwalletRegistered);
106 setpwalletRegistered.erase(pwalletIn);
110 // check whether the passed transaction is from us
111 bool static IsFromMe(CTransaction& tx)
113 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
114 if (pwallet->IsFromMe(tx))
119 // get the wallet transaction with the given hash (if it exists)
120 bool static GetTransaction(const uint256& hashTx, CWalletTx& wtx)
122 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
123 if (pwallet->GetTransaction(hashTx,wtx))
128 // erases transaction with the given hash from all wallets
129 void static EraseFromWallets(uint256 hash)
131 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
132 pwallet->EraseFromWallet(hash);
135 // make sure all wallets know about the given transaction, in the given block
136 void SyncWithWallets(const CTransaction& tx, const CBlock* pblock, bool fUpdate, bool fConnect)
140 // ppcoin: wallets need to refund inputs when disconnecting coinstake
141 if (tx.IsCoinStake())
143 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
144 if (pwallet->IsFromMe(tx))
145 pwallet->DisableTransaction(tx);
150 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
151 pwallet->AddToWalletIfInvolvingMe(tx, pblock, fUpdate);
154 // notify wallets about a new best chain
155 void static SetBestChain(const CBlockLocator& loc)
157 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
158 pwallet->SetBestChain(loc);
161 // notify wallets about an updated transaction
162 void static UpdatedTransaction(const uint256& hashTx)
164 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
165 pwallet->UpdatedTransaction(hashTx);
169 void static PrintWallets(const CBlock& block)
171 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
172 pwallet->PrintWallet(block);
175 // notify wallets about an incoming inventory (for request counts)
176 void static Inventory(const uint256& hash)
178 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
179 pwallet->Inventory(hash);
182 // ask wallets to resend their transactions
183 void ResendWalletTransactions()
185 BOOST_FOREACH(CWallet* pwallet, setpwalletRegistered)
186 pwallet->ResendWalletTransactions();
195 //////////////////////////////////////////////////////////////////////////////
197 // mapOrphanTransactions
200 bool AddOrphanTx(const CTransaction& tx)
202 uint256 hash = tx.GetHash();
203 if (mapOrphanTransactions.count(hash))
206 // Ignore big transactions, to avoid a
207 // send-big-orphans memory exhaustion attack. If a peer has a legitimate
208 // large transaction with a missing parent then we assume
209 // it will rebroadcast it later, after the parent transaction(s)
210 // have been mined or received.
211 // 10,000 orphans, each of which is at most 5,000 bytes big is
212 // at most 500 megabytes of orphans:
214 size_t nSize = tx.GetSerializeSize(SER_NETWORK, CTransaction::CURRENT_VERSION);
218 printf("ignoring large orphan tx (size: %"PRIszu", hash: %s)\n", nSize, hash.ToString().substr(0,10).c_str());
222 mapOrphanTransactions[hash] = tx;
223 BOOST_FOREACH(const CTxIn& txin, tx.vin)
224 mapOrphanTransactionsByPrev[txin.prevout.hash].insert(hash);
226 printf("stored orphan tx %s (mapsz %"PRIszu")\n", hash.ToString().substr(0,10).c_str(),
227 mapOrphanTransactions.size());
231 void static EraseOrphanTx(uint256 hash)
233 if (!mapOrphanTransactions.count(hash))
235 const CTransaction& tx = mapOrphanTransactions[hash];
236 BOOST_FOREACH(const CTxIn& txin, tx.vin)
238 mapOrphanTransactionsByPrev[txin.prevout.hash].erase(hash);
239 if (mapOrphanTransactionsByPrev[txin.prevout.hash].empty())
240 mapOrphanTransactionsByPrev.erase(txin.prevout.hash);
242 mapOrphanTransactions.erase(hash);
245 unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans)
247 unsigned int nEvicted = 0;
248 while (mapOrphanTransactions.size() > nMaxOrphans)
250 // Evict a random orphan:
251 uint256 randomhash = GetRandHash();
252 map<uint256, CTransaction>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
253 if (it == mapOrphanTransactions.end())
254 it = mapOrphanTransactions.begin();
255 EraseOrphanTx(it->first);
267 //////////////////////////////////////////////////////////////////////////////
269 // CTransaction and CTxIndex
272 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout, CTxIndex& txindexRet)
275 if (!txdb.ReadTxIndex(prevout.hash, txindexRet))
277 if (!ReadFromDisk(txindexRet.pos))
279 if (prevout.n >= vout.size())
287 bool CTransaction::ReadFromDisk(CTxDB& txdb, COutPoint prevout)
290 return ReadFromDisk(txdb, prevout, txindex);
293 bool CTransaction::ReadFromDisk(COutPoint prevout)
297 return ReadFromDisk(txdb, prevout, txindex);
300 bool CTransaction::IsStandard() const
302 if (nVersion > CTransaction::CURRENT_VERSION)
305 unsigned int nDataOut = 0;
306 txnouttype whichType;
307 BOOST_FOREACH(const CTxIn& txin, vin)
309 // Biggest 'standard' txin is a 3-signature 3-of-3 CHECKMULTISIG
310 // pay-to-script-hash, which is 3 ~80-byte signatures, 3
311 // ~65-byte public keys, plus a few script ops.
312 if (txin.scriptSig.size() > 500)
314 if (!txin.scriptSig.IsPushOnly())
316 if (!txin.scriptSig.HasCanonicalPushes()) {
320 BOOST_FOREACH(const CTxOut& txout, vout) {
321 if (!::IsStandard(txout.scriptPubKey, whichType)) {
324 if (whichType == TX_NULL_DATA)
327 if (txout.nValue == 0) {
330 if (!txout.scriptPubKey.HasCanonicalPushes()) {
336 // only one OP_RETURN txout is permitted
345 // Check transaction inputs, and make sure any
346 // pay-to-script-hash transactions are evaluating IsStandard scripts
348 // Why bother? To avoid denial-of-service attacks; an attacker
349 // can submit a standard HASH... OP_EQUAL transaction,
350 // which will get accepted into blocks. The redemption
351 // script can be anything; an attacker could use a very
352 // expensive-to-check-upon-redemption script like:
353 // DUP CHECKSIG DROP ... repeated 100 times... OP_1
355 bool CTransaction::AreInputsStandard(const MapPrevTx& mapInputs) const
358 return true; // Coinbases don't use vin normally
360 for (unsigned int i = 0; i < vin.size(); i++)
362 const CTxOut& prev = GetOutputFor(vin[i], mapInputs);
364 vector<vector<unsigned char> > vSolutions;
365 txnouttype whichType;
366 // get the scriptPubKey corresponding to this input:
367 const CScript& prevScript = prev.scriptPubKey;
368 if (!Solver(prevScript, whichType, vSolutions))
370 int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
371 if (nArgsExpected < 0)
374 // Transactions with extra stuff in their scriptSigs are
375 // non-standard. Note that this EvalScript() call will
376 // be quick, because if there are any operations
377 // beside "push data" in the scriptSig the
378 // IsStandard() call returns false
379 vector<vector<unsigned char> > stack;
380 if (!EvalScript(stack, vin[i].scriptSig, *this, i, false, 0))
383 if (whichType == TX_SCRIPTHASH)
387 CScript subscript(stack.back().begin(), stack.back().end());
388 vector<vector<unsigned char> > vSolutions2;
389 txnouttype whichType2;
390 if (!Solver(subscript, whichType2, vSolutions2))
392 if (whichType2 == TX_SCRIPTHASH)
396 tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
399 nArgsExpected += tmpExpected;
402 if (stack.size() != (unsigned int)nArgsExpected)
410 CTransaction::GetLegacySigOpCount() const
412 unsigned int nSigOps = 0;
413 BOOST_FOREACH(const CTxIn& txin, vin)
415 nSigOps += txin.scriptSig.GetSigOpCount(false);
417 BOOST_FOREACH(const CTxOut& txout, vout)
419 nSigOps += txout.scriptPubKey.GetSigOpCount(false);
425 int CMerkleTx::SetMerkleBranch(const CBlock* pblock)
437 // Load the block this tx is in
439 if (!CTxDB("r").ReadTxIndex(GetHash(), txindex))
441 if (!blockTmp.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos))
446 // Update the tx's hashBlock
447 hashBlock = pblock->GetHash();
449 // Locate the transaction
450 for (nIndex = 0; nIndex < (int)pblock->vtx.size(); nIndex++)
451 if (pblock->vtx[nIndex] == *(CTransaction*)this)
453 if (nIndex == (int)pblock->vtx.size())
455 vMerkleBranch.clear();
457 printf("ERROR: SetMerkleBranch() : couldn't find tx in block\n");
461 // Fill in merkle branch
462 vMerkleBranch = pblock->GetMerkleBranch(nIndex);
465 // Is the tx in a block that's in the main chain
466 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
467 if (mi == mapBlockIndex.end())
469 CBlockIndex* pindex = (*mi).second;
470 if (!pindex || !pindex->IsInMainChain())
473 return pindexBest->nHeight - pindex->nHeight + 1;
482 bool CTransaction::CheckTransaction() const
484 // Basic checks that don't depend on any context
486 return DoS(10, error("CTransaction::CheckTransaction() : vin empty"));
488 return DoS(10, error("CTransaction::CheckTransaction() : vout empty"));
490 if (::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
491 return DoS(100, error("CTransaction::CheckTransaction() : size limits failed"));
493 // Check for negative or overflow output values
495 for (unsigned int i = 0; i < vout.size(); i++)
497 const CTxOut& txout = vout[i];
498 if (txout.IsEmpty() && !IsCoinBase() && !IsCoinStake())
499 return DoS(100, error("CTransaction::CheckTransaction() : txout empty for user transaction"));
501 if (txout.nValue < 0)
502 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue is negative"));
503 if (txout.nValue > MAX_MONEY)
504 return DoS(100, error("CTransaction::CheckTransaction() : txout.nValue too high"));
505 nValueOut += txout.nValue;
506 if (!MoneyRange(nValueOut))
507 return DoS(100, error("CTransaction::CheckTransaction() : txout total out of range"));
510 // Check for duplicate inputs
511 set<COutPoint> vInOutPoints;
512 BOOST_FOREACH(const CTxIn& txin, vin)
514 if (vInOutPoints.count(txin.prevout))
516 vInOutPoints.insert(txin.prevout);
521 if (vin[0].scriptSig.size() < 2 || vin[0].scriptSig.size() > 100)
522 return DoS(100, error("CTransaction::CheckTransaction() : coinbase script size is invalid"));
526 BOOST_FOREACH(const CTxIn& txin, vin)
527 if (txin.prevout.IsNull())
528 return DoS(10, error("CTransaction::CheckTransaction() : prevout is null"));
534 int64 CTransaction::GetMinFee(unsigned int nBlockSize, bool fAllowFree, enum GetMinFee_mode mode, unsigned int nBytes) const
536 // Use new fees approach if we are on test network or
537 // switch date has been reached
538 bool fNewApproach = fTestNet || nTime > FEE_SWITCH_TIME;
540 int64 nMinTxFee = MIN_TX_FEE, nMinRelayTxFee = MIN_RELAY_TX_FEE;
542 if(!fNewApproach || IsCoinStake())
544 // Enforce 0.01 as minimum fee for old approach or coinstake
546 nMinRelayTxFee = CENT;
549 // Base fee is either nMinTxFee or nMinRelayTxFee
550 int64 nBaseFee = (mode == GMF_RELAY) ? nMinRelayTxFee : nMinTxFee;
552 unsigned int nNewBlockSize = nBlockSize + nBytes;
553 int64 nMinFee = (1 + (int64)nBytes / 1000) * nBaseFee;
561 // Transactions under 1K are free
567 // Free transaction area
568 if (nNewBlockSize < 27000)
573 // To limit dust spam, require additional MIN_TX_FEE/MIN_RELAY_TX_FEE for
574 // each non empty output which is less than 0.01
576 // It's safe to ignore empty outputs here, because these inputs are allowed
577 // only for coinbase and coinstake transactions.
578 BOOST_FOREACH(const CTxOut& txout, vout)
579 if (txout.nValue < CENT && !txout.IsEmpty())
582 else if (nMinFee < nBaseFee)
584 // To limit dust spam, require MIN_TX_FEE/MIN_RELAY_TX_FEE if
585 // any output is less than 0.01
586 BOOST_FOREACH(const CTxOut& txout, vout)
587 if (txout.nValue < CENT)
591 // Raise the price as the block approaches full
592 if (nBlockSize != 1 && nNewBlockSize >= MAX_BLOCK_SIZE_GEN/2)
594 if (nNewBlockSize >= MAX_BLOCK_SIZE_GEN)
596 nMinFee *= MAX_BLOCK_SIZE_GEN / (MAX_BLOCK_SIZE_GEN - nNewBlockSize);
599 if (!MoneyRange(nMinFee))
606 bool CTxMemPool::accept(CTxDB& txdb, CTransaction &tx, bool fCheckInputs,
607 bool* pfMissingInputs)
610 *pfMissingInputs = false;
612 if (!tx.CheckTransaction())
613 return error("CTxMemPool::accept() : CheckTransaction failed");
615 // Coinbase is only valid in a block, not as a loose transaction
617 return tx.DoS(100, error("CTxMemPool::accept() : coinbase as individual tx"));
619 // ppcoin: coinstake is also only valid in a block, not as a loose transaction
620 if (tx.IsCoinStake())
621 return tx.DoS(100, error("CTxMemPool::accept() : coinstake as individual tx"));
623 // To help v0.1.5 clients who would see it as a negative number
624 if ((int64)tx.nLockTime > std::numeric_limits<int>::max())
625 return error("CTxMemPool::accept() : not accepting nLockTime beyond 2038 yet");
627 // Rather not work on nonstandard transactions (unless -testnet)
628 if (!fTestNet && !tx.IsStandard())
629 return error("CTxMemPool::accept() : nonstandard transaction type");
631 // Do we already have it?
632 uint256 hash = tx.GetHash();
635 if (mapTx.count(hash))
639 if (txdb.ContainsTx(hash))
642 // Check for conflicts with in-memory transactions
643 CTransaction* ptxOld = NULL;
644 for (unsigned int i = 0; i < tx.vin.size(); i++)
646 COutPoint outpoint = tx.vin[i].prevout;
647 if (mapNextTx.count(outpoint))
649 // Disable replacement feature for now
652 // Allow replacing with a newer version of the same transaction
655 ptxOld = mapNextTx[outpoint].ptx;
656 if (ptxOld->IsFinal())
658 if (!tx.IsNewerThan(*ptxOld))
660 for (unsigned int i = 0; i < tx.vin.size(); i++)
662 COutPoint outpoint = tx.vin[i].prevout;
663 if (!mapNextTx.count(outpoint) || mapNextTx[outpoint].ptx != ptxOld)
673 map<uint256, CTxIndex> mapUnused;
674 bool fInvalid = false;
675 if (!tx.FetchInputs(txdb, mapUnused, false, false, mapInputs, fInvalid))
678 return error("CTxMemPool::accept() : FetchInputs found invalid tx %s", hash.ToString().substr(0,10).c_str());
680 *pfMissingInputs = true;
684 // Check for non-standard pay-to-script-hash in inputs
685 if (!tx.AreInputsStandard(mapInputs) && !fTestNet)
686 return error("CTxMemPool::accept() : nonstandard transaction input");
688 // Note: if you modify this code to accept non-standard transactions, then
689 // you should add code here to check that the transaction does a
690 // reasonable number of ECDSA signature verifications.
692 int64 nFees = tx.GetValueIn(mapInputs)-tx.GetValueOut();
693 unsigned int nSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
695 // Don't accept it if it can't get into a block
696 int64 txMinFee = tx.GetMinFee(1000, true, GMF_RELAY, nSize);
697 if (nFees < txMinFee)
698 return error("CTxMemPool::accept() : not enough fees %s, %"PRI64d" < %"PRI64d,
699 hash.ToString().c_str(),
702 // Continuously rate-limit free transactions
703 // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
704 // be annoying or make others' transactions take longer to confirm.
705 if (nFees < MIN_RELAY_TX_FEE)
707 static CCriticalSection cs;
708 static double dFreeCount;
709 static int64 nLastTime;
710 int64 nNow = GetTime();
714 // Use an exponentially decaying ~10-minute window:
715 dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
717 // -limitfreerelay unit is thousand-bytes-per-minute
718 // At default rate it would take over a month to fill 1GB
719 if (dFreeCount > GetArg("-limitfreerelay", 15)*10*1000 && !IsFromMe(tx))
720 return error("CTxMemPool::accept() : free transaction rejected by rate limiter");
722 printf("Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
727 // Check against previous transactions
728 // This is done last to help prevent CPU exhaustion denial-of-service attacks.
729 if (!tx.ConnectInputs(txdb, mapInputs, mapUnused, CDiskTxPos(1,1,1), pindexBest, false, false, true, SIG_SWITCH_TIME < tx.nTime ? STRICT_FLAGS : SOFT_FLAGS))
731 return error("CTxMemPool::accept() : ConnectInputs failed %s", hash.ToString().substr(0,10).c_str());
735 // Store transaction in memory
740 printf("CTxMemPool::accept() : replacing tx %s with new version\n", ptxOld->GetHash().ToString().c_str());
743 addUnchecked(hash, tx);
746 ///// are we sure this is ok when loading transactions or restoring block txes
747 // If updated, erase old tx from wallet
749 EraseFromWallets(ptxOld->GetHash());
751 printf("CTxMemPool::accept() : accepted %s (poolsz %"PRIszu")\n",
752 hash.ToString().substr(0,10).c_str(),
757 bool CTransaction::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs, bool* pfMissingInputs)
759 return mempool.accept(txdb, *this, fCheckInputs, pfMissingInputs);
762 bool CTxMemPool::addUnchecked(const uint256& hash, CTransaction &tx)
764 // Add to memory pool without checking anything. Don't call this directly,
765 // call CTxMemPool::accept to properly check the transaction first.
768 for (unsigned int i = 0; i < tx.vin.size(); i++)
769 mapNextTx[tx.vin[i].prevout] = CInPoint(&mapTx[hash], i);
770 nTransactionsUpdated++;
776 bool CTxMemPool::remove(CTransaction &tx)
778 // Remove transaction from memory pool
781 uint256 hash = tx.GetHash();
782 if (mapTx.count(hash))
784 BOOST_FOREACH(const CTxIn& txin, tx.vin)
785 mapNextTx.erase(txin.prevout);
787 nTransactionsUpdated++;
793 void CTxMemPool::clear()
798 ++nTransactionsUpdated;
801 void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
806 vtxid.reserve(mapTx.size());
807 for (map<uint256, CTransaction>::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi)
808 vtxid.push_back((*mi).first);
814 int CMerkleTx::GetDepthInMainChain(CBlockIndex* &pindexRet) const
816 if (hashBlock == 0 || nIndex == -1)
819 // Find the block it claims to be in
820 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashBlock);
821 if (mi == mapBlockIndex.end())
823 CBlockIndex* pindex = (*mi).second;
824 if (!pindex || !pindex->IsInMainChain())
827 // Make sure the merkle branch connects to this block
828 if (!fMerkleVerified)
830 if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
832 fMerkleVerified = true;
836 return pindexBest->nHeight - pindex->nHeight + 1;
840 int CMerkleTx::GetBlocksToMaturity() const
842 if (!(IsCoinBase() || IsCoinStake()))
844 return max(0, (nCoinbaseMaturity+20) - GetDepthInMainChain());
848 bool CMerkleTx::AcceptToMemoryPool(CTxDB& txdb, bool fCheckInputs)
852 if (!IsInMainChain() && !ClientConnectInputs())
854 return CTransaction::AcceptToMemoryPool(txdb, false);
858 return CTransaction::AcceptToMemoryPool(txdb, fCheckInputs);
862 bool CMerkleTx::AcceptToMemoryPool()
865 return AcceptToMemoryPool(txdb);
870 bool CWalletTx::AcceptWalletTransaction(CTxDB& txdb, bool fCheckInputs)
875 // Add previous supporting transactions first
876 BOOST_FOREACH(CMerkleTx& tx, vtxPrev)
878 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
880 uint256 hash = tx.GetHash();
881 if (!mempool.exists(hash) && !txdb.ContainsTx(hash))
882 tx.AcceptToMemoryPool(txdb, fCheckInputs);
885 return AcceptToMemoryPool(txdb, fCheckInputs);
890 bool CWalletTx::AcceptWalletTransaction()
893 return AcceptWalletTransaction(txdb);
896 int CTxIndex::GetDepthInMainChain() const
900 if (!block.ReadFromDisk(pos.nFile, pos.nBlockPos, false))
902 // Find the block in the index
903 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(block.GetHash());
904 if (mi == mapBlockIndex.end())
906 CBlockIndex* pindex = (*mi).second;
907 if (!pindex || !pindex->IsInMainChain())
909 return 1 + nBestHeight - pindex->nHeight;
912 // Return transaction in tx, and if it was found inside a block, its hash is placed in hashBlock
913 bool GetTransaction(const uint256 &hash, CTransaction &tx, uint256 &hashBlock)
919 if (mempool.exists(hash))
921 tx = mempool.lookup(hash);
927 if (tx.ReadFromDisk(txdb, COutPoint(hash, 0), txindex))
930 if (block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
931 hashBlock = block.GetHash();
945 //////////////////////////////////////////////////////////////////////////////
947 // CBlock and CBlockIndex
950 static CBlockIndex* pblockindexFBBHLast;
951 CBlockIndex* FindBlockByHeight(int nHeight)
953 CBlockIndex *pblockindex;
954 if (nHeight < nBestHeight / 2)
955 pblockindex = pindexGenesisBlock;
957 pblockindex = pindexBest;
958 if (pblockindexFBBHLast && abs(nHeight - pblockindex->nHeight) > abs(nHeight - pblockindexFBBHLast->nHeight))
959 pblockindex = pblockindexFBBHLast;
960 while (pblockindex->nHeight > nHeight)
961 pblockindex = pblockindex->pprev;
962 while (pblockindex->nHeight < nHeight)
963 pblockindex = pblockindex->pnext;
964 pblockindexFBBHLast = pblockindex;
968 bool CBlock::ReadFromDisk(const CBlockIndex* pindex, bool fReadTransactions)
970 if (!fReadTransactions)
972 *this = pindex->GetBlockHeader();
975 if (!ReadFromDisk(pindex->nFile, pindex->nBlockPos, fReadTransactions))
977 if (GetHash() != pindex->GetBlockHash())
978 return error("CBlock::ReadFromDisk() : GetHash() doesn't match index");
982 uint256 static GetOrphanRoot(const CBlock* pblock)
984 // Work back to the first block in the orphan chain
985 while (mapOrphanBlocks.count(pblock->hashPrevBlock))
986 pblock = mapOrphanBlocks[pblock->hashPrevBlock];
987 return pblock->GetHash();
990 // ppcoin: find block wanted by given orphan block
991 uint256 WantedByOrphan(const CBlock* pblockOrphan)
993 // Work back to the first block in the orphan chain
994 while (mapOrphanBlocks.count(pblockOrphan->hashPrevBlock))
995 pblockOrphan = mapOrphanBlocks[pblockOrphan->hashPrevBlock];
996 return pblockOrphan->hashPrevBlock;
999 // select stake target limit according to hard-coded conditions
1000 CBigNum inline GetProofOfStakeLimit(int nHeight, unsigned int nTime)
1002 if(fTestNet) // separate proof of stake target limit for testnet
1003 return bnProofOfStakeLimit;
1004 if(nTime > TARGETS_SWITCH_TIME) // 27 bits since 20 July 2013
1005 return bnProofOfStakeLimit;
1006 if(nHeight + 1 > 15000) // 24 bits since block 15000
1007 return bnProofOfStakeLegacyLimit;
1008 if(nHeight + 1 > 14060) // 31 bits since block 14060 until 15000
1009 return bnProofOfStakeHardLimit;
1011 return bnProofOfWorkLimit; // return bnProofOfWorkLimit of none matched
1014 // miner's coin base reward based on nBits
1015 int64 GetProofOfWorkReward(unsigned int nBits, int64 nFees)
1017 CBigNum bnSubsidyLimit = MAX_MINT_PROOF_OF_WORK;
1020 bnTarget.SetCompact(nBits);
1021 CBigNum bnTargetLimit = bnProofOfWorkLimit;
1022 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1024 // NovaCoin: subsidy is cut in half every 64x multiply of PoW difficulty
1025 // A reasonably continuous curve is used to avoid shock to market
1026 // (nSubsidyLimit / nSubsidy) ** 6 == bnProofOfWorkLimit / bnTarget
1028 // Human readable form:
1030 // nSubsidy = 100 / (diff ^ 1/6)
1031 CBigNum bnLowerBound = CENT;
1032 CBigNum bnUpperBound = bnSubsidyLimit;
1033 while (bnLowerBound + CENT <= bnUpperBound)
1035 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1036 if (fDebug && GetBoolArg("-printcreation"))
1037 printf("GetProofOfWorkReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1038 if (bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnTargetLimit > bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnSubsidyLimit * bnTarget)
1039 bnUpperBound = bnMidValue;
1041 bnLowerBound = bnMidValue;
1044 int64 nSubsidy = bnUpperBound.getuint64();
1046 nSubsidy = (nSubsidy / CENT) * CENT;
1047 if (fDebug && GetBoolArg("-printcreation"))
1048 printf("GetProofOfWorkReward() : create=%s nBits=0x%08x nSubsidy=%"PRI64d"\n", FormatMoney(nSubsidy).c_str(), nBits, nSubsidy);
1050 return min(nSubsidy, MAX_MINT_PROOF_OF_WORK) + nFees;
1053 // miner's coin stake reward based on nBits and coin age spent (coin-days)
1054 int64 GetProofOfStakeReward(int64 nCoinAge, unsigned int nBits, unsigned int nTime, bool bCoinYearOnly)
1056 int64 nRewardCoinYear, nSubsidy, nSubsidyLimit = 10 * COIN;
1058 if(fTestNet || nTime > STAKE_SWITCH_TIME)
1060 // Stage 2 of emission process is PoS-based. It will be active on mainNet since 20 Jun 2013.
1062 CBigNum bnRewardCoinYearLimit = MAX_MINT_PROOF_OF_STAKE; // Base stake mint rate, 100% year interest
1064 bnTarget.SetCompact(nBits);
1065 CBigNum bnTargetLimit = GetProofOfStakeLimit(0, nTime);
1066 bnTargetLimit.SetCompact(bnTargetLimit.GetCompact());
1068 // NovaCoin: A reasonably continuous curve is used to avoid shock to market
1070 CBigNum bnLowerBound = 1 * CENT, // Lower interest bound is 1% per year
1071 bnUpperBound = bnRewardCoinYearLimit, // Upper interest bound is 100% per year
1072 bnMidPart, bnRewardPart;
1074 while (bnLowerBound + CENT <= bnUpperBound)
1076 CBigNum bnMidValue = (bnLowerBound + bnUpperBound) / 2;
1077 if (fDebug && GetBoolArg("-printcreation"))
1078 printf("GetProofOfStakeReward() : lower=%"PRI64d" upper=%"PRI64d" mid=%"PRI64d"\n", bnLowerBound.getuint64(), bnUpperBound.getuint64(), bnMidValue.getuint64());
1080 if(!fTestNet && nTime < STAKECURVE_SWITCH_TIME)
1083 // Until 20 Oct 2013: reward for coin-year is cut in half every 64x multiply of PoS difficulty
1085 // (nRewardCoinYearLimit / nRewardCoinYear) ** 6 == bnProofOfStakeLimit / bnTarget
1087 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/6)
1090 bnMidPart = bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue * bnMidValue;
1091 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1096 // Since 20 Oct 2013: reward for coin-year is cut in half every 8x multiply of PoS difficulty
1098 // (nRewardCoinYearLimit / nRewardCoinYear) ** 3 == bnProofOfStakeLimit / bnTarget
1100 // Human readable form: nRewardCoinYear = 1 / (posdiff ^ 1/3)
1103 bnMidPart = bnMidValue * bnMidValue * bnMidValue;
1104 bnRewardPart = bnRewardCoinYearLimit * bnRewardCoinYearLimit * bnRewardCoinYearLimit;
1107 if (bnMidPart * bnTargetLimit > bnRewardPart * bnTarget)
1108 bnUpperBound = bnMidValue;
1110 bnLowerBound = bnMidValue;
1113 nRewardCoinYear = bnUpperBound.getuint64();
1114 nRewardCoinYear = min((nRewardCoinYear / CENT) * CENT, MAX_MINT_PROOF_OF_STAKE);
1118 // Old creation amount per coin-year, 5% fixed stake mint rate
1119 nRewardCoinYear = 5 * CENT;
1123 return nRewardCoinYear;
1125 nSubsidy = nCoinAge * nRewardCoinYear * 33 / (365 * 33 + 8);
1127 // Set reasonable reward limit for large inputs since 20 Oct 2013
1129 // This will stimulate large holders to use smaller inputs, that's good for the network protection
1130 if(fTestNet || STAKECURVE_SWITCH_TIME < nTime)
1132 if (fDebug && GetBoolArg("-printcreation") && nSubsidyLimit < nSubsidy)
1133 printf("GetProofOfStakeReward(): %s is greater than %s, coinstake reward will be truncated\n", FormatMoney(nSubsidy).c_str(), FormatMoney(nSubsidyLimit).c_str());
1135 nSubsidy = min(nSubsidy, nSubsidyLimit);
1138 if (fDebug && GetBoolArg("-printcreation"))
1139 printf("GetProofOfStakeReward(): create=%s nCoinAge=%"PRI64d" nBits=%d\n", FormatMoney(nSubsidy).c_str(), nCoinAge, nBits);
1143 static const int64 nTargetTimespan = 7 * 24 * 60 * 60; // one week
1145 // get proof of work blocks max spacing according to hard-coded conditions
1146 int64 inline GetTargetSpacingWorkMax(int nHeight, unsigned int nTime)
1148 if(nTime > TARGETS_SWITCH_TIME)
1149 return 3 * nStakeTargetSpacing; // 30 minutes on mainNet since 20 Jul 2013 00:00:00
1152 return 3 * nStakeTargetSpacing; // 15 minutes on testNet
1154 return 12 * nStakeTargetSpacing; // 2 hours otherwise
1158 // maximum nBits value could possible be required nTime after
1160 unsigned int ComputeMaxBits(CBigNum bnTargetLimit, unsigned int nBase, int64 nTime)
1163 bnResult.SetCompact(nBase);
1165 while (nTime > 0 && bnResult < bnTargetLimit)
1167 // Maximum 200% adjustment per day...
1169 nTime -= 24 * 60 * 60;
1171 if (bnResult > bnTargetLimit)
1172 bnResult = bnTargetLimit;
1173 return bnResult.GetCompact();
1177 // minimum amount of work that could possibly be required nTime after
1178 // minimum proof-of-work required was nBase
1180 unsigned int ComputeMinWork(unsigned int nBase, int64 nTime)
1182 return ComputeMaxBits(bnProofOfWorkLimit, nBase, nTime);
1186 // minimum amount of stake that could possibly be required nTime after
1187 // minimum proof-of-stake required was nBase
1189 unsigned int ComputeMinStake(unsigned int nBase, int64 nTime, unsigned int nBlockTime)
1191 return ComputeMaxBits(GetProofOfStakeLimit(0, nBlockTime), nBase, nTime);
1195 // ppcoin: find last block index up to pindex
1196 const CBlockIndex* GetLastBlockIndex(const CBlockIndex* pindex, bool fProofOfStake)
1198 while (pindex && pindex->pprev && (pindex->IsProofOfStake() != fProofOfStake))
1199 pindex = pindex->pprev;
1203 unsigned int GetNextTargetRequired(const CBlockIndex* pindexLast, bool fProofOfStake)
1205 CBigNum bnTargetLimit = !fProofOfStake ? bnProofOfWorkLimit : GetProofOfStakeLimit(pindexLast->nHeight, pindexLast->nTime);
1207 if (pindexLast == NULL)
1208 return bnTargetLimit.GetCompact(); // genesis block
1210 const CBlockIndex* pindexPrev = GetLastBlockIndex(pindexLast, fProofOfStake);
1211 if (pindexPrev->pprev == NULL)
1212 return bnTargetLimit.GetCompact(); // first block
1213 const CBlockIndex* pindexPrevPrev = GetLastBlockIndex(pindexPrev->pprev, fProofOfStake);
1214 if (pindexPrevPrev->pprev == NULL)
1215 return bnTargetLimit.GetCompact(); // second block
1217 int64 nActualSpacing = pindexPrev->GetBlockTime() - pindexPrevPrev->GetBlockTime();
1219 // ppcoin: target change every block
1220 // ppcoin: retarget with exponential moving toward target spacing
1222 bnNew.SetCompact(pindexPrev->nBits);
1223 int64 nTargetSpacing = fProofOfStake? nStakeTargetSpacing : min(GetTargetSpacingWorkMax(pindexLast->nHeight, pindexLast->nTime), (int64) nStakeTargetSpacing * (1 + pindexLast->nHeight - pindexPrev->nHeight));
1224 int64 nInterval = nTargetTimespan / nTargetSpacing;
1225 bnNew *= ((nInterval - 1) * nTargetSpacing + nActualSpacing + nActualSpacing);
1226 bnNew /= ((nInterval + 1) * nTargetSpacing);
1228 if (bnNew > bnTargetLimit)
1229 bnNew = bnTargetLimit;
1231 return bnNew.GetCompact();
1234 bool CheckProofOfWork(uint256 hash, unsigned int nBits)
1237 bnTarget.SetCompact(nBits);
1240 if (bnTarget <= 0 || bnTarget > bnProofOfWorkLimit)
1241 return error("CheckProofOfWork() : nBits below minimum work");
1243 // Check proof of work matches claimed amount
1244 if (hash > bnTarget.getuint256())
1245 return error("CheckProofOfWork() : hash doesn't match nBits");
1250 // Return maximum amount of blocks that other nodes claim to have
1251 int GetNumBlocksOfPeers()
1253 return std::max(cPeerBlockCounts.median(), Checkpoints::GetTotalBlocksEstimate());
1256 bool IsInitialBlockDownload()
1258 if (pindexBest == NULL || nBestHeight < Checkpoints::GetTotalBlocksEstimate())
1260 static int64 nLastUpdate;
1261 static CBlockIndex* pindexLastBest;
1262 if (pindexBest != pindexLastBest)
1264 pindexLastBest = pindexBest;
1265 nLastUpdate = GetTime();
1267 return (GetTime() - nLastUpdate < 10 &&
1268 pindexBest->GetBlockTime() < GetTime() - 24 * 60 * 60);
1271 void static InvalidChainFound(CBlockIndex* pindexNew)
1273 if (pindexNew->nChainTrust > nBestInvalidTrust)
1275 nBestInvalidTrust = pindexNew->nChainTrust;
1276 CTxDB().WriteBestInvalidTrust(CBigNum(nBestInvalidTrust));
1277 uiInterface.NotifyBlocksChanged();
1280 uint256 nBestInvalidBlockTrust = pindexNew->nChainTrust - pindexNew->pprev->nChainTrust;
1281 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
1283 printf("InvalidChainFound: invalid block=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1284 pindexNew->GetBlockHash().ToString().substr(0,20).c_str(), pindexNew->nHeight,
1285 CBigNum(pindexNew->nChainTrust).ToString().c_str(), nBestInvalidBlockTrust.Get64(),
1286 DateTimeStrFormat("%x %H:%M:%S", pindexNew->GetBlockTime()).c_str());
1287 printf("InvalidChainFound: current best=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
1288 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
1289 CBigNum(pindexBest->nChainTrust).ToString().c_str(),
1290 nBestBlockTrust.Get64(),
1291 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
1295 void CBlock::UpdateTime(const CBlockIndex* pindexPrev)
1297 nTime = max(GetBlockTime(), GetAdjustedTime());
1310 bool CTransaction::DisconnectInputs(CTxDB& txdb)
1312 // Relinquish previous transactions' spent pointers
1315 BOOST_FOREACH(const CTxIn& txin, vin)
1317 COutPoint prevout = txin.prevout;
1319 // Get prev txindex from disk
1321 if (!txdb.ReadTxIndex(prevout.hash, txindex))
1322 return error("DisconnectInputs() : ReadTxIndex failed");
1324 if (prevout.n >= txindex.vSpent.size())
1325 return error("DisconnectInputs() : prevout.n out of range");
1327 // Mark outpoint as not spent
1328 txindex.vSpent[prevout.n].SetNull();
1331 if (!txdb.UpdateTxIndex(prevout.hash, txindex))
1332 return error("DisconnectInputs() : UpdateTxIndex failed");
1336 // Remove transaction from index
1337 // This can fail if a duplicate of this transaction was in a chain that got
1338 // reorganized away. This is only possible if this transaction was completely
1339 // spent, so erasing it would be a no-op anyway.
1340 txdb.EraseTxIndex(*this);
1346 bool CTransaction::FetchInputs(CTxDB& txdb, const map<uint256, CTxIndex>& mapTestPool,
1347 bool fBlock, bool fMiner, MapPrevTx& inputsRet, bool& fInvalid)
1349 // FetchInputs can return false either because we just haven't seen some inputs
1350 // (in which case the transaction should be stored as an orphan)
1351 // or because the transaction is malformed (in which case the transaction should
1352 // be dropped). If tx is definitely invalid, fInvalid will be set to true.
1356 return true; // Coinbase transactions have no inputs to fetch.
1358 for (unsigned int i = 0; i < vin.size(); i++)
1360 COutPoint prevout = vin[i].prevout;
1361 if (inputsRet.count(prevout.hash))
1362 continue; // Got it already
1365 CTxIndex& txindex = inputsRet[prevout.hash].first;
1367 if ((fBlock || fMiner) && mapTestPool.count(prevout.hash))
1369 // Get txindex from current proposed changes
1370 txindex = mapTestPool.find(prevout.hash)->second;
1374 // Read txindex from txdb
1375 fFound = txdb.ReadTxIndex(prevout.hash, txindex);
1377 if (!fFound && (fBlock || fMiner))
1378 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());
1381 CTransaction& txPrev = inputsRet[prevout.hash].second;
1382 if (!fFound || txindex.pos == CDiskTxPos(1,1,1))
1384 // Get prev tx from single transactions in memory
1387 if (!mempool.exists(prevout.hash))
1388 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());
1389 txPrev = mempool.lookup(prevout.hash);
1392 txindex.vSpent.resize(txPrev.vout.size());
1396 // Get prev tx from disk
1397 if (!txPrev.ReadFromDisk(txindex.pos))
1398 return error("FetchInputs() : %s ReadFromDisk prev tx %s failed", GetHash().ToString().substr(0,10).c_str(), prevout.hash.ToString().substr(0,10).c_str());
1402 // Make sure all prevout.n indexes are valid:
1403 for (unsigned int i = 0; i < vin.size(); i++)
1405 const COutPoint prevout = vin[i].prevout;
1406 assert(inputsRet.count(prevout.hash) != 0);
1407 const CTxIndex& txindex = inputsRet[prevout.hash].first;
1408 const CTransaction& txPrev = inputsRet[prevout.hash].second;
1409 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1411 // Revisit this if/when transaction replacement is implemented and allows
1414 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()));
1421 const CTxOut& CTransaction::GetOutputFor(const CTxIn& input, const MapPrevTx& inputs) const
1423 MapPrevTx::const_iterator mi = inputs.find(input.prevout.hash);
1424 if (mi == inputs.end())
1425 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.hash not found");
1427 const CTransaction& txPrev = (mi->second).second;
1428 if (input.prevout.n >= txPrev.vout.size())
1429 throw std::runtime_error("CTransaction::GetOutputFor() : prevout.n out of range");
1431 return txPrev.vout[input.prevout.n];
1434 int64 CTransaction::GetValueIn(const MapPrevTx& inputs) const
1440 for (unsigned int i = 0; i < vin.size(); i++)
1442 nResult += GetOutputFor(vin[i], inputs).nValue;
1448 unsigned int CTransaction::GetP2SHSigOpCount(const MapPrevTx& inputs) const
1453 unsigned int nSigOps = 0;
1454 for (unsigned int i = 0; i < vin.size(); i++)
1456 const CTxOut& prevout = GetOutputFor(vin[i], inputs);
1457 if (prevout.scriptPubKey.IsPayToScriptHash())
1458 nSigOps += prevout.scriptPubKey.GetSigOpCount(vin[i].scriptSig);
1463 bool CScriptCheck::operator()() const {
1464 const CScript &scriptSig = ptxTo->vin[nIn].scriptSig;
1465 if (!VerifyScript(scriptSig, scriptPubKey, *ptxTo, nIn, nFlags, nHashType))
1466 return error("CScriptCheck() : %s VerifySignature failed", ptxTo->GetHash().ToString().substr(0,10).c_str());
1470 bool VerifySignature(const CTransaction& txFrom, const CTransaction& txTo, unsigned int nIn, unsigned int flags, int nHashType)
1472 return CScriptCheck(txFrom, 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, bool fScriptChecks, unsigned int flags, std::vector<CScriptCheck> *pvChecks)
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
1487 for (unsigned int i = 0; i < vin.size(); i++)
1489 COutPoint prevout = vin[i].prevout;
1490 assert(inputs.count(prevout.hash) > 0);
1491 CTxIndex& txindex = inputs[prevout.hash].first;
1492 CTransaction& txPrev = inputs[prevout.hash].second;
1494 if (prevout.n >= txPrev.vout.size() || prevout.n >= txindex.vSpent.size())
1495 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()));
1497 // If prev is coinbase or coinstake, check that it's matured
1498 if (txPrev.IsCoinBase() || txPrev.IsCoinStake())
1499 for (const CBlockIndex* pindex = pindexBlock; pindex && pindexBlock->nHeight - pindex->nHeight < nCoinbaseMaturity; pindex = pindex->pprev)
1500 if (pindex->nBlockPos == txindex.pos.nBlockPos && pindex->nFile == txindex.pos.nFile)
1501 return error("ConnectInputs() : tried to spend %s at depth %d", txPrev.IsCoinBase() ? "coinbase" : "coinstake", pindexBlock->nHeight - pindex->nHeight);
1503 // ppcoin: check transaction timestamp
1504 if (txPrev.nTime > nTime)
1505 return DoS(100, error("ConnectInputs() : transaction timestamp earlier than input transaction"));
1507 // Check for negative or overflow input values
1508 nValueIn += txPrev.vout[prevout.n].nValue;
1509 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1510 return DoS(100, error("ConnectInputs() : txin values out of range"));
1515 pvChecks->reserve(vin.size());
1517 // The first loop above does all the inexpensive checks.
1518 // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
1519 // Helps prevent CPU exhaustion attacks.
1520 for (unsigned int i = 0; i < vin.size(); i++)
1522 COutPoint prevout = vin[i].prevout;
1523 assert(inputs.count(prevout.hash) > 0);
1524 CTxIndex& txindex = inputs[prevout.hash].first;
1525 CTransaction& txPrev = inputs[prevout.hash].second;
1527 // Check for conflicts (double-spend)
1528 // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
1529 // for an attacker to attempt to split the network.
1530 if (!txindex.vSpent[prevout.n].IsNull())
1531 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());
1533 // Skip ECDSA signature verification when connecting blocks (fBlock=true)
1534 // before the last blockchain checkpoint. This is safe because block merkle hashes are
1535 // still computed and checked, and any change will be caught at the next checkpoint.
1539 CScriptCheck check(txPrev, *this, i, flags, 0);
1542 pvChecks->push_back(CScriptCheck());
1543 check.swap(pvChecks->back());
1547 if (flags & STRICT_FLAGS)
1549 // Don't trigger DoS code in case of STRICT_FLAGS caused failure.
1550 CScriptCheck check(txPrev, *this, i, flags & ~STRICT_FLAGS, 0);
1552 return error("ConnectInputs() : %s strict VerifySignature failed", GetHash().ToString().substr(0,10).c_str());
1554 return DoS(100,error("ConnectInputs() : %s VerifySignature failed", GetHash().ToString().substr(0,10).c_str()));
1558 // Mark outpoints as spent
1559 txindex.vSpent[prevout.n] = posThisTx;
1562 if (fBlock || fMiner)
1564 mapTestPool[prevout.hash] = txindex;
1570 // ppcoin: coin stake tx earns reward instead of paying fee
1572 if (!GetCoinAge(txdb, nCoinAge))
1573 return error("ConnectInputs() : %s unable to get coin age for coinstake", GetHash().ToString().substr(0,10).c_str());
1575 unsigned int nTxSize = (nTime > VALIDATION_SWITCH_TIME || fTestNet) ? GetSerializeSize(SER_NETWORK, PROTOCOL_VERSION) : 0;
1577 int64 nReward = GetValueOut() - nValueIn;
1578 int64 nCalculatedReward = GetProofOfStakeReward(nCoinAge, pindexBlock->nBits, nTime) - GetMinFee(1, false, GMF_BLOCK, nTxSize) + CENT;
1580 if (nReward > nCalculatedReward)
1581 return DoS(100, error("ConnectInputs() : coinstake pays too much(actual=%"PRI64d" vs calculated=%"PRI64d")", nReward, nCalculatedReward));
1585 if (nValueIn < GetValueOut())
1586 return DoS(100, error("ConnectInputs() : %s value in < value out", GetHash().ToString().substr(0,10).c_str()));
1588 // Tally transaction fees
1589 int64 nTxFee = nValueIn - GetValueOut();
1591 return DoS(100, error("ConnectInputs() : %s nTxFee < 0", GetHash().ToString().substr(0,10).c_str()));
1594 if (!MoneyRange(nFees))
1595 return DoS(100, error("ConnectInputs() : nFees out of range"));
1603 bool CTransaction::ClientConnectInputs()
1608 // Take over previous transactions' spent pointers
1612 for (unsigned int i = 0; i < vin.size(); i++)
1614 // Get prev tx from single transactions in memory
1615 COutPoint prevout = vin[i].prevout;
1616 if (!mempool.exists(prevout.hash))
1618 CTransaction& txPrev = mempool.lookup(prevout.hash);
1620 if (prevout.n >= txPrev.vout.size())
1624 if (!VerifySignature(txPrev, *this, i, SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH, 0))
1625 return error("ClientConnectInputs() : VerifySignature failed");
1627 ///// this is redundant with the mempool.mapNextTx stuff,
1628 ///// not sure which I want to get rid of
1629 ///// this has to go away now that posNext is gone
1630 // // Check for conflicts
1631 // if (!txPrev.vout[prevout.n].posNext.IsNull())
1632 // return error("ConnectInputs() : prev tx already used");
1634 // // Flag outpoints as used
1635 // txPrev.vout[prevout.n].posNext = posThisTx;
1637 nValueIn += txPrev.vout[prevout.n].nValue;
1639 if (!MoneyRange(txPrev.vout[prevout.n].nValue) || !MoneyRange(nValueIn))
1640 return error("ClientConnectInputs() : txin values out of range");
1642 if (GetValueOut() > nValueIn)
1652 bool CBlock::DisconnectBlock(CTxDB& txdb, CBlockIndex* pindex)
1654 // Disconnect in reverse order
1655 for (int i = vtx.size()-1; i >= 0; i--)
1656 if (!vtx[i].DisconnectInputs(txdb))
1659 // Update block index on disk without changing it in memory.
1660 // The memory index structure will be changed after the db commits.
1663 CDiskBlockIndex blockindexPrev(pindex->pprev);
1664 blockindexPrev.hashNext = 0;
1665 if (!txdb.WriteBlockIndex(blockindexPrev))
1666 return error("DisconnectBlock() : WriteBlockIndex failed");
1669 // ppcoin: clean up wallet after disconnecting coinstake
1670 BOOST_FOREACH(CTransaction& tx, vtx)
1671 SyncWithWallets(tx, this, false, false);
1676 static CCheckQueue<CScriptCheck> scriptcheckqueue(128);
1678 void ThreadScriptCheck(void*) {
1679 vnThreadsRunning[THREAD_SCRIPTCHECK]++;
1680 RenameThread("novacoin-scriptch");
1681 scriptcheckqueue.Thread();
1682 vnThreadsRunning[THREAD_SCRIPTCHECK]--;
1685 void ThreadScriptCheckQuit() {
1686 scriptcheckqueue.Quit();
1689 bool CBlock::ConnectBlock(CTxDB& txdb, CBlockIndex* pindex, bool fJustCheck)
1691 // Check it again in case a previous version let a bad block in, but skip BlockSig checking
1692 if (!CheckBlock(!fJustCheck, !fJustCheck, false))
1695 bool fProtocol048 = fTestNet || VALIDATION_SWITCH_TIME < nTime;
1697 // Do not allow blocks that contain transactions which 'overwrite' older transactions,
1698 // unless those are already completely spent.
1699 // If such overwrites are allowed, coinbases and transactions depending upon those
1700 // can be duplicated to remove the ability to spend the first instance -- even after
1701 // being sent to another address.
1702 // See BIP30 and http://r6.ca/blog/20120206T005236Z.html for more information.
1703 // This logic is not necessary for memory pool transactions, as AcceptToMemoryPool
1704 // already refuses previously-known transaction ids entirely.
1705 // This rule was originally applied all blocks whose timestamp was after March 15, 2012, 0:00 UTC.
1706 // Now that the whole chain is irreversibly beyond that time it is applied to all blocks except the
1707 // two in the chain that violate it. This prevents exploiting the issue against nodes in their
1708 // initial block download.
1709 bool fEnforceBIP30 = true; // Always active in NovaCoin
1710 bool fScriptChecks = pindex->nHeight >= Checkpoints::GetTotalBlocksEstimate();
1712 //// issue here: it doesn't know the version
1713 unsigned int nTxPos;
1715 // FetchInputs treats CDiskTxPos(1,1,1) as a special "refer to memorypool" indicator
1716 // 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
1719 nTxPos = pindex->nBlockPos + ::GetSerializeSize(CBlock(), SER_DISK, CLIENT_VERSION) - (2 * GetSizeOfCompactSize(0)) + GetSizeOfCompactSize(vtx.size());
1721 map<uint256, CTxIndex> mapQueuedChanges;
1722 CCheckQueueControl<CScriptCheck> control(fScriptChecks && nScriptCheckThreads ? &scriptcheckqueue : NULL);
1726 int64 nValueOut = 0;
1727 unsigned int nSigOps = 0;
1728 BOOST_FOREACH(CTransaction& tx, vtx)
1730 uint256 hashTx = tx.GetHash();
1732 if (fEnforceBIP30) {
1733 CTxIndex txindexOld;
1734 if (txdb.ReadTxIndex(hashTx, txindexOld)) {
1735 BOOST_FOREACH(CDiskTxPos &pos, txindexOld.vSpent)
1741 nSigOps += tx.GetLegacySigOpCount();
1742 if (nSigOps > MAX_BLOCK_SIGOPS)
1743 return DoS(100, error("ConnectBlock() : too many sigops"));
1745 CDiskTxPos posThisTx(pindex->nFile, pindex->nBlockPos, nTxPos);
1747 nTxPos += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
1749 MapPrevTx mapInputs;
1750 if (tx.IsCoinBase())
1751 nValueOut += tx.GetValueOut();
1755 if (!tx.FetchInputs(txdb, mapQueuedChanges, true, false, mapInputs, fInvalid))
1758 // Add in sigops done by pay-to-script-hash inputs;
1759 // this is to prevent a "rogue miner" from creating
1760 // an incredibly-expensive-to-validate block.
1761 nSigOps += tx.GetP2SHSigOpCount(mapInputs);
1762 if (nSigOps > MAX_BLOCK_SIGOPS)
1763 return DoS(100, error("ConnectBlock() : too many sigops"));
1765 int64 nTxValueIn = tx.GetValueIn(mapInputs);
1766 int64 nTxValueOut = tx.GetValueOut();
1767 nValueIn += nTxValueIn;
1768 nValueOut += nTxValueOut;
1769 if (!tx.IsCoinStake())
1770 nFees += nTxValueIn - nTxValueOut;
1772 std::vector<CScriptCheck> vChecks;
1773 if (!tx.ConnectInputs(txdb, mapInputs, mapQueuedChanges, posThisTx, pindex, true, false, fScriptChecks, SCRIPT_VERIFY_NOCACHE | SCRIPT_VERIFY_P2SH, nScriptCheckThreads ? &vChecks : NULL))
1775 control.Add(vChecks);
1778 mapQueuedChanges[hashTx] = CTxIndex(posThisTx, tx.vout.size());
1781 if (!control.Wait())
1782 return DoS(100, false);
1784 if (IsProofOfWork())
1786 int64 nBlockReward = GetProofOfWorkReward(nBits, fProtocol048 ? nFees : 0);
1788 // Check coinbase reward
1789 if (vtx[0].GetValueOut() > nBlockReward)
1790 return error("CheckBlock() : coinbase reward exceeded (actual=%"PRI64d" vs calculated=%"PRI64d")",
1791 vtx[0].GetValueOut(),
1795 // track money supply and mint amount info
1796 pindex->nMint = nValueOut - nValueIn + nFees;
1797 pindex->nMoneySupply = (pindex->pprev? pindex->pprev->nMoneySupply : 0) + nValueOut - nValueIn;
1798 if (!txdb.WriteBlockIndex(CDiskBlockIndex(pindex)))
1799 return error("Connect() : WriteBlockIndex for pindex failed");
1801 // fees are not collected by proof-of-stake miners
1802 // fees are destroyed to compensate the entire network
1803 if (fProtocol048 && fDebug && IsProofOfStake() && GetBoolArg("-printcreation"))
1804 printf("ConnectBlock() : destroy=%s nFees=%"PRI64d"\n", FormatMoney(nFees).c_str(), nFees);
1809 // Write queued txindex changes
1810 for (map<uint256, CTxIndex>::iterator mi = mapQueuedChanges.begin(); mi != mapQueuedChanges.end(); ++mi)
1812 if (!txdb.UpdateTxIndex((*mi).first, (*mi).second))
1813 return error("ConnectBlock() : UpdateTxIndex failed");
1816 // Update block index on disk without changing it in memory.
1817 // The memory index structure will be changed after the db commits.
1820 CDiskBlockIndex blockindexPrev(pindex->pprev);
1821 blockindexPrev.hashNext = pindex->GetBlockHash();
1822 if (!txdb.WriteBlockIndex(blockindexPrev))
1823 return error("ConnectBlock() : WriteBlockIndex failed");
1826 // Watch for transactions paying to me
1827 BOOST_FOREACH(CTransaction& tx, vtx)
1828 SyncWithWallets(tx, this, true);
1833 bool static Reorganize(CTxDB& txdb, CBlockIndex* pindexNew)
1835 printf("REORGANIZE\n");
1838 CBlockIndex* pfork = pindexBest;
1839 CBlockIndex* plonger = pindexNew;
1840 while (pfork != plonger)
1842 while (plonger->nHeight > pfork->nHeight)
1843 if (!(plonger = plonger->pprev))
1844 return error("Reorganize() : plonger->pprev is null");
1845 if (pfork == plonger)
1847 if (!(pfork = pfork->pprev))
1848 return error("Reorganize() : pfork->pprev is null");
1851 // List of what to disconnect
1852 vector<CBlockIndex*> vDisconnect;
1853 for (CBlockIndex* pindex = pindexBest; pindex != pfork; pindex = pindex->pprev)
1854 vDisconnect.push_back(pindex);
1856 // List of what to connect
1857 vector<CBlockIndex*> vConnect;
1858 for (CBlockIndex* pindex = pindexNew; pindex != pfork; pindex = pindex->pprev)
1859 vConnect.push_back(pindex);
1860 reverse(vConnect.begin(), vConnect.end());
1862 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());
1863 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());
1865 // Disconnect shorter branch
1866 vector<CTransaction> vResurrect;
1867 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1870 if (!block.ReadFromDisk(pindex))
1871 return error("Reorganize() : ReadFromDisk for disconnect failed");
1872 if (!block.DisconnectBlock(txdb, pindex))
1873 return error("Reorganize() : DisconnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1875 // Queue memory transactions to resurrect
1876 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1877 if (!(tx.IsCoinBase() || tx.IsCoinStake()))
1878 vResurrect.push_back(tx);
1881 // Connect longer branch
1882 vector<CTransaction> vDelete;
1883 for (unsigned int i = 0; i < vConnect.size(); i++)
1885 CBlockIndex* pindex = vConnect[i];
1887 if (!block.ReadFromDisk(pindex))
1888 return error("Reorganize() : ReadFromDisk for connect failed");
1889 if (!block.ConnectBlock(txdb, pindex))
1892 return error("Reorganize() : ConnectBlock %s failed", pindex->GetBlockHash().ToString().substr(0,20).c_str());
1895 // Queue memory transactions to delete
1896 BOOST_FOREACH(const CTransaction& tx, block.vtx)
1897 vDelete.push_back(tx);
1899 if (!txdb.WriteHashBestChain(pindexNew->GetBlockHash()))
1900 return error("Reorganize() : WriteHashBestChain failed");
1902 // Make sure it's successfully written to disk before changing memory structure
1903 if (!txdb.TxnCommit())
1904 return error("Reorganize() : TxnCommit failed");
1906 // Disconnect shorter branch
1907 BOOST_FOREACH(CBlockIndex* pindex, vDisconnect)
1909 pindex->pprev->pnext = NULL;
1911 // Connect longer branch
1912 BOOST_FOREACH(CBlockIndex* pindex, vConnect)
1914 pindex->pprev->pnext = pindex;
1916 // Resurrect memory transactions that were in the disconnected branch
1917 BOOST_FOREACH(CTransaction& tx, vResurrect)
1918 tx.AcceptToMemoryPool(txdb, false);
1920 // Delete redundant memory transactions that are in the connected branch
1921 BOOST_FOREACH(CTransaction& tx, vDelete)
1924 printf("REORGANIZE: done\n");
1930 // Called from inside SetBestChain: attaches a block to the new best chain being built
1931 bool CBlock::SetBestChainInner(CTxDB& txdb, CBlockIndex *pindexNew)
1933 uint256 hash = GetHash();
1935 // Adding to current best branch
1936 if (!ConnectBlock(txdb, pindexNew) || !txdb.WriteHashBestChain(hash))
1939 InvalidChainFound(pindexNew);
1942 if (!txdb.TxnCommit())
1943 return error("SetBestChain() : TxnCommit failed");
1945 // Add to current best branch
1946 pindexNew->pprev->pnext = pindexNew;
1948 // Delete redundant memory transactions
1949 BOOST_FOREACH(CTransaction& tx, vtx)
1955 bool CBlock::SetBestChain(CTxDB& txdb, CBlockIndex* pindexNew)
1957 uint256 hash = GetHash();
1959 if (!txdb.TxnBegin())
1960 return error("SetBestChain() : TxnBegin failed");
1962 if (pindexGenesisBlock == NULL && hash == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
1964 txdb.WriteHashBestChain(hash);
1965 if (!txdb.TxnCommit())
1966 return error("SetBestChain() : TxnCommit failed");
1967 pindexGenesisBlock = pindexNew;
1969 else if (hashPrevBlock == hashBestChain)
1971 if (!SetBestChainInner(txdb, pindexNew))
1972 return error("SetBestChain() : SetBestChainInner failed");
1976 // the first block in the new chain that will cause it to become the new best chain
1977 CBlockIndex *pindexIntermediate = pindexNew;
1979 // list of blocks that need to be connected afterwards
1980 std::vector<CBlockIndex*> vpindexSecondary;
1982 // Reorganize is costly in terms of db load, as it works in a single db transaction.
1983 // Try to limit how much needs to be done inside
1984 while (pindexIntermediate->pprev && pindexIntermediate->pprev->nChainTrust > pindexBest->nChainTrust)
1986 vpindexSecondary.push_back(pindexIntermediate);
1987 pindexIntermediate = pindexIntermediate->pprev;
1990 if (!vpindexSecondary.empty())
1991 printf("Postponing %"PRIszu" reconnects\n", vpindexSecondary.size());
1993 // Switch to new best branch
1994 if (!Reorganize(txdb, pindexIntermediate))
1997 InvalidChainFound(pindexNew);
1998 return error("SetBestChain() : Reorganize failed");
2001 // Connect further blocks
2002 BOOST_REVERSE_FOREACH(CBlockIndex *pindex, vpindexSecondary)
2005 if (!block.ReadFromDisk(pindex))
2007 printf("SetBestChain() : ReadFromDisk failed\n");
2010 if (!txdb.TxnBegin()) {
2011 printf("SetBestChain() : TxnBegin 2 failed\n");
2014 // errors now are not fatal, we still did a reorganisation to a new chain in a valid way
2015 if (!block.SetBestChainInner(txdb, pindex))
2020 // Update best block in wallet (so we can detect restored wallets)
2021 bool fIsInitialDownload = IsInitialBlockDownload();
2022 if (!fIsInitialDownload)
2024 const CBlockLocator locator(pindexNew);
2025 ::SetBestChain(locator);
2029 hashBestChain = hash;
2030 pindexBest = pindexNew;
2031 pblockindexFBBHLast = NULL;
2032 nBestHeight = pindexBest->nHeight;
2033 nBestChainTrust = pindexNew->nChainTrust;
2034 nTimeBestReceived = GetTime();
2035 nTransactionsUpdated++;
2037 uint256 nBestBlockTrust = pindexBest->nHeight != 0 ? (pindexBest->nChainTrust - pindexBest->pprev->nChainTrust) : pindexBest->nChainTrust;
2039 printf("SetBestChain: new best=%s height=%d trust=%s blocktrust=%"PRI64d" date=%s\n",
2040 hashBestChain.ToString().substr(0,20).c_str(), nBestHeight,
2041 CBigNum(nBestChainTrust).ToString().c_str(),
2042 nBestBlockTrust.Get64(),
2043 DateTimeStrFormat("%x %H:%M:%S", pindexBest->GetBlockTime()).c_str());
2045 // Check the version of the last 100 blocks to see if we need to upgrade:
2046 if (!fIsInitialDownload)
2049 const CBlockIndex* pindex = pindexBest;
2050 for (int i = 0; i < 100 && pindex != NULL; i++)
2052 if (pindex->nVersion > CBlock::CURRENT_VERSION)
2054 pindex = pindex->pprev;
2057 printf("SetBestChain: %d of last 100 blocks above version %d\n", nUpgraded, CBlock::CURRENT_VERSION);
2058 if (nUpgraded > 100/2)
2059 // strMiscWarning is read by GetWarnings(), called by Qt and the JSON-RPC code to warn the user:
2060 strMiscWarning = _("Warning: This version is obsolete, upgrade required!");
2063 std::string strCmd = GetArg("-blocknotify", "");
2065 if (!fIsInitialDownload && !strCmd.empty())
2067 boost::replace_all(strCmd, "%s", hashBestChain.GetHex());
2068 boost::thread t(runCommand, strCmd); // thread runs free
2074 // ppcoin: total coin age spent in transaction, in the unit of coin-days.
2075 // Only those coins meeting minimum age requirement counts. As those
2076 // transactions not in main chain are not currently indexed so we
2077 // might not find out about their coin age. Older transactions are
2078 // guaranteed to be in main chain by sync-checkpoint. This rule is
2079 // introduced to help nodes establish a consistent view of the coin
2080 // age (trust score) of competing branches.
2081 bool CTransaction::GetCoinAge(CTxDB& txdb, uint64& nCoinAge) const
2083 CBigNum bnCentSecond = 0; // coin age in the unit of cent-seconds
2089 BOOST_FOREACH(const CTxIn& txin, vin)
2091 // First try finding the previous transaction in database
2092 CTransaction txPrev;
2094 if (!txPrev.ReadFromDisk(txdb, txin.prevout, txindex))
2095 continue; // previous transaction not in main chain
2096 if (nTime < txPrev.nTime)
2097 return false; // Transaction timestamp violation
2099 // Read block header
2101 if (!block.ReadFromDisk(txindex.pos.nFile, txindex.pos.nBlockPos, false))
2102 return false; // unable to read block of previous transaction
2103 if (block.GetBlockTime() + nStakeMinAge > nTime)
2104 continue; // only count coins meeting min age requirement
2106 int64 nValueIn = txPrev.vout[txin.prevout.n].nValue;
2107 bnCentSecond += CBigNum(nValueIn) * (nTime-txPrev.nTime) / CENT;
2109 if (fDebug && GetBoolArg("-printcoinage"))
2110 printf("coin age nValueIn=%"PRI64d" nTimeDiff=%d bnCentSecond=%s\n", nValueIn, nTime - txPrev.nTime, bnCentSecond.ToString().c_str());
2113 CBigNum bnCoinDay = bnCentSecond * CENT / COIN / (24 * 60 * 60);
2114 if (fDebug && GetBoolArg("-printcoinage"))
2115 printf("coin age bnCoinDay=%s\n", bnCoinDay.ToString().c_str());
2116 nCoinAge = bnCoinDay.getuint64();
2120 // ppcoin: total coin age spent in block, in the unit of coin-days.
2121 bool CBlock::GetCoinAge(uint64& nCoinAge) const
2126 BOOST_FOREACH(const CTransaction& tx, vtx)
2129 if (tx.GetCoinAge(txdb, nTxCoinAge))
2130 nCoinAge += nTxCoinAge;
2135 if (nCoinAge == 0) // block coin age minimum 1 coin-day
2137 if (fDebug && GetBoolArg("-printcoinage"))
2138 printf("block coin age total nCoinDays=%"PRI64d"\n", nCoinAge);
2142 bool CBlock::AddToBlockIndex(unsigned int nFile, unsigned int nBlockPos)
2144 // Check for duplicate
2145 uint256 hash = GetHash();
2146 if (mapBlockIndex.count(hash))
2147 return error("AddToBlockIndex() : %s already exists", hash.ToString().substr(0,20).c_str());
2149 // Construct new block index object
2150 CBlockIndex* pindexNew = new CBlockIndex(nFile, nBlockPos, *this);
2152 return error("AddToBlockIndex() : new CBlockIndex failed");
2153 pindexNew->phashBlock = &hash;
2154 map<uint256, CBlockIndex*>::iterator miPrev = mapBlockIndex.find(hashPrevBlock);
2155 if (miPrev != mapBlockIndex.end())
2157 pindexNew->pprev = (*miPrev).second;
2158 pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
2161 // ppcoin: compute chain trust score
2162 pindexNew->nChainTrust = (pindexNew->pprev ? pindexNew->pprev->nChainTrust : 0) + pindexNew->GetBlockTrust();
2164 // ppcoin: compute stake entropy bit for stake modifier
2165 if (!pindexNew->SetStakeEntropyBit(GetStakeEntropyBit(pindexNew->nTime)))
2166 return error("AddToBlockIndex() : SetStakeEntropyBit() failed");
2168 // ppcoin: record proof-of-stake hash value
2169 if (pindexNew->IsProofOfStake())
2171 if (!mapProofOfStake.count(hash))
2172 return error("AddToBlockIndex() : hashProofOfStake not found in map");
2173 pindexNew->hashProofOfStake = mapProofOfStake[hash];
2176 // ppcoin: compute stake modifier
2177 uint64 nStakeModifier = 0;
2178 bool fGeneratedStakeModifier = false;
2179 if (!ComputeNextStakeModifier(pindexNew, nStakeModifier, fGeneratedStakeModifier))
2180 return error("AddToBlockIndex() : ComputeNextStakeModifier() failed");
2181 pindexNew->SetStakeModifier(nStakeModifier, fGeneratedStakeModifier);
2182 pindexNew->nStakeModifierChecksum = GetStakeModifierChecksum(pindexNew);
2183 if (!CheckStakeModifierCheckpoints(pindexNew->nHeight, pindexNew->nStakeModifierChecksum))
2184 return error("AddToBlockIndex() : Rejected by stake modifier checkpoint height=%d, modifier=0x%016"PRI64x, pindexNew->nHeight, nStakeModifier);
2186 // Add to mapBlockIndex
2187 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
2188 if (pindexNew->IsProofOfStake())
2189 setStakeSeen.insert(make_pair(pindexNew->prevoutStake, pindexNew->nStakeTime));
2190 pindexNew->phashBlock = &((*mi).first);
2192 // Write to disk block index
2194 if (!txdb.TxnBegin())
2196 txdb.WriteBlockIndex(CDiskBlockIndex(pindexNew));
2197 if (!txdb.TxnCommit())
2201 if (pindexNew->nChainTrust > nBestChainTrust)
2202 if (!SetBestChain(txdb, pindexNew))
2205 if (pindexNew == pindexBest)
2207 // Notify UI to display prev block's coinbase if it was ours
2208 static uint256 hashPrevBestCoinBase;
2209 UpdatedTransaction(hashPrevBestCoinBase);
2210 hashPrevBestCoinBase = vtx[0].GetHash();
2213 uiInterface.NotifyBlocksChanged();
2220 bool CBlock::CheckBlock(bool fCheckPOW, bool fCheckMerkleRoot, bool fCheckSig) const
2222 // These are checks that are independent of context
2223 // that can be verified before saving an orphan block.
2226 if (vtx.empty() || vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
2227 return DoS(100, error("CheckBlock() : size limits failed"));
2229 bool fProtocol048 = fTestNet || VALIDATION_SWITCH_TIME < nTime;
2231 // Check proof of work matches claimed amount
2232 if (fCheckPOW && IsProofOfWork() && !CheckProofOfWork(GetHash(), nBits))
2233 return DoS(50, error("CheckBlock() : proof of work failed"));
2236 if (GetBlockTime() > FutureDrift(GetAdjustedTime()))
2237 return error("CheckBlock() : block timestamp too far in the future");
2239 // First transaction must be coinbase, the rest must not be
2240 if (vtx.empty() || !vtx[0].IsCoinBase())
2241 return DoS(100, error("CheckBlock() : first tx is not coinbase"));
2245 // Check coinbase timestamp
2246 if (GetBlockTime() < (int64)vtx[0].nTime)
2247 return DoS(100, error("CheckBlock() : coinbase timestamp violation"));
2251 // Check coinbase timestamp
2252 if (GetBlockTime() < PastDrift((int64)vtx[0].nTime))
2253 return DoS(50, error("CheckBlock() : coinbase timestamp is too late"));
2256 for (unsigned int i = 1; i < vtx.size(); i++)
2258 if (vtx[i].IsCoinBase())
2259 return DoS(100, error("CheckBlock() : more than one coinbase"));
2261 // Check transaction timestamp
2262 if (GetBlockTime() < (int64)vtx[i].nTime)
2263 return DoS(50, error("CheckBlock() : block timestamp earlier than transaction timestamp"));
2266 if (IsProofOfStake())
2271 return DoS(100, error("CheckBlock() : non-zero nonce in proof-of-stake block"));
2274 // Coinbase output should be empty if proof-of-stake block
2275 if (vtx[0].vout.size() != 1 || !vtx[0].vout[0].IsEmpty())
2276 return DoS(100, error("CheckBlock() : coinbase output not empty for proof-of-stake block"));
2278 // Second transaction must be coinstake, the rest must not be
2279 if (vtx.empty() || !vtx[1].IsCoinStake())
2280 return DoS(100, error("CheckBlock() : second tx is not coinstake"));
2281 for (unsigned int i = 2; i < vtx.size(); i++)
2282 if (vtx[i].IsCoinStake())
2283 return DoS(100, error("CheckBlock() : more than one coinstake"));
2285 // Check coinstake timestamp
2286 if (GetBlockTime() != (int64)vtx[1].nTime)
2287 return DoS(50, error("CheckBlock() : coinstake timestamp violation nTimeBlock=%"PRI64d" nTimeTx=%u", GetBlockTime(), vtx[1].nTime));
2289 // NovaCoin: check proof-of-stake block signature
2290 if (fCheckSig && !CheckBlockSignature(true))
2291 return DoS(100, error("CheckBlock() : bad proof-of-stake block signature"));
2295 // Should we check proof-of-work block signature or not?
2297 // * Always skip on TestNet
2298 // * Perform checking for the first 9689 blocks
2299 // * Perform checking since last checkpoint until 20 Sep 2013 (will be removed after)
2301 if(!fTestNet && fCheckSig)
2303 bool checkEntropySig = (GetBlockTime() < ENTROPY_SWITCH_TIME);
2305 // NovaCoin: check proof-of-work block signature
2306 if (checkEntropySig && !CheckBlockSignature(false))
2307 return DoS(100, error("CheckBlock() : bad proof-of-work block signature"));
2311 // Check transactions
2312 BOOST_FOREACH(const CTransaction& tx, vtx)
2314 if (!tx.CheckTransaction())
2315 return DoS(tx.nDoS, error("CheckBlock() : CheckTransaction failed"));
2318 // Check for duplicate txids. This is caught by ConnectInputs(),
2319 // but catching it earlier avoids a potential DoS attack:
2320 set<uint256> uniqueTx;
2321 BOOST_FOREACH(const CTransaction& tx, vtx)
2323 uniqueTx.insert(tx.GetHash());
2325 if (uniqueTx.size() != vtx.size())
2326 return DoS(100, error("CheckBlock() : duplicate transaction"));
2328 unsigned int nSigOps = 0;
2329 BOOST_FOREACH(const CTransaction& tx, vtx)
2331 nSigOps += tx.GetLegacySigOpCount();
2333 if (nSigOps > MAX_BLOCK_SIGOPS)
2334 return DoS(100, error("CheckBlock() : out-of-bounds SigOpCount"));
2336 // Check merkle root
2337 if (fCheckMerkleRoot && hashMerkleRoot != BuildMerkleTree())
2338 return DoS(100, error("CheckBlock() : hashMerkleRoot mismatch"));
2344 bool CBlock::AcceptBlock()
2346 // Check for duplicate
2347 uint256 hash = GetHash();
2348 if (mapBlockIndex.count(hash))
2349 return error("AcceptBlock() : block already in mapBlockIndex");
2351 // Get prev block index
2352 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashPrevBlock);
2353 if (mi == mapBlockIndex.end())
2354 return DoS(10, error("AcceptBlock() : prev block not found"));
2355 CBlockIndex* pindexPrev = (*mi).second;
2356 int nHeight = pindexPrev->nHeight+1;
2358 // Check proof-of-work or proof-of-stake
2359 if (nBits != GetNextTargetRequired(pindexPrev, IsProofOfStake()))
2360 return DoS(100, error("AcceptBlock() : incorrect %s", IsProofOfWork() ? "proof-of-work" : "proof-of-stake"));
2362 // Check timestamp against prev
2363 if (GetBlockTime() <= pindexPrev->GetMedianTimePast() || FutureDrift(GetBlockTime()) < pindexPrev->GetBlockTime())
2364 return error("AcceptBlock() : block's timestamp is too early");
2366 // Check that all transactions are finalized
2367 BOOST_FOREACH(const CTransaction& tx, vtx)
2368 if (!tx.IsFinal(nHeight, GetBlockTime()))
2369 return DoS(10, error("AcceptBlock() : contains a non-final transaction"));
2371 // Check that the block chain matches the known block chain up to a checkpoint
2372 if (!Checkpoints::CheckHardened(nHeight, hash))
2373 return DoS(100, error("AcceptBlock() : rejected by hardened checkpoint lock-in at %d", nHeight));
2375 bool cpSatisfies = Checkpoints::CheckSync(hash, pindexPrev);
2377 // Check that the block satisfies synchronized checkpoint
2378 if (CheckpointsMode == Checkpoints::STRICT && !cpSatisfies)
2379 return error("AcceptBlock() : rejected by synchronized checkpoint");
2381 if (CheckpointsMode == Checkpoints::ADVISORY && !cpSatisfies)
2382 strMiscWarning = _("WARNING: syncronized checkpoint violation detected, but skipped!");
2384 // Enforce rule that the coinbase starts with serialized block height
2385 CScript expect = CScript() << nHeight;
2386 if (vtx[0].vin[0].scriptSig.size() < expect.size() ||
2387 !std::equal(expect.begin(), expect.end(), vtx[0].vin[0].scriptSig.begin()))
2388 return DoS(100, error("AcceptBlock() : block height mismatch in coinbase"));
2390 // Write block to history file
2391 if (!CheckDiskSpace(::GetSerializeSize(*this, SER_DISK, CLIENT_VERSION)))
2392 return error("AcceptBlock() : out of disk space");
2393 unsigned int nFile = -1;
2394 unsigned int nBlockPos = 0;
2395 if (!WriteToDisk(nFile, nBlockPos))
2396 return error("AcceptBlock() : WriteToDisk failed");
2397 if (!AddToBlockIndex(nFile, nBlockPos))
2398 return error("AcceptBlock() : AddToBlockIndex failed");
2400 // Relay inventory, but don't relay old inventory during initial block download
2401 int nBlockEstimate = Checkpoints::GetTotalBlocksEstimate();
2402 if (hashBestChain == hash)
2405 BOOST_FOREACH(CNode* pnode, vNodes)
2406 if (nBestHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
2407 pnode->PushInventory(CInv(MSG_BLOCK, hash));
2410 // ppcoin: check pending sync-checkpoint
2411 Checkpoints::AcceptPendingSyncCheckpoint();
2416 uint256 CBlockIndex::GetBlockTrust() const
2419 bnTarget.SetCompact(nBits);
2425 if (!fTestNet && GetBlockTime() < CHAINCHECKS_SWITCH_TIME)
2426 return (IsProofOfStake()? ((CBigNum(1)<<256) / (bnTarget+1)).getuint256() : 1);
2430 // Calculate work amount for block
2431 uint256 nPoWTrust = (CBigNum(nPoWBase) / (bnTarget+1)).getuint256();
2433 // Set nPowTrust to 1 if we are checking PoS block or PoW difficulty is too low
2434 nPoWTrust = (IsProofOfStake() || nPoWTrust < 1) ? 1 : nPoWTrust;
2436 // Return nPoWTrust for the first 12 blocks
2437 if (pprev == NULL || pprev->nHeight < 12)
2440 const CBlockIndex* currentIndex = pprev;
2442 if(IsProofOfStake())
2444 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2446 // Return 1/3 of score if parent block is not the PoW block
2447 if (!pprev->IsProofOfWork())
2448 return (bnNewTrust / 3).getuint256();
2452 // Check last 12 blocks type
2453 while (pprev->nHeight - currentIndex->nHeight < 12)
2455 if (currentIndex->IsProofOfWork())
2457 currentIndex = currentIndex->pprev;
2460 // Return 1/3 of score if less than 3 PoW blocks found
2462 return (bnNewTrust / 3).getuint256();
2464 return bnNewTrust.getuint256();
2468 CBigNum bnLastBlockTrust = CBigNum(pprev->nChainTrust - pprev->pprev->nChainTrust);
2470 // Return nPoWTrust + 2/3 of previous block score if two parent blocks are not PoS blocks
2471 if (!(pprev->IsProofOfStake() && pprev->pprev->IsProofOfStake()))
2472 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2476 // Check last 12 blocks type
2477 while (pprev->nHeight - currentIndex->nHeight < 12)
2479 if (currentIndex->IsProofOfStake())
2481 currentIndex = currentIndex->pprev;
2484 // Return nPoWTrust + 2/3 of previous block score if less than 7 PoS blocks found
2486 return nPoWTrust + (2 * bnLastBlockTrust / 3).getuint256();
2488 bnTarget.SetCompact(pprev->nBits);
2493 CBigNum bnNewTrust = (CBigNum(1)<<256) / (bnTarget+1);
2495 // Return nPoWTrust + full trust score for previous block nBits
2496 return nPoWTrust + bnNewTrust.getuint256();
2500 bool CBlockIndex::IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned int nRequired, unsigned int nToCheck)
2502 unsigned int nFound = 0;
2503 for (unsigned int i = 0; i < nToCheck && nFound < nRequired && pstart != NULL; i++)
2505 if (pstart->nVersion >= minVersion)
2507 pstart = pstart->pprev;
2509 return (nFound >= nRequired);
2512 bool ProcessBlock(CNode* pfrom, CBlock* pblock)
2514 // Check for duplicate
2515 uint256 hash = pblock->GetHash();
2516 if (mapBlockIndex.count(hash))
2517 return error("ProcessBlock() : already have block %d %s", mapBlockIndex[hash]->nHeight, hash.ToString().substr(0,20).c_str());
2518 if (mapOrphanBlocks.count(hash))
2519 return error("ProcessBlock() : already have block (orphan) %s", hash.ToString().substr(0,20).c_str());
2521 // ppcoin: check proof-of-stake
2522 // Limited duplicity on stake: prevents block flood attack
2523 // Duplicate stake allowed only when there is orphan child block
2524 if (pblock->IsProofOfStake() && setStakeSeen.count(pblock->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2525 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());
2527 // Preliminary checks
2528 if (!pblock->CheckBlock())
2529 return error("ProcessBlock() : CheckBlock FAILED");
2531 // ppcoin: verify hash target and signature of coinstake tx
2532 if (pblock->IsProofOfStake())
2534 uint256 hashProofOfStake = 0, targetProofOfStake = 0;
2535 if (!CheckProofOfStake(pblock->vtx[1], pblock->nBits, hashProofOfStake, targetProofOfStake))
2537 printf("WARNING: ProcessBlock(): check proof-of-stake failed for block %s\n", hash.ToString().c_str());
2538 return false; // do not error here as we expect this during initial block download
2540 if (!mapProofOfStake.count(hash)) // add to mapProofOfStake
2541 mapProofOfStake.insert(make_pair(hash, hashProofOfStake));
2544 CBlockIndex* pcheckpoint = Checkpoints::GetLastSyncCheckpoint();
2545 if (pcheckpoint && pblock->hashPrevBlock != hashBestChain && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2547 // Extra checks to prevent "fill up memory by spamming with bogus blocks"
2548 int64 deltaTime = pblock->GetBlockTime() - pcheckpoint->nTime;
2550 bnNewBlock.SetCompact(pblock->nBits);
2553 if (pblock->IsProofOfStake())
2554 bnRequired.SetCompact(ComputeMinStake(GetLastBlockIndex(pcheckpoint, true)->nBits, deltaTime, pblock->nTime));
2556 bnRequired.SetCompact(ComputeMinWork(GetLastBlockIndex(pcheckpoint, false)->nBits, deltaTime));
2558 if (bnNewBlock > bnRequired)
2561 pfrom->Misbehaving(100);
2562 return error("ProcessBlock() : block with too little %s", pblock->IsProofOfStake()? "proof-of-stake" : "proof-of-work");
2566 // ppcoin: ask for pending sync-checkpoint if any
2567 if (!IsInitialBlockDownload())
2568 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
2570 // If don't already have its previous block, shunt it off to holding area until we get it
2571 if (!mapBlockIndex.count(pblock->hashPrevBlock))
2573 printf("ProcessBlock: ORPHAN BLOCK, prev=%s\n", pblock->hashPrevBlock.ToString().substr(0,20).c_str());
2574 CBlock* pblock2 = new CBlock(*pblock);
2575 // ppcoin: check proof-of-stake
2576 if (pblock2->IsProofOfStake())
2578 // Limited duplicity on stake: prevents block flood attack
2579 // Duplicate stake allowed only when there is orphan child block
2580 if (setStakeSeenOrphan.count(pblock2->GetProofOfStake()) && !mapOrphanBlocksByPrev.count(hash) && !Checkpoints::WantedByPendingSyncCheckpoint(hash))
2581 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());
2583 setStakeSeenOrphan.insert(pblock2->GetProofOfStake());
2585 mapOrphanBlocks.insert(make_pair(hash, pblock2));
2586 mapOrphanBlocksByPrev.insert(make_pair(pblock2->hashPrevBlock, pblock2));
2588 // Ask this guy to fill in what we're missing
2591 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(pblock2));
2592 // ppcoin: getblocks may not obtain the ancestor block rejected
2593 // earlier by duplicate-stake check so we ask for it again directly
2594 if (!IsInitialBlockDownload())
2595 pfrom->AskFor(CInv(MSG_BLOCK, WantedByOrphan(pblock2)));
2601 if (!pblock->AcceptBlock())
2602 return error("ProcessBlock() : AcceptBlock FAILED");
2604 // Recursively process any orphan blocks that depended on this one
2605 vector<uint256> vWorkQueue;
2606 vWorkQueue.push_back(hash);
2607 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
2609 uint256 hashPrev = vWorkQueue[i];
2610 for (multimap<uint256, CBlock*>::iterator mi = mapOrphanBlocksByPrev.lower_bound(hashPrev);
2611 mi != mapOrphanBlocksByPrev.upper_bound(hashPrev);
2614 CBlock* pblockOrphan = (*mi).second;
2615 if (pblockOrphan->AcceptBlock())
2616 vWorkQueue.push_back(pblockOrphan->GetHash());
2617 mapOrphanBlocks.erase(pblockOrphan->GetHash());
2618 setStakeSeenOrphan.erase(pblockOrphan->GetProofOfStake());
2619 delete pblockOrphan;
2621 mapOrphanBlocksByPrev.erase(hashPrev);
2624 printf("ProcessBlock: ACCEPTED\n");
2626 // ppcoin: if responsible for sync-checkpoint send it
2627 if (pfrom && !CSyncCheckpoint::strMasterPrivKey.empty())
2628 Checkpoints::SendSyncCheckpoint(Checkpoints::AutoSelectSyncCheckpoint());
2633 // novacoin: attempt to generate suitable proof-of-stake
2634 bool CBlock::SignBlock(CWallet& wallet)
2636 // if we are trying to sign
2637 // something except proof-of-stake block template
2638 if (!vtx[0].vout[0].IsEmpty())
2641 // if we are trying to sign
2642 // a complete proof-of-stake block
2643 if (IsProofOfStake())
2646 static int64 nLastCoinStakeSearchTime = GetAdjustedTime(); // startup timestamp
2649 CTransaction txCoinStake;
2650 int64 nSearchTime = txCoinStake.nTime; // search to current time
2652 if (nSearchTime > nLastCoinStakeSearchTime)
2654 if (wallet.CreateCoinStake(wallet, nBits, nSearchTime-nLastCoinStakeSearchTime, txCoinStake, key))
2656 if (txCoinStake.nTime >= max(pindexBest->GetMedianTimePast()+1, PastDrift(pindexBest->GetBlockTime())))
2658 // make sure coinstake would meet timestamp protocol
2659 // as it would be the same as the block timestamp
2660 vtx[0].nTime = nTime = txCoinStake.nTime;
2661 nTime = max(pindexBest->GetMedianTimePast()+1, GetMaxTransactionTime());
2662 nTime = max(GetBlockTime(), PastDrift(pindexBest->GetBlockTime()));
2664 // we have to make sure that we have no future timestamps in
2665 // our transactions set
2666 for (vector<CTransaction>::iterator it = vtx.begin(); it != vtx.end();)
2667 if (it->nTime > nTime) { it = vtx.erase(it); } else { ++it; }
2669 vtx.insert(vtx.begin() + 1, txCoinStake);
2670 hashMerkleRoot = BuildMerkleTree();
2672 // append a signature to our block
2673 return key.Sign(GetHash(), vchBlockSig);
2676 nLastCoinStakeSearchInterval = nSearchTime - nLastCoinStakeSearchTime;
2677 nLastCoinStakeSearchTime = nSearchTime;
2683 // ppcoin: check block signature
2684 bool CBlock::CheckBlockSignature(bool fProofOfStake) const
2686 if (GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet))
2687 return vchBlockSig.empty();
2689 vector<valtype> vSolutions;
2690 txnouttype whichType;
2694 const CTxOut& txout = vtx[1].vout[1];
2696 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2698 if (whichType == TX_PUBKEY)
2700 valtype& vchPubKey = vSolutions[0];
2702 if (!key.SetPubKey(vchPubKey))
2704 if (vchBlockSig.empty())
2706 return key.Verify(GetHash(), vchBlockSig);
2711 for(unsigned int i = 0; i < vtx[0].vout.size(); i++)
2713 const CTxOut& txout = vtx[0].vout[i];
2715 if (!Solver(txout.scriptPubKey, whichType, vSolutions))
2718 if (whichType == TX_PUBKEY)
2721 valtype& vchPubKey = vSolutions[0];
2723 if (!key.SetPubKey(vchPubKey))
2725 if (vchBlockSig.empty())
2727 if(!key.Verify(GetHash(), vchBlockSig))
2737 bool CheckDiskSpace(uint64 nAdditionalBytes)
2739 uint64 nFreeBytesAvailable = filesystem::space(GetDataDir()).available;
2741 // Check for nMinDiskSpace bytes (currently 50MB)
2742 if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
2745 string strMessage = _("Warning: Disk space is low!");
2746 strMiscWarning = strMessage;
2747 printf("*** %s\n", strMessage.c_str());
2748 uiInterface.ThreadSafeMessageBox(strMessage, "NovaCoin", CClientUIInterface::OK | CClientUIInterface::ICON_EXCLAMATION | CClientUIInterface::MODAL);
2755 static filesystem::path BlockFilePath(unsigned int nFile)
2757 string strBlockFn = strprintf("blk%04u.dat", nFile);
2758 return GetDataDir() / strBlockFn;
2761 FILE* OpenBlockFile(unsigned int nFile, unsigned int nBlockPos, const char* pszMode)
2763 if ((nFile < 1) || (nFile == (unsigned int) -1))
2765 FILE* file = fopen(BlockFilePath(nFile).string().c_str(), pszMode);
2768 if (nBlockPos != 0 && !strchr(pszMode, 'a') && !strchr(pszMode, 'w'))
2770 if (fseek(file, nBlockPos, SEEK_SET) != 0)
2779 static unsigned int nCurrentBlockFile = 1;
2781 FILE* AppendBlockFile(unsigned int& nFileRet)
2786 FILE* file = OpenBlockFile(nCurrentBlockFile, 0, "ab");
2789 if (fseek(file, 0, SEEK_END) != 0)
2791 // FAT32 file size max 4GB, fseek and ftell max 2GB, so we must stay under 2GB
2792 if (ftell(file) < (long)(0x7F000000 - MAX_SIZE))
2794 nFileRet = nCurrentBlockFile;
2798 nCurrentBlockFile++;
2802 bool LoadBlockIndex(bool fAllowNew)
2804 CBigNum bnTrustedModulus;
2808 pchMessageStart[0] = 0xcd;
2809 pchMessageStart[1] = 0xf2;
2810 pchMessageStart[2] = 0xc0;
2811 pchMessageStart[3] = 0xef;
2813 bnTrustedModulus.SetHex("f0d14cf72623dacfe738d0892b599be0f31052239cddd95a3f25101c801dc990453b38c9434efe3f372db39a32c2bb44cbaea72d62c8931fa785b0ec44531308df3e46069be5573e49bb29f4d479bfc3d162f57a5965db03810be7636da265bfced9c01a6b0296c77910ebdc8016f70174f0f18a57b3b971ac43a934c6aedbc5c866764a3622b5b7e3f9832b8b3f133c849dbcc0396588abcd1e41048555746e4823fb8aba5b3d23692c6857fccce733d6bb6ec1d5ea0afafecea14a0f6f798b6b27f77dc989c557795cc39a0940ef6bb29a7fc84135193a55bcfc2f01dd73efad1b69f45a55198bd0e6bef4d338e452f6a420f1ae2b1167b923f76633ab6e55");
2814 bnProofOfWorkLimit = bnProofOfWorkLimitTestNet; // 16 bits PoW target limit for testnet
2815 nStakeMinAge = 2 * 60 * 60; // test net min age is 2 hours
2816 nModifierInterval = 20 * 60; // test modifier interval is 20 minutes
2817 nCoinbaseMaturity = 10; // test maturity is 10 blocks
2818 nStakeTargetSpacing = 5 * 60; // test block spacing is 5 minutes
2822 bnTrustedModulus.SetHex("d01f952e1090a5a72a3eda261083256596ccc192935ae1454c2bafd03b09e6ed11811be9f3a69f5783bbbced8c6a0c56621f42c2d19087416facf2f13cc7ed7159d1c5253119612b8449f0c7f54248e382d30ecab1928dbf075c5425dcaee1a819aa13550e0f3227b8c685b14e0eae094d65d8a610a6f49fff8145259d1187e4c6a472fa5868b2b67f957cb74b787f4311dbc13c97a2ca13acdb876ff506ebecbb904548c267d68868e07a32cd9ed461fbc2f920e9940e7788fed2e4817f274df5839c2196c80abe5c486df39795186d7bc86314ae1e8342f3c884b158b4b05b4302754bf351477d35370bad6639b2195d30006b77bf3dbb28b848fd9ecff5662bf39dde0c974e83af51b0d3d642d43834827b8c3b189065514636b8f2a59c42ba9b4fc4975d4827a5d89617a3873e4b377b4d559ad165748632bd928439cfbc5a8ef49bc2220e0b15fb0aa302367d5e99e379a961c1bc8cf89825da5525e3c8f14d7d8acca2fa9c133a2176ae69874d8b1d38b26b9c694e211018005a97b40848681b9dd38feb2de141626fb82591aad20dc629b2b6421cef1227809551a0e4e943ab99841939877f18f2d9c0addc93cf672e26b02ed94da3e6d329e8ac8f3736eebbf37bb1a21e5aadf04ee8e3b542f876aa88b2adf2608bd86329b7f7a56fd0dc1c40b48188731d11082aea360c62a0840c2db3dad7178fd7e359317ae081");
2825 // Set up the Zerocoin Params object
2826 ZCParams = new libzerocoin::Params(bnTrustedModulus);
2832 if (!txdb.LoadBlockIndex())
2836 // Init with genesis block
2838 if (mapBlockIndex.empty())
2847 //CBlock(hash=00000a060336cbb72fe969666d337b87198b1add2abaa59cca226820b32933a4, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1e0fffff, nNonce=1575379, vtx=1, vchBlockSig=)
2848 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2849 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2851 // vMerkleTree: 4cb33b3b6a
2855 //CBlock(hash=0000c763e402f2436da9ed36c7286f62c3f6e5dbafce9ff289bd43d7459327eb, ver=1, hashPrevBlock=0000000000000000000000000000000000000000000000000000000000000000, hashMerkleRoot=4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b, nTime=1360105017, nBits=1f00ffff, nNonce=46534, vtx=1, vchBlockSig=)
2856 // Coinbase(hash=4cb33b3b6a, nTime=1360105017, ver=1, vin.size=1, vout.size=1, nLockTime=0)
2857 // CTxIn(COutPoint(0000000000, 4294967295), coinbase 04ffff001d020f274468747470733a2f2f626974636f696e74616c6b2e6f72672f696e6465782e7068703f746f7069633d3133343137392e6d736731353032313936236d736731353032313936)
2859 // vMerkleTree: 4cb33b3b6a
2861 const char* pszTimestamp = "https://bitcointalk.org/index.php?topic=134179.msg1502196#msg1502196";
2863 txNew.nTime = 1360105017;
2864 txNew.vin.resize(1);
2865 txNew.vout.resize(1);
2866 txNew.vin[0].scriptSig = CScript() << 486604799 << CBigNum(9999) << vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
2867 txNew.vout[0].SetEmpty();
2869 block.vtx.push_back(txNew);
2870 block.hashPrevBlock = 0;
2871 block.hashMerkleRoot = block.BuildMerkleTree();
2873 block.nTime = 1360105017;
2874 block.nBits = bnProofOfWorkLimit.GetCompact();
2875 block.nNonce = !fTestNet ? 1575379 : 46534;
2878 assert(block.hashMerkleRoot == uint256("0x4cb33b3b6a861dcbc685d3e614a9cafb945738d6833f182855679f2fad02057b"));
2880 assert(block.GetHash() == (!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet));
2881 assert(block.CheckBlock());
2883 // Start new block file
2885 unsigned int nBlockPos;
2886 if (!block.WriteToDisk(nFile, nBlockPos))
2887 return error("LoadBlockIndex() : writing genesis block to disk failed");
2888 if (!block.AddToBlockIndex(nFile, nBlockPos))
2889 return error("LoadBlockIndex() : genesis block not accepted");
2891 // initialize synchronized checkpoint
2892 if (!Checkpoints::WriteSyncCheckpoint((!fTestNet ? hashGenesisBlock : hashGenesisBlockTestNet)))
2893 return error("LoadBlockIndex() : failed to init sync checkpoint");
2895 // upgrade time set to zero if txdb initialized
2897 if (!txdb.WriteModifierUpgradeTime(0))
2898 return error("LoadBlockIndex() : failed to init upgrade info");
2899 printf(" Upgrade Info: ModifierUpgradeTime txdb initialization\n");
2905 string strPubKey = "";
2906 if (!txdb.ReadCheckpointPubKey(strPubKey) || strPubKey != CSyncCheckpoint::strMasterPubKey)
2908 // write checkpoint master key to db
2910 if (!txdb.WriteCheckpointPubKey(CSyncCheckpoint::strMasterPubKey))
2911 return error("LoadBlockIndex() : failed to write new checkpoint master key to db");
2912 if (!txdb.TxnCommit())
2913 return error("LoadBlockIndex() : failed to commit new checkpoint master key to db");
2914 if ((!fTestNet) && !Checkpoints::ResetSyncCheckpoint())
2915 return error("LoadBlockIndex() : failed to reset sync-checkpoint");
2918 // upgrade time set to zero if blocktreedb initialized
2919 if (txdb.ReadModifierUpgradeTime(nModifierUpgradeTime))
2921 if (nModifierUpgradeTime)
2922 printf(" Upgrade Info: blocktreedb upgrade detected at timestamp %d\n", nModifierUpgradeTime);
2924 printf(" Upgrade Info: no blocktreedb upgrade detected.\n");
2928 nModifierUpgradeTime = GetTime();
2929 printf(" Upgrade Info: upgrading blocktreedb at timestamp %u\n", nModifierUpgradeTime);
2930 if (!txdb.WriteModifierUpgradeTime(nModifierUpgradeTime))
2931 return error("LoadBlockIndex() : failed to write upgrade info");
2944 void PrintBlockTree()
2946 // pre-compute tree structure
2947 map<CBlockIndex*, vector<CBlockIndex*> > mapNext;
2948 for (map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.begin(); mi != mapBlockIndex.end(); ++mi)
2950 CBlockIndex* pindex = (*mi).second;
2951 mapNext[pindex->pprev].push_back(pindex);
2953 //while (rand() % 3 == 0)
2954 // mapNext[pindex->pprev].push_back(pindex);
2957 vector<pair<int, CBlockIndex*> > vStack;
2958 vStack.push_back(make_pair(0, pindexGenesisBlock));
2961 while (!vStack.empty())
2963 int nCol = vStack.back().first;
2964 CBlockIndex* pindex = vStack.back().second;
2967 // print split or gap
2968 if (nCol > nPrevCol)
2970 for (int i = 0; i < nCol-1; i++)
2974 else if (nCol < nPrevCol)
2976 for (int i = 0; i < nCol; i++)
2983 for (int i = 0; i < nCol; i++)
2988 block.ReadFromDisk(pindex);
2989 printf("%d (%u,%u) %s %08x %s mint %7s tx %"PRIszu"",
2993 block.GetHash().ToString().c_str(),
2995 DateTimeStrFormat("%x %H:%M:%S", block.GetBlockTime()).c_str(),
2996 FormatMoney(pindex->nMint).c_str(),
2999 PrintWallets(block);
3001 // put the main time-chain first
3002 vector<CBlockIndex*>& vNext = mapNext[pindex];
3003 for (unsigned int i = 0; i < vNext.size(); i++)
3005 if (vNext[i]->pnext)
3007 swap(vNext[0], vNext[i]);
3013 for (unsigned int i = 0; i < vNext.size(); i++)
3014 vStack.push_back(make_pair(nCol+i, vNext[i]));
3018 bool LoadExternalBlockFile(FILE* fileIn)
3020 int64 nStart = GetTimeMillis();
3026 CAutoFile blkdat(fileIn, SER_DISK, CLIENT_VERSION);
3027 unsigned int nPos = 0;
3028 while (nPos != (unsigned int)-1 && blkdat.good() && !fRequestShutdown)
3030 unsigned char pchData[65536];
3032 fseek(blkdat, nPos, SEEK_SET);
3033 int nRead = fread(pchData, 1, sizeof(pchData), blkdat);
3036 nPos = (unsigned int)-1;
3039 void* nFind = memchr(pchData, pchMessageStart[0], nRead+1-sizeof(pchMessageStart));
3042 if (memcmp(nFind, pchMessageStart, sizeof(pchMessageStart))==0)
3044 nPos += ((unsigned char*)nFind - pchData) + sizeof(pchMessageStart);
3047 nPos += ((unsigned char*)nFind - pchData) + 1;
3050 nPos += sizeof(pchData) - sizeof(pchMessageStart) + 1;
3051 } while(!fRequestShutdown);
3052 if (nPos == (unsigned int)-1)
3054 fseek(blkdat, nPos, SEEK_SET);
3057 if (nSize > 0 && nSize <= MAX_BLOCK_SIZE)
3061 if (ProcessBlock(NULL,&block))
3069 catch (std::exception &e) {
3070 printf("%s() : Deserialize or I/O error caught during load\n",
3071 __PRETTY_FUNCTION__);
3074 printf("Loaded %i blocks from external file in %"PRI64d"ms\n", nLoaded, GetTimeMillis() - nStart);
3078 //////////////////////////////////////////////////////////////////////////////
3083 extern map<uint256, CAlert> mapAlerts;
3084 extern CCriticalSection cs_mapAlerts;
3086 string GetWarnings(string strFor)
3089 string strStatusBar;
3092 if (GetBoolArg("-testsafemode"))
3095 // Misc warnings like out of disk space and clock is wrong
3096 if (strMiscWarning != "")
3099 strStatusBar = strMiscWarning;
3102 // if detected unmet upgrade requirement enter safe mode
3103 // Note: Modifier upgrade requires blockchain redownload if past protocol switch
3104 if (IsFixedModifierInterval(nModifierUpgradeTime + 60*60*24)) // 1 day margin
3107 strStatusBar = strRPC = "WARNING: Blockchain redownload required approaching or past v.0.4.4.6u4 upgrade deadline.";
3110 // if detected invalid checkpoint enter safe mode
3111 if (Checkpoints::hashInvalidCheckpoint != 0)
3114 strStatusBar = strRPC = _("WARNING: Invalid checkpoint found! Displayed transactions may not be correct! You may need to upgrade, or notify developers.");
3120 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3122 const CAlert& alert = item.second;
3123 if (alert.AppliesToMe() && alert.nPriority > nPriority)
3125 nPriority = alert.nPriority;
3126 strStatusBar = alert.strStatusBar;
3127 if (nPriority > 1000)
3128 strRPC = strStatusBar;
3133 if (strFor == "statusbar")
3134 return strStatusBar;
3135 else if (strFor == "rpc")
3137 assert(!"GetWarnings() : invalid parameter");
3148 //////////////////////////////////////////////////////////////////////////////
3154 bool static AlreadyHave(CTxDB& txdb, const CInv& inv)
3160 bool txInMap = false;
3163 txInMap = (mempool.exists(inv.hash));
3166 mapOrphanTransactions.count(inv.hash) ||
3167 txdb.ContainsTx(inv.hash);
3171 return mapBlockIndex.count(inv.hash) ||
3172 mapOrphanBlocks.count(inv.hash);
3174 // Don't know what it is, just say we already got one
3181 // The message start string is designed to be unlikely to occur in normal data.
3182 // The characters are rarely used upper ASCII, not valid as UTF-8, and produce
3183 // a large 4-byte int at any alignment.
3184 unsigned char pchMessageStart[4] = { 0xe4, 0xe8, 0xe9, 0xe5 };
3186 bool static ProcessMessage(CNode* pfrom, string strCommand, CDataStream& vRecv)
3188 static map<CService, CPubKey> mapReuseKey;
3189 RandAddSeedPerfmon();
3191 printf("received: %s (%"PRIszu" bytes)\n", strCommand.c_str(), vRecv.size());
3192 if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
3194 printf("dropmessagestest DROPPING RECV MESSAGE\n");
3198 if (strCommand == "version")
3200 // Each connection can only send one version message
3201 if (pfrom->nVersion != 0)
3203 pfrom->Misbehaving(1);
3211 vRecv >> pfrom->nVersion >> pfrom->nServices >> nTime >> addrMe;
3212 if (pfrom->nVersion < MIN_PROTO_VERSION)
3214 // Since February 20, 2012, the protocol is initiated at version 209,
3215 // and earlier versions are no longer supported
3216 printf("partner %s using obsolete version %i; disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3217 pfrom->fDisconnect = true;
3221 if (pfrom->nVersion == 10300)
3222 pfrom->nVersion = 300;
3224 vRecv >> addrFrom >> nNonce;
3226 vRecv >> pfrom->strSubVer;
3228 vRecv >> pfrom->nStartingHeight;
3230 if (pfrom->fInbound && addrMe.IsRoutable())
3232 pfrom->addrLocal = addrMe;
3236 // Disconnect if we connected to ourself
3237 if (nNonce == nLocalHostNonce && nNonce > 1)
3239 printf("connected to self at %s, disconnecting\n", pfrom->addr.ToString().c_str());
3240 pfrom->fDisconnect = true;
3244 if (pfrom->nVersion < 60010)
3246 printf("partner %s using a buggy client %d, disconnecting\n", pfrom->addr.ToString().c_str(), pfrom->nVersion);
3247 pfrom->fDisconnect = true;
3251 // record my external IP reported by peer
3252 if (addrFrom.IsRoutable() && addrMe.IsRoutable())
3253 addrSeenByPeer = addrMe;
3255 // Be shy and don't send version until we hear
3256 if (pfrom->fInbound)
3257 pfrom->PushVersion();
3259 pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
3261 AddTimeData(pfrom->addr, nTime);
3264 pfrom->PushMessage("verack");
3265 pfrom->vSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3267 if (!pfrom->fInbound)
3269 // Advertise our address
3270 if (!fNoListen && !IsInitialBlockDownload())
3272 CAddress addr = GetLocalAddress(&pfrom->addr);
3273 if (addr.IsRoutable())
3274 pfrom->PushAddress(addr);
3277 // Get recent addresses
3278 if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
3280 pfrom->PushMessage("getaddr");
3281 pfrom->fGetAddr = true;
3283 addrman.Good(pfrom->addr);
3285 if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
3287 addrman.Add(addrFrom, addrFrom);
3288 addrman.Good(addrFrom);
3292 // Ask the first connected node for block updates
3293 static int nAskedForBlocks = 0;
3294 if (!pfrom->fClient && !pfrom->fOneShot &&
3295 (pfrom->nStartingHeight > (nBestHeight - 144)) &&
3296 (pfrom->nVersion < NOBLKS_VERSION_START ||
3297 pfrom->nVersion >= NOBLKS_VERSION_END) &&
3298 (nAskedForBlocks < 1 || vNodes.size() <= 1))
3301 pfrom->PushGetBlocks(pindexBest, uint256(0));
3307 BOOST_FOREACH(PAIRTYPE(const uint256, CAlert)& item, mapAlerts)
3308 item.second.RelayTo(pfrom);
3311 // Relay sync-checkpoint
3313 LOCK(Checkpoints::cs_hashSyncCheckpoint);
3314 if (!Checkpoints::checkpointMessage.IsNull())
3315 Checkpoints::checkpointMessage.RelayTo(pfrom);
3318 pfrom->fSuccessfullyConnected = true;
3320 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());
3322 cPeerBlockCounts.input(pfrom->nStartingHeight);
3324 // ppcoin: ask for pending sync-checkpoint if any
3325 if (!IsInitialBlockDownload())
3326 Checkpoints::AskForPendingSyncCheckpoint(pfrom);
3330 else if (pfrom->nVersion == 0)
3332 // Must have a version message before anything else
3333 pfrom->Misbehaving(1);
3338 else if (strCommand == "verack")
3340 pfrom->vRecv.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
3344 else if (strCommand == "addr")
3346 vector<CAddress> vAddr;
3349 // Don't want addr from older versions unless seeding
3350 if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
3352 if (vAddr.size() > 1000)
3354 pfrom->Misbehaving(20);
3355 return error("message addr size() = %"PRIszu"", vAddr.size());
3358 // Store the new addresses
3359 vector<CAddress> vAddrOk;
3360 int64 nNow = GetAdjustedTime();
3361 int64 nSince = nNow - 10 * 60;
3362 BOOST_FOREACH(CAddress& addr, vAddr)
3366 if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
3367 addr.nTime = nNow - 5 * 24 * 60 * 60;
3368 pfrom->AddAddressKnown(addr);
3369 bool fReachable = IsReachable(addr);
3370 if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
3372 // Relay to a limited number of other nodes
3375 // Use deterministic randomness to send to the same nodes for 24 hours
3376 // at a time so the setAddrKnowns of the chosen nodes prevent repeats
3377 static uint256 hashSalt;
3379 hashSalt = GetRandHash();
3380 uint64 hashAddr = addr.GetHash();
3381 uint256 hashRand = hashSalt ^ (hashAddr<<32) ^ ((GetTime()+hashAddr)/(24*60*60));
3382 hashRand = Hash(BEGIN(hashRand), END(hashRand));
3383 multimap<uint256, CNode*> mapMix;
3384 BOOST_FOREACH(CNode* pnode, vNodes)
3386 if (pnode->nVersion < CADDR_TIME_VERSION)
3388 unsigned int nPointer;
3389 memcpy(&nPointer, &pnode, sizeof(nPointer));
3390 uint256 hashKey = hashRand ^ nPointer;
3391 hashKey = Hash(BEGIN(hashKey), END(hashKey));
3392 mapMix.insert(make_pair(hashKey, pnode));
3394 int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
3395 for (multimap<uint256, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
3396 ((*mi).second)->PushAddress(addr);
3399 // Do not store addresses outside our network
3401 vAddrOk.push_back(addr);
3403 addrman.Add(vAddrOk, pfrom->addr, 2 * 60 * 60);
3404 if (vAddr.size() < 1000)
3405 pfrom->fGetAddr = false;
3406 if (pfrom->fOneShot)
3407 pfrom->fDisconnect = true;
3410 else if (strCommand == "inv")
3414 if (vInv.size() > MAX_INV_SZ)
3416 pfrom->Misbehaving(20);
3417 return error("message inv size() = %"PRIszu"", vInv.size());
3420 // find last block in inv vector
3421 unsigned int nLastBlock = (unsigned int)(-1);
3422 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++) {
3423 if (vInv[vInv.size() - 1 - nInv].type == MSG_BLOCK) {
3424 nLastBlock = vInv.size() - 1 - nInv;
3429 for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
3431 const CInv &inv = vInv[nInv];
3435 pfrom->AddInventoryKnown(inv);
3437 bool fAlreadyHave = AlreadyHave(txdb, inv);
3439 printf(" got inventory: %s %s\n", inv.ToString().c_str(), fAlreadyHave ? "have" : "new");
3443 else if (inv.type == MSG_BLOCK && mapOrphanBlocks.count(inv.hash)) {
3444 pfrom->PushGetBlocks(pindexBest, GetOrphanRoot(mapOrphanBlocks[inv.hash]));
3445 } else if (nInv == nLastBlock) {
3446 // In case we are on a very long side-chain, it is possible that we already have
3447 // the last block in an inv bundle sent in response to getblocks. Try to detect
3448 // this situation and push another getblocks to continue.
3449 pfrom->PushGetBlocks(mapBlockIndex[inv.hash], uint256(0));
3451 printf("force request: %s\n", inv.ToString().c_str());
3454 // Track requests for our stuff
3455 Inventory(inv.hash);
3460 else if (strCommand == "getdata")
3464 if (vInv.size() > MAX_INV_SZ)
3466 pfrom->Misbehaving(20);
3467 return error("message getdata size() = %"PRIszu"", vInv.size());
3470 if (fDebugNet || (vInv.size() != 1))
3471 printf("received getdata (%"PRIszu" invsz)\n", vInv.size());
3473 BOOST_FOREACH(const CInv& inv, vInv)
3477 if (fDebugNet || (vInv.size() == 1))
3478 printf("received getdata for: %s\n", inv.ToString().c_str());
3480 if (inv.type == MSG_BLOCK)
3482 // Send block from disk
3483 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(inv.hash);
3484 if (mi != mapBlockIndex.end())
3487 block.ReadFromDisk((*mi).second);
3488 pfrom->PushMessage("block", block);
3490 // Trigger them to send a getblocks request for the next batch of inventory
3491 if (inv.hash == pfrom->hashContinue)
3493 // ppcoin: send latest proof-of-work block to allow the
3494 // download node to accept as orphan (proof-of-stake
3495 // block might be rejected by stake connection check)
3497 vInv.push_back(CInv(MSG_BLOCK, GetLastBlockIndex(pindexBest, false)->GetBlockHash()));
3498 pfrom->PushMessage("inv", vInv);
3499 pfrom->hashContinue = 0;
3503 else if (inv.IsKnownType())
3505 // Send stream from relay memory
3506 bool pushed = false;
3509 map<CInv, CDataStream>::iterator mi = mapRelay.find(inv);
3510 if (mi != mapRelay.end()) {
3511 pfrom->PushMessage(inv.GetCommand(), (*mi).second);
3515 if (!pushed && inv.type == MSG_TX) {
3517 if (mempool.exists(inv.hash)) {
3518 CTransaction tx = mempool.lookup(inv.hash);
3519 CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
3522 pfrom->PushMessage("tx", ss);
3527 // Track requests for our stuff
3528 Inventory(inv.hash);
3533 else if (strCommand == "getblocks")
3535 CBlockLocator locator;
3537 vRecv >> locator >> hashStop;
3539 // Find the last block the caller has in the main chain
3540 CBlockIndex* pindex = locator.GetBlockIndex();
3542 // Send the rest of the chain
3544 pindex = pindex->pnext;
3546 printf("getblocks %d to %s limit %d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str(), nLimit);
3547 for (; pindex; pindex = pindex->pnext)
3549 if (pindex->GetBlockHash() == hashStop)
3551 printf(" getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3552 // ppcoin: tell downloading node about the latest block if it's
3553 // without risk being rejected due to stake connection check
3554 if (hashStop != hashBestChain && pindex->GetBlockTime() + nStakeMinAge > pindexBest->GetBlockTime())
3555 pfrom->PushInventory(CInv(MSG_BLOCK, hashBestChain));
3558 pfrom->PushInventory(CInv(MSG_BLOCK, pindex->GetBlockHash()));
3561 // When this block is requested, we'll send an inv that'll make them
3562 // getblocks the next batch of inventory.
3563 printf(" getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString().substr(0,20).c_str());
3564 pfrom->hashContinue = pindex->GetBlockHash();
3569 else if (strCommand == "checkpoint")
3571 CSyncCheckpoint checkpoint;
3572 vRecv >> checkpoint;
3574 if (checkpoint.ProcessSyncCheckpoint(pfrom))
3577 pfrom->hashCheckpointKnown = checkpoint.hashCheckpoint;
3579 BOOST_FOREACH(CNode* pnode, vNodes)
3580 checkpoint.RelayTo(pnode);
3584 else if (strCommand == "getheaders")
3586 CBlockLocator locator;
3588 vRecv >> locator >> hashStop;
3590 CBlockIndex* pindex = NULL;
3591 if (locator.IsNull())
3593 // If locator is null, return the hashStop block
3594 map<uint256, CBlockIndex*>::iterator mi = mapBlockIndex.find(hashStop);
3595 if (mi == mapBlockIndex.end())
3597 pindex = (*mi).second;
3601 // Find the last block the caller has in the main chain
3602 pindex = locator.GetBlockIndex();
3604 pindex = pindex->pnext;
3607 vector<CBlock> vHeaders;
3609 printf("getheaders %d to %s\n", (pindex ? pindex->nHeight : -1), hashStop.ToString().substr(0,20).c_str());
3610 for (; pindex; pindex = pindex->pnext)
3612 vHeaders.push_back(pindex->GetBlockHeader());
3613 if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
3616 pfrom->PushMessage("headers", vHeaders);
3620 else if (strCommand == "tx")
3622 vector<uint256> vWorkQueue;
3623 vector<uint256> vEraseQueue;
3624 CDataStream vMsg(vRecv);
3629 CInv inv(MSG_TX, tx.GetHash());
3630 pfrom->AddInventoryKnown(inv);
3632 bool fMissingInputs = false;
3633 if (tx.AcceptToMemoryPool(txdb, true, &fMissingInputs))
3635 SyncWithWallets(tx, NULL, true);
3636 RelayTransaction(tx, inv.hash);
3637 mapAlreadyAskedFor.erase(inv);
3638 vWorkQueue.push_back(inv.hash);
3639 vEraseQueue.push_back(inv.hash);
3641 // Recursively process any orphan transactions that depended on this one
3642 for (unsigned int i = 0; i < vWorkQueue.size(); i++)
3644 uint256 hashPrev = vWorkQueue[i];
3645 for (set<uint256>::iterator mi = mapOrphanTransactionsByPrev[hashPrev].begin();
3646 mi != mapOrphanTransactionsByPrev[hashPrev].end();
3649 const uint256& orphanTxHash = *mi;
3650 CTransaction& orphanTx = mapOrphanTransactions[orphanTxHash];
3651 bool fMissingInputs2 = false;
3653 if (orphanTx.AcceptToMemoryPool(txdb, true, &fMissingInputs2))
3655 printf(" accepted orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3656 SyncWithWallets(tx, NULL, true);
3657 RelayTransaction(orphanTx, orphanTxHash);
3658 mapAlreadyAskedFor.erase(CInv(MSG_TX, orphanTxHash));
3659 vWorkQueue.push_back(orphanTxHash);
3660 vEraseQueue.push_back(orphanTxHash);
3662 else if (!fMissingInputs2)
3665 vEraseQueue.push_back(orphanTxHash);
3666 printf(" removed invalid orphan tx %s\n", orphanTxHash.ToString().substr(0,10).c_str());
3671 BOOST_FOREACH(uint256 hash, vEraseQueue)
3672 EraseOrphanTx(hash);
3674 else if (fMissingInputs)
3678 // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
3679 unsigned int nEvicted = LimitOrphanTxSize(MAX_ORPHAN_TRANSACTIONS);
3681 printf("mapOrphan overflow, removed %u tx\n", nEvicted);
3683 if (tx.nDoS) pfrom->Misbehaving(tx.nDoS);
3687 else if (strCommand == "block")
3691 uint256 hashBlock = block.GetHash();
3693 printf("received block %s\n", hashBlock.ToString().substr(0,20).c_str());
3696 CInv inv(MSG_BLOCK, hashBlock);
3697 pfrom->AddInventoryKnown(inv);
3699 if (ProcessBlock(pfrom, &block))
3700 mapAlreadyAskedFor.erase(inv);
3701 if (block.nDoS) pfrom->Misbehaving(block.nDoS);
3705 else if (strCommand == "getaddr")
3707 // Don't return addresses older than nCutOff timestamp
3708 int64 nCutOff = GetTime() - (nNodeLifespan * 24 * 60 * 60);
3709 pfrom->vAddrToSend.clear();
3710 vector<CAddress> vAddr = addrman.GetAddr();
3711 BOOST_FOREACH(const CAddress &addr, vAddr)
3712 if(addr.nTime > nCutOff)
3713 pfrom->PushAddress(addr);
3717 else if (strCommand == "mempool")
3719 std::vector<uint256> vtxid;
3720 mempool.queryHashes(vtxid);
3722 for (unsigned int i = 0; i < vtxid.size(); i++) {
3723 CInv inv(MSG_TX, vtxid[i]);
3724 vInv.push_back(inv);
3725 if (i == (MAX_INV_SZ - 1))
3728 if (vInv.size() > 0)
3729 pfrom->PushMessage("inv", vInv);
3733 else if (strCommand == "checkorder")
3738 if (!GetBoolArg("-allowreceivebyip"))
3740 pfrom->PushMessage("reply", hashReply, (int)2, string(""));
3747 /// we have a chance to check the order here
3749 // Keep giving the same key to the same ip until they use it
3750 if (!mapReuseKey.count(pfrom->addr))
3751 pwalletMain->GetKeyFromPool(mapReuseKey[pfrom->addr], true);
3753 // Send back approval of order and pubkey to use
3754 CScript scriptPubKey;
3755 scriptPubKey << mapReuseKey[pfrom->addr] << OP_CHECKSIG;
3756 pfrom->PushMessage("reply", hashReply, (int)0, scriptPubKey);
3760 else if (strCommand == "reply")
3765 CRequestTracker tracker;
3767 LOCK(pfrom->cs_mapRequests);
3768 map<uint256, CRequestTracker>::iterator mi = pfrom->mapRequests.find(hashReply);
3769 if (mi != pfrom->mapRequests.end())
3771 tracker = (*mi).second;
3772 pfrom->mapRequests.erase(mi);
3775 if (!tracker.IsNull())
3776 tracker.fn(tracker.param1, vRecv);
3780 else if (strCommand == "ping")
3782 if (pfrom->nVersion > BIP0031_VERSION)
3786 // Echo the message back with the nonce. This allows for two useful features:
3788 // 1) A remote node can quickly check if the connection is operational
3789 // 2) Remote nodes can measure the latency of the network thread. If this node
3790 // is overloaded it won't respond to pings quickly and the remote node can
3791 // avoid sending us more work, like chain download requests.
3793 // The nonce stops the remote getting confused between different pings: without
3794 // it, if the remote node sends a ping once per second and this node takes 5
3795 // seconds to respond to each, the 5th ping the remote sends would appear to
3796 // return very quickly.
3797 pfrom->PushMessage("pong", nonce);
3802 else if (strCommand == "alert")
3807 uint256 alertHash = alert.GetHash();
3808 if (pfrom->setKnown.count(alertHash) == 0)
3810 if (alert.ProcessAlert())
3813 pfrom->setKnown.insert(alertHash);
3816 BOOST_FOREACH(CNode* pnode, vNodes)
3817 alert.RelayTo(pnode);
3821 // Small DoS penalty so peers that send us lots of
3822 // duplicate/expired/invalid-signature/whatever alerts
3823 // eventually get banned.
3824 // This isn't a Misbehaving(100) (immediate ban) because the
3825 // peer might be an older or different implementation with
3826 // a different signature key, etc.
3827 pfrom->Misbehaving(10);
3835 // Ignore unknown commands for extensibility
3839 // Update the last seen time for this node's address
3840 if (pfrom->fNetworkNode)
3841 if (strCommand == "version" || strCommand == "addr" || strCommand == "inv" || strCommand == "getdata" || strCommand == "ping")
3842 AddressCurrentlyConnected(pfrom->addr);
3848 bool ProcessMessages(CNode* pfrom)
3850 CDataStream& vRecv = pfrom->vRecv;
3854 // printf("ProcessMessages(%u bytes)\n", vRecv.size());
3858 // (4) message start
3867 // Don't bother if send buffer is too full to respond anyway
3868 if (pfrom->vSend.size() >= SendBufferSize())
3871 // Scan for message start
3872 CDataStream::iterator pstart = search(vRecv.begin(), vRecv.end(), BEGIN(pchMessageStart), END(pchMessageStart));
3873 int nHeaderSize = vRecv.GetSerializeSize(CMessageHeader());
3874 if (vRecv.end() - pstart < nHeaderSize)
3876 if ((int)vRecv.size() > nHeaderSize)
3878 printf("\n\nPROCESSMESSAGE MESSAGESTART NOT FOUND\n\n");
3879 vRecv.erase(vRecv.begin(), vRecv.end() - nHeaderSize);
3883 if (pstart - vRecv.begin() > 0)
3884 printf("\n\nPROCESSMESSAGE SKIPPED %"PRIpdd" BYTES\n\n", pstart - vRecv.begin());
3885 vRecv.erase(vRecv.begin(), pstart);
3888 vector<char> vHeaderSave(vRecv.begin(), vRecv.begin() + nHeaderSize);
3893 printf("\n\nPROCESSMESSAGE: ERRORS IN HEADER %s\n\n\n", hdr.GetCommand().c_str());
3896 string strCommand = hdr.GetCommand();
3899 unsigned int nMessageSize = hdr.nMessageSize;
3900 if (nMessageSize > MAX_SIZE)
3902 printf("ProcessMessages(%s, %u bytes) : nMessageSize > MAX_SIZE\n", strCommand.c_str(), nMessageSize);
3905 if (nMessageSize > vRecv.size())
3907 // Rewind and wait for rest of message
3908 vRecv.insert(vRecv.begin(), vHeaderSave.begin(), vHeaderSave.end());
3913 uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
3914 unsigned int nChecksum = 0;
3915 memcpy(&nChecksum, &hash, sizeof(nChecksum));
3916 if (nChecksum != hdr.nChecksum)
3918 printf("ProcessMessages(%s, %u bytes) : CHECKSUM ERROR nChecksum=%08x hdr.nChecksum=%08x\n",
3919 strCommand.c_str(), nMessageSize, nChecksum, hdr.nChecksum);
3923 // Copy message to its own buffer
3924 CDataStream vMsg(vRecv.begin(), vRecv.begin() + nMessageSize, vRecv.nType, vRecv.nVersion);
3925 vRecv.ignore(nMessageSize);
3933 fRet = ProcessMessage(pfrom, strCommand, vMsg);
3938 catch (std::ios_base::failure& e)
3940 if (strstr(e.what(), "end of data"))
3942 // Allow exceptions from under-length message on vRecv
3943 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());
3945 else if (strstr(e.what(), "size too large"))
3947 // Allow exceptions from over-long size
3948 printf("ProcessMessages(%s, %u bytes) : Exception '%s' caught\n", strCommand.c_str(), nMessageSize, e.what());
3952 PrintExceptionContinue(&e, "ProcessMessages()");
3955 catch (std::exception& e) {
3956 PrintExceptionContinue(&e, "ProcessMessages()");
3958 PrintExceptionContinue(NULL, "ProcessMessages()");
3962 printf("ProcessMessage(%s, %u bytes) FAILED\n", strCommand.c_str(), nMessageSize);
3970 bool SendMessages(CNode* pto, bool fSendTrickle)
3972 TRY_LOCK(cs_main, lockMain);
3974 // Don't send anything until we get their version message
3975 if (pto->nVersion == 0)
3978 // Keep-alive ping. We send a nonce of zero because we don't use it anywhere
3980 if (pto->nLastSend && GetTime() - pto->nLastSend > 30 * 60 && pto->vSend.empty()) {
3982 if (pto->nVersion > BIP0031_VERSION)
3983 pto->PushMessage("ping", nonce);
3985 pto->PushMessage("ping");
3989 if (pto->fStartSync) {
3990 pto->fStartSync = false;
3991 pto->PushGetBlocks(pindexBest, uint256(0));
3994 // Resend wallet transactions that haven't gotten in a block yet
3995 ResendWalletTransactions();
3997 // Address refresh broadcast
3998 static int64 nLastRebroadcast;
3999 if (!IsInitialBlockDownload() && (GetTime() - nLastRebroadcast > 24 * 60 * 60))
4003 BOOST_FOREACH(CNode* pnode, vNodes)
4005 // Periodically clear setAddrKnown to allow refresh broadcasts
4006 if (nLastRebroadcast)
4007 pnode->setAddrKnown.clear();
4009 // Rebroadcast our address
4012 CAddress addr = GetLocalAddress(&pnode->addr);
4013 if (addr.IsRoutable())
4014 pnode->PushAddress(addr);
4018 nLastRebroadcast = GetTime();
4026 vector<CAddress> vAddr;
4027 vAddr.reserve(pto->vAddrToSend.size());
4028 BOOST_FOREACH(const CAddress& addr, pto->vAddrToSend)
4030 // returns true if wasn't already contained in the set
4031 if (pto->setAddrKnown.insert(addr).second)
4033 vAddr.push_back(addr);
4034 // receiver rejects addr messages larger than 1000
4035 if (vAddr.size() >= 1000)
4037 pto->PushMessage("addr", vAddr);
4042 pto->vAddrToSend.clear();
4044 pto->PushMessage("addr", vAddr);
4049 // Message: inventory
4052 vector<CInv> vInvWait;
4054 LOCK(pto->cs_inventory);
4055 vInv.reserve(pto->vInventoryToSend.size());
4056 vInvWait.reserve(pto->vInventoryToSend.size());
4057 BOOST_FOREACH(const CInv& inv, pto->vInventoryToSend)
4059 if (pto->setInventoryKnown.count(inv))
4062 // trickle out tx inv to protect privacy
4063 if (inv.type == MSG_TX && !fSendTrickle)
4065 // 1/4 of tx invs blast to all immediately
4066 static uint256 hashSalt;
4068 hashSalt = GetRandHash();
4069 uint256 hashRand = inv.hash ^ hashSalt;
4070 hashRand = Hash(BEGIN(hashRand), END(hashRand));
4071 bool fTrickleWait = ((hashRand & 3) != 0);
4073 // always trickle our own transactions
4077 if (GetTransaction(inv.hash, wtx))
4079 fTrickleWait = true;
4084 vInvWait.push_back(inv);
4089 // returns true if wasn't already contained in the set
4090 if (pto->setInventoryKnown.insert(inv).second)
4092 vInv.push_back(inv);
4093 if (vInv.size() >= 1000)
4095 pto->PushMessage("inv", vInv);
4100 pto->vInventoryToSend = vInvWait;
4103 pto->PushMessage("inv", vInv);
4109 vector<CInv> vGetData;
4110 int64 nNow = GetTime() * 1000000;
4112 while (!pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
4114 const CInv& inv = (*pto->mapAskFor.begin()).second;
4115 if (!AlreadyHave(txdb, inv))
4118 printf("sending getdata: %s\n", inv.ToString().c_str());
4119 vGetData.push_back(inv);
4120 if (vGetData.size() >= 1000)
4122 pto->PushMessage("getdata", vGetData);
4125 mapAlreadyAskedFor[inv] = nNow;
4127 pto->mapAskFor.erase(pto->mapAskFor.begin());
4129 if (!vGetData.empty())
4130 pto->PushMessage("getdata", vGetData);