Search content
Sort by
Showing 20 of 193 results by alek76
⭐ Merited by PrivatePerson (1)
I can't figure out how to calculate the ccap=20 parameter?
I have an RTX 4050 Laptop.
Help please.
This is architecture "Ada Lovelace", you need 8.9 so use ccap=89 in your compiling task. In case you have no success try downgrading and use max CUDA 11.8. However I wish you best of luck and success.
citb0in
https://bitcointalk.org/index.php?topic=1306983.msg63128300#msg63128300
Did it. Now I have
# ./test.bin
Floating point exception
...
This is pain in ass
I will delete my posts, they are cluttering the thread.# ./test.bin
Floating point exception
...
This is pain in ass
result
0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b
0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b
Check each function separately. Starting with void point_add().
Missing intermediate variables.
mpz_t imod;
mpz_t l;
mpz_t lsq;
mpz_t lsq2;
mpz_t lsq3;
mpz_t mul;
mpz_t x3;
mpz_t xmx3;
mpz_t xsub;
mpz_t ymul;
mpz_t ys;
mpz_t ysub;
Should the results be stored in temporary variables?
For example:
mpz_sub(ysub, other.m_y, m_y);
mpz_sub(xsub, other.m_x, m_x);
mpz_invert(imod, xsub, m_curve.m_p);
mpz_mul(mul, ysub, imod);
mpz_mod(l, mul, m_curve.m_p);
mpz_pow_ui(lsq, l, 2);
mpz_sub(lsq2, lsq, m_x);
mpz_sub(lsq3, lsq2, other.m_x);
mpz_mod(x3, lsq3, m_curve.m_p);
mpz_sub(xmx3, m_x, x3);
mpz_mul(ymul, l, xmx3);
mpz_sub(ys, ymul, m_y);
mpz_mod(m_y, ys, m_curve.m_p);
mpz_set(m_x, x3);
mpz_set_ui(m_o, 0);
...
Take a look at the finished code https://github.com/albertobsd/ecctoolswhere did i go wrong ??
mpz_set_str (mpz_t rop, const char *str, int base) These functions assign new values to already initialized integers.
Where are the Initialization Functions? They should probably.
mpz_init (Gx) mpz_init (Gy) mpz_init (p) mpz_init (n)
https://gmplib.org/manual/Assigning-Integers
https://gmplib.org/manual/Initializing-Integers
Bro thanks again, will test, but is it still present somewhere the bip39_english.h and Winm.lib
Im add in VanitySearch.vcxproj <AdditionalDependencies> Winmm.lib;Wordlist_en.h in folder 013
Added mod 013
https://github.com/alek76-2/VanitySearch/tree/main/mod/013
Added Path - m/0'/0'/66' For 32 BTC Puzzle
Use SSE2 instructions - default VanitySearch code / Disable SSE cmd: -nosse
Initial SEED extension to 64 bits
GPU Added rotation - #define NB_SPIN 16
Modification file GPUHash.h
The speed on the Tesla T4 GPU is 670.98 Mkeys/s
If Use GPU Rekey multiple by 1000
RUN CMD:
Added play sound buzzer.wav in Windows version
p.s. The binaries assemble everything themselves.
https://github.com/alek76-2/VanitySearch/tree/main/mod/013
Added Path - m/0'/0'/66' For 32 BTC Puzzle
Use SSE2 instructions - default VanitySearch code / Disable SSE cmd: -nosse
Initial SEED extension to 64 bits
GPU Added rotation - #define NB_SPIN 16
Modification file GPUHash.h
The speed on the Tesla T4 GPU is 670.98 Mkeys/s
If Use GPU Rekey multiple by 1000
RUN CMD:
Code:
VanitySearch.exe -stop -nosse -verbose 1 -level 0 -t 1 -bits 66 -r 10 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
VanitySearch.exe -stop -t 0 -nosse -o Result.txt -verbose 1 -level 0 -gpu -r 500000000 -bits 66 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
VanitySearch.exe -stop -t 0 -nosse -o Result.txt -verbose 1 -level 0 -gpu -r 500000000 -bits 66 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Added play sound buzzer.wav in Windows version
p.s. The binaries assemble everything themselves.
The beginning of private key for 130 is 0x3
Вы заипали уже со своими догадками! Хватит спам распространять!
Added mod 013
https://github.com/alek76-2/VanitySearch/tree/main/mod/013
Added Path - m/0'/0'/66' For 32 BTC Puzzle
Use SSE2 instructions - default VanitySearch code / Disable SSE cmd: -nosse
Initial SEED extension to 64 bits
GPU Added rotation - #define NB_SPIN 16
Modification file GPUHash.h
The speed on the Tesla T4 GPU is 670.98 Mkeys/s
If Use GPU Rekey multiple by 1000
RUN CMD:
Added play sound buzzer.wav in Windows version
https://github.com/alek76-2/VanitySearch/tree/main/mod/013
Added Path - m/0'/0'/66' For 32 BTC Puzzle
Use SSE2 instructions - default VanitySearch code / Disable SSE cmd: -nosse
Initial SEED extension to 64 bits
GPU Added rotation - #define NB_SPIN 16
Modification file GPUHash.h
The speed on the Tesla T4 GPU is 670.98 Mkeys/s
If Use GPU Rekey multiple by 1000
RUN CMD:
Code:
VanitySearch.exe -stop -nosse -verbose 1 -level 0 -t 1 -bits 66 -r 10 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
VanitySearch.exe -stop -t 0 -nosse -o Result.txt -verbose 1 -level 0 -gpu -r 500000000 -bits 66 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
VanitySearch.exe -stop -t 0 -nosse -o Result.txt -verbose 1 -level 0 -gpu -r 500000000 -bits 66 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Added play sound buzzer.wav in Windows version
He succeeded in his idea. He showed our cracking capabilities are poor.
https://github.com/alek76-2/VanitySearch/blob/main/mod/other_files/GPUHash_nc_optimized.h
Previously, the data array was transferred from one function to another when initializing RIPEMD160.
I put the constants directly into the RIPEMD160Transform() function.
Now the question is, can this be optimized using compiler options? The uint32_t * array is no longer used.
Code:
__device__ void RIPEMD160Transform(uint32_t s[5],uint32_t* w) {
uint32_t u;
//uint32_t a1 = s[0], b1 = s[1], c1 = s[2], d1 = s[3], e1 = s[4];
//uint32_t a2 = a1, b2 = b1, c2 = c1, d2 = d1, e2 = e1;
uint32_t a1 = 0x67452301ul, b1 = 0xEFCDAB89ul, c1 = 0x98BADCFEul, d1 = 0x10325476ul, e1 = 0xC3D2E1F0ul;
uint32_t a2 = a1, b2 = b1, c2 = c1, d2 = d1, e2 = e1;
//uint32_t t = s[0];
//s[0] = s[1] + c1 + d2;
//s[1] = s[2] + d1 + e2;
//s[2] = s[3] + e1 + a2;
//s[3] = s[4] + a1 + b2;
//s[4] = t + b1 + c2;
uint32_t t = 0x67452301ul;
s[0] = 0xEFCDAB89ul + c1 + d2;
s[1] = 0x98BADCFEul + d1 + e2;
s[2] = 0x10325476ul + e1 + a2;
s[3] = 0xC3D2E1F0ul + a1 + b2;
s[4] = t + b1 + c2;
uint32_t u;
//uint32_t a1 = s[0], b1 = s[1], c1 = s[2], d1 = s[3], e1 = s[4];
//uint32_t a2 = a1, b2 = b1, c2 = c1, d2 = d1, e2 = e1;
uint32_t a1 = 0x67452301ul, b1 = 0xEFCDAB89ul, c1 = 0x98BADCFEul, d1 = 0x10325476ul, e1 = 0xC3D2E1F0ul;
uint32_t a2 = a1, b2 = b1, c2 = c1, d2 = d1, e2 = e1;
//uint32_t t = s[0];
//s[0] = s[1] + c1 + d2;
//s[1] = s[2] + d1 + e2;
//s[2] = s[3] + e1 + a2;
//s[3] = s[4] + a1 + b2;
//s[4] = t + b1 + c2;
uint32_t t = 0x67452301ul;
s[0] = 0xEFCDAB89ul + c1 + d2;
s[1] = 0x98BADCFEul + d1 + e2;
s[2] = 0x10325476ul + e1 + a2;
s[3] = 0xC3D2E1F0ul + a1 + b2;
s[4] = t + b1 + c2;
Or will the compiler do it itself now?
In the meantime I rewrite the GPUHash.h file
GPU constant memory is not used in hash functions. I checked the program's operation on PK 40 bit. It works, but the speed is the same.
https://github.com/alek76-2/VanitySearch/blob/main/mod/other_files/GPUHash_nc.h
Can someone test it?
nice work alek !
could you please add a stride function on it ?
There, for starting keys in the getGPUStartingKeys function, the step is set here.
Code:
else {
//
keys[i].Set(&startKey);
Int offT((uint64_t)i);
//offT.ShiftL(32);
Int offG((uint64_t)thId);
//offG.ShiftL(40);
// new offset
int nbBit = startKey.GetBitLength();
offT.ShiftL((uint32_t)(nbBit / 2));
offG.ShiftL((uint32_t)(nbBit - 4));
//
keys[i].Add(&offT);
keys[i].Add(&offG);
if (i < 10 || i > nbThread - 10) { printf("Bit %d GPU startKey Base Key %d: %s\n", Random_bits, i, keys[i].GetBase16().c_str()); }
//
}
//
keys[i].Set(&startKey);
Int offT((uint64_t)i);
//offT.ShiftL(32);
Int offG((uint64_t)thId);
//offG.ShiftL(40);
// new offset
int nbBit = startKey.GetBitLength();
offT.ShiftL((uint32_t)(nbBit / 2));
offG.ShiftL((uint32_t)(nbBit - 4));
//
keys[i].Add(&offT);
keys[i].Add(&offG);
if (i < 10 || i > nbThread - 10) { printf("Bit %d GPU startKey Base Key %d: %s\n", Random_bits, i, keys[i].GetBase16().c_str()); }
//
}
I don’t want to, I will need to recalculate the distance traveled and create an addition for a new start of the keys. A table and steps are used. +1 and -1 further to +512 and -512 Delta is needed to increase the speed when calculating the inversion modulo distance - this is when adding points.
You can generate starting keys in increments. The dot addition step cannot be changed.
For example, you won’t be able to add 16, 64 or 2048. The addition step is 1 - all because of the table.
Or even better.... a simplified NSA accelerated study on how to solve any puzzle with key-subtraction.
Yes, let them try this method again 
Point X to Start Key
Code:
Int startKey;
Point p = checkPoint;// old Point to check hash160
Int k;
k.SetInt32(0);
k.Set(&p.x);
k.ShiftR(190);// 256 - 66
startKey.Set(&k);
printf("\n PointX to Start Key: %s ", startKey.GetBase16().c_str());
I wonder if anyone has done this?Point p = checkPoint;// old Point to check hash160
Int k;
k.SetInt32(0);
k.Set(&p.x);
k.ShiftR(190);// 256 - 66
startKey.Set(&k);
printf("\n PointX to Start Key: %s ", startKey.GetBase16().c_str());
And so on and on....This is only part of it.
I even modify BIOS on Intel boards and even GPU bios. Until the components burn *from efficiency.
Wow... Approaching your goal step by step. This is great !I even modify BIOS on Intel boards and even GPU bios. Until the components burn *from efficiency.
What happened to your vansearch kangaroo on github? You take it down?
For an unspecified time.
_______________________________________________________________________________ _______________________________
This is another one that remembers the steps and saves it to a file; re-running does not generate new start keys. It extracts them from the file. Save and unload functions were once available in the repository. Kangaroos are not currently available.
No, I will not distribute this version of the program for now. It seems like a lot of work has been done. Thanks also to the farm owners who offer paid access to GPU computing resources. This is starting to annoy me
Launched it on one video card
And leave it like that until January 1, 2025
Code:
[i] Upload work file: Work_Kangaroos_128.txt
[i] File Work_Kangaroos_128.txt: 255590400 bytes 1317476 lines
[i] Get Keys time: 24549.068 msec From file: Work_Kangaroos_128.txt Size: 255590400 bytes
[i] GPU Use Start Keys from work file: Work_Kangaroos_128.txt
[+] Runing Comparator every: 300 sec
[i] Save Work_Kangaroos_id.txt file every: 600 sec
[i] WILD Check Distance: 8D206E8B3814706BABF1C3A693EE7A0
[i] TAME Check Distance: 3E23F093957C9DD9A3D9AB48B3482F85C
[|][ 0: 0:36 ; 0.0 j/s; [GPU 0.00 Mj/s] 0.0 j 0.0%; dp/kgr=0.0; 1.0Ty 2m 22d 14: 0:32 ]
[i] Write work Kangaroos in file: Work_Kangaroos_128.txt
[i] Save Work file OK
[/][ 0: 0:38 ; 0.0 j/s; [GPU 0.00 Mj/s] 0.0 j 0.0%; dp/kgr=0.0; 1.0Ty 2m 22d 14: 0:32 ]
[i] Load Work file to Drive
[|][ 0:11:48 ; 460.8M j/s; [GPU 460.83 Mj/s] 311.0Gj 0.0%; dp/kgr=0.0; 2.0Ky 10m 28d 19:52:16 ]
Python Comparator time: 708831.895 msec
[-][ 0:12:40 ; 461.3M j/s; [GPU 461.26 Mj/s] 335.0Gj 0.0%; dp/kgr=0.0; 2.0Ky 6m 1d 10:52: 6 ]
[i] WILD Check Distance: 8D206EC1A13D020EFECB550DA146C3D
[i] TAME Check Distance: 3E23F093CC220F1301640B64F086A15D5
[|][ 0:13:24 ; 0.0 j/s; [GPU 0.00 Mj/s] 335.0Gj 0.0%; dp/kgr=0.0; 1.0Ty 7m 14d 3:41:52 ]
[i] Write work Kangaroos in file: Work_Kangaroos_128.txt
[i] Save Work file OK
[-][ 0:13:28 ; 0.0 j/s; [GPU 0.00 Mj/s] 335.0Gj 0.0%; dp/kgr=0.0; 1.0Ty 7m 14d 3:41:52 ]
[i] Load Work file to Drive
[|][ 0:13:56 ; 461.1M j/s; [GPU 461.14 Mj/s] 348.0Gj 0.0%; dp/kgr=0.0; 2.0Ky 2m 0d 10:55:49 ]
[i] Copy tame and wild files in My Drive
[-][ 0:24:16 ; 461.1M j/s; [GPU 461.09 Mj/s] 634.0Gj 0.0%; dp/kgr=0.0; 2.0Ky 5m 9d 9:27:12 ]
[i] File Work_Kangaroos_128.txt: 255590400 bytes 1317476 lines
[i] Get Keys time: 24549.068 msec From file: Work_Kangaroos_128.txt Size: 255590400 bytes
[i] GPU Use Start Keys from work file: Work_Kangaroos_128.txt
[+] Runing Comparator every: 300 sec
[i] Save Work_Kangaroos_id.txt file every: 600 sec
[i] WILD Check Distance: 8D206E8B3814706BABF1C3A693EE7A0
[i] TAME Check Distance: 3E23F093957C9DD9A3D9AB48B3482F85C
[|][ 0: 0:36 ; 0.0 j/s; [GPU 0.00 Mj/s] 0.0 j 0.0%; dp/kgr=0.0; 1.0Ty 2m 22d 14: 0:32 ]
[i] Write work Kangaroos in file: Work_Kangaroos_128.txt
[i] Save Work file OK
[/][ 0: 0:38 ; 0.0 j/s; [GPU 0.00 Mj/s] 0.0 j 0.0%; dp/kgr=0.0; 1.0Ty 2m 22d 14: 0:32 ]
[i] Load Work file to Drive
[|][ 0:11:48 ; 460.8M j/s; [GPU 460.83 Mj/s] 311.0Gj 0.0%; dp/kgr=0.0; 2.0Ky 10m 28d 19:52:16 ]
Python Comparator time: 708831.895 msec
[-][ 0:12:40 ; 461.3M j/s; [GPU 461.26 Mj/s] 335.0Gj 0.0%; dp/kgr=0.0; 2.0Ky 6m 1d 10:52: 6 ]
[i] WILD Check Distance: 8D206EC1A13D020EFECB550DA146C3D
[i] TAME Check Distance: 3E23F093CC220F1301640B64F086A15D5
[|][ 0:13:24 ; 0.0 j/s; [GPU 0.00 Mj/s] 335.0Gj 0.0%; dp/kgr=0.0; 1.0Ty 7m 14d 3:41:52 ]
[i] Write work Kangaroos in file: Work_Kangaroos_128.txt
[i] Save Work file OK
[-][ 0:13:28 ; 0.0 j/s; [GPU 0.00 Mj/s] 335.0Gj 0.0%; dp/kgr=0.0; 1.0Ty 7m 14d 3:41:52 ]
[i] Load Work file to Drive
[|][ 0:13:56 ; 461.1M j/s; [GPU 461.14 Mj/s] 348.0Gj 0.0%; dp/kgr=0.0; 2.0Ky 2m 0d 10:55:49 ]
[i] Copy tame and wild files in My Drive
[-][ 0:24:16 ; 461.1M j/s; [GPU 461.09 Mj/s] 634.0Gj 0.0%; dp/kgr=0.0; 2.0Ky 5m 9d 9:27:12 ]
And leave it like that until January 1, 2025
someone solved it ?
Everyone is waiting for a bite There are only a few fish in the whole ocean Just Happy New Year to every one !!!)))
Happy New Year everyone !!!Happy New Year everyone. I only read here but didn’t write anything.
What did I find? I found a number that, if subtracted or added to the public key. Returns the same public key, regardless of whether the private key is large or small. A number was also found that, if subtracted or added to the public key, produces a key that is not on the curve.
I don't know to be honest. Has anyone found this already or not? But I’m still deciding what to do with it next. Because, in my opinion, this is the vulnerability of the curve. I've been working on the puzzle for 2 weeks. So far I've only found this. Sorry for broken English. I wrote through a translator.
What did I find? I found a number that, if subtracted or added to the public key. Returns the same public key, regardless of whether the private key is large or small. A number was also found that, if subtracted or added to the public key, produces a key that is not on the curve.
I don't know to be honest. Has anyone found this already or not? But I’m still deciding what to do with it next. Because, in my opinion, this is the vulnerability of the curve. I've been working on the puzzle for 2 weeks. So far I've only found this. Sorry for broken English. I wrote through a translator.
No key on the curve? If something sticks out of your pants, the elastic band from your panties will cut it to the required length, dividing by modulo. And the key will be within the curve
Go get that bag mcdouglas!!!
Rooting for you even though I am a 130 searcher as well.
Puzzle 130 will not be solved soon, around January 1, 2025 Rooting for you even though I am a 130 searcher as well.