Bitcoin Forum
October 21, 2018, 07:20:53 AM *
News: Make sure you are not using versions of Bitcoin Core other than 0.17.0 [Torrent], 0.16.3, 0.15.2, or 0.14.3. More info.
 
   Home   Help Search Donate Login Register  
Pages: « 1 ... 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 [176] 177 178 179 180 181 »
  Print  
Author Topic: Vanitygen: Vanity bitcoin address generator/miner [v0.22]  (Read 1113188 times)
7Seas
Newbie
*
Offline Offline

Activity: 47
Merit: 0


View Profile
March 09, 2018, 04:17:41 PM
 #3501

Any new developments on any projects like this like with regex on GPU?

I get 100mkey on a 1080ti if anyone wanted to know
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction. Advertise here.
ken3go
Newbie
*
Offline Offline

Activity: 6
Merit: 0


View Profile
March 15, 2018, 06:10:44 AM
 #3502

noob here. I'm confused which generator I should be running.  I need to generate only BTC addresses.  I've used what I believed to be samr7's 0.22 code but now I'm using exploitagency's vanity gen plus 1.52 (GPU version oclvanitygen).  I have used both to varying degrees of success, but they usually crash after a few days (I'll post those issues later, once I figure out where to post them!).  Thanks for the help.

https://github.com/samr7/vanitygen
this 0.22 thread?

https://github.com/exploitagency/vanitygen-plus/releases
https://bitcointalk.org/index.php?topic=1777048.0
vanity gen plus 1.52 thread

and I think axerunner is working on yet another fork
https://github.com/AXErunners/vanitygen-plus

bbopa637
Member
**
Offline Offline

Activity: 107
Merit: 10

PC repair master, engeneer, radioamateur


View Profile WWW
March 15, 2018, 10:21:32 AM
 #3503

hi dears I have a questions
1)Can the program in Windows generate 100 addresses with 1bbopa**** and automatically import all of them in to my wallet.dat file??
2)Can the program generate 100 random addresses beginning with 1**** and automatically import them into my wallet.dat file?
and how can I do that?
3)if no 1) and 2) can be done with program, then how can I generate 1000 1bbopa**** addresses in windows and how can i search into them whatererv I want to import in my wallet.dat manually?

LoyceV
Legendary
*
Offline Offline

Activity: 1274
Merit: 2138


Self-made Legendary!


View Profile WWW
March 15, 2018, 10:32:03 AM
 #3504

hi dears I have a questions
1)Can the program in Windows generate 100 addresses with 1bbopa**** and automatically import all of them in to my wallet.dat file??
2)Can the program generate 100 random addresses beginning with 1**** and automatically import them into my wallet.dat file?
and how can I do that?
I see no reason to do 2: Bitcoin Core can generate random addresses on it's own.

Generating 100+ addresses is easy: just add these options to your command line:
Code:
-k            Keep pattern and continue search after finding a match
-o <file>     Write pattern matches to <file>
Depending on your hardware it can take a few days to find them.

To import them in Bitcoin Core, see here.

davoski
Newbie
*
Offline Offline

Activity: 11
Merit: 0


View Profile
March 16, 2018, 07:25:45 PM
 #3505

I’ve always got mine searching for >100 addresses. I’ve never noticed a speed decline.
I've just tested it again (GeForce 840M):
400,000 prefixes: 5Mkey/s


I got a limitation for git bash on Windows. How did you manage to input such long command?
LoyceV
Legendary
*
Offline Offline

Activity: 1274
Merit: 2138


Self-made Legendary!


View Profile WWW
March 16, 2018, 07:44:42 PM
 #3506

How did you manage to input such long command?
Don't use the command line to add prefixes, just use an input file:
Code:
-f <file>     File containing list of patterns, one per line
              (Use "-" as the file name for stdin)
If you use a long list of prefixes and search case insensitive, your available RAM may become the limitation.

davoski
Newbie
*
Offline Offline

Activity: 11
Merit: 0


View Profile
March 17, 2018, 09:13:22 AM
 #3507

This way doesn't check all instances at once. Checked with easy prefix list of a few - it prints the first line's prefix only.
LoyceV
Legendary
*
Offline Offline

Activity: 1274
Merit: 2138


Self-made Legendary!


View Profile WWW
March 17, 2018, 11:33:52 AM
 #3508

This way doesn't check all instances at once. Checked with easy prefix list of a few - it prints the first line's prefix only.
It works fine for me. If you post your sample prefix list and the command line options you used, I'll have a look.

davoski
Newbie
*
Offline Offline

Activity: 11
Merit: 0


View Profile
March 18, 2018, 04:08:45 PM
 #3509

Command:
Code:
vanitygen.exe -C BTC -k -o results2.txt -i -r -f addr.txt

addr.txt
Code:
1AA
1BB

result2.txt
http://prntscr.com/isvnsv

git bash window:
http://prntscr.com/isvnyz

Thanks!
LoyceV
Legendary
*
Offline Offline

Activity: 1274
Merit: 2138


Self-made Legendary!


View Profile WWW
March 18, 2018, 04:15:23 PM
 #3510

Can you try it with less options to start with?
Code:
./vanitygen -f addr.txt -k # or the .exe alternative of course)
I've used several variations on this, and they work fine. Flags -r and -C don't work for me, so I omit them.

charlie137
Full Member
***
Offline Offline

Activity: 392
Merit: 118


💢 🤘🔪 🔥


View Profile WWW
March 19, 2018, 06:39:24 AM
 #3511

is there a solution for high sierra without cuda drivers?) can't compile current https://github.com/exploitagency/vanitygen-plus

/__      ___ (  /    
\\--`-'-|`---\\ |      AXErunners
 |' _/   ` __/ / 
 '._  W    ,--'     
    |_:_._/
starmyc
Member
**
Offline Offline

Activity: 193
Merit: 85

Software engineer


View Profile WWW
March 20, 2018, 05:50:20 AM
 #3512

Does the vanitygen searches for each prefix digit 1 by 1 or the entire prefix, I'm trying to see how does the vanitygen does its searches.

vanitygen has its source code available to understand how it works: https://github.com/samr7/vanitygen
In short, it generate a random private key, from which it will generate a batch of parameters to get a list of public keys that it will hash using sha256 & ripemd160 according to the Bitcoin protocol, and if address matches pattern, it stops. If not, it continues, regenerating a new private key once a while.
It can not search 1 by 1 because of the nature of the hashing algorithm.

Software engineer.
Tip me if you find my help useful: 3QBRMM2CLUTd7hqL4T9Ja2wy6B1VkbXyZ3
ken3go
Newbie
*
Offline Offline

Activity: 6
Merit: 0


View Profile
March 24, 2018, 04:38:14 AM
 #3513

My searches usually error out after 7 days or so of running at 16Mkeys/sec (~12 quadrillion tries).   Are there settings that reduce the amount of GPU that is being used -- maybe it is busting the buffer ("out of resources")?  What does the "grid" attribute do?  I've tried without it, at 1024x1024, and 2048x2048.  Doesn't appear to make a difference.  Any ideas? Thanks.

clWaitForEvents(NDRange,1): CL_OUT_OF_RESOURCES
clEnqueueMapBuffer(4): CL_INVALID_COMMAND_QUEUE
ERROR: Could not map row buffer for slot 1
ERROR: allocation failure?


---------------------
c:\xxx>oclvanitygen.exe -D 0:0,grid=2048x2048 -v -k -f 2patterns.txt -o 2matches.txt
Loading Pattern #3: 1ZZZZZZZ
Prefix difficulty:       51529903411245 1XXXXXXX
Prefix difficulty:       51529903411245 1YYYYYYY
Prefix difficulty:       51529903411245 1ZZZZZZZ
Next match difficulty: 17176634470415 (3 prefixes)
Device: GeForce GTX 680M
Vendor: NVIDIA Corporation (10de)
Driver: 369.09
Profile: FULL_PROFILE
Version: OpenCL 1.2 CUDA
Max compute units: 7
Max workgroup size: 1024
Global memory: -2147483648
Max allocation: 536870912
OpenCL compiler flags: -DPRAGMA_UNROLL -cl-nv-verbose
Loading kernel binary 04c59513592276694f1b58b9124bba9c.oclbin
Grid size: 2048x2048
Modular inverse: 4096 threads, 1024 ops each
Using OpenCL prefix matcher
GPU idle: 2.75%
[16.00 Mkey/s][total 11653961744384][Prob 49.3%][50% in 4.4h]                  clWaitForEvents(NDRange,1): CL_OUT_OF_RESOURCES
clEnqueueMapBuffer(4): CL_INVALID_COMMAND_QUEUE
ERROR: Could not map row buffer for slot 1
ERROR: allocation failure?
c:\xxx>
---------------------
LoyceV
Legendary
*
Offline Offline

Activity: 1274
Merit: 2138


Self-made Legendary!


View Profile WWW
March 24, 2018, 07:58:21 AM
 #3514

My searches usually error out after 7 days or so of running at 16Mkeys/sec (~12 quadrillion tries).
If you just restart it, nothing is lost. It just makes a clean random start at another point than where you started before.

Quote
Are there settings that reduce the amount of GPU that is being used
You can reduce the number of threads it uses:
Code:
./oclvanitygen -t 10 1testt
Difficulty: 15318045009
[868.99 Kkey/s][total 34037760][Prob 0.2%][50% in 3.4h]
I highly doubt this will help though: it slows down my system just as much as when I run oclvanitygen at full speed. Unless your "out of resources" means out of memory, in that case less threads could help.

Alternative: set it to save results to a file, and set it to restart after it crashes.

renggileh
Newbie
*
Offline Offline

Activity: 280
Merit: 0


View Profile
March 24, 2018, 11:57:33 PM
 #3515

I got everything running. I must have installed SDK v2.4 incorrectly, maybe skipped a step. Re-installation fixed the issue.
./oclvanitygen produced 25 Mkeys/s on the GPU. Thats like 200x more key searches than on my CPU.   Shocked
It took about 8 hours to find 1+6 '1abcdef'. How much longer would it take to find 1+7 or 1+8?
LoyceV
Legendary
*
Offline Offline

Activity: 1274
Merit: 2138


Self-made Legendary!


View Profile WWW
March 25, 2018, 07:51:47 AM
 #3516

It took about 8 hours to find 1+6 '1abcdef'. How much longer would it take to find 1+7 or 1+8?
Each extra character makes it 58 times more difficult to find.
Note that starting with a Capital can be 58 times faster (depending on which character you use): 1Abcdef or 1ABCDEF are much faster than 1abcdef.
For general use: try to search for a long line of prefixes at once, that increases your odds of finding one.

Blue Tyrant
Copper Member
Member
**
Offline Offline

Activity: 70
Merit: 62

IOS - The secure, scalable blockchain


View Profile
March 25, 2018, 10:01:24 AM
 #3517

Each extra character makes it 58 times more difficult to find.
Note that starting with a Capital can be 58 times faster (depending on which character you use): 1Abcdef or 1ABCDEF are much faster than 1abcdef.

Just two questions about the two points:

  • Why is it 58 exactly? My guess would be: is it something like 26 +26+ 10 = 62 (alphabet sets in caps and regular making the 26 each and the 10 being the number of numbers zero to nice) minus four illegal characters?
  • Why are capital letters easier to find as compared to regular numbers and what's like the "math" behind it?

LoyceV
Legendary
*
Offline Offline

Activity: 1274
Merit: 2138


Self-made Legendary!


View Profile WWW
March 25, 2018, 10:27:01 AM
 #3518

  • Why is it 58 exactly? My guess would be: is it something like 26 +26+ 10 = 62 (alphabet sets in caps and regular making the 26 each and the 10 being the number of numbers zero to nice) minus four illegal characters?
Correct: 123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz makes 58 characters.

Quote
Why are capital letters easier to find as compared to regular numbers and what's like the "math" behind it?
Unfortunately, I don't know exactly. For whatever reason, some prefixes are more likely than others.

Not all Capitals are faster than their lower case equivalent. For instance, 1Zebra isn't faster than 1zebra.
It becomes more interesting when searching for "1":
11ebra takes the same amount of time, 111bra too, but 1111ra takes 58 times longer (but just as long as 11111a and 111111).[/list]

Blue Tyrant
Copper Member
Member
**
Offline Offline

Activity: 70
Merit: 62

IOS - The secure, scalable blockchain


View Profile
March 25, 2018, 10:38:56 AM
 #3519

    Is Vanitygen used by bitcoin-payment-processors (like Coinpayments, Bitpay or custom) in backend of websites?
    I mean is it used for generating addresses?

    For the first question, no it's not used by them. Most payment processors don't use any vanity addresses. The answer to your second question would be yes, it is used to generate addresses but a special type vanity addresses. Well not exactly "special" per se but they are addresses which have your (where you stands for the person generating the addresses) choice of word, text, characters used. Say I want my address to start with 1tyrant so it "looks" better.

    Basically it's used to make aesthetically better "looking" addresses. There's no other difference apart from that. You can use it for branding for example or so people recognise it. For example Atriz uses a 1atriz address, Darkstar has if I'm not wrong 1darkstr or something similar. People recongise those addresses quickly as compared to random ones which are hard to remember

    Unfortunately, I don't know exactly. For whatever reason, some prefixes are more likely than others.

    Not all Capitals are faster than their lower case equivalent. For instance, 1Zebra isn't faster than 1zebra.
    It becomes more interesting when searching for "1":
    11ebra takes the same amount of time, 111bra too, but 1111ra takes 58 times longer (but just as long as 11111a and 111111).[/list]

    Hmm, I'm guessing this more of a practical real life data rather than actual theoretical analysis?

    LoyceV
    Legendary
    *
    Offline Offline

    Activity: 1274
    Merit: 2138


    Self-made Legendary!


    View Profile WWW
    March 25, 2018, 10:51:46 AM
     #3520

    Hmm, I'm guessing this more of a practical real life data rather than actual theoretical analysis?
    Yes. The theoretical answer must be somewhere within the hashing algorithm, but that's beyond my understanding.

    Pages: « 1 ... 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 [176] 177 178 179 180 181 »
      Print  
     
    Jump to:  

    Sponsored by , a Bitcoin-accepting VPN.
    Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!