Bitcoin Forum
March 19, 2024, 07:51:27 AM *
News: Latest Bitcoin Core release: 26.0 [Torrent]
 
   Home   Help Search Login Register More  
Pages: « 1 ... 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 [72] 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 ... 191 »
  Print  
Author Topic: Vanitygen: Vanity bitcoin address generator/miner [v0.22]  (Read 1152724 times)
Trillium
Hero Member
*****
Offline Offline

Activity: 546
Merit: 500



View Profile
September 02, 2013, 10:31:15 PM
 #1421

Quote
i am just curious how things can get stuck in such a way in an open source environment.

Because vanity gen addresses are a minor niche of cryptocoins and people would rather use their hardware to mine and make profit.

BTC:1AaaAAAAaAAE2L1PXM1x9VDNqvcrfa9He6
No Gods or Kings. Only Bitcoin
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction.
1710834687
Hero Member
*
Offline Offline

Posts: 1710834687

View Profile Personal Message (Offline)

Ignore
1710834687
Reply with quote  #2

1710834687
Report to moderator
1710834687
Hero Member
*
Offline Offline

Posts: 1710834687

View Profile Personal Message (Offline)

Ignore
1710834687
Reply with quote  #2

1710834687
Report to moderator
deepceleron
Legendary
*
Offline Offline

Activity: 1512
Merit: 1025



View Profile WWW
September 04, 2013, 10:58:51 AM
 #1422

I installed video driver Catalyst 13.8 beta and it seems to still be working with oclvanitygen on my HD5xxx, going from 11.11.
eXclusiveOR
Jr. Member
*
Offline Offline

Activity: 60
Merit: 1


View Profile
September 04, 2013, 07:06:05 PM
 #1423

I installed video driver Catalyst 13.8 beta and it seems to still be working with oclvanitygen on my HD5xxx, going from 11.11.
many posts so far have indicated that the problems are related to the actual hardware rather than to the driver, your post makes it +1  Wink
mmmerlin
Sr. Member
****
Offline Offline

Activity: 266
Merit: 250


View Profile
September 10, 2013, 12:28:19 AM
 #1424

Anyone able to explain how someone was able to mine this address: 1111111111111111111114oLvT2

Seems to be crazy hard, that's 21 1's in a row!  Shocked

Fact check: https://blockchain.info/address/1111111111111111111114oLvT2
Dabs
Legendary
*
Offline Offline

Activity: 3416
Merit: 1912


The Concierge of Crypto


View Profile
September 10, 2013, 01:43:31 AM
 #1425

Anyone able to explain how someone was able to mine this address: 1111111111111111111114oLvT2

Seems to be crazy hard, that's 21 1's in a row!  Shocked

Fact check: https://blockchain.info/address/1111111111111111111114oLvT2

That's not a "real" address.

Just like 1BitcoinEaterAddressDontSendf59kuE.

Nobody has the private keys for those two.

mmmerlin
Sr. Member
****
Offline Offline

Activity: 266
Merit: 250


View Profile
September 10, 2013, 01:57:20 AM
 #1426

Anyone able to explain how someone was able to mine this address: 1111111111111111111114oLvT2

Seems to be crazy hard, that's 21 1's in a row!  Shocked

Fact check: https://blockchain.info/address/1111111111111111111114oLvT2

That's not a "real" address.

Just like 1BitcoinEaterAddressDontSendf59kuE.

Nobody has the private keys for those two.

Thank you, a perfect explanation! (Though I do feel a bit silly now  Roll Eyes)
Trillium
Hero Member
*****
Offline Offline

Activity: 546
Merit: 500



View Profile
September 10, 2013, 03:06:34 AM
 #1427

It's important to note that searching for short addresses (<34 standard character address length) by utilising "1"*n patterns has a greater difficulty than other patterns of the same length.

I have found several hundred 31 length addresses and a few (2 or 3) 30 character addresses running my 7950 at work over a many-month long period of time.

BTC:1AaaAAAAaAAE2L1PXM1x9VDNqvcrfa9He6
mmmerlin
Sr. Member
****
Offline Offline

Activity: 266
Merit: 250


View Profile
September 10, 2013, 05:13:17 PM
 #1428

It's important to note that searching for short addresses (<34 standard character address length) by utilising "1"*n patterns has a greater difficulty than other patterns of the same length.

I have found several hundred 31 length addresses and a few (2 or 3) 30 character addresses running my 7950 at work over a many-month long period of time.

Yeah, I hadn't factored in the extra difficulty from the fact it's all 1's / is such a short address, I was just messing around on FirstBits and was shocked to see that address in use!
gadman2
Legendary
*
Offline Offline

Activity: 977
Merit: 1000



View Profile
September 10, 2013, 05:18:38 PM
 #1429

Is there a way to easily calculate the difficulty (without mining for it) through a web-app or what not?

FanEagle
Legendary
*
Offline Offline

Activity: 2800
Merit: 1112


Leading Crypto Sports Betting & Casino Platform


View Profile
September 15, 2013, 12:46:20 PM
Last edit: September 15, 2013, 08:41:55 PM by FanEagle
 #1430

oclvanitygen gives me an error while trying to use it:
"Error loading kernel file 'calc_addrs.cl': No such file or directory"
On a windows machine.

To be clear: both files, oclvanitygen and calc_addrs.cl are in the same folder

Edit: Run in administrator mode, error log

Compiling kernel, can take minutes...failure.
clBuildProgram: CL_BUILD_PROGRAM_FAILURE
Build log:
Error: Code selection failed to select: 04B3A1A0: i32 = bswap 04B3EC00

..Stake.com..   ▄████████████████████████████████████▄
   ██ ▄▄▄▄▄▄▄▄▄▄            ▄▄▄▄▄▄▄▄▄▄ ██  ▄████▄
   ██ ▀▀▀▀▀▀▀▀▀▀ ██████████ ▀▀▀▀▀▀▀▀▀▀ ██  ██████
   ██ ██████████ ██      ██ ██████████ ██   ▀██▀
   ██ ██      ██ ██████  ██ ██      ██ ██    ██
   ██ ██████  ██ █████  ███ ██████  ██ ████▄ ██
   ██ █████  ███ ████  ████ █████  ███ ████████
   ██ ████  ████ ██████████ ████  ████ ████▀
   ██ ██████████ ▄▄▄▄▄▄▄▄▄▄ ██████████ ██
   ██            ▀▀▀▀▀▀▀▀▀▀            ██ 
   ▀█████████▀ ▄████████████▄ ▀█████████▀
  ▄▄▄▄▄▄▄▄▄▄▄▄███  ██  ██  ███▄▄▄▄▄▄▄▄▄▄▄▄
 ██████████████████████████████████████████
▄▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄
█  ▄▀▄             █▀▀█▀▄▄
█  █▀█             █  ▐  ▐▌
█       ▄██▄       █  ▌  █
█     ▄██████▄     █  ▌ ▐▌
█    ██████████    █ ▐  █
█   ▐██████████▌   █ ▐ ▐▌
█    ▀▀██████▀▀    █ ▌ █
█     ▄▄▄██▄▄▄     █ ▌▐▌
█                  █▐ █
█                  █▐▐▌
█                  █▐█
▀▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▀█
▄▄█████████▄▄
▄██▀▀▀▀█████▀▀▀▀██▄
▄█▀       ▐█▌       ▀█▄
██         ▐█▌         ██
████▄     ▄█████▄     ▄████
████████▄███████████▄████████
███▀    █████████████    ▀███
██       ███████████       ██
▀█▄       █████████       ▄█▀
▀█▄    ▄██▀▀▀▀▀▀▀██▄  ▄▄▄█▀
▀███████         ███████▀
▀█████▄       ▄█████▀
▀▀▀███▄▄▄███▀▀▀
..PLAY NOW..
bernard75
Legendary
*
Offline Offline

Activity: 1316
Merit: 1003



View Profile
September 17, 2013, 06:26:40 AM
 #1431

Is there a way to easily calculate the difficulty (without mining for it) through a web-app or what not?
Is there? Or maybe data from experience for 5-7 char length?
mmmerlin
Sr. Member
****
Offline Offline

Activity: 266
Merit: 250


View Profile
September 17, 2013, 03:58:28 PM
 #1432

Is there a way to easily calculate the difficulty (without mining for it) through a web-app or what not?
Is there? Or maybe data from experience for 5-7 char length?

Well, it's obviously calculable (probalistically), so there's no need to do it from data.

The code to make this calculation has already been written and is included in VanityGen, so if you really want you could always pull that bit of the code out and make the app yourself...  Wink
gadman2
Legendary
*
Offline Offline

Activity: 977
Merit: 1000



View Profile
September 17, 2013, 04:06:49 PM
 #1433

Is there a way to easily calculate the difficulty (without mining for it) through a web-app or what not?
Is there? Or maybe data from experience for 5-7 char length?

Well, it's obviously calculable (probalistically), so there's no need to do it from data.

The code to make this calculation has already been written and is included in VanityGen, so if you really want you could always pull that bit of the code out and make the app yourself...  Wink

I'm a newb Sad Can anyone do this real quick and post the code?

mmmerlin
Sr. Member
****
Offline Offline

Activity: 266
Merit: 250


View Profile
September 17, 2013, 05:20:07 PM
 #1434

Is there a way to easily calculate the difficulty (without mining for it) through a web-app or what not?
Is there? Or maybe data from experience for 5-7 char length?

Well, it's obviously calculable (probalistically), so there's no need to do it from data.

The code to make this calculation has already been written and is included in VanityGen, so if you really want you could always pull that bit of the code out and make the app yourself...  Wink

I'm a newb Sad Can anyone do this real quick and post the code?

Lol, I don't know how "real quick" it would be, I've never looked at the code. You can always just run vanitygen with the expression as it runs that part of the code automatically and outputs the estimate. Can you just use this?
Dabs
Legendary
*
Offline Offline

Activity: 3416
Merit: 1912


The Concierge of Crypto


View Profile
September 18, 2013, 12:24:49 AM
 #1435

H:\vanitygen>vanitygen -F compressed 1
Difficulty: 1

H:\vanitygen>vanitygen -F compressed 12
Difficulty: 23
Pattern: 12

H:\vanitygen>vanitygen -F compressed 123
Difficulty: 1353
Pattern: 123

H:\vanitygen>vanitygen -F compressed 1234
Difficulty: 78508
Pattern: 1234

H:\vanitygen>vanitygen -F compressed 12345
Difficulty: 4553521
[103.63 Kkey/s][total 399360][Prob 8.4%][50% in 26.6s]

H:\vanitygen>vanitygen -F compressed 123456
Difficulty: 264104224
[79.58 Kkey/s][total 17408][Prob 0.0%][50% in 38.3min]

H:\vanitygen>vanitygen -F compressed 1234567
Difficulty: 15318045009
[79.58 Kkey/s][total 17408][Prob 0.0%][50% in 1.5d]

H:\vanitygen>vanitygen -F compressed 12345678
Difficulty: 888446610538
[79.58 Kkey/s][total 17408][Prob 0.0%][50% in 89.6d]

H:\vanitygen>vanitygen -F compressed 123456789
Difficulty: 51529903411245
[79.58 Kkey/s][total 17408][Prob 0.0%][50% in 14.2y]

H:\vanitygen>vanitygen -F compressed 123456789o
Difficulty: 2988734397852220
[85.70 Kkey/s][total 17408][Prob 0.0%][50% in 766.5y]

mmmerlin
Sr. Member
****
Offline Offline

Activity: 266
Merit: 250


View Profile
September 18, 2013, 12:34:45 AM
 #1436

H:\vanitygen>vanitygen -F compressed 1
Difficulty: 1

H:\vanitygen>vanitygen -F compressed 12
Difficulty: 23
Pattern: 12

H:\vanitygen>vanitygen -F compressed 123
Difficulty: 1353
Pattern: 123

H:\vanitygen>vanitygen -F compressed 1234
Difficulty: 78508
Pattern: 1234

H:\vanitygen>vanitygen -F compressed 12345
Difficulty: 4553521
[103.63 Kkey/s][total 399360][Prob 8.4%][50% in 26.6s]

H:\vanitygen>vanitygen -F compressed 123456
Difficulty: 264104224
[79.58 Kkey/s][total 17408][Prob 0.0%][50% in 38.3min]

H:\vanitygen>vanitygen -F compressed 1234567
Difficulty: 15318045009
[79.58 Kkey/s][total 17408][Prob 0.0%][50% in 1.5d]

H:\vanitygen>vanitygen -F compressed 12345678
Difficulty: 888446610538
[79.58 Kkey/s][total 17408][Prob 0.0%][50% in 89.6d]

H:\vanitygen>vanitygen -F compressed 123456789
Difficulty: 51529903411245
[79.58 Kkey/s][total 17408][Prob 0.0%][50% in 14.2y]

H:\vanitygen>vanitygen -F compressed 123456789o
Difficulty: 2988734397852220
[85.70 Kkey/s][total 17408][Prob 0.0%][50% in 766.5y]


Yes, that's what I meant!  Tongue
Dabs
Legendary
*
Offline Offline

Activity: 3416
Merit: 1912


The Concierge of Crypto


View Profile
September 18, 2013, 01:10:08 AM
 #1437

I just ran it. Obviously didn't finish the longer ones. My laptop is also slow as you can see, 100 Kkey/s.

Up to 1234 is almost instant. Longer prefixes take longer amounts of time. People who managed to get this working on their GPUs have faster times or less times needed to generate.

ratty
Sr. Member
****
Offline Offline

Activity: 261
Merit: 250


View Profile
September 19, 2013, 02:13:17 AM
 #1438

In case anyone works on this program again (it would be nice if it worked on modern cards again), I have a suggestion. Have it so you can put in a big list of strings and let it match on any of them. When I use oclvanityminer it appears to only grab 1 string from the list and just dial up addresses until it finds a match. But wouldn't it be better to just search for a lot of addresses at once? Or maybe that is not possible to do on a GPU?
I look at a page like this: https://vanitypool.appspot.com/availableWork and think, why can't I just wardial addresses and look for them all at the same time?
kjj
Legendary
*
Offline Offline

Activity: 1302
Merit: 1024



View Profile
September 19, 2013, 02:23:01 AM
 #1439

If you are using vanitypool, each address request has an associated secret.  The people working don't have access to the secret, but it is a factor in the resulting address, so you can only look for one at a time.

17Np17BSrpnHCZ2pgtiMNnhjnsWJ2TMqq8
I routinely ignore posters with paid advertising in their sigs.  You should too.
Trillium
Hero Member
*****
Offline Offline

Activity: 546
Merit: 500



View Profile
September 19, 2013, 03:33:32 AM
 #1440

In case anyone works on this program again (it would be nice if it worked on modern cards again), I have a suggestion. Have it so you can put in a big list of strings and let it match on any of them. When I use oclvanityminer it appears to only grab 1 string from the list and just dial up addresses until it finds a match. But wouldn't it be better to just search for a lot of addresses at once? Or maybe that is not possible to do on a GPU?


oclvanitygen -D 0:2 -i -k -o foundMANY1111111111116234234661s.txt 1111111 1tri11ium 1heartofgold 1aaaaaaaaa 1bbbbbbbbb 1cccccccccc 1ddddddddd 1eeeeeeeee 1fffffffff 1ggggggggg 1hhhhhhhhh 1iiiiiiiii 1jjjjjjjjj 1kkkkkkkkk 1lllllllll 1mmmmmmmmm 1nnnnnnnnn 1ooooooooo 1ppppppppp 1qqqqqqqqq 1rrrrrrrrr 1sssssssss 1ttttttttt 1uuuuuuuuu 1vvvvvvvvv 1wwwwwwwww 1xxxxxxxxx 1yyyyyyyyy 1zzzzzzzzz 1222222222 1333333333 1444444444 1555555555 1666666666 1777777777 1888888888 1999999999 1000000000


BTC:1AaaAAAAaAAE2L1PXM1x9VDNqvcrfa9He6
Pages: « 1 ... 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 [72] 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 ... 191 »
  Print  
 
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!