Why do all programs/tools about bitcoin all-time download chrome browser warning to download and recommend deleting a file?
What algorithms or some code makes the browser check it and think can be harm the computer.
it happens with tools download from Github and open source code, bitcrack, kangaroo all get warning all-time download it.
Topic: BitCrack - A tool for brute-forcing private keys - page 23. (Read 74618 times)
There is no single tool which he is the author. There is no one single program written by him.
If you want reliability - go and find the original version, from the tool's author, not from that xero guy.
Maybe he has small dick or other complexes and that's why he is not using "fork" option on source repos, he wants projects to look like they were made by him?
I respect him for amount of time he must spend to monitor source repos and copy/paste diffs
So guys, you do not need to worry about virus or other bug hidden in his closed wif500 program, he is not able to do something like that.
If you want reliability - go and find the original version, from the tool's author, not from that xero guy.
Maybe he has small dick or other complexes and that's why he is not using "fork" option on source repos, he wants projects to look like they were made by him?
I respect him for amount of time he must spend to monitor source repos and copy/paste diffs
So guys, you do not need to worry about virus or other bug hidden in his closed wif500 program, he is not able to do something like that.
I didn't check the repos (Github is a PITA to browse through lynx) but I can conclude two things from this:
a - if the programs are open-source, then he just coppied the Git tree - anyone can do that. The commits still appear (unless you destroy the tree and create a new one - in which case nobody would really think you wrote the whole thing in 1 commit anyway) if you do a git log, so it's just a nuisance.
b - the programs are all closed source like that sp-mod guy. In which case the most risk that would come from using it would be the code sending the rewards to some baked address inside the code (or if he is sufficiently insane, maybe he includes a piece of malware like the node-ipc maintainer).
It will be interesting to see/read about the wif500 and if they solve it.
I think it's just a clever scam.The author claims that the photo is from a burnt diary in 2017, but the Ethereum address in the same photo was used in 2021, and just one day.
Why write this address and key in a diary if there was no balance on it at the time?
And even more so to use it after so many years..
0x428d88b326748ebd55c4a7f89fd3bc08378dc0d2
It will be interesting to see/read about the wif500 and if they solve it.
I think it's just a clever scam.The author claims that the photo is from a burnt diary in 2017, but the Ethereum address in the same photo was used in 2021, and just one day.
Why write this address and key in a diary if there was no balance on it at the time?
And even more so to use it after so many years..
0x428d88b326748ebd55c4a7f89fd3bc08378dc0d2
If his tools work, they work. If the challenge is fake or if you think its fake just don't participate in it.
There is no single tool which he is the author. There is no one single program written by him.
If you want reliability - go and find the original version, from the tool's author, not from that xero guy.
Maybe he has small dick or other complexes and that's why he is not using "fork" option on source repos, he wants projects to look like they were made by him?
I respect him for amount of time he must spend to monitor source repos and copy/paste diffs
So guys, you do not need to worry about virus or other bug hidden in his closed wif500 program, he is not able to do something like that.
If you take an existing program and change it to different things, is that a fork or a new master? I do not know...I imagine you could fork and make changes.
It will be interesting to see/read about the wif500 and if they solve it.
If his tools work, they work. If the challenge is fake or if you think its fake just don't participate in it.
There is no single tool which he is the author. There is no one single program written by him.
If you want reliability - go and find the original version, from the tool's author, not from that xero guy.
Maybe he has small dick or other complexes and that's why he is not using "fork" option on source repos, he wants projects to look like they were made by him?
I respect him for amount of time he must spend to monitor source repos and copy/paste diffs
So guys, you do not need to worry about virus or other bug hidden in his closed wif500 program, he is not able to do something like that.
You can use this too for Hash160 https://github.com/phrutis/Rotor-Cuda you can use a GPU with this.
Use whatever you want, just not from that russian thief. All he does is copy/paste from other repos (not fork), he changes name and says like it belongs to him.
I also cannot recommend his tools, especially when he ran shady brute-force challenge[1]. But i'm not sure he can be called thief when AFAIK he don't violate original repository license. Although i can understand uneasiness that he don't use GitHub fork feature when the original source code also hosted on GitHub.
[1] https://bitcointalksearch.org/topic/challenge-or-scam-or-nothing-5394745
If his tools work, they work. If the challenge is fake or if you think its fake just don't participate in it.
@fxsniper
Hello
You won't notice much speed difference on this case.
Only thing pubkey bruteforce fastest is BSGS, because it's come after only 1 step(value*G). no need double SHA2,RIPEMD160,BASE8
address or RIPEMD160 won't make much noticeable difference in bruteforce.
Hello
You won't notice much speed difference on this case.
Only thing pubkey bruteforce fastest is BSGS, because it's come after only 1 step(value*G). no need double SHA2,RIPEMD160,BASE8
address or RIPEMD160 won't make much noticeable difference in bruteforce.
OK, I just think simple maybe calculate SHA-256 and RIPEMD160 it is maybe fast that Elliptic curve point calculate
I think with 1 step(value*G). it is calculated 256 times (loop) for each bit maybe make full key brute-force slow
You can use this too for Hash160 https://github.com/phrutis/Rotor-Cuda you can use a GPU with this.
Use whatever you want, just not from that russian
@fxsniper
Hello
You won't notice much speed difference on this case.
Only thing pubkey bruteforce fastest is BSGS, because it's come after only 1 step(value*G). no need double SHA2,RIPEMD160,BASE8
address or RIPEMD160 won't make much noticeable difference in bruteforce.
Hello
You won't notice much speed difference on this case.
Only thing pubkey bruteforce fastest is BSGS, because it's come after only 1 step(value*G). no need double SHA2,RIPEMD160,BASE8
address or RIPEMD160 won't make much noticeable difference in bruteforce.
OK, I just think simple maybe calculate SHA-256 and RIPEMD160 it is maybe fast that Elliptic curve point calculate
I think with 1 step(value*G). it is calculated 256 times (loop) for each bit maybe make full key brute-force slow
You can use this too for Hash160 https://github.com/phrutis/Rotor-Cuda you can use a GPU with this.
@fxsniper
Hello
You won't notice much speed difference on this case.
Only thing pubkey bruteforce fastest is BSGS, because it's come after only 1 step(value*G). no need double SHA2,RIPEMD160,BASE8
address or RIPEMD160 won't make much noticeable difference in bruteforce.
Hello
You won't notice much speed difference on this case.
Only thing pubkey bruteforce fastest is BSGS, because it's come after only 1 step(value*G). no need double SHA2,RIPEMD160,BASE8
address or RIPEMD160 won't make much noticeable difference in bruteforce.
OK, I just think simple maybe calculate SHA-256 and RIPEMD160 it is maybe fast that Elliptic curve point calculate
I think with 1 step(value*G). it is calculated 256 times (loop) for each bit maybe make full key brute-force slow
@fxsniper
Hello
You won't notice much speed difference on this case.
Only thing pubkey bruteforce fastest is BSGS, because it's come after only 1 step(value*G). no need double SHA2,RIPEMD160,BASE8
address or RIPEMD160 won't make much noticeable difference in bruteforce.
Hello
You won't notice much speed difference on this case.
Only thing pubkey bruteforce fastest is BSGS, because it's come after only 1 step(value*G). no need double SHA2,RIPEMD160,BASE8
address or RIPEMD160 won't make much noticeable difference in bruteforce.
There are already 2 Tools out there which can do exactly the same.
1. https://github.com/albertobsd/keyhunt in the pub2rmd mode. This is for CPU.
Code:
./keyhunt -m pub2rmd
2. https://github.com/kanhavishva/PubHunt This is for GPU
thank iceland2k14
I will try keyhunt
The problem is that in this way it is impossible to set the range for generation. It's like pointing your finger at the sky to find the one star you need out of billions.
thank you sssergy2705
right, it is very hard to find with 256-bit number
my idea try to calculate sort can possible
1. random X
2. calculate Y from X
3. hash SHA-256
4. hash RIPEMD-160
5. check the match search
There are already 2 Tools out there which can do exactly the same.
1. https://github.com/albertobsd/keyhunt in the pub2rmd mode. This is for CPU.
Code:
./keyhunt -m pub2rmd
2. https://github.com/kanhavishva/PubHunt This is for GPU
The problem is that in this way it is impossible to set the range for generation. It's like pointing your finger at the sky to find the one star you need out of billions.
my idea try to calculate sort can possible
1. random X
2. calculate Y from X
3. hash SHA-256
4. hash RIPEMD-160
5. check the match search
There are already 2 Tools out there which can do exactly the same.
1. https://github.com/albertobsd/keyhunt in the pub2rmd mode. This is for CPU.
Code:
./keyhunt -m pub2rmd
2. https://github.com/kanhavishva/PubHunt This is for GPU
Quote
my idea try to calculate sort can possible
1. random X
2. calculate Y from X
3. hash SHA-256
4. hash RIPEMD-160
5. check the match search
1. random X
2. calculate Y from X
3. hash SHA-256
4. hash RIPEMD-160
5. check the match search
So you want:
random privkey
calculate pubkey from random privkey
sha
and then RIPEMD160
Correct?
There are programs out there that search for H160 already. The problem becomes the "pure" randomness.
I know albertobsd's keyhunt program will allow you to load a H160 to search for and it has the random (CPU cores are better/faster with the "absolute" randomness) option.
Programs like vanitysearch and bitcrack, take the inputted address and convert it to H160 and that's what it searches for, but it's hard to do a true (absolute as you call it), check one random key and then jump to another random key with a GPU; most programs will/can put a GPU thread on a random point but it normally checks thousands or millions of consecutive keys before rekeying or re-randomizing the GPU threads.
You want a program to randomly create a public key and then search for it's corresponding H160?
Yes, please
maybe puzzle 64-100 without pubkey can be useful to solve
free stye to code as you want or easy to code (with GPU)
problem with full calculate like bitcrack it is calculated puzzle#64 from first bit to bit 64 (or any bit 356) it uses to may loop over 200 to calculate double and add multiply, made it slow to brute-forcing
maybe someone can use this too found it (dot point trillion one percent possible)
my idea try to calculate sort can possible
1. random X
2. calculate Y from X
3. hash SHA-256
4. hash RIPEMD-160
5. check the match search
I am not sure I write step correct or not
With GPU calculate How many pubkey scans can do per minute?
option may be up to you code begins with easy first for open testing and then modify to option later
option
1. absolute random
2. random in the range
3. run number X (+1 next like bitcrack)
for check match RIPEMD-160 search
1. full match with "3EE4133D991F52FDF6A25C9834E0745AC74248A4"
2. vanity math like "3EE4133D991F5" (from 3EE4133D991F52FDF6A25C9834E0745AC74248A4)
Can any body help to create tools brute-forcing by using GPU NVidia from random Public ECDSA Key to RIPEMD-160 Hash and vanity search
RIPEMD-160 Hash
just test random idea to brute-forcing puzzle 64 and use kangaroo solve it ( I know it is not work, but would be test to know it sure to not work)
You want a program to randomly create a public key and then search for it's corresponding H160? RIPEMD-160 Hash
just test random idea to brute-forcing puzzle 64 and use kangaroo solve it ( I know it is not work, but would be test to know it sure to not work)
Pawgo, you know we have talked in the past and I have tested your programs and posted results; I honestly do not know how the kangaroo stride version could help speed up search time or how to really implement it to work better than original kangaroo, as far as time finding key.
Kangaroo with stride is not for puzzles or other search, but for solving WIFs with missing beginning, you tested that: https://bitcointalksearch.org/topic/--5315607
This is the situation where you know that answer is in the range A - B, but you do not test each key - stride is equal 58^x, where x depends on position of missing character.
It works, it solves given problem - but noone (at least not me) stated that it is somehow better or faster than original one. It is just an add-on.
Quote
When we talk about pure private key solving, it works well. Which means you my try puzzle #120 with a custom stride if you do not want to wait to long and believe in yours luck
I remember thinking on how or what parameters one would use. But it's like you said, it's just a lottery...
Can any body help to create tools brute-forcing by using GPU NVidia from random Public ECDSA Key to RIPEMD-160 Hash and vanity search
RIPEMD-160 Hash
just test random idea to brute-forcing puzzle 64 and use kangaroo solve it ( I know it is not work, but would be test to know it sure to not work)
RIPEMD-160 Hash
just test random idea to brute-forcing puzzle 64 and use kangaroo solve it ( I know it is not work, but would be test to know it sure to not work)
Jump to: