Show Posts
|
Pages: « 1 [2]
|
i agree with you but free purebasic program can compile only small code lines so that's why i need help from @Etar
and program is setting memory automatically but calculating it wrong
|
|
|
i think i found the problem the information which program is pulling from device is wrong or these are max value which intentionally hardcoded in program , Ethar can you please set all dynamic , i mean device should report all parameters
Found 1 Cuda device. Cuda device:GeForce RTX 3080(4095Mb) wrong Device have: MP:68 Cores+0 wrong Shared memory total:49152 i guess this is system memory but avaiable is 128GB Constant memory total:65536 not sure how calculate this one
i am not sure but MP is unit of AMD cards and cuda for Nvidia , and cuda is 8k+ in 3080 but not sure what is 68 cores here so many confusions
|
|
|
speed is also slower than Kangaroo around 1200M i am getting , but i want to tweak to utilize max gpu memory and max ram with max power , increase item size will slow down speed and take longer to solve .
any idea how to tweak
Possibly due to "memory fragmentation" that happens when the program allocates GPU memory for one stuct, it's allocated in the middle of GPU memory and that will limit the maximum contiguous memory allocation allowed on the GPU for other structs. The resolution for it is to allocate the largest structure first (in this case the TotalBuff) and then the smaller ones last. It requires a code modification though, which is impossible to do without the source code. source codes are available i guess here https://github.com/Etayson/BSGS-cuda/blob/main/bsgscudaussualHTchangeble1_2.pb can you check please
|
|
|
GPU #0 launched GPU #0 TotalBuff: 8112.000Mb error cuMemAlloc-2 Press Enter to exit
i guess you hard coded 4096 GPU mem as i did everything but i am unable utilizing full GPU memory , my GPU is 3080 with 10GB
this is the max i can use
GPU #0 launched GPU #0 TotalBuff: 3216.000Mb
speed is also slower than Kangaroo around 1200M i am getting , but i want to tweak to utilize max gpu memory and max ram with max power , increase item size will slow down speed and take longer to solve .
any idea how to tweak
|
|
|
Also dont forget: The Problem we have is, that we don't know if the last bit is even or odd. If you know if the last bit is even or odd, you can crack any public key in no time.
How does this affect? Please explain in more detail.. maybe SSXB can explain this
|
|
|
ssxb
Your post makes not so much sense to me?!
How does brainless approach reduce the amount of public keys? Did you understand what he meant? Can you elaborate it further?
ok which part doesn't make sense , if you asking about 1/720 keys part ~ that what brainless said in his previous posts. check his last posts and you will find these comments. and if you ask me this is possible or not? , yes this is possible but not the way he explained. but there is one problem with my yes. it is very difficult to guess specific range where you can start searching your calculated keys. perhaps you will guess 10 keys are in 110 range but they are not there. ![Kiss](https://bitcointalk.org/Smileys/default/kiss.gif) is that right ssxb?
|
|
|
i have a script to convert compressed keys to uncompressed import binascii
p_hex = 'FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F' p = int(p_hex, 16) compressed_key_hex = '0250863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B2352' x_hex = compressed_key_hex[2:66] x = int(x_hex, 16) prefix = compressed_key_hex[0:2]
y_square = (pow(x, 3, p) + 7) % p y_square_square_root = pow(y_square, (p+1)/4, p) if (prefix == "02" and y_square_square_root & 1) or (prefix == "03" and not y_square_square_root & 1): y = (-y_square_square_root) % p else: y = y_square_square_root
computed_y_hex = format(y, '064x') computed_uncompressed_key = "04" + x_hex + computed_y_hex
print computed_uncompressed_key but i need script where i can convert uncompressed keys to compressed i guess that will be pretty simple to make as we need to take x value and add 02 or 03 in front of x. right? but need working code where i can upload file of uncompressed keys and get all compressed keys :p edit: i wrote these code to convert uncompressed to compress but output file is blank. from fastecdsa import curve from fastecdsa.point import Point import bit
G = curve.secp256k1.G N = curve.secp256k1.q
def pub2point(line, file): x = int(line[2:66], 16) if len(line) < 70: y = bit.format.x_to_y(x, int(line[:2], 16) % 2) else: y = int(line[66:], 16) return Point(x, y, curve=curve.secp256k1) if (y % 2 == 0): prefix = "02" else: prefix = "03" hx = hex(x)[2:].zfill(64) hy = hex(y)[2:].zfill(64) file.write(prefix+hx+"\n") # Writes compressed key to file
with open("1.txt", "r") as f, open("output.txt", "w") as outf: line = f.readline().strip() while line != '': pub2point(line, outf) line = f.readline().strip() i guess something is missing or i am doing it wrong
|
|
|
need help in python i have 2 files and each file have 32 lines hex values so i want to subtract line 1 of "file1.txt" with line 1 of "file2" subtract line 2 of "file1.txt" with line 2 of "file2" vice versa and print output. i am using code like this but don't know what i am doing wrong with open("file1.txt", "r") as f: line = f.readline().strip() while line != '': hex1 = f.readline().strip()
with open("file2.txt", "r") as f: line = f.readline().strip() while line != '': hex2 = f.readline().strip() def add(file1.txt, file2.txt): P = (hex1) Q = (hex2) R = hex(P - Q) hx = hex(R).zfill(64) print(hx)
|
|
|
wow it created an output file with 99 nums.. what range should those be at sir.
That's how it works. At the bottom of the script there's a variable called "factor" you should change that determines how much each key is divided by (yes all keys are shifted by the same factor). I also include the "0" position as well as the 1-32 positions, that's why you see 33 shifted keys per key. You must have used 3 keys as file input. If you wanted to shift down each pubkey by 5 bits for example, compute 2**5 and then set "factor" to that value. Your range will be between 0 and 2 bitsorig_range - bitsfactor e.g. if your range is 120 and you shrink it by 5, the max is 2^115 in hex. thanks man , its worked ![Smiley](https://bitcointalk.org/Smileys/default/smiley.gif)
|
|
|
cool bro but one issue is appearing Traceback (most recent call last): File "shiftdown.py", line 47, in <module> P = shiftdown(P, factor, outf, convert=False) File "shiftdown.py", line 28, in shiftdown P = Q - (i * G) TypeError: unsupported operand type(s) for -: 'NoneType' and 'Point' There was a small typo, try it now. i don't know for others but for me still issue as no error is there and nothing in output.txt. also it is deleting data from input file ![Sad](https://bitcointalk.org/Smileys/default/sad.gif) . after executing codes both file became 0 in size. is it working on your side?
|
|
|
i want to load 300 keys from file line by line and do the divisor calculation on each one 32 time and save output in file.
Again, one file total, or one file for each pubkey? Printing all the keys in a single file becomes messy to read but is doable. yes please if you can share such script
|
|
|
" I got it down to 104 bits today, but with 32,000 pubkeys; better than the normal 2^16 normally required, but I can't figure out a way to shrink it down to one key... "
for 10 bit down = 1024 pubkeys for 20 bit down = 1024*1024 = 1048576 pubkeys for 30 bit down = 1024*1024*1024 = 1073741824 pubkeys
1048576 and 1073741824 pubkeys with each other addition and mutiplication will return you 260 pubkeys apear where 16 pubkeys sure inside 10 bit down from main pubkey these 260 pubkeys again played for get 30 bit down for 1/720 pubkeys now you can start to find with above tip
which script you used bro
|
|
|
thanks crow for awesome work :p
|
|
|
why the hell so low speed with max -b 70 -t 512 -p 2078
[2021-01-30.08:55:30] [Info] Compression: compressed [2021-01-30.08:55:30] [Info] Starting at: 0000000000000000000000000000000000000000000000000000000000000001 [2021-01-30.08:55:30] [Info] Ending at: FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364140 [2021-01-30.08:55:30] [Info] Counting by: 0000000000000000000000000000000000000000000000000000000000000001 [2021-01-30.08:55:30] [Info] Compiling OpenCL kernels... [2021-01-30.08:55:30] [Info] Initializing GeForce RTX 3080 [2021-01-30.08:55:36] [Info] Generating 74,475,520 starting points (2841.0MB) [2021-01-30.08:55:42] [Info] 10.0% [2021-01-30.08:55:43] [Info] 20.0% [2021-01-30.08:55:43] [Info] 30.0% [2021-01-30.08:55:43] [Info] 40.0% [2021-01-30.08:55:43] [Info] 50.0% [2021-01-30.08:55:44] [Info] 60.0% [2021-01-30.08:55:44] [Info] 70.0% [2021-01-30.08:55:44] [Info] 80.0% [2021-01-30.08:55:44] [Info] 90.0% [2021-01-30.08:55:45] [Info] 100.0% [2021-01-30.08:55:45] [Info] Done [00:00:00] 4545/10240MB | 1 target 780.92 MKey/s
OpenCL versus the Cuda version. clBitCrack versus cuBitCrack; have you tried cuBitCrack? cuda is not working yet but other gus post there gtx 3060 ti result with CL and that is even more than me , even 2070 with cl is more than mine wtf
|
|
|
why the hell so low speed with max -b 70 -t 512 -p 2078
[2021-01-30.08:55:30] [Info] Compression: compressed [2021-01-30.08:55:30] [Info] Starting at: 0000000000000000000000000000000000000000000000000000000000000001 [2021-01-30.08:55:30] [Info] Ending at: FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364140 [2021-01-30.08:55:30] [Info] Counting by: 0000000000000000000000000000000000000000000000000000000000000001 [2021-01-30.08:55:30] [Info] Compiling OpenCL kernels... [2021-01-30.08:55:30] [Info] Initializing GeForce RTX 3080 [2021-01-30.08:55:36] [Info] Generating 74,475,520 starting points (2841.0MB) [2021-01-30.08:55:42] [Info] 10.0% [2021-01-30.08:55:43] [Info] 20.0% [2021-01-30.08:55:43] [Info] 30.0% [2021-01-30.08:55:43] [Info] 40.0% [2021-01-30.08:55:43] [Info] 50.0% [2021-01-30.08:55:44] [Info] 60.0% [2021-01-30.08:55:44] [Info] 70.0% [2021-01-30.08:55:44] [Info] 80.0% [2021-01-30.08:55:44] [Info] 90.0% [2021-01-30.08:55:45] [Info] 100.0% [2021-01-30.08:55:45] [Info] Done [00:00:00] 4545/10240MB | 1 target 780.92 MKey/s
|
|
|
please don't feed the trolls. -[Announcement]- Qortal Core and UI updates Qortal Core version 1.3.9 Core update with a few little bugfixes and preparation for LTC in version 1.4.0. auto-update pushed today, if you are sync'd and you don't have auto-updates disabled, you will update automatically on all platforms. you can see a blog post I made here about the updates Linux and Mac users will have to update to 1.3.2 UI manually. Windows should auto-update both core and UI. Everyone should auto-update core unless they have auto-updates disabled. https://qortal.org/index.php/2020/12/30/qortal-updates-core-version-1-3-9-and-ui-version-1-3-2/See post for specifics. The next updates after these, will include the LTC Trade Portal, 3 local wallets (BTC, LTC, and QORT), PRESENCE transactions for Trade Portal sells, and much more. Very excited about all that has been accomplished recently, applause to the Qortal dev team, looks like 2021 may be the year of Qortal. out standing work crowetic , keep it up
|
|
|
Guys one thing i noticed, some guys are asking about why some Qortal guys are just at level 1 or level 2 and they are getting so many Qortal in minting , just to be clear Qortal is born from Qora and guys who are getting lot of Qortal was holder of Qora and they will get 250:1 ratio Qortal over time. once all ratio is deposited they will get minting value of Qortal according to level of their wallet. you can read details in whitepaper or http://wiki.qortal.org/doku.php?id=qora_transition noted, should have included that in my video. any idea when that will come to an end? as ssxb said, they will get qortal over time so lets say if he someone was having 10000 Qora and he burned for getting qortal 10000 / 250 = 40 Qortal These 40 will deposit over time in his qortal wallet as if all coin will go one time in his wallet , he maybe try to dump them and will make problem for qortal echo system, perhaps he will get that 40 in years as far as i know , but i will dig more for formula or crowtic can explian here when he will be online here,
|
|
|
Of course, what did you expect? By default stride = 1, which means you check numbers ...,3,4,5,6,7..... but if you specify stride 5, program checks 5,10,15,20,25... Why you expect to have number 9 or 11 checked? If your public key is generated from number 20, it will be found, if from 21 - not. It is obvious.
ok wait do you mean if my gpu is checking 20m keys /sec with 5 jump so in normal this will be 1,2,3,4,5,6.......20000000 but with 5 Jump this will be 5,10,15,20,25,30........100000000 right?
|
|
|
this one is very strange check this out clBitCrack.exe --stride BA43B7400 -b 52 -t 512 -p 1024 --compression both --keyspace 0100000000000000000000000000000000000000000000000000000000000000:FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364140 -i 1.txt -o 01.txt i loaded these addresses to check this one is working or not and guess what if i load 6 or 8 address its working as i expect but if i load more than 6 addressess it is not working , 1CTGjE4t65gvTzGRCP2rr1UmwYRHRwR2gB 1Bst22LeSjptwhSbAe4XXArjBpnnKDF42X 1FoWHbebHzAuNzg4sX8R2bxBDBCdFQejTv 1CTkWpdNYsM7u9zw3DTiJhEZFA1YJTzBcU 16MAA9YeMSp7VtnQsBSYXgEGg6f1dFdwR1 1B8XXy9YykVF1qk6qm9N3HZ5Bx55mmjDpW 14B12QMdUbtnpAVv7wkowQtG1B94GP2Sa9 1Ap9DW4YjtuGxxVR9hL3CLjMTM8z1kQZfE 1KDpXzUdjcxkbC7NhTL8T7DiVNh1ERAmEs some addresses i chose as they are coming in stride range jump and some i chose right after or before stride jump , so question is if GPU doing stride jump and than calculating million of addresses this should also show address right after stride jump or right before stride jump, but in all cases it is showing only ,exact jump address only nothing before or nothing after . and my guess is GPU is checking first only compress range and than non compress range , strange thing lol. and in my guess Gpu is only searching for one address when you will give stride range jump in command and will find key than this will start search for 2nd address , please clarify
|
|
|
Everyone knows that bitcrack only goes by consecutive keys.
Not really. You may specify your own 'distance' between key. For example: will do 1000000 keys long 'jump' between tries. That's still consecutive not random how you are calculating --stride F4240 = 1m how about for 1 billion or for 50billion? please tell me how to calculate any guide
|
|
|
|