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

If vanitygen.exe is on your path and your current directory isn't the dir where vanitygen.exe is located, then the file will be saved to the current directory instead.

It should get written away to the same folder as the vanitygen executable.

great,tnx
where the txt is saved?

Use -k and you always use -o to save the addresses and private keys generated to that file.

Eg:- vanitygen.exe -k 1MZakir -o asd.txt

Hi,
How can i "loop" the generator so he can create more and more addresses for me when he finished the first one? instead of checking the machine each hour/day to see if its over and then press "enter" again..

Tnx!

Cd worked thank you!

You have to make sure that oclvanitygen is being run with its folder as the 'working directory'.  It's best to open a command line window (cmd), make sure you're in the vanitygen folder ('cd' on over if needed), and then run it / any prepared batch file you made.
If you're using a desktop shortcut, right-click it, choose properties, and make sure that the "Start in" field has the vanitygen folder.

If you need further assistance on this, detail exactly how and what you run so we can give a more targeted approach

Guys i have this error when i run oclvanitygen64.exe -v -i -D 0:0 1myaddress

But they are in the same folder!
How can i fix?
Win 8.1

thanks!

Edit: Dogecoin's had some changes - updated link to new correct line number.

for an arbitrary altcoin, how do i determine the -X value (address family, eg: dogecoin is value 30)
to use in vanitygen ?
is there a standard place in the coin's source code?

I Guess what you are looking for kind of kills the purpose of the ECDSA algorithm.
The algorithms to find ECSDA points for addition and multiplications are not so straightforward to find points that are 'close'.
The result is also hashed with SHA256, creating a big change in the result for each minor change.
All the code you need for your problem is available, its called vanitygen, unfortunately >99% of the solutions/time is waisted.......

Helou,

Could someone give some coding support for vanitygen (oclvanitygen)?
I'm using oclvanitygen (GPU) with Linux and I could compile a new version from source code.

So I need some advices for my "problem".
When oclvanitygen found ex "1GeGeA" pattern with -k option (Keep pattern and continue search after finding a match), now it's generate a new random seed and start again from different point.
I need to modify the source code that way, when it found a pattern, it does not generate a random seed value, only increase X value amount to "secret exponent value". So the starting point is quite near the previous one (diff X).

example:
Difficulty: 259627881
Pattern: 1GeGeA                                                               
Address: 1GeGeAAzBwzcPpCiMdGSURUBxLdSW3PFV3
Privkey: 5JpiwYTQZmKCtfumGP1wsZuZdfEvEBqSiEojSHh6QUPdM1a1pgV

This Privkey is hex and dec (=secret exponent):
84b05b4fff33236fe6f1e8d886d94fd8f4498d71ea0420d1902c90d9bf246bd5
60016891312021175057331173446731109351198050644514140408495846939253006429141

If X value is 12345678, next starting point is:
60016891312021175057331173446731109351198050644514140408495846939253018774819
Address: 1FwwNCewMPk8RsnzA528QSse3NjXuV6745
Privkey: 5JpiwYTQZmKCtfumGP1wsZuZdfEvEBqSiEojSHh6QbXg96Bfepr

Could someone please give piece of code for me? I'm quite noob to code.
I have look the source code, but it's quite difficult to understand.

Thank you very much!

And it doesn't even matter if I replace it with ptrp = &itemp->ai_right;

It works either way.

Thanks again.

I disagree.

	-r (1a|1ab|1abc)	1a 1ab 1abc	1a	ocl -r	ocl 1a 1ab 1abc
complains about overlap	no	yes	no	n/a	yes
finds 1a	yes	yes	yes	n/a	yes
finds 1ab	yes	yes	yes	n/a	yes
finds 1abc	yes	yes	yes	n/a	yes
finds 1ax	yes	yes	yes	n/a	yes
Kkeys/s (example)	~150	~220	~220	n/a	~2800

So at the benefit of it not complaining about overlap, you lose a lot of performance compared to just the CPU version alone - never mind compared against the OpenCL version (which doesn't support regex).  And that would be the only benefit, as functionally it's still the exact same.  The only time there's a functional difference is if the prefixes are provided in reduced specificity order, e.g. '1abc 1ab 1a' - which is something a preparser could easily deal with before sending them to vanitygen.

 

It works if I do this:


remove return vp;
and replace it with ptrp = &itemp->ai_left;

Thanks again for the hint, TheRealSteve! You really are The Real Steve! 

Thanks, I tried that, removing the part and changing either to >= or <=, but it doesn't work.

It looks like the program isn't even starting the search cycle anymore.

I don't think this is the way to go about it - preparsing the user's list, feeding it into vanitygen, filtering afterward being more appropriate - but alright.
In pattern.c, look for vg_prefix_avl_insert.  There's a comparison function in there that compares prefixes and inserts them in appropriate spots.  There's an edge condition where the two are considered equal, the 'else [...] return vp;' part.  You want to eliminate that.  Should be as simple as changing one of the comparisons from '>' or '<' to '>=' or '<=' respectively.
Not sure if that breaks anything, but give it a shot.

---

It already will.  See earlier example where feeding it '1a 1ab' has it drop '1ab' from the prefixes list, but will still happily return '1ab*' results (along with '1aa*', '1ac*', '1ad*', etc.) because it still matches '1a'.

Thanks, so it requires regex.

What if I don't want to use regex, but rather adjust vanitygen so that it doesn't ignore overlaps?

Try with -r command. It is working for me.


I tried with these but vanitygen is only finding for 5 keywords not 6 but it is better than nothing.