(143990, 0x9c592c78u )
(149000, 0x48f2bdc4u )
(160000, 0x789df0f0u )
+ (200000, 0x01ec1503u )
;
// Hard checkpoints of stake modifiers to ensure they are deterministic (testNet)
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
return true;
}
-// Precompute hashing state for static part of kernel
-void GetKernelMidstate(uint64_t nStakeModifier, uint32_t nBlockTime, uint32_t nTxOffset, uint32_t nInputTxTime, uint32_t nOut, SHA256_CTX &ctx)
-{
- // Build static part of kernel
- CDataStream ssKernel(SER_GETHASH, 0);
- ssKernel << nStakeModifier;
- ssKernel << nBlockTime << nTxOffset << nInputTxTime << nOut;
- CDataStream::const_iterator it = ssKernel.begin();
-
- // Init sha256 context and update it
- // with first 24 bytes of kernel
- SHA256_Init(&ctx);
- SHA256_Update(&ctx, (unsigned char*)&it[0], 8 + 16);
-}
-// Scan given midstate for solution
-bool ScanMidstateForward(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)
+#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);
+
+class ScanMidstateWorker
{
- CBigNum bnTargetPerCoinDay;
- bnTargetPerCoinDay.SetCompact(nBits);
+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> >();
+ }
- // Get maximum possible target to filter out the majority of obviously insufficient hashes
- CBigNum bnMaxTargetPerCoinDay = bnTargetPerCoinDay * CBigNum(nValueIn) * nStakeMaxAge / COIN / (24 * 60 * 60);
- uint256 maxTarget = bnMaxTargetPerCoinDay.getuint256();
+ void Do_4way()
+ {
+ SetThreadPriority(THREAD_PRIORITY_LOWEST);
- SHA256_CTX ctxCopy = ctx;
+ // 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();
- // Search forward in time from the given timestamp
- // Stopping search in case of shutting down
- for (uint32_t nTimeTx=SearchInterval.first; nTimeTx<SearchInterval.second && !fShutdown; nTimeTx++)
+ 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)));
+
+ vector<uint32_t> vRow = vector<uint32_t>(4);
+ uint32_t *pnKernel = (uint32_t *) kernel;
+
+ for(int i = 0; i < 7; i++)
+ {
+ uint32_t nVal = pnKernel[i];
+ fill(vRow.begin(), vRow.end(), nVal);
+
+ 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; nTimeTx+=4)
+ {
+ for (int n = 0; n < 4; n++)
+ blocks1[24+n] = nTimeTx + n;
+
+ sha256_init_4way(state1);
+ sha256_init_4way(state2);
+ sha256_transform_4way(&state1[0], &blocks1[0], 1); // first hashing
+
+ for(int i=0; i<32; i++)
+ blocks2[i] = __builtin_bswap32(state1[i]);
+
+ sha256_transform_4way(&state2[0], &blocks2[0], 1); // second hashing
+
+ for(int n = 0; n < 4; n++)
+ {
+ uint32_t nTime = blocks1[24+n];
+ uint32_t nHash = __builtin_bswap32(state2[28+n]);
+
+ if (nHash <= nMaxTarget32) // Possible hit
+ {
+ 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) + n]);
+
+ 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()
{
- // Complete first hashing iteration
- uint256 hash1;
- SHA256_Update(&ctxCopy, (unsigned char*)&nTimeTx, 4);
- SHA256_Final((unsigned char*)&hash1, &ctxCopy);
+ SetThreadPriority(THREAD_PRIORITY_LOWEST);
- // Restore context
- ctxCopy = ctx;
+ // 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;
- // Finally, calculate kernel hash
- uint256 hashProofOfStake;
- SHA256((unsigned char*)&hash1, sizeof(hashProofOfStake), (unsigned char*)&hashProofOfStake);
+ // Sha256 result buffer
+ uint32_t hashProofOfStake[8];
- // Skip if hash doesn't satisfy the maximum target
- if (hashProofOfStake > maxTarget)
- continue;
+ // Compute maximum possible target to filter out majority of obviously insufficient hashes
+ CBigNum bnTargetPerCoinDay;
+ bnTargetPerCoinDay.SetCompact(nBits);
- CBigNum bnCoinDayWeight = CBigNum(nValueIn) * GetWeight((int64_t)nInputTxTime, (int64_t)nTimeTx) / COIN / (24 * 60 * 60);
- CBigNum bnTargetProofOfStake = bnCoinDayWeight * bnTargetPerCoinDay;
+ uint256 nMaxTarget = (bnTargetPerCoinDay * bnValueIn * nStakeMaxAge / COIN / nOneDay).getuint256(),
+ *pnHashProofOfStake = (uint256 *)&hashProofOfStake;
- if (bnTargetProofOfStake >= CBigNum(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++)
{
- solution.first = hashProofOfStake;
- solution.second = nTimeTx;
+ // Complete first hashing iteration
+ uint256 hash1;
+ SHA256_Update(&ctx, (unsigned char*)&nTimeTx, 4);
+ SHA256_Final((unsigned char*)&hash1, &ctx);
- return true;
+ // 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));
}
}
- return false;
+ void Do()
+ {
+ if (sha256_use_4way() != 0)
+ Do_4way();
+ Do_generic();
+ }
+
+ vector<std::pair<uint256,uint32_t> >& GetSolutions()
+ {
+ return solutions;
+ }
+
+private:
+ std::vector<std::pair<uint256,uint32_t> > solutions;
+
+ uint8_t *kernel;
+ uint32_t nBits;
+ uint32_t nInputTxTime;
+ CBigNum bnValueIn;
+ uint32_t nIntervalBegin;
+ uint32_t nIntervalEnd;
+};
+
+#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 ScanMidstateBackward(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)
+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 / (24 * 60 * 60);
+ CBigNum bnMaxTargetPerCoinDay = bnTargetPerCoinDay * CBigNum(nValueIn) * nStakeMaxAge / COIN / nOneDay;
uint256 maxTarget = bnMaxTargetPerCoinDay.getuint256();
SHA256_CTX ctxCopy = ctx;
if (hashProofOfStake > maxTarget)
continue;
- CBigNum bnCoinDayWeight = CBigNum(nValueIn) * GetWeight((int64_t)nInputTxTime, (int64_t)nTimeTx) / COIN / (24 * 60 * 60);
+ CBigNum bnCoinDayWeight = CBigNum(nValueIn) * GetWeight((int64_t)nInputTxTime, (int64_t)nTimeTx) / COIN / nOneDay;
CBigNum bnTargetProofOfStake = bnCoinDayWeight * bnTargetPerCoinDay;
if (bnTargetProofOfStake >= CBigNum(hashProofOfStake))
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
git://git.novaco.in / novacoin.git / blobdiff