// Copyright (c) 2012-2013 The PPCoin developers
+// Copyright (c) 2013-2015 The Novacoin developers
+// Distributed under the MIT/X11 software license, see the accompanying
+// file COPYING or http://www.opensource.org/licenses/mit-license.php.
// Distributed under the MIT/X11 software license, see the accompanying
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
static std::map<int, unsigned int> mapStakeModifierCheckpoints =
boost::assign::map_list_of
( 0, 0x0e00670bu )
- ( 9690, 0x97dcdafau )
( 12661, 0x5d84115du )
- ( 37092, 0xd230afccu )
- ( 44200, 0x05370164u )
- ( 65000, 0xc8e7be6au )
- ( 68600, 0x73a8cc4cu )
- ( 92161, 0xe21a911au )
- ( 98661, 0xd20c44d4u )
(143990, 0x9c592c78u )
+ (149000, 0x48f2bdc4u )
+ (160000, 0x789df0f0u )
+ (200000, 0x01ec1503u )
;
// Hard checkpoints of stake modifiers to ensure they are deterministic (testNet)
return (nTimeBlock >= (fTestNet? nModifierTestSwitchTime : nModifierSwitchTime));
}
-// Get time weight
-int64_t GetWeight(int64_t nIntervalBeginning, int64_t nIntervalEnd)
-{
- // Kernel hash weight starts from 0 at the 30-day min age
- // this change increases active coins participating the hash and helps
- // to secure the network when proof-of-stake difficulty is low
- //
- // Maximum TimeWeight is 90 days.
-
- return min(nIntervalEnd - nIntervalBeginning - nStakeMinAge, (int64_t)nStakeMaxAge);
-}
-
// Get the last stake modifier and its generation time from a given block
static bool GetLastStakeModifier(const CBlockIndex* pindex, uint64_t& nStakeModifier, int64_t& nModifierTime)
{
uint256 hashBlockFrom = blockFrom.GetHash();
- CBigNum bnCoinDayWeight = CBigNum(nValueIn) * GetWeight((int64_t)txPrev.nTime, (int64_t)nTimeTx) / COIN / (24 * 60 * 60);
+ CBigNum bnCoinDayWeight = CBigNum(nValueIn) * GetWeight((int64_t)txPrev.nTime, (int64_t)nTimeTx) / COIN / nOneDay;
targetProofOfStake = (bnCoinDayWeight * bnTargetPerCoinDay).getuint256();
// Calculate hash
DateTimeStrFormat(nStakeModifierTime).c_str(),
mapBlockIndex[hashBlockFrom]->nHeight,
DateTimeStrFormat(blockFrom.GetBlockTime()).c_str());
- printf("CheckStakeKernelHash() : check modifier=0x%016" PRIx64 " nTimeBlockFrom=%u nTxPrevOffset=%u nTimeTxPrev=%u nPrevout=%u nTimeTx=%u hashProof=%s\n",
+ printf("CheckStakeKernelHash() : check modifier=0x%016" PRIx64 " nTimeBlockFrom=%u nTxPrevOffset=%u nTimeTxPrev=%u nPrevout=%u nTimeTx=%u hashTarget=%s hashProof=%s\n",
nStakeModifier,
nTimeBlockFrom, nTxPrevOffset, txPrev.nTime, prevout.n, nTimeTx,
- hashProofOfStake.ToString().c_str());
+ targetProofOfStake.ToString().c_str(), hashProofOfStake.ToString().c_str());
}
// Now check if proof-of-stake hash meets target protocol
DateTimeStrFormat(nStakeModifierTime).c_str(),
mapBlockIndex[hashBlockFrom]->nHeight,
DateTimeStrFormat(blockFrom.GetBlockTime()).c_str());
- printf("CheckStakeKernelHash() : pass modifier=0x%016" PRIx64 " nTimeBlockFrom=%u nTxPrevOffset=%u nTimeTxPrev=%u nPrevout=%u nTimeTx=%u hashProof=%s\n",
+ printf("CheckStakeKernelHash() : pass modifier=0x%016" PRIx64 " nTimeBlockFrom=%u nTxPrevOffset=%u nTimeTxPrev=%u nPrevout=%u nTimeTx=%u hashTarget=%s hashProof=%s\n",
nStakeModifier,
nTimeBlockFrom, nTxPrevOffset, txPrev.nTime, prevout.n, nTimeTx,
- hashProofOfStake.ToString().c_str());
+ targetProofOfStake.ToString().c_str(), hashProofOfStake.ToString().c_str());
}
return true;
}
-// Scan given coins set for kernel solution
-bool ScanForStakeKernelHash(MetaMap &mapMeta, KernelSearchSettings &settings, CoinsSet::value_type &kernelcoin, uint32_t &nTimeTx, uint32_t &nBlockTime, uint64_t &nKernelsTried, uint64_t &nCoinDaysTried)
+
+#ifdef USE_ASM
+
+// kernel padding
+static const uint32_t block1_suffix[9] = { 0x80000000, 0, 0, 0, 0, 0, 0, 0, 0xe0000000 };
+static const uint32_t block1_suffix_4way[4 * 9] = {
+ 0x00000080, 0x00000080, 0x00000080, 0x00000080,
+ 0, 0, 0, 0,
+ 0, 0, 0, 0,
+ 0, 0, 0, 0,
+ 0, 0, 0, 0,
+ 0, 0, 0, 0,
+ 0, 0, 0, 0,
+ 0, 0, 0, 0,
+ 0xe0000000, 0xe0000000, 0xe0000000, 0xe0000000
+};
+
+// hash padding
+static const uint32_t block2_suffix[8] = { 0x80000000, 0, 0, 0, 0, 0, 0, 0x00010000 };
+static const uint32_t block2_suffix_4way[4 * 8] = {
+ 0x00000080, 0x00000080, 0x00000080, 0x00000080,
+ 0, 0, 0, 0,
+ 0, 0, 0, 0,
+ 0, 0, 0, 0,
+ 0, 0, 0, 0,
+ 0, 0, 0, 0,
+ 0, 0, 0, 0,
+ 0x00010000, 0x00010000, 0x00010000, 0x00010000
+};
+
+extern "C" int sha256_use_4way();
+extern "C" void sha256_init(uint32_t *state);
+extern "C" void sha256_transform(uint32_t *state, const uint32_t *block, int swap);
+extern "C" void sha256_init_4way(uint32_t *state);
+extern "C" void sha256_transform_4way(uint32_t *state, const uint32_t *block, int swap);
+extern "C" void copy_swap_hashes(uint32_t *blocks, uint32_t *state); // Generic block copy function
+
+#ifdef USE_SSSE3
+extern "C" int sha256_use_ssse3();
+extern "C" void copy_swap_hashes_ssse3(uint32_t *blocks, uint32_t *state); // SSSE3 optimized block copy function
+
+void (*copy_swap)(uint32_t *, uint32_t *) = (sha256_use_ssse3() != 0) ? ©_swap_hashes_ssse3 : copy_swap_hashes;
+#else
+void (*copy_swap)(uint32_t *, uint32_t *) = ©_swap_hashes;
+#endif
+
+bool fUse4Way = sha256_use_4way() != 0;
+
+class ScanMidstateWorker
{
- uint256 hashProofOfStake = 0;
+public:
+ ScanMidstateWorker()
+ { }
+ ScanMidstateWorker(unsigned char *kernel, uint32_t nBits, uint32_t nInputTxTime, int64_t nValueIn, uint32_t nIntervalBegin, uint32_t nIntervalEnd)
+ : kernel(kernel), nBits(nBits), nInputTxTime(nInputTxTime), bnValueIn(nValueIn), nIntervalBegin(nIntervalBegin), nIntervalEnd(nIntervalEnd)
+ {
+ solutions = vector<std::pair<uint256,uint32_t> >();
+ }
- // (txid, vout.n) => ((txindex, (tx, vout.n)), (block, modifier))
- for(MetaMap::const_iterator meta_item = mapMeta.begin(); meta_item != mapMeta.end(); meta_item++)
+ void Do_4way()
{
- if (!fCoinsDataActual)
- break;
+ SetThreadPriority(THREAD_PRIORITY_LOWEST);
- CTxIndex txindex = (*meta_item).second.first.first;
- CBlock block = (*meta_item).second.second.first;
- uint64_t nStakeModifier = (*meta_item).second.second.second;
+ // Compute maximum possible target to filter out majority of obviously insufficient hashes
+ CBigNum bnTargetPerCoinDay;
+ bnTargetPerCoinDay.SetCompact(nBits);
+ uint256 nMaxTarget = (bnTargetPerCoinDay * bnValueIn * nStakeMaxAge / COIN / nOneDay).getuint256();
- // Get coin
- CoinsSet::value_type pcoin = meta_item->second.first.second;
+ uint32_t state1[4 * 8] __attribute__((aligned(16)));
+ uint32_t state2[4 * 8] __attribute__((aligned(16)));
+ uint32_t blocks1[4 * 16] __attribute__((aligned(16)));
+ uint32_t blocks2[4 * 16] __attribute__((aligned(16)));
- static int nMaxStakeSearchInterval = 60;
+ vector<uint32_t> vRow = vector<uint32_t>(4);
+ uint32_t *pnKernel = (uint32_t *) kernel;
- // only count coins meeting min age requirement
- if (nStakeMinAge + block.nTime > settings.nTime - nMaxStakeSearchInterval)
- continue;
+ for(int i = 0; i < 7; i++)
+ {
+ uint32_t nVal = pnKernel[i];
+ fill(vRow.begin(), vRow.end(), nVal);
- // Transaction offset inside block
- uint32_t nTxOffset = txindex.pos.nTxPos - txindex.pos.nBlockPos;
+ for (int j = 0; j < 4; j++)
+ {
+ memcpy(&blocks1[i*4], &vRow[0], 16);
+ }
+ }
+
+ memcpy(&blocks1[28], &block1_suffix_4way[0], 36*4); // sha256 padding
+ memcpy(&blocks2[32], &block2_suffix_4way[0], 32*4);
+
+ // Search forward in time from the given timestamp
+ // Stopping search in case of shutting down
+ for (uint32_t nTimeTx=nIntervalBegin, nMaxTarget32 = nMaxTarget.Get32(7); nTimeTx<nIntervalEnd && !fShutdown; )
+ {
+ sha256_init_4way(state1);
+ sha256_init_4way(state2);
- // Current timestamp scanning interval
- unsigned int nCurrentSearchInterval = min((int64_t)settings.nSearchInterval, (int64_t)nMaxStakeSearchInterval);
+ blocks1[24] = nTimeTx++;
+ blocks1[25] = nTimeTx++;
+ blocks1[26] = nTimeTx++;
+ blocks1[27] = nTimeTx++;
+
+ sha256_transform_4way(&state1[0], &blocks1[0], 1); // first hashing
+ copy_swap(&blocks2[0], &state1[0]);
+ sha256_transform_4way(&state2[0], &blocks2[0], 1); // second hashing
+
+ for(int nResult = 0; nResult < 4; nResult++)
+ {
+ uint32_t nHash = __builtin_bswap32(state2[28+nResult]);
- nBlockTime = block.nTime;
+ if (nHash <= nMaxTarget32) // Possible hit
+ {
+ uint32_t nTime = blocks1[24+nResult];
+ uint256 nHashProofOfStake = 0;
+ uint32_t *pnHashProofOfStake = (uint32_t *) &nHashProofOfStake;
+ pnHashProofOfStake[7] = nHash;
+
+ for (int i = 0; i < 7; i++)
+ pnHashProofOfStake[i] = __builtin_bswap32(state2[(i*4) + nResult]);
+
+ CBigNum bnCoinDayWeight = bnValueIn * GetWeight((int64_t)nInputTxTime, (int64_t)nTimeTx) / COIN / nOneDay;
+ CBigNum bnTargetProofOfStake = bnCoinDayWeight * bnTargetPerCoinDay;
+
+ if (bnTargetProofOfStake >= CBigNum(nHashProofOfStake))
+ solutions.push_back(std::pair<uint256,uint32_t>(nHashProofOfStake, nTime));
+ }
+ }
+ }
+ }
+
+ void Do_generic()
+ {
+ SetThreadPriority(THREAD_PRIORITY_LOWEST);
+
+ // Init new sha256 context and update it
+ // with first 24 bytes of kernel
+ SHA256_CTX workerCtx;
+ SHA256_Init(&workerCtx);
+ SHA256_Update(&workerCtx, kernel, 8 + 16);
+ SHA256_CTX ctx = workerCtx;
+
+ // Sha256 result buffer
+ uint32_t hashProofOfStake[8];
+
+ // Compute maximum possible target to filter out majority of obviously insufficient hashes
CBigNum bnTargetPerCoinDay;
- bnTargetPerCoinDay.SetCompact(settings.nBits);
- int64_t nValueIn = pcoin.first->vout[pcoin.second].nValue;
+ bnTargetPerCoinDay.SetCompact(nBits);
+
+ uint256 nMaxTarget = (bnTargetPerCoinDay * bnValueIn * nStakeMaxAge / COIN / nOneDay).getuint256(),
+ *pnHashProofOfStake = (uint256 *)&hashProofOfStake;
- // Search backward in time from the given timestamp
- // Search nSearchInterval seconds back up to nMaxStakeSearchInterval
- // Stopping search in case of shutting down or cache invalidation
- for (unsigned int n=0; n<nCurrentSearchInterval && fCoinsDataActual && !fShutdown; n++)
+ // Search forward in time from the given timestamp
+ // Stopping search in case of shutting down
+ for (uint32_t nTimeTx=nIntervalBegin, nMaxTarget32 = nMaxTarget.Get32(7); nTimeTx<nIntervalEnd && !fShutdown; nTimeTx++)
{
- nTimeTx = settings.nTime - n;
- CBigNum bnCoinDayWeight = CBigNum(nValueIn) * GetWeight((int64_t)pcoin.first->nTime, (int64_t)nTimeTx) / COIN / (24 * 60 * 60);
+ // Complete first hashing iteration
+ uint256 hash1;
+ SHA256_Update(&ctx, (unsigned char*)&nTimeTx, 4);
+ SHA256_Final((unsigned char*)&hash1, &ctx);
+
+ // Restore context
+ ctx = workerCtx;
+
+ // Finally, calculate kernel hash
+ SHA256((unsigned char*)&hash1, sizeof(hashProofOfStake), (unsigned char*)&hashProofOfStake);
+
+ // Skip if hash doesn't satisfy the maximum target
+ if (hashProofOfStake[7] > nMaxTarget32)
+ continue;
+
+ CBigNum bnCoinDayWeight = bnValueIn * GetWeight((int64_t)nInputTxTime, (int64_t)nTimeTx) / COIN / nOneDay;
CBigNum bnTargetProofOfStake = bnCoinDayWeight * bnTargetPerCoinDay;
- // Build kernel
- CDataStream ss(SER_GETHASH, 0);
- ss << nStakeModifier;
- ss << nBlockTime << nTxOffset << pcoin.first->nTime << pcoin.second << nTimeTx;
+ if (bnTargetProofOfStake >= CBigNum(*pnHashProofOfStake))
+ solutions.push_back(std::pair<uint256,uint32_t>(*pnHashProofOfStake, nTimeTx));
+ }
+ }
- // Calculate kernel hash
- hashProofOfStake = Hash(ss.begin(), ss.end());
+ void Do()
+ {
+ if (fUse4Way)
+ Do_4way();
+ else
+ Do_generic();
+ }
- // Update statistics
- nKernelsTried += 1;
- nCoinDaysTried += bnCoinDayWeight.getuint64();
+ vector<std::pair<uint256,uint32_t> >& GetSolutions()
+ {
+ return solutions;
+ }
- if (bnTargetProofOfStake >= CBigNum(hashProofOfStake))
- {
- if (fDebug)
- printf("nStakeModifier=0x%016" PRIx64 ", nBlockTime=%u nTxOffset=%u nTxPrevTime=%u nVout=%u nTimeTx=%u hashProofOfStake=%s Success=true\n",
- nStakeModifier, nBlockTime, nTxOffset, pcoin.first->nTime, pcoin.second, nTimeTx, hashProofOfStake.GetHex().c_str());
+private:
+ std::vector<std::pair<uint256,uint32_t> > solutions;
- kernelcoin = pcoin;
- return true;
- }
+ uint8_t *kernel;
+ uint32_t nBits;
+ uint32_t nInputTxTime;
+ CBigNum bnValueIn;
+ uint32_t nIntervalBegin;
+ uint32_t nIntervalEnd;
+};
- if (fDebug)
- printf("nStakeModifier=0x%016" PRIx64 ", nBlockTime=%u nTxOffset=%u nTxPrevTime=%u nTxNumber=%u nTimeTx=%u hashProofOfStake=%s Success=false\n",
- nStakeModifier, nBlockTime, nTxOffset, pcoin.first->nTime, pcoin.second, nTimeTx, hashProofOfStake.GetHex().c_str());
+#else
+class ScanMidstateWorker
+{
+public:
+ ScanMidstateWorker()
+ { }
+ ScanMidstateWorker(unsigned char *kernel, uint32_t nBits, uint32_t nInputTxTime, int64_t nValueIn, uint32_t nIntervalBegin, uint32_t nIntervalEnd)
+ : nBits(nBits), nInputTxTime(nInputTxTime), bnValueIn(nValueIn), nIntervalBegin(nIntervalBegin), nIntervalEnd(nIntervalEnd)
+ {
+ // Init new sha256 context and update it
+ // with first 24 bytes of kernel
+ SHA256_Init(&workerCtx);
+ SHA256_Update(&workerCtx, kernel, 8 + 16);
+ solutions = vector<std::pair<uint256,uint32_t> >();
+ }
+
+ void Do()
+ {
+ SetThreadPriority(THREAD_PRIORITY_LOWEST);
+ SHA256_CTX ctx = workerCtx;
+
+ // Sha256 result buffer
+ uint32_t hashProofOfStake[8];
+
+ // Compute maximum possible target to filter out majority of obviously insufficient hashes
+ CBigNum bnTargetPerCoinDay;
+ bnTargetPerCoinDay.SetCompact(nBits);
+
+ uint256 nMaxTarget = (bnTargetPerCoinDay * bnValueIn * nStakeMaxAge / COIN / nOneDay).getuint256(),
+ *pnHashProofOfStake = (uint256 *)&hashProofOfStake;
+
+ // Search forward in time from the given timestamp
+ // Stopping search in case of shutting down
+ for (uint32_t nTimeTx=nIntervalBegin, nMaxTarget32 = nMaxTarget.Get32(7); nTimeTx<nIntervalEnd && !fShutdown; nTimeTx++)
+ {
+ // Complete first hashing iteration
+ uint256 hash1;
+ SHA256_Update(&ctx, (unsigned char*)&nTimeTx, 4);
+ SHA256_Final((unsigned char*)&hash1, &ctx);
+
+ // Restore context
+ ctx = workerCtx;
+
+ // Finally, calculate kernel hash
+ SHA256((unsigned char*)&hash1, sizeof(hashProofOfStake), (unsigned char*)&hashProofOfStake);
+
+ // Skip if hash doesn't satisfy the maximum target
+ if (hashProofOfStake[7] > nMaxTarget32)
+ continue;
+
+ CBigNum bnCoinDayWeight = bnValueIn * GetWeight((int64_t)nInputTxTime, (int64_t)nTimeTx) / COIN / nOneDay;
+ CBigNum bnTargetProofOfStake = bnCoinDayWeight * bnTargetPerCoinDay;
+
+ if (bnTargetProofOfStake >= CBigNum(*pnHashProofOfStake))
+ solutions.push_back(std::pair<uint256,uint32_t>(*pnHashProofOfStake, nTimeTx));
+ }
+ }
+
+ vector<std::pair<uint256,uint32_t> >& GetSolutions()
+ {
+ return solutions;
+ }
+
+private:
+ SHA256_CTX workerCtx;
+ std::vector<std::pair<uint256,uint32_t> > solutions;
+
+ uint32_t nBits;
+ uint32_t nInputTxTime;
+ CBigNum bnValueIn;
+ uint32_t nIntervalBegin;
+ uint32_t nIntervalEnd;
+};
+
+#endif
+// Scan given kernel for solution
+bool ScanKernelForward(unsigned char *kernel, uint32_t nBits, uint32_t nInputTxTime, int64_t nValueIn, std::pair<uint32_t, uint32_t> &SearchInterval, std::vector<std::pair<uint256, uint32_t> > &solutions)
+{
+ // TODO: custom threads amount
+
+ uint32_t nThreads = boost::thread::hardware_concurrency();
+ uint32_t nPart = (SearchInterval.second - SearchInterval.first) / nThreads;
+
+
+ ScanMidstateWorker *workers = new ScanMidstateWorker[nThreads];
+
+ boost::thread_group group;
+ for(size_t i = 0; i < nThreads; i++)
+ {
+ uint32_t nBegin = SearchInterval.first + nPart * i;
+ uint32_t nEnd = SearchInterval.first + nPart * (i + 1);
+ workers[i] = ScanMidstateWorker(kernel, nBits, nInputTxTime, nValueIn, nBegin, nEnd);
+ boost::function<void()> workerFnc = boost::bind(&ScanMidstateWorker::Do, &workers[i]);
+ group.create_thread(workerFnc);
+ }
+
+ group.join_all();
+ solutions.clear();
+
+ for(size_t i = 0; i < nThreads; i++)
+ {
+ std::vector<std::pair<uint256, uint32_t> > ws = workers[i].GetSolutions();
+ solutions.insert(solutions.end(), ws.begin(), ws.end());
+ }
+
+ delete [] workers;
+
+ if (solutions.size() == 0)
+ {
+ // no solutions
+ return false;
+ }
+
+ return true;
+}
+
+// Scan given midstate for solution
+bool ScanContextBackward(SHA256_CTX &ctx, uint32_t nBits, uint32_t nInputTxTime, int64_t nValueIn, std::pair<uint32_t, uint32_t> &SearchInterval, std::pair<uint256, uint32_t> &solution)
+{
+ CBigNum bnTargetPerCoinDay;
+ bnTargetPerCoinDay.SetCompact(nBits);
+
+ // Get maximum possible target to filter out the majority of obviously insufficient hashes
+ CBigNum bnMaxTargetPerCoinDay = bnTargetPerCoinDay * CBigNum(nValueIn) * nStakeMaxAge / COIN / nOneDay;
+ uint256 maxTarget = bnMaxTargetPerCoinDay.getuint256();
+
+ SHA256_CTX ctxCopy = ctx;
+
+ // Search backward in time from the given timestamp
+ // Stopping search in case of shutting down
+ for (uint32_t nTimeTx=SearchInterval.first; nTimeTx>SearchInterval.second && !fShutdown; nTimeTx--)
+ {
+ // Complete first hashing iteration
+ uint256 hash1;
+ SHA256_Update(&ctxCopy, (unsigned char*)&nTimeTx, 4);
+ SHA256_Final((unsigned char*)&hash1, &ctxCopy);
+
+ // Restore context
+ ctxCopy = ctx;
+
+ // Finally, calculate kernel hash
+ uint256 hashProofOfStake;
+ SHA256((unsigned char*)&hash1, sizeof(hashProofOfStake), (unsigned char*)&hashProofOfStake);
+
+ // Skip if hash doesn't satisfy the maximum target
+ if (hashProofOfStake > maxTarget)
+ continue;
+
+ CBigNum bnCoinDayWeight = CBigNum(nValueIn) * GetWeight((int64_t)nInputTxTime, (int64_t)nTimeTx) / COIN / nOneDay;
+ CBigNum bnTargetProofOfStake = bnCoinDayWeight * bnTargetPerCoinDay;
+
+ if (bnTargetProofOfStake >= CBigNum(hashProofOfStake))
+ {
+ solution.first = hashProofOfStake;
+ solution.second = nTimeTx;
+
+ return true;
}
}
ss << pindex->nFlags << pindex->hashProofOfStake << pindex->nStakeModifier;
uint256 hashChecksum = Hash(ss.begin(), ss.end());
hashChecksum >>= (256 - 32);
- return hashChecksum.Get64();
+ return static_cast<uint32_t>(hashChecksum.Get64());
}
// Check stake modifier hard checkpoints