NotATether
Legendary
Offline
Activity: 1596
Merit: 6735
bitcoincleanup.com / bitmixlist.org
|
|
March 16, 2021, 09:38:35 AM |
|
Can anyone help to fix about random function can not using large number problem random.Next not work with 9223372036854775808 to 18446744073709551616
random.Next(9223372036854775808, 18446744073709551616)
If it's returning negative numbers instead of positive, did you try changing the result variable of random.Next to "unsigned int" by making a cast? I don't know much C# so I can't be much more helpful with this.
|
. .BLACKJACK ♠ FUN. | | | ███▄██████ ██████████████▀ ████████████ █████████████████ ████████████████▄▄ ░█████████████▀░▀▀ ██████████████████ ░██████████████ █████████████████▄ ░██████████████▀ ████████████ ███████████████░██ ██████████ | | CRYPTO CASINO & SPORTS BETTING | | │ | | │ | ▄▄███████▄▄ ▄███████████████▄ ███████████████████ █████████████████████ ███████████████████████ █████████████████████████ █████████████████████████ █████████████████████████ ███████████████████████ █████████████████████ ███████████████████ ▀███████████████▀ ███████████████████ | | .
|
|
|
|
|
|
|
|
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction.
|
|
|
|
A-Bolt
Legendary
Offline
Activity: 2315
Merit: 2316
|
|
March 16, 2021, 08:52:35 PM |
|
Can anyone help to fix about random function can not using large number problem random.Next not work with 9223372036854775808 to 18446744073709551616
random.Next(9223372036854775808, 18446744073709551616)
UInt64 Base = 0x7FFFFFFFFFFFFFFF; var random = new Random();
UInt64 high32Rnd = (UInt64)random.Next(); UInt64 low32Rnd = (UInt64)random.Next();
UInt64 rnd64 = (high32Rnd << 32) | low32Rnd; rnd64 >>= 1; rnd64 += Base;
Console.WriteLine(rnd64);
|
|
|
|
fxsniper
Member
Offline
Activity: 406
Merit: 45
|
|
March 17, 2021, 12:42:59 AM |
|
Can anyone help to fix about random function can not using large number problem random.Next not work with 9223372036854775808 to 18446744073709551616
random.Next(9223372036854775808, 18446744073709551616)
UInt64 Base = 0x7FFFFFFFFFFFFFFF; var random = new Random();
UInt64 high32Rnd = (UInt64)random.Next(); UInt64 low32Rnd = (UInt64)random.Next();
UInt64 rnd64 = (high32Rnd << 32) | low32Rnd; rnd64 >>= 1; rnd64 += Base;
Console.WriteLine(rnd64);
Thank you A-Bolt I will try use this code and if for puzzle #120 664613997892457936451903530140172287 1329227995784915872903807060280344575 and puzzle #160 730750818665451459101842416358141509827966271232 1461501637330902918203684832716283019655932542464 how to apply use same code?
|
|
|
|
zahid888
Member
Offline
Activity: 260
Merit: 19
the right steps towerds the goal
|
|
March 17, 2021, 09:25:03 PM |
|
save as .bat file place it in same folder with clbitcrack.. double click in .bat file and enjoy @echo off :loop setlocal EnableDelayedExpansion set /a "i1 = 0, i2 = 0" &for /l %%i in (0,1,23) do set /a "i1 = (i1 << 1) | (!random! & 1), i2 = (i2 << 1) | (!random! & 1)" cmd /c exit /b %i1% set "GO=%=exitcode:~2% cmd /c exit /b %i2% set "GO=%GO%%=exitcode:~2% endlocal &set "GO=%GO:~2,7%%" echo %GO% start clBitCrack.exe -i C:/Users/pc/Desktop/keys.txt -b 128 -t 256 -p 1024 -o C:/Users/pc/Desktop/found.txt --keyspace 800000000%GO%:ffffffffffffffff --stride 10000000 timeout /t 50 taskkill /f /im clBitCrack.exe timeout /t 0 goto loop
|
1BGvwggxfCaHGykKrVXX7fk8GYaLQpeixA
|
|
|
fxsniper
Member
Offline
Activity: 406
Merit: 45
|
|
March 19, 2021, 07:28:55 AM |
|
I try to compile BitCrack
using Visual Studio 2019
but found error
Severity Code Description Project File Line Suppression State Error C1083 Cannot open include file: 'CL/cl.h': No such file or directory clUtil \BitCrack\clUtil\clutil.h 8
How I can fix it?
|
|
|
|
dex1
|
|
March 19, 2021, 11:07:17 AM |
|
Hi guys ,
Can this tool or any modification of this be modified to write all private keys and respective uncompressed private keys and addresses) in range 1 to 56BC75E2D630FFFFF as a csv file . Since it generates 700 to xxxx million keys /s in some of its versions , so it will take many years on a single machine. But still looking for solutions. Writing regular outputs will consume too much time So better it will save several millions or billions in some sort of memory operation and then write them once , till then next batch will find its space in memory to be written again.
Just before you set out on your endeavor it's just wise to do some planning. Even assuming that time needed to complete your task is of no significance to you, it is worth a while to think about a storage capacity you will need to write results of your work to. Basically you are asking for a csv file like this: P.K. hex format Private Key WIF(uncompressed) Bitcoin Address(uncompressed)
00000000000000001,5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip4nEB3kEsreAnchuDf,1EHNa6Q4Jz2uvNExL497mE43ikXhwF6kZm 00000000000000002,5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip4nEB3kEsreAvUcVfH,1LagHJk2FyCV2VzrNHVqg3gYG4TSYwDV4m . . . . . . . . . 56BC75E2D630FFFFE,5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ipWyAZRoQaWUwNpPfbk,1KxoAem9qcEgf9naPk7ETaWvx379Hw2YZX 56BC75E2D630FFFFF,5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ipWyAZRoQaWUwZy1EeS,1MCzMYUdD68jXjtXtyv82uVRUvsHW7cNN9 This file is bound to have 99,999,999,999,999,999,999 plus 1 (56BC75E2D630FFFFFh=99999999999999999999) lines of roughly 104 characters each. So to put it another way one hundred quintillion lines times 104 bytes equals to 10,400,000,000,000,000,000,000 bytes. Using a conversion tool you end up with these numbers: 10,400,000,000,000,000,000,000 bytes (B) = 9685754776000.98 gigabytes (GB) 10,400,000,000,000,000,000,000 bytes (B) = 9458744898.44 terabytes (TB) 10,400,000,000,000,000,000,000 bytes (B) = 9237055.56 petabytes (PB) To make it easier for you to grasp all of what I stated above I'll paraphrase it: To complete your task you have to be a rather affluent person. According to this wiki page 1 TB of storage costs $50 so you'd have to fork out $472,937,244,922. But please worry NOT because I've got some good news for you. The wiki page I've just mentioned must be outdated and I found this little device of which you need 525,485,827 of them. And that will ONLY set you back mere $209,936,843,020. Good luck and all the best to you. PS Remember: PLANNING IS CRUCIAL
|
|
|
|
NotATether
Legendary
Offline
Activity: 1596
Merit: 6735
bitcoincleanup.com / bitmixlist.org
|
|
March 19, 2021, 03:48:36 PM |
|
I try to compile BitCrack
using Visual Studio 2019
but found error
Severity Code Description Project File Line Suppression State Error C1083 Cannot open include file: 'CL/cl.h': No such file or directory clUtil \BitCrack\clUtil\clutil.h 8
How I can fix it?
You don't have OpenCL headers installed. They should be available from CUDA toolkit or AMD's OpenCL SDK. This file is bound to have 99,999,999,999,999,999,999 plus 1 (56BC75E2D630FFFFFh=99999999999999999999) lines of roughly 104 characters each. So to put it another way one hundred quintillion lines times 104 bytes equals to 10,400,000,000,000,000,000,000 bytes. Using a conversion tool you end up with these numbers: 10,400,000,000,000,000,000,000 bytes (B) = 9685754776000.98 gigabytes (GB) 10,400,000,000,000,000,000,000 bytes (B) = 9458744898.44 terabytes (TB) 10,400,000,000,000,000,000,000 bytes (B) = 9237055.56 petabytes (PB) I'm starting to think that even Google's combined storage capacity across all its services doesn't have 9 zettabytes of storage space. Youtube only has a mere couple exabytes of capacity for example.
|
. .BLACKJACK ♠ FUN. | | | ███▄██████ ██████████████▀ ████████████ █████████████████ ████████████████▄▄ ░█████████████▀░▀▀ ██████████████████ ░██████████████ █████████████████▄ ░██████████████▀ ████████████ ███████████████░██ ██████████ | | CRYPTO CASINO & SPORTS BETTING | | │ | | │ | ▄▄███████▄▄ ▄███████████████▄ ███████████████████ █████████████████████ ███████████████████████ █████████████████████████ █████████████████████████ █████████████████████████ ███████████████████████ █████████████████████ ███████████████████ ▀███████████████▀ ███████████████████ | | .
|
|
|
|
sp_
Legendary
Offline
Activity: 2912
Merit: 1087
Team Black developer
|
|
March 20, 2021, 12:14:58 AM Merited by NotATether (1) |
|
I played around with the code and managed a 50% increase in speed on pascal cards. I forked this repository: https://github.com/BoGnY/BitCrackspeed without sp-mod: 267MHASH. after, 400MHASH
|
|
|
|
fxsniper
Member
Offline
Activity: 406
Merit: 45
|
|
March 20, 2021, 12:30:55 AM |
|
I played around with the code and managed a 50% increase in speed on pascal cards. I forked this repository: https://github.com/BoGnY/BitCrackspeed without sp-mod: 267MHASH. after, 400MHASH How can I compile bitcrack on windows? I use windows 10 and Visual Studio 2019 I install CUDA Toolkit 11.2 already https://developer.nvidia.com/cuda-downloadsCUDA SDK and CUDA Toolkit is same right?
|
|
|
|
sp_
Legendary
Offline
Activity: 2912
Merit: 1087
Team Black developer
|
|
March 20, 2021, 12:33:54 AM |
|
This fork needs cuda 10.2
|
|
|
|
fxsniper
Member
Offline
Activity: 406
Merit: 45
|
|
March 20, 2021, 12:37:32 AM |
|
You don't have OpenCL headers installed. They should be available from CUDA toolkit or AMD's OpenCL SDK.
I install CUDA Tools kits https://developer.nvidia.com/cuda-downloadsand Intel® SDK For OpenCL, still not work Where can I download correct OpenCL SDK
|
|
|
|
fxsniper
Member
Offline
Activity: 406
Merit: 45
|
|
March 20, 2021, 12:41:30 AM |
|
Windows can install multiple CUDA Toolkit right? CUDA Toolkit 11.2 CUDA Toolkit 10.2
|
|
|
|
WanderingPhilospher
Full Member
Offline
Activity: 1064
Merit: 219
Shooters Shoot...
|
|
March 20, 2021, 01:10:12 AM |
|
Windows can install multiple CUDA Toolkit right? CUDA Toolkit 11.2 CUDA Toolkit 10.2 Yes
|
|
|
|
fxsniper
Member
Offline
Activity: 406
Merit: 45
|
|
March 20, 2021, 05:07:51 AM |
|
ok, now I can compile some bitcrack test compile with version https://github.com/brichard19/BitCrackstill can not compile have some problem same machine with version compile https://github.com/BoGnY/BitCrackresult compile success with many warning yellow line when using bitcrack this fork version program waiting to generate point long time more than brichard19 (waiting before show 10% to 100%) my result is reverse BoGnY run only 1M/s and brichard19 11M/s
|
|
|
|
fxsniper
Member
Offline
Activity: 406
Merit: 45
|
|
March 20, 2021, 05:34:09 AM |
|
I am not sure why debug is use time very long but release version result is better BoGnY/BitCrack debug = 1 M/s BoGnY/BitCrack release = 58 M/s brichard19/BitCrack = 11 M/s
|
|
|
|
fxsniper
Member
Offline
Activity: 406
Merit: 45
|
|
March 20, 2021, 07:59:08 AM |
|
I played around with the code and managed a 50% increase in speed on pascal cards. I forked this repository: https://github.com/BoGnY/BitCrackspeed without sp-mod: 267MHASH. after, 400MHASH sp_ link I found some problem I use batch file run group of command cubitcrack first time run fast but after that 3-5 set look like slow or struck it Reached end of keyspace very fast feel 2-3 set but faster 2-3 it not pass to next order (each set 2,000,000)
|
|
|
|
|
sp_
Legendary
Offline
Activity: 2912
Merit: 1087
Team Black developer
|
|
March 20, 2021, 09:58:16 AM Last edit: March 20, 2021, 10:14:58 AM by sp_ |
|
You said that your performance is 9 million BTC-addresses per second, i.e. approximately 223 BTC-addresses per second. Thus the brute forcing will take 2160-23 = 2137 seconds! I guess it is more than septillion (1024) years!
Note that this calculating is very approximate, because actually the private key length is 2256, but I think it is enough to stop making an attempts to crack Bitcoin-addresses.
The 1070ti was released in 2017 bitcrack can be set up to search for private keys in all 31million known bitcoin adresses with money in them at the same time. That gives 400 * 31 million BTC-addresses per second for the 1070ti with bitcrack sp-mod. 2^160 - (2^25 + (2^29 * gpus)) 1 gpu (2017) will use around 2^104 seconds. 10 000 gpu's (2017) will use around 2^90 seconds And then there is more's law, and then there is luck.
|
|
|
|
chrysophylax
Legendary
Offline
Activity: 2828
Merit: 1091
--- ChainWorks Industries ---
|
|
March 20, 2021, 10:32:16 AM |
|
I have been watching for some time now ...
There are only a few ways of endeavoring to do this in any meaningful time frame, and what you are showing here is not one of them.
However, it is a start.
Still a VERY long way off, but a start.
#crysx
|
|
|
|
fxsniper
Member
Offline
Activity: 406
Merit: 45
|
|
March 20, 2021, 01:47:27 PM |
|
I test both version https://github.com/sp-hash/Bitcrack/releases/tag/sp-mod1up speed from 11 to 50 and https://github.com/BoGnY/BitCrackup speed from 11 to 30 very good work for very fast than normal I testing fine to works generate address each 1000 million address to in.txt and testing search it is work correct found key when scan over 1000 million found key each 1000 million as generate key high bits with fast speed not answer for high bits brute force because still use a lot of time I think strategy or algorithm calculate key space target and scan that keyspace for fast found key
|
|
|
|
|