Bitcoin Forum
September 21, 2019, 12:19:12 PM
 News: Latest Bitcoin Core release: 0.18.1 [Torrent]
 Home Help Search Login Register More
 Pages: 1 ... 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 123 124 125 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 ... 185
hexafraction
Sr. Member

Offline

Activity: 378
Merit: 250

Tips welcomed: 1CF4GhXX1RhCaGzWztgE1YZZUcSpoqTbsJ

 August 03, 2015, 10:21:46 PM

I might be completely wrong here, but isn't the -O3 just going to build the program in parallel?  I guess I thought the wiki wasn't referring to optimizing the build process itself, but to optimizing the built binary for working on some harware or another.  Please correct me if I'm wrong!

No, that's -j2 (or some other number) passed to make. -O3 means optimization level 3 (highest performance). When you add it to CFLAGS or CXXFLAGS and then run ./configure, the makefile will contain -O3 for all compiler steps. Thus the compiler will be called with -O3 and thus every compilation unit/source file will be compiled with maximum optimizations.

Thanks, I'll look at the Makefile that I downloaded from github and see what's going on in there with respect to CFLAGS/CXXFLAGS.

EDIT:

This is the top of the default Makefile, looks like I'm okay if that's the only optimizations they're referring to in the wiki:

Code:
CFLAGS=-ggdb -O3 -Wall

Yep, it looks like it's being fully optimized. I'm not sure why -ggdb is included; debug builds usually have poorer performance. -ggdb should be removed and the final executable tested.

I have recently become active again after a long period of inactivity. Cryptographic proof that my account has not been compromised is available.
1569068352
Hero Member

Offline

Posts: 1569068352

Ignore
 1569068352

1569068352
 Report to moderator
1569068352
Hero Member

Offline

Posts: 1569068352

Ignore
 1569068352

1569068352
 Report to moderator
1569068352
Hero Member

Offline

Posts: 1569068352

Ignore
 1569068352

1569068352
 Report to moderator
Advertised sites are not endorsed by the Bitcoin Forum. They may be unsafe, untrustworthy, or illegal in your jurisdiction. Advertise here.
1569068352
Hero Member

Offline

Posts: 1569068352

Ignore
 1569068352

1569068352
 Report to moderator
1569068352
Hero Member

Offline

Posts: 1569068352

Ignore
 1569068352

1569068352
 Report to moderator
1569068352
Hero Member

Offline

Posts: 1569068352

Ignore
 1569068352

1569068352
 Report to moderator
tspacepilot
Legendary

Offline

Activity: 1456
Merit: 1053

I may write code in exchange for bitcoins.

 August 03, 2015, 10:26:32 PM

I might be completely wrong here, but isn't the -O3 just going to build the program in parallel?  I guess I thought the wiki wasn't referring to optimizing the build process itself, but to optimizing the built binary for working on some harware or another.  Please correct me if I'm wrong!

No, that's -j2 (or some other number) passed to make. -O3 means optimization level 3 (highest performance). When you add it to CFLAGS or CXXFLAGS and then run ./configure, the makefile will contain -O3 for all compiler steps. Thus the compiler will be called with -O3 and thus every compilation unit/source file will be compiled with maximum optimizations.

Thanks, I'll look at the Makefile that I downloaded from github and see what's going on in there with respect to CFLAGS/CXXFLAGS.

EDIT:

This is the top of the default Makefile, looks like I'm okay if that's the only optimizations they're referring to in the wiki:

Code:
CFLAGS=-ggdb -O3 -Wall

Yep, it looks like it's being fully optimized. I'm not sure why -ggdb is included; debug builds usually have poorer performance. -ggdb should be removed and the final executable tested.

Thanks for the tip, I'll remove the debugger flag and rebuild.  Cheers!

EDIT: that actually does appear to have made a small difference, but to be honest I think it's in the margin of error (10Kkeys/s or so) since I'm doing other things on this computer at the same time.
hexafraction
Sr. Member

Offline

Activity: 378
Merit: 250

Tips welcomed: 1CF4GhXX1RhCaGzWztgE1YZZUcSpoqTbsJ

 August 03, 2015, 10:33:23 PM

I might be completely wrong here, but isn't the -O3 just going to build the program in parallel?  I guess I thought the wiki wasn't referring to optimizing the build process itself, but to optimizing the built binary for working on some harware or another.  Please correct me if I'm wrong!

No, that's -j2 (or some other number) passed to make. -O3 means optimization level 3 (highest performance). When you add it to CFLAGS or CXXFLAGS and then run ./configure, the makefile will contain -O3 for all compiler steps. Thus the compiler will be called with -O3 and thus every compilation unit/source file will be compiled with maximum optimizations.

Thanks, I'll look at the Makefile that I downloaded from github and see what's going on in there with respect to CFLAGS/CXXFLAGS.

EDIT:

This is the top of the default Makefile, looks like I'm okay if that's the only optimizations they're referring to in the wiki:

Code:
CFLAGS=-ggdb -O3 -Wall

Yep, it looks like it's being fully optimized. I'm not sure why -ggdb is included; debug builds usually have poorer performance. -ggdb should be removed and the final executable tested.

Thanks for the tip, I'll remove the debugger flag and rebuild.  Cheers!

EDIT: that actually does appear to have made a small difference, but to be honest I think it's in the margin of error (10Kkeys/s or so) since I'm doing other things on this computer at the same time.

No problem, I'll do some testing myself. I don't have working OpenCL drivers so I'm forced to go CPU, so I'm always on the lookout for compile-time optimizations beyond the defaults for some CPU-intensive executables I use.

I have recently become active again after a long period of inactivity. Cryptographic proof that my account has not been compromised is available.
ChetnotAtkins
Full Member

Offline

Activity: 131
Merit: 100

 August 20, 2015, 01:42:52 PM

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!
deepceleron
Legendary

Offline

Activity: 1512
Merit: 1000

 August 23, 2015, 12:42:06 PM

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.
Monopoly
Hero Member

Offline

Activity: 546
Merit: 500

 August 23, 2015, 03:05:23 PM

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

Offline

Activity: 378
Merit: 250

Tips welcomed: 1CF4GhXX1RhCaGzWztgE1YZZUcSpoqTbsJ

 August 23, 2015, 03:06:15 PM

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?

I have recently become active again after a long period of inactivity. Cryptographic proof that my account has not been compromised is available.
Monopoly
Hero Member

Offline

Activity: 546
Merit: 500

 August 23, 2015, 03:09:52 PM

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
Hero Member

Offline

Activity: 560
Merit: 504

I prefer Zakir over Muhammed when mentioning me!

 August 23, 2015, 03:24:56 PMLast edit: August 23, 2015, 04:09:50 PM by 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

 ░░░░░▄▄██████▄▄░░▄████▀▀▀▀▀▀████▄░███▀░░░░░░░░░░▀█▀████░░░▄██████▄▄░░░██░░░░░█████████░░░░██▌░░░░█████████████████░░░░█████████████████░░░░░███████████████████▄░░▀██████▀░░░████▀█▄▄░░░░░░░░░░▄███░░▀████▄▄▄▄▄▄████▀░░░░░▀▀██████▀▀ .ChipMixer.{ MIXING REINVENTED FOR YOUR PRIVACY #.ChipMixer. ░░░░░▄▄██████▄▄░░▄████▀▀▀▀▀▀████▄░███▀░░░░░░░░░░▀█▀████░░░▄██████▄▄░░░██░░░░░█████████░░░░██▌░░░░█████████████████░░░░█████████████████░░░░░███████████████████▄░░▀██████▀░░░████▀█▄▄░░░░░░░░░░▄███░░▀████▄▄▄▄▄▄████▀░░░░░▀▀██████▀▀
tspacepilot
Legendary

Offline

Activity: 1456
Merit: 1053

I may write code in exchange for bitcoins.

 August 23, 2015, 06:48:15 PM

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:
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)
Monopoly
Hero Member

Offline

Activity: 546
Merit: 500

 August 24, 2015, 02:35:05 AMLast edit: August 24, 2015, 03:12:48 AM by 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
Hero Member

Offline

Activity: 546
Merit: 500

 August 24, 2015, 03:04:39 AM

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:
but see error the address is too long .
TheRealSteve
Hero Member

Offline

Activity: 686
Merit: 500

FUN > ROI

 August 24, 2015, 03:42:35 AM

How find a privkey for a complete address ?
i use
Code:
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.

But again, see the aforementioned.

Timelord2067
Legendary

Offline

Activity: 1974
Merit: 1284

Witty! £ $₹ € ¥ ¢ ≠ ÷ ™  August 24, 2015, 05:31:54 AM Hi there, I saw on the opening page Quote 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. Timelord2067's Timely Test and Main-neT LighTning Loans to a "T" https://bitcointalk.org/index.php?topic=5184177.0 main-net BTC 0.0001 loans, test-net BTC 0.001 loans 1% seven days max. tspacepilot Legendary Offline Activity: 1456 Merit: 1053 I may write code in exchange for bitcoins.  August 24, 2015, 05:41:08 AM Hi there, I saw on the opening page Quote 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 Legendary Offline Activity: 1974 Merit: 1284 Witty! £$ ₹ € ¥ ¢ ≠ ÷ ™

 August 24, 2015, 05:55:35 AM

Hi there,

I saw on the opening page

Quote
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 )

Timelord2067's Timely Test and Main-neT LighTning Loans to a "T"
https://bitcointalk.org/index.php?topic=5184177.0
main-net BTC 0.0001 loans, test-net BTC 0.001 loans 1% seven days max.
Sr. Member

Offline

Activity: 336
Merit: 250

 August 24, 2015, 06:06:23 AM

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

Offline

Activity: 546
Merit: 500

 August 24, 2015, 08:08:07 AM

How find a privkey for a complete address ?
i use
Code:
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.

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
Hero Member

Offline

Activity: 686
Merit: 500

FUN > ROI

 August 24, 2015, 11:27:44 AM

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
Full Member

Offline

Activity: 131
Merit: 100

 August 24, 2015, 12:01:34 PM

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

Thanks!
 Pages: 1 ... 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 123 124 125 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 ... 185