Topic: Vanitygen: Vanity bitcoin address generator/miner [v0.22] - page 13. (Read 1153691 times)

The problem is solved. De-seeded the binaries, found the place of the number, replaced it with 50 by binaries.

I'm not trying to say what's possible or not. Will you be able to compile these programs for me with the changes I need?
I do not want to plant a flame here.
If you can help, you will be plus a hundred in karma.

You're missing my point: what you want, is not possible.
If it would be possible to brute-force private keys, Bitcoin wouldn't exist. You can try this for the rest of your life, but you'll never find what you're looking for. So safe yourself the trouble and don't bother.

Yes, I need 50 number of characters
I know that the generation itself is 2 ^ 256

I need a program with this change.
Can you help?

If I understand correctly, this increases the maximum number of characters to search for from 19 to 50, correct?
If so, you can just safe yourself the trouble: it's never going to happen!
But if you still want to try, you can just as well search for "only" the first 19 characters. If there is a hit, which takes somewhere around a quintillion years, you can manually verify the remaining characters to see if they are correct too.

Hello!

I'm a beginner and I will not be able to compile program oclvanitygen.exe and vanitygen64.exe

I want to ask you to compile your program with one change

in pattern.c
=======================
      if (i == zero_prefix) {
         if (c == 0) {
            /* Add another zero prefix */
            zero_prefix++;
            if (zero_prefix > 50) {
               fprintf(stderr,
                  "Prefix '%s' is too long\n",
                  pfx);
               goto out;
            }
            continue;
         }
========================
Put the number 50 instead of 19.
if (zero_prefix> 50)

Thanks in advance.

I have now received this message with the R9 390x

D:\Desktop\Nova pasta (2)\Nova pasta\oclvanitygen>oclvanitygen.exe -d 0 -v 1LGU
Prefix difficulty:                77178 1LGU
Difficulty: 77178
Device: Hawaii
Vendor: Advanced Micro Devices, Inc. (1002)
Driver: 2639.5
Profile: FULL_PROFILE
Version: OpenCL 1.2 AMD-APP (2639.5)
Max compute units: 44
Max workgroup size: 256
Global memory: 0
Max allocation: -50331648
clCreateCommandQueue: CL_OUT_OF_HOST_MEMORY
Available OpenCL platforms:
0: [Advanced Micro Devices, Inc.] AMD Accelerated Parallel Processing
  0: [Advanced Micro Devices, Inc.] Hawaii
  1: [AuthenticAMD] AMD Ryzen 7 1800X Eight-Core Processor

I suppose you could just type in '1' and no other characters. This would be random. You can then add an argument that tells vanitygen to repeat step as well as write them in a text file.

How do I search for random private keys?
even if it is practically impossible to find I would like to test
using gpu

hey,

found this project today and tried it out.
so i ran vanitygen on the pattern "1", expecting it would write every address it generates to the out-file, what it did.

but when i tried oclvanitygen, it creates masses of addresses, but writes only very few (1 per second) to the out-file.
Whats wrong?

Hi

I don't understand what the -Z option does ?

-Z    Private key prefix in hex (vipco.in)

is it related to mining vipcoins?

Also I have question:
When vanitygen  generates a coin  address matching a ,  is it possible to limit the search within a certain range and not  the full
 256bit range of the private key ?

Any thoughts?

 Thanks for sharing.

This tool is quite amazing.

The thing i don't understand is how is even possible to get an address with a pattern we want. I didn't read into the code yet (i see is quite complicated) but, aren't private keys of two address wich differ  just by these chars occuring in the same position *piggy* or *piggp* completely different? So how is it finding those patterns so relatively fast?

If was already answered somewhere please point me to the answer, thanks.

EDIT: found some good explanation with some more details in here: https://en.bitcoin.it/wiki/Vanitygen

Yes you are misunderstanding the compressed keys.

Uncompressed key is a pair of (X,Y) EC point coordinates prefixed with 04.

Compressed key is just X coordinate of the same point prefixed with 03 if Y is odd or 02 if it is even.

Then the key is hashed as: ripemd160(sha256()), which gives you a (bitcoin) address.

You can actually hash a string of any length, so it is not evident what do you mean by "can't be expressed as ...".

Sorry to insist, but are you sure? How do compressed private keys (introduced in bitcoind/bitcoin-qt 0.6.0) fit in there? From what I've been able to read, vanitygen doesn't support them and they are actually separate from noncompressed keys (ie, can't be expressed as normal uncompressed base58 keys) - so what proportion of the 2^256 search range do they represent? Or am I totally misunderstanding compressed keys?

Many thanks for your kind words and sorry for any inconvenience, but we have no influence over those external tools. At least the one project I mentioned above now officially supports Actinium.

And I too hope that our little community will soon get more members. We hope that our transparency will attract people who are into crypto not only because of quick gains. Making money is ok and we want our users to become wealthier, but ideally they should also stay with us!

We're currently waiting for Ledger HQ's response regarding our Ledger Nano Integration.

Let's hope the best!

Best regards,

Hey Brak thanks for the hard work! I was able to salvage half my mined coins the other half (in the privkey i posted above as a bounty) were snapped up by someone else. Hopefully they join and help the community take care!

Hi,

Actinium developer here.

We have changed the prefixes for private keys between versions. Simply install the latest version (0.16.1.0) and then start the Wallet-Application (or Daemon) with option -upgradewallet to upgrade to the latest wallet version.

Regarding vanity key generators, please take into account that some of them assume certain numerical distances between public & private keys (128 numbers).
 
This was not the case with Actinium in the beginning (and several other cryptocurrencies as well). Or more specifically: the variant of the wallet that preceded Actinium, which had a different name, wasn't following this pattern. But the new versions do follow it.

I have provided a Pull Request to one of such projects named vanitygen plus. The change was accepted by their team, so please check out their releases. They might have released a new version which supports Actinium by default. If not, then you'll have to clone & compile their code from GitHub. Check their compilation docs for more info on this.

Here their repo:

https://github.com/exploitagency/vanitygen-plus

Here the pull request for Actinium:

https://github.com/exploitagency/vanitygen-plus/pull/113

To generate an valid Actinium address you can now use these flags:

vanitygen -C ACM N

You won't need to provide numbers anymore as the app will automatically set them for you.

There are also additional flags, for compressed & uncompresses privkeys, scriptkey-hashes etc.

I hope this could help you solve the problems with Actinium's address generation. In general: the keys aren't lost, but only the parsing of underlying numbers that constitute them has changed.

For further support you can join our Discord (channel #support). Welcome!

https://discord.gg/5xRppjz

Regards,

Looks like someone was able to claim the coins.

Tried the newer ACM wallet for my other coins and the privkey imported just fine, not sure what changes were made. anyways all good. enjoy the 43k coins whomever got them! trades at bitfex and tradeogre now for ~2k sats, thats like 0.8 btc worth of ACM you got if ya hodled.

Several things are wrong with your approach:
1LionKingJungle is a duplicate of 1LionKing, if it searches for the first, it includes the longer version too.
1Robotworld isn't possible, you should replace the the "l" by an uppercase: "L".

At 75 kkeys/s, it's virtually impossible to find any of the longer addresses.
When testing how long it would take to find an address, you should omit "1ant". Without the short address you'll get a realistic estimate for the next match.

One more thing: play around with the case insentive switch, you'll have much more matches.

My pattern.txt contains this:

my code

I use windows system to run the program all are working good , but it not give a output match

if I give only 1ant pattern more output on the output file , i think its not find the match in the entire given file (all pattern in the file), it search only one pattern at a time , it search first or last pattern only in the list of given pattern file.

need any match in the given list of pattern to out , because my laptop generate 75Kk/s , if i give a 10 pattern  any match found on that 75 Kk/s generated address that gets out, so the time is reduce

Thank all