Topic: WifSolverCuda - new project for solving WIFs on GPU (Read 1203 times)

At least provide an actual WIF even if it's a random one, now what are the actual first 2 characters?
We need to determine the range of your private key.

What I wanna know, why is your WIF in example has 17 missing characters? Why would you say it has 29 missing characters when in WIF it only has 17?
First you need to think about what your problem really is.
Then if you also have a public key, you could unleash herds of savage kangaroos to find your key.😉

Those case rarely happen, my recomendation is forget about it.

TBH that shoud like a BS

Not true, I have 35 characters, I know their location, need to define other characters. The format of my data is as follows: Kz**ofz1AMJ****aLa8RepNxmVbKR****5dDOdPrG****PGlw***
Of course, the symbols are different than what I have mentioned here, but I have shown the principle of arrangement of known and unknown symbols. I guarantee a generous reward for effective help!

So you have a private key missing 35 characters while you have the other 29 characters? Are the missing chars at the end, middle or beginning?

Hi, need to find private key for bitcoin wallet. Part of this key is 35 characters, I know how to find other characters, is there a program for sorting characters with an indication of mandatory ones.
I would appreciate a tip on the bitcoin part

Thank you for the reply , i am wondering are those data coralated to address 1PfNh5fRcE9JKDmicD2Rh3pexGwce1LqyU  ??
also i doubt the data that you gave to me . According to the info above its missing 12 characters infront of other characters . so  if we add up the number becomes 52 characters  it will be compressed wiff , it will Kw or Kz in front of those characters. . btw thanks again for the reply and the data . if you have another data or any other members on this group need help to solve  your wiff >10 digits  please letme know by DM or direct email to me mamaceo.99 @gmail.com , maybe we can make collaboration by using this remarkable program . Thank you

Ok, here you go, start grinding away!
For keys starting with 5J:

For keys starting with 5K:

For compressed ones if you needed help let me know.😅

thank you for the reply , i m just asking do you have more data like that so i can test my rigs with that data , you just answer yes or no

I'm sure if this key was real, the owner would have already found the key by now,  there is no evidence suggesting this address corresponds to that WIF.

And I believe there is much more to improve on this tool, as I believe there is a way to up the speed by ten folds.

thank you for the reply , well i did what you had to tell me to take the known wif to test my rigs , just need more challenge , it doesnt need 40 strong GPUs to crack only 12 lost wif character with this program , if  this coins have an owner , let the owner talk to me and maybe we can make collaboration.   

The range is already known, well at least I know the range, it only takes a few days with 40 strong GPUs to solve that key, but that key has an owner, taking that money will buy you fire in life and afterlife, besides there are so many thieves around these woods, if it was real they would have already taken it.😉

If you are interested to test your rigs, just take a known WIF, and remove a few characters to see how it works, this tool is the kangaroo for keys without known public keys but with known partial private keys!

Thank you for your kind reply
I already test all your test examples ,i need real wif solver case , my rigs is not much but if your  program is good as your advertise here i wold like to try them with my rigs
regards

The simplest way to test performance of your card would be to launch examples from /docs/ folder. You may easily adapt them for your needs to calculate the performance and estimated time needed for solving the given problem.

do you have any other data like That ? i need to test my GPUs using wif solver cuda ?
regards

There are only 15,000 trillion permutations to check in order to find that key, my old laptop can search 1 trillion per day, 15,000 days to find it. Considering 60M/s speed wifsolver is showing on my screen, it would take me 7,500 days, and this is brute force.

It's hard to believe the owner is sitting idle and is not doing anything to find his 500 coins, it would cost him less than $2M to find his coins in a month.

However there is a faster solution, I will share it with the rightful owner if he agrees to escrow 10% of the funds as a reward.😉

2^255+

Ok, to be a little more exact with less info:

If the key is uncompressed (which seems like it based on the info given), then you have to speculate the second character after the 5.
So let's assume it's a "J".

The range would be something like:

Again, that's speculating off the info given.

Could we find the range of that private key? What would be the range width in your opinion?

I don't know about the WIF 500; you have to trust they have the correct remaining characters AND if phrutis would share the reward, if found.

However, his other repo, is a little scammy to me and that is why I would not trust him.

He is basically trying to sell public keys from older addresses, which anyone can find via the blockchain. But the part that is scammy is him claiming,

So basically he is saying, hey, spend 500 dollars and buy these public keys and you can find them easy with just one or two GPUs.

I am ok with him selling public keys so others don't have to do the work (but it's not much work, just automated process using python), but his selling point (quickly find the private key...) is a red flag. Just my opinion.

Hello digaran, i am not running from anyone. This is a challenge has been running for almost a year by a russian person named phrutis.

Look his github, he has already a pool Splitting ranges running to try to solve, but the real question is, no body knows if thats even a legit challenge and most likely it will be fake.

For more info look here: https://github.com/phrutis/wif500


The known private key of the 500 BTC is 5bCRZhiS5sEGMpmcRZdpAhmWLRfMmutGmPHtjVob. 12 characters missing in the beginning of the private key which makes it even harder because of checksums.


Keep in ming again, this is not sure thats this is a legit challenge. Most probably a lie to waste time. Goodluck!

Last 12 characters or in the middle? Post the key for everyone to see. You won't get any where alone.😉

Hello @PawGo,

There's a diary that has a missing 12 WIF private key character and holds 500 BTC, $11Million. Do you think that this challenge a legit one? 1PfNh5fRcE9JKDmicD2Rh3pexGwce1LqyU

I'm just wondering because this challenge has been going around for months now. I doubt it.

A Russian user named @phrutis is currently the only one who's running the challenge with a bruteforce pool.

Technically, it does work when missing characters are at the end

I understand what you are saying though. Sometimes it's like getting a new shiny toy and you want to play with it before reading care, maintenance, instructions lol.

I understand how to use the program, I was answering their questions.

However, could you elaborate on the speed? What is the speed calculating?


How did you get it to work? The settings/flags you posted, will not work with this program, period. Please explain.

I'm a puzzle hunter, when I see brute force/ key finder/ cracker, I lose my control.😆 I do love what you done, my only problem is the rapid change in speed as I mentioned above. Seems too unstable jumping from 6 billion keys down to 60 million keys is some kind of design flaw maybe? I don't know really. Your work is appreciated.

It's like using butter as a hammer.

But I managed to get it to work, I'm searching my desired start/end ranges, unless your tool doesn't search all the private keys to find the target address.
Also I got a problem, my speed/ performance has a drastic chane, it goes up to 6 Gkey/s and suddenly drops down to 60 Mkeys/s minutes by minutes.

I was also wondering if I change my wifstart and remove 10 chars to replace them with 1, then if I set wifend with 15 chars removed and replaced with z, then I can tweak the end key range to a value of my desire, if all the 10 chars in wifstart process and result in no match then those 5 extra z's on wifend start changing to find my key if it's there. And consequently my wifstart not missing characters will also start to change, even though I didn't change them at all. Did you know about this or is it a bug?

I do not know how to tell it simpler. People just do not read or do not understand (or understand only the part they want).

That program if NOT FOR PUZZLE SOLVING. It will not work.

You would have to actually know a partial of the actual WIF to use this program.
Or at least that's what it seems.
Also, the speed...I am not sure what it is measuring but it is not accurate to me, unless I misunderstand it.
If it is checking 87,000,000,000 keys per second, then this should have solved before it started.
Unless it is checking WIFs and checksums, which could be accurate then.
What I am saying is, it is not checking a private key, like Bitcrack or VBCr does. And in cases where the characters are missing from the end, this is not the fastest program to use.
I ran a test with a known 40 bit key...I removed 7 characters from the end (for quickness), and used a stride of 1.
It found the key in 31 seconds...which is good, but other programs could find this in under a second.
The money for this program is when you are missing characters in the middle and you know the checksum, or have the last x many characters of the wif.
But I know you need a partial of the WIF, and it seems like in the middle is the best...

I do not know if you can use rangestart and end as you have it, let me check real quick...no, you can not, you must use the range like:


Lastly, your stride is based on the last character (from the right) of the WIF you are looking for. If you have no WIF then you can't know what it needs to be.


Test with missing characters at the end:

I am sure OP can explain better/more than me...but you need to have partial WIF to really use this program.

Since you insist 😀 here, I'm testing puzzle 153. What am I doing wrong?


Lol, I know I'm looking in a wrong place though.

Lol...you can't compare apples and oranges. And when you never show your settings/command line, it makes it harder to help you without having to ask you 10 questions to understand what you are doing wrong.
Everyone on here usually is willing to help, up to a point...
Also, I do not know what you are looking at when talking about GPU usage...apparently you are not looking at a program that tells you what your GPU is actually doing.

It depends where your missing characters are, program will not work if you have missing end. See /docs folder, examples and how to find stride.

WOW, I'm really amazed by the performance, I used another tool and got 28MK/s with GPU use: 0, and now I'm using your tool with 450MK/s Also GPU use: 0%. either the speed shown is incorrect or I have a special system.
Why is it when I set -restore it shuts down? I tried it at the end of the command line and at the start, didn't work. Are you aware of finderouter that has an UI? Would that be possible to use his UI on your tool or not?

One thing though I couldn't quite figure out how to set my WIF with missing chars, calculating stride etc, which is something I should work on by myself.

Thank you man, your job is superb.

I have prepared a Windows build for compute cap 5.0 (cuda 11., try now:
https://github.com/PawelGorny/WifSolverCuda/releases/tag/v0.6.2

Thank you for your time, I ran a device query and apparently my cuda cap is 5.0, however after running the program returned a kernel launch failed : no kernel image on device, any advice? I'm new to this stuff.

Ps, I'll send a tip when I find my 1+ bitcoin address.😉

I am afraid in cuda 12 ccap 3.2 has been already removed, you probably need older cuda toolkit. In their release notes they wrote 3.5 and 3.7 (kepler) are abandoned, so I assume 3.2 is abandoned too (but you need to double check).

You may change that parameter in Makefile (if you build for Linux) or in Visual Studio project settings.

update:

Except one minor change whish I did not announce before (support for Segwit 3...) addresses, today I have release a new version:

v0.6.0
Added multi-gpu support, using parameter "-d all" program runs on all the available CUDA devices, so it is not necessary to split work manually anymore.

v0.6.1

v0.6.2
support for search for multiple addresses (list of addresses loaded from the file)
https://github.com/PawelGorny/WifSolverCuda/releases/tag/v0.6.2

update:

v 0.4.7
I have improved memory management, now default configuration for single rtx3090 uses less than 100MB of RAM. previous it was more than 900MB  

In the meantime I have added progress indicator, resume from status file and some other minor changes.

v 0.4.8
Support for segwit/p2sh addresses

v 0.5.0
I have changed the way how memory/data transfer is managed and if it is possible I use memory from host. It should not be a problem, even for sets with 4-8 cards on one host. Speed is improved up to 10%, but still it is good to play with number of blocks/threads/steps processed per thread.
On 3080Ti I process around 4000 MKey/s for WIF with missing beginning, I think it is a good result.

v0.5.2
I have prepared a new release, 0.5.2, it could be mini-mini-minimally better, as I decreased some unnecessary latency. But displayed speed probably will be lower - what was until now was a bit too optimistic (I was dividing work done by full seconds, when I divide by miliseconds result is closer to reality). On 3080ti I see speed +-3.830, but now we see it fluctuates every time is displayed - in old version it was 4.096 all the time.
There is also a new parameter "-v" - verbose output - to display WIF processed in status line - but as it is extra work, it slows down the process (not much but still).
And 2 new parameters "-wifStart -wifEnd" for automatic conversion of provided WIF to range start/end

v0.5.3
https://github.com/PawelGorny/WifSolverCuda/releases/tag/v0.5.3

Added support for P2WPKH addresses (bc1...)

Hello

It took me a long time to start, but I hope that now, after the first step it will be much easier. Motivated by topic https://bitcointalksearch.org/topic/m.58913560 I decided to start migrating my CPU WifSolver into GPU.
And here it is: https://github.com/PawelGorny/WifSolverCuda

I will not repeat description from ReadMe file because all the important information are there - and it is easier to update one place.

Currently it covers only needs of the aforementioned topic (and similar).
Yes, yes I know... It is a long way to Tipperary. Code maybe does not look beautiful, lot of libraries (anyway JLP rulez), but it WORKS! Probably some CUDA masters will know how to improve it - please let me know any of your ideas. I may also say that it was a painful journey in time for me, as I did not use c++ for years. But finally I am happy the first step is done.
And - what is the most important - it is the solution for the cases which cannot be solved with BitCrack (stride collides with checksum). And it is slightly faster than BitCrack - at least for the cases I tested. As it is CUDA - sky is the limit if you know how to configure a given program for your card.

TODO list is long, if you have any ideas, requests - let me know, here or on github.


edit
v 0.3.1

I have added worker for compressed address and improved general performance.
Now it is possible to work on WIFs with missing characters at the beginning (static checksum, param: -checksum) and in the middle (checksum changed by stride).
It looks like my algorithm is almost twice as fast as BitCrack, at least for the cases where BitCrack could be used.
(On my card I had 690MKeys on regular Bitcrack and 790MKeys on patched versions, my WifSolver produces 1300MKeys. For compressed WIFs where missing characters are in the middle and compression flag is impacted, speed is around 3600MKeys).


edit
v 0.4.3

I have added a small helper - WIF decoder.
Some minor changes in algorithm and program itself, performance improved, especially for compressed keys with missing characters in the middle (x3 faster now, 10.000 MKeys on my test machine, solving 19*6 missing characters in 1:10 min).
Added Makefile for linux builds.