It was the Bitcointalk forum that inspired us to create Bitcointalksearch.org - Bitcointalk is an excellent site that should be the default page for anybody dealing in cryptocurrency, since it is a virtual gold-mine of data. However, our experience and user feedback led us create our site; Bitcointalk's search is slow, and difficult to get the results you need, because you need to log in first to find anything useful - furthermore, there are rate limiters for their search functionality.
The aim of our project is to create a faster website that yields more results and faster without having to create an account and eliminate the need to log in - your personal data, therefore, will never be in jeopardy since we are not asking for any of your data and you don't need to provide them to use our site with all of its capabilities.
We created this website with the sole purpose of users being able to search quickly and efficiently in the field of cryptocurrency so they will have access to the latest and most accurate information and thereby assisting the crypto-community at large.
kangaro.exe -w save.work -wi 300 -d 28 -s input.txt
kangaro.exe -nt 36000 -t 0 -gpu -gpuId 0,1,2,3 -g 880,256,880,256,880,256,880,256 -c {MYserverIP} input.txt
kangaro.exe -w save.work -wi 300 -d 28 -s input.txt
kangaro.exe -nt 36000 -t 0 -gpu -gpuId 0,1,2,3 -g 880,256,880,256,880,256,880,256 -c {MYserverIP} input.txt
kangaro.exe -w save.work -wi 300 -d 28 -s input.txt
kangaro.exe -nt 36000 -t 0 -gpu -gpuId 0,1,2,3 -g 880,256,880,256,880,256,880,256 -c {MYserverIP} input.txt
- Change NB_JUMP to value 64
- Change CLIENT_TIMEOUT to value 36000.0
kangaro.exe -w save.work -wi 300 -d 28 -s input.txt
kangaro.exe -nt 36000 -t 0 -gpu -gpuId 0,1,2,3 -g 880,256,880,256,880,256,880,256 -c {MYserverIP} input.txt
bool Kangaroo::output(string msg) {
FILE *f = stdout;
f = fopen("Result.txt", "a");
if (f == NULL) {
printf("[error] Cannot open file Result.txt\n");
f = stdout;
return false;
}
else {
fprintf(f, "%s\n", msg.c_str());
fclose(f);
printf("[i] Success saved to file Result.txt\n");
return true;
}
}
bool Kangaroo::CheckKey(Int d1,Int d2,uint8_t type) {
// Resolve equivalence collision
if(type & 0x1)
d1.ModNegK1order();
if(type & 0x2)
d2.ModNegK1order();
Int pk(&d1);
pk.ModAddK1order(&d2);
Point P = secp->ComputePublicKey(&pk);
if(P.equals(keyToSearch)) {
// Key solved
#ifdef USE_SYMMETRY
pk.ModAddK1order(&rangeWidthDiv2);
#endif
pk.ModAddK1order(&rangeStart);
Point PR = secp->ComputePublicKey(&pk);
::printf("\nKey#%2d [%dN]Pub: 0x%s \n",keyIdx,type,secp->GetPublicKeyHex(true,keysToSearch[keyIdx]).c_str());
// Save Priv
std::string prvkey = pk.GetBase16().c_str();
bool save_pk = output(prvkey + string(":") + string("04") + PR.x.GetBase16().c_str() + PR.y.GetBase16().c_str() );
if( PR.equals(keysToSearch[keyIdx]) ) {
::printf(" Priv: 0x%s \n",pk.GetBase16().c_str());
} else {
::printf(" Failed !\n");
::printf(" Priv: 0x%s \n",pk.GetBase16().c_str());
return false;
}
return true;
}
if(P.equals(keyToSearchNeg)) {
// Key solved
pk.ModNegK1order();
#ifdef USE_SYMMETRY
pk.ModAddK1order(&rangeWidthDiv2);
#endif
pk.ModAddK1order(&rangeStart);
Point PR = secp->ComputePublicKey(&pk);
::printf("\nKey#%2d [%dS]Pub: 0x%s \n",keyIdx,type,secp->GetPublicKeyHex(true,keysToSearch[keyIdx]).c_str());
// Save Priv
std::string prvkeyNeg = pk.GetBase16().c_str();
bool save_pk = output(prvkeyNeg + string(":") + string("04") + PR.x.GetBase16().c_str() + PR.y.GetBase16().c_str() );
if(PR.equals(keysToSearch[keyIdx]) ) {
::printf(" Priv: 0x%s \n",pk.GetBase16().c_str());
} else {
::printf(" Failed !\n");
::printf(" Priv: 0x%s \n",pk.GetBase16().c_str());
return false;
}
return true;
}
return false;
}
bool output(std::string msg);