Vanitygen: Vanity bitcoin address generator/miner [v0.22]

[hexafraction]

I have 5 prefix letters , what is the command line for find at least a BTC address for it ?

Um, just vanitygen 1Prefix or oclvanitygen 1Prefix?

[1714303931]

1714303931

[1714303931]

1714303931

[Monopoly]

I have 5 prefix letters , what is the command line for find at least a BTC address for it ?

Um, just vanitygen 1Prefix or oclvanitygen 1Prefix?

vanitygen 1Prefix

[Muhammed Zakir]

I have 5 prefix letters , what is the command line for find at least a BTC address for it ?

Case-sensitive prefix search:

Code:

"path\to\vanitygen.exe" 1Prefix

Case-insensitive prefix search (faster):

Code:

"path\to\vanitygen.exe" -i 1Prefix

Case-sensitive prefix search but not limited to 1 match:

Code:

"path\to\vanitygen.exe" -k 1Prefix

Case-sensitive prefix search but not limited to 1 match and saves all matches to a file:

Code:

"path\to\vanitygen.exe" -k -o anything 1Prefix

Note: If you want to save all matches to a file in the same folder Vanitygen is, specify the path to directory. Eg:- "path\to\vanitygen.exe" -k -o "path\to\anything" 1za

Edit: Searching for compressed key is faster than uncompressed key. Download Lifeboat's vanitygen. See https://bitcointalk.org/index.php?topic=301068.0. Also, see https://bitcointalk.org/index.php?topic=25804.msg10590011#msg10590011.

Case-sensitive prefix search but not limited to 1 match and saves all matches to a file (compressed):

Code:

"path\to\vanitygen.exe" -k -F compressed -o anything 1Prefix

[tspacepilot]

Could anybody post the necessary code changes to allow oclvanitygen to generate compressed and uncompressed keys simultaneously? I suspect the speed increase must be substantial

Thanks!

Your "suspicion" is misplaced. The only calculation in common that would be saved is the calculation of the x coordinate of the public key, which is just a few multiplications. Everything else, from creating the compressed public key parity, creating an address from a compressed public key and checking for the vanity match would be a completely different process.

Given that there are two bitcoin addresses per private key, that if you are iterating through private keys pseudo-randomly (i assume this is what vanitygen does, at the end of the day), it does seem that you may as well look at both the addresses each time you calculate a point on the curve for a given private key.  I recently implemented this using some code from ken sherrif's bitcoins-the-hard-way blog along with some library routines from ecdsa module in python and I could basically as step one create a seed; step 2, get a point on the curve; and from there the process forks and you'd have two methods of generating a pubkey (one with and one without the y part).  Anyway, it seems to me like there could be some value in looking at both addresses once you have a point on the curve.

Code:

def pubKeyToAddr(s):
  ripemd160 = hashlib.new('ripemd160')
  ripemd160.update(hashlib.sha256(s.decode('hex')).digest())
  return base58CheckEncode(0, ripemd160.digest())

def privateKeyToPublicKey(s, compressed=False):
  sk = ecdsa.SigningKey.from_string(s.decode('hex'), curve=ecdsa.SECP256k1)
  vk = sk.verifying_key

  if compressed:
    from ecdsa.util import number_to_string
    order = vk.pubkey.order
    x_str = number_to_string(vk.pubkey.point.x(), order).encode('hex')
    sign = '02' if vk.pubkey.point.y() % 2 == 0 else '03'
    return (sign+x_str)
  else:
    return ('\04' + vk.to_string()).encode('hex')


private_key = ''.join(['%x' % random.randrange(16) for x in range(0,64)])
print "A private key: ", private_key
public_key = privateKeyToPublicKey(private_key)
cpublic_key = privateKeyToPublicKey(private_key,compressed=True)
print "The uncompressed bitcoin address: ", pubKeyToAddr(public_key)
print "The bitcoin address: ", pubKeyToAddr(cpublic_key)

[Monopoly]

I have 5 prefix letters , what is the command line for find at least a BTC address for it ?

Case-sensitive prefix search:

Code:

"path\to\vanitygen.exe" 1Prefix

Case-insensitive prefix search (faster):

Code:

"path\to\vanitygen.exe" -i 1Prefix

Case-sensitive prefix search but not limited to 1 match:

Code:

"path\to\vanitygen.exe" -k 1Prefix

Case-sensitive prefix search but not limited to 1 match and saves all matches to a file:

Code:

"path\to\vanitygen.exe" -k -o anything 1Prefix

Note: If you want to save all matches to a file in the same folder Vanitygen is, specify the path to directory. Eg:- "path\to\vanitygen.exe" -k -o "path\to\anything" 1za

Edit: Searching for compressed key is faster than uncompressed key. Download Lifeboat's vanitygen. See https://bitcointalk.org/index.php?topic=301068.0. Also, see https://bitcointalk.org/index.php?topic=25804.msg10590011#msg10590011.

Case-sensitive prefix search but not limited to 1 match and saves all matches to a file (compressed):

Code:

"path\to\vanitygen.exe" -k -F compressed -o anything 1Prefix

What are command lines for oclvanitygen ? does oclvanitygen use graphic card for computing ? and this is faster than vanitygen ?

[Monopoly]

Can I use vanitygen to find someone else's private key from their bitcoin address?

Yes.  Vanitygen is a cryptographic brute-forcing application, and can be used to search for a complete address.  However, you will be unhappy with the amount of time required for it to find a match.

How find a privkey for a complete address ?
i use

Code:

"path\to\vanitygen.exe" bitcoinaddress 

but see error the address is too long .

[TheRealSteve]

How find a privkey for a complete address ?
i use

Code:

"path\to\vanitygen.exe" bitcoinaddress 

but see error the address is too long .

See how the bit you quoted says 'unhappy'?  That's a bit of an understatement.. see: https://en.bitcoin.it/wiki/Vanitygen#Use_of_vanitygen_to_try_to_attack_addresses

That said - yes, there's a limit on the length as the vanity cannot include the error correction portion of the address, so you'd have to feed it the address minus the error correction portion.
https://en.bitcoin.it/wiki/Technical_background_of_version_1_Bitcoin_addresses

But again, see the aforementioned.

[Timelord2067]

Hi there,

I saw on the opening page

try "vanitygen -r [Ww]iLL"

(no need to use [Ii] and/or [Ll] because l (small L) and I are not in base58, I think.

EDIT: found one in seconds: 1NZED7AR8hbwiLLkTWwXgZvM89FZqFiXnj

Would that mean I can't put

Code:

vanitygen -f work.txt -o dump.txt

( work.txt ) Timelord

 into a search only TimeLord ?

And also, If I'm looking for Timelord2067 I'd actually have to put TimeLord2o67 (small "oh' Oscar after the "2")

Thanks for looking.

[tspacepilot]

Hi there,

I saw on the opening page

try "vanitygen -r [Ww]iLL"

(no need to use [Ii] and/or [Ll] because l (small L) and I are not in base58, I think.

EDIT: found one in seconds: 1NZED7AR8hbwiLLkTWwXgZvM89FZqFiXnj

Would that mean I can't put

Code:

vanitygen -f work.txt -o dump.txt

( work.txt ) Timelord

 into a search only TimeLord ?

And also, If I'm looking for Timelord2067 I'd actually have to put TimeLord2o67 (small "oh' Oscar after the "2")

Thanks for looking.

Indeed, you read it correctly, there's no lower case "l" in bitcoin addresses nor zeros nor upper case O.  See here for more background on it: https://en.bitcoin.it/wiki/Base58Check_encoding

[Timelord2067]

Hi there,

I saw on the opening page

try "vanitygen -r [Ww]iLL"

(no need to use [Ii] and/or [Ll] because l (small L) and I are not in base58, I think.

EDIT: found one in seconds: 1NZED7AR8hbwiLLkTWwXgZvM89FZqFiXnj

Would that mean I can't put

Code:

vanitygen -f work.txt -o dump.txt

( work.txt ) Timelord

 into a search only TimeLord ?

And also, If I'm looking for Timelord2067 I'd actually have to put TimeLord2o67 (small "oh' Oscar after the "2")

Thanks for looking.

Indeed, you read it correctly, there's no lower case "l" in bitcoin addresses nor zeros nor upper case O.  See here for more background on it: https://en.bitcoin.it/wiki/Base58Check_encoding

Hey thanks for that - much appreciated.

Will try TimeLord first then TimeLord2o67 later (I've got all the time in the world )

[RustyNomad]

Is there anybody working on a multi-signature version of VanityGen?

[Monopoly]

How find a privkey for a complete address ?
i use

Code:

"path\to\vanitygen.exe" bitcoinaddress 

but see error the address is too long .

See how the bit you quoted says 'unhappy'?  That's a bit of an understatement.. see: https://en.bitcoin.it/wiki/Vanitygen#Use_of_vanitygen_to_try_to_attack_addresses

That said - yes, there's a limit on the length as the vanity cannot include the error correction portion of the address, so you'd have to feed it the address minus the error correction portion.
https://en.bitcoin.it/wiki/Technical_background_of_version_1_Bitcoin_addresses

But again, see the aforementioned.

I don't understand your explanations very well .... my question is what are the command lines for finding privkey for a complete address ?

I have a quantum computer that capable of looking through 1000 billion keys per micro second. i want to attack this address 1Cii2e2wGejfrRHRCbaYTzmyPLpJwGvsgD what are the Instructions at vanitygen ?

[TheRealSteve]

I have a quantum computer that capable of looking through 1000 billion keys per micro second. i want to attack this address 1Cii2e2wGejfrRHRCbaYTzmyPLpJwGvsgD what are the Instructions at vanitygen ?

Closest you'll get with unmodified builds is:

Code:

vanitygen.exe -k -o output.txt 1Cii2e2wGejfrRHRCbaYTzmyPLp

Technically that's missing the last 3 characters 'JwG' (the other 4 are the checksum), but one out of every 200,000 addresses or so in the resulting output.txt file should be correct.  Have fun with your quantum computer.  You should have gone with more ridiculous numbers, though.. it would still take 3.3E24 years on average.

[ChetnotAtkins]

tspacepilot it seems this is exactly what I was looking for. Could you tell me where to add the piece you posted?

Thanks!

[Timelord2067]

...blah

I don't understand your explanations very well .... my question is what are the command lines for finding privkey for a complete address ?

I have a quantum computer that capable of looking through 1000 billion keys per micro second. i want to attack this address 1Cii2e2wGejfrRHRCbaYTzmyPLpJwGvsgD what are the Instructions at vanitygen ?

You know there's no BTC in this wallet https://blockchain.info/address/1Cii2e2wGejfrRHRCbaYTzmyPLpJwGvsgD (and it only every had about $50 at most ever?)

With a Quantum Computer, you'd be better off mining BitCoin blocks.  1,000 Billion is a Trillion BTW, thought you'd like to know that and a micro second... Well.... that's just silly....

[Kangaderoo]

tspacepilot it seems this is exactly what I was looking for. Could you tell me where to add the piece you posted?

Thanks!

Nice topic to research.
the mayor changes will only have to be made in the function:
void *vg_thread_loop(void *arg).
In stead of the two options compress and uncompressed a combined flag could to be introduced/added as a valid command line flag.
When combined is active, only calculate (uncompressed) EC points for half the buffer.
Fill the other half with the equivalent compressed points.
for all other calculations use same flag to switch halfway between postprocessing (un)compressed settings.
The final address checks can stay the same.
In theory.... at least.

It will take a bit more work than just porting the example python code........

[hexafraction]

You know there's no BTC in this wallet https://blockchain.info/address/1Cii2e2wGejfrRHRCbaYTzmyPLpJwGvsgD (and it only every had about $50 at most ever?)

With a Quantum Computer, you'd be better off mining BitCoin blocks.  1,000 Billion is a Trillion BTW, thought you'd like to know that and a micro second... Well.... that's just silly....

No, there's no known quantum algorithm for solving a SHA256 hash. It would also be useless for address reversal (except possibly with reused addresses) since the pubkey isn't known, just the hash, until the first spend from said address. I'm also not sure if EC is breakable on a quantum computer (Shor's algorithm has a discrete log variant but I'm not sure if it's applicable here)

[Muhammed Zakir]

I have 5 prefix letters , what is the command line for find at least a BTC address for it ?

Case-sensitive prefix search:

Code:

"path\to\vanitygen.exe" 1Prefix

Case-insensitive prefix search (faster):

Code:

"path\to\vanitygen.exe" -i 1Prefix

Case-sensitive prefix search but not limited to 1 match:

Code:

"path\to\vanitygen.exe" -k 1Prefix

Case-sensitive prefix search but not limited to 1 match and saves all matches to a file:

Code:

"path\to\vanitygen.exe" -k -o anything 1Prefix

Note: If you want to save all matches to a file in the same folder Vanitygen is, specify the path to directory. Eg:- "path\to\vanitygen.exe" -k -o "path\to\anything" 1za

Edit: Searching for compressed key is faster than uncompressed key. Download Lifeboat's vanitygen. See https://bitcointalk.org/index.php?topic=301068.0. Also, see https://bitcointalk.org/index.php?topic=25804.msg10590011#msg10590011.

Case-sensitive prefix search but not limited to 1 match and saves all matches to a file (compressed):

Code:

"path\to\vanitygen.exe" -k -F compressed -o anything 1Prefix

What are command lines for oclvanitygen ? does oclvanitygen use graphic card for computing ? and this is faster than vanitygen ?

Commands are same except you will have to select OpenCL device using -D command. If you have only one OpenCL device and you did not specify, Oclvanitygen automatically chooses the device. Else, it will give you an error.

Eg:-

Code:

"path\to\oclvanitygen.exe" -D 0:0 -k -o anything 1Prefix

-snip-

 -snip-

[deepceleron]

Given that there are two bitcoin addresses per private key, that if you are iterating through private keys pseudo-randomly (i assume this is what vanitygen does, at the end of the day), it does seem that you may as well look at both the addresses each time you calculate a point on the curve for a given private key...

Only the initial key position is random, then vanitygen just increments the key by one for each additional address search. There is little cost to be saved there.

[wicks]

No matter what I try, I couldnt make it work with OpenCL on my computer.