Search content
Sort by
Showing 20 of 20 results by jennamarble
SHA256 is secure you are declaring that sha256 is insecure? besides that length-extension attack wouldn't work on anything which is considered secure such as 132 bits of entropy...
If by secure you mean "cannot be reverse-engineered" then that is correct. However, it is suspectable to brute-force. On a 1080 Ti card a hacker can try SHA256 combos at around 4400 megahash/s. For comparison, the same card can only try scrypt at around 0.9 megahash/s and PBKDF2 with HMAC-SHA256 iterations at 1.6 megahash/s.
I guess the fact that you are using 132 bits of entropy in your string nullifies the cracking speed increase, but you must make sure your entropy source is not dirty or else you could actually be using less entropy unknowingly. A good example of this is using /dev/urandom.
correct /dev/urandom would be a good source of entropy no known weaknesses plus there are good amount of tools available out there to choose how many bits of entropy you want before hand many even use 256 bit of entropy which is what I consider way over the top.
I think you are talking nonsense how do you explain key generation? Do you think the random key is generated out of nowhere? Random key generation also needs input without input there is no output also to say that random key generation is the only secure way to generate is a real security risk since all random numbers cant be trusted havent you heard of the weak random seed generated by android clients?
Just because some poorly written applications in the past by incompetent developers used a weak RNG doesn't mean random number generators are weak in general! You just have to know how to use them correctly. Giving them up altogether and relying on a weak method sounds like replacing one mistake with another.Since when using words with 132 bit of entropy become weak? Do you even know what are you talking about? it would take you ages or maybe a decade to crack addresses generated using words with 132 bit of entropy.
I think the problem is that what you want (a vanity bitcoin address) and the method you want to use (SHA256(string+n)) don't make sense together and that is what people are trying to tell you. Mainly it doesn't make any sense to start from a starting seed to generate the vanity address, if you want such an address then simply start from a random key.
I think you are talking nonsense how do you explain key generation? Do you think the random key is generated out of nowhere? Random key generation also needs input without input there is no output also to say that random key generation is the only secure way to generate is a real security risk since all random numbers cant be trusted havent you heared of the weak random seed generated by android clients?
You said something about forgetting and being able to recover it from that seed which again doesn't make sense if you are generating a vanity address because depending on how many fixed starting characters the address has the process can take a very long time and recovering it this way is not practical. Not to mention that using a starting string that you can remember suggests weakness in the randomness.
It makes perfect see the above reply.
Here is a suggestion, why not generate a random entropy then start your vanity address search from there until you find the key that corresponds to your desired address. Then take the private key to that address (256-bit) and encode that using an algorithm like BIP39 to a set of words that you can easily store or remember (although it is not recommended to only rely on your memory for backup).
I think you are talking nonsense how do you explain key generation? Do you think the random key is generated out of nowhere? Random key generation also needs input without input there is no output also to say that random key generation is the only secure way to generate is a real security risk since all random numbers cant be trusted havent you heared of the weak random seed generated by android clients?
You said something about forgetting and being able to recover it from that seed which again doesn't make sense if you are generating a vanity address because depending on how many fixed starting characters the address has the process can take a very long time and recovering it this way is not practical. Not to mention that using a starting string that you can remember suggests weakness in the randomness.
It makes perfect see the above reply.
Here is a suggestion, why not generate a random entropy then start your vanity address search from there until you find the key that corresponds to your desired address. Then take the private key to that address (256-bit) and encode that using an algorithm like BIP39 to a set of words that you can easily store or remember (although it is not recommended to only rely on your memory for backup).
I can remember it and it is very practical as well
~
this is understandable I will use 132 bits of entropy as a string plus the increments for extra security and uniqueness plus it would be deterministic for me if whenever I forget I can recover it however the big number is just hard to recover if lost so the point stands that I will use string, not my name as I gave that just as an example I will use a string with 132 bits of entropy as that is strong and used by electrum as well plus by using GPU I don't want to save all those billions of addresses so i will only save the addresses that match the pattern but with my method of string+n increments and for this increments are necessary if you use same string billions of times it will generate the same address but if you add the needed numbers/increments it will fulfil the task of pattern and uniqueness since using 132 of entropy for single address is not very economical I would say.
A random string with 132-bit entropy is much better than what I initially thought you were doing (just make sure you add the string at the end of n and not the other way around), but in my opinion, if you really want to generate private keys this way then I suggest ditching hashing functions altogether and use Scrypt for your algorithm instead, which can be tweaked to make brute-forcing infeasible.
SHA256 is secure you are declaring that sha256 is insecure? besides that length-extension attack wouldn't work on anything which is considered secure such as 132 bits of entropy anything else other then that would be going far from the topic as per the rules of the forum we should stick to the main keywords here SHA256 WALLET AND BITCOIN and what's between the first post.
As a native English speaker, I find it difficult to understand what you have written because your grammar and punctuation (which are important components of the language) are poor.
If I understand you correctly, you would like someone to create a vanity address generator that returns a number, N, such that a private key derived from SHA256(M|N) has an address that matches a pattern, where M and the pattern are both chosen by the user.
That is certainly doable. Is there a limit on the value of the number?
Keep in mind that as others have mentioned, any brain wallet is insecure. That includes your derivation of a brain wallet. While "now is the time for all good men to come to the aid of their country 67854897" is more secure than "now is the time for all good men to come to the aid of their country", it may not be not secure enough to be used as a private key.
[/quote]
my first paragraph in my topic literally comes from https://en.bitcoin.it/wiki/Deterministic_wallet have grammatical errors? lol really for a native speaker I expected better even non native illiterate person would understand what I wrote in simple English people don't have to know English to understand it second many programmers don't know English but can write programs using it for if for and while loops besides this is not grammar and education measuring contest
the string does not have to bip39 to be secure is just needs to be long enough
I never said that.i think you are misunderstanding or trying to twist my words or maybe trying to change the topic
You caught me!you think i dont know about those procedures you talk about
Buddy, we were just having a discussion and I was trying to help. Good luck on your way to find a programmer that will do you a work you can't even describe.can't even describe lol.
you are clearly not very claver regarding this
im not claver... 
Type 1 deterministic wallet
A type 1 deterministic wallet is a simple method of generating addresses from a known starting string, as such it does not allow advanced features such as a Master Public Key. To generate a private key take SHA256(string + n), where n is an ASCII-coded number that starts from 1 and increments as additional keys are needed.
This type of wallet can be created by Casascius Bitcoin Address Utility.
I want the above functionality with a simple twist since gpu will generate addresses in millions compressed and uncompressed form similar to vanity address generators save only the addresses
that have the matching pattern along with the private key that generated that address and do that indefinately gpu either cuda or opencl i will appreciate if you make such program for free if not we can discuss this if you want you can contact me on telegram its same as my username since i am not that active.
A type 1 deterministic wallet is a simple method of generating addresses from a known starting string, as such it does not allow advanced features such as a Master Public Key. To generate a private key take SHA256(string + n), where n is an ASCII-coded number that starts from 1 and increments as additional keys are needed.
This type of wallet can be created by Casascius Bitcoin Address Utility.
I want the above functionality with a simple twist since gpu will generate addresses in millions compressed and uncompressed form similar to vanity address generators save only the addresses
that have the matching pattern along with the private key that generated that address and do that indefinately gpu either cuda or opencl i will appreciate if you make such program for free if not we can discuss this if you want you can contact me on telegram its same as my username since i am not that active.
Breath!
There are no 132 bits of entropy. You may have confused it with the BIP39 in which you use 128 bits of entropy along with 4 bits of hash for the seed generation. Then, after some PBKDF2 and HMAC-SHA256/512 rounds, you end up with the derived addresses. But, that's just a proposal for generating deterministic keys. If you want to go with the standard way, you'll need 256 bits.
this is understandable I will use 132 bits of entropy as a string plus the increments for extra security and uniqueness plus it would be deterministic for me if whenever I forget I can recover it however the big number is just hard to recover if lost so the point stands that I will use string, not my name as I gave that just as an example I will use a string with 132 bits of entropy as that is strong and used by electrum as well plus by using GPU I don't want to save all those billions of addresses so i will only save the addresses that match the pattern but with my method of string+n increments and for this increments are necessary if you use same string billions of times it will generate the same address but if you add the needed numbers/increments it will fulfil the task of pattern and uniqueness since using 132 of entropy for single address is not very economical I would say.
this is understandable I will use 132 bits of entropy as a string plus the increments for extra security and uniqueness
Wait, do you mean that you'll hash that entropy or that you'll use it directly for the addresses? There's no need to hash anything neither to take any extra security measures; if you randomly generate 256 bits, they're fine to perform ECDSA, SHA256, RIPEMD-160, SHA256 and then the final base58 encoding.it will fulfil the task of pattern and uniqueness since using 132 of entropy for single address is not very economical I would say.
You may have misunderstood the procedure. Every address is an encoded RIPEMD-160 hash along with a version byte in the front and with a checksum in the back. [Useful link]There are no 132 bits of entropy. You may have confused it with the BIP39 in which you use 128 bits of entropy along with 4 bits of hash for the seed generation. Then, after some PBKDF2 and HMAC-SHA256/512 rounds, you end up with the derived addresses. But, that's just a proposal for generating deterministic keys. If you want to go with the standard way, you'll need 256 bits.
the string does not have to bip39 to be secure is just needs to be long enough i think you are misunderstanding or trying to twist my words or maybe trying to change the topic you think i dont know about those procedures you talk about you are clearly not very claver regarding this
Its a real shame really while these kind of programs can generate millions of addresses why not have a simple option to input millions of private keys from a text file that otherwise would take forever to convert using python to convert using gpu and save the output to text file or otherwise save addresses with the matching pattern along with private keys
Ahh, maybe because that's not the reason why these type of programs are written? 
Based from your description, it's far from vanitysearch's main purpose: "generating vanity addresses"
I’m not trying to be disrespectful but you are not very genius regarding this it seems if you reread it then you would understand it does indeed fits the purpose I clearly said that if it cannot save all the addresses then it should do its job and search for pattern and save addresses that match the pattern so tell me again does it not fit the "purpose" what is the difference by randomly brute-forcing the private keys and checking for the pattern and doing the same by taking millions of private keys? or will it lose its functionality by doing so?.
If you quote a post, write beneath it, not inside the quote tags.
Code:
[quote author=BlackHatCoiner link=topic=5347515.msg57383096#msg57383096 date=1625401428]...[/quote]
Write here...
Write here...
To generate a private key take SHA256(string + n), where n is an ASCII-coded number that starts from 1 and increments as additional keys are needed.
I know how a simple deterministic wallet implemetation would be like and I understood your example. I'm just recommending you to be clearer in the future, especially when you want to buy services from an unknown person in the internet.Why would i want to use hexadecimal number as string since any number plus alphabet can be represented as string for example i will use my name
Again, it depends on what you want to achieve. If these addresses will be used in the future for funding, then knowing your name can increase my odds to find their private keys. On the other hand, if you used a very large random number, I couldn't stand a chance.Yes i want to generate vanity address using this Type 1 deterministic wallet
A type 1 deterministic wallet is a simple method of generating addresses from a known starting string, as such it does not allow advanced features such as a Master Public Key. To generate a private key take SHA256(string + n), where n is an ASCII-coded number that starts from 1 and increments as additional keys are needed.
Great. Don't use the brain wallet way. Instead I'd suggest you to do the following; generate a random number between 1 and 2256 - 232 - 977 (secp256k1 range). Instead of having an n variable, just increase that number by 1 each time. Simple as that.A type 1 deterministic wallet is a simple method of generating addresses from a known starting string, as such it does not allow advanced features such as a Master Public Key. To generate a private key take SHA256(string + n), where n is an ASCII-coded number that starts from 1 and increments as additional keys are needed.
this is understandable I will use 132 bits of entropy as a string plus the increments for extra security and uniqueness plus it would be deterministic for me if whenever I forget I can recover it however the big number is just hard to recover if lost so the point stands that I will use string not my name as I gave that just as an example I will use a string with 132 bits of entropy as that is strong and used by electrum as well but I have to use number with as string+n since using 132 of entropy for single address is not very economical I would say.
if you make such program for free if not we can discuss this if you want you can contact me on telegram its same as my username since i am not that active.
You should be a little bit more clear if you want someone's services. I've understood half of what you wrote.I think you have trouble understanding a clear example Type 1 deterministic wallet
A type 1 deterministic wallet is a simple method of generating addresses from a known starting string, as such it does not allow advanced features such as a Master Public Key. To generate a private key take SHA256(string + n), where n is an ASCII-coded number that starts from 1 and increments as additional keys are needed.
To generate a private key take SHA256(string + n), where n is an ASCII-coded number that starts from 1 and increments as additional keys are needed.
And string a random hexadecimally represented number? If you just want to generate brute forcefully addresses starting from a random number, just increase it by 1 for each loop.Why would i want to use hexadecimal number as string since any number plus alphabet can be represented as string for example i will use my name
I want the above functionality with a simple twist since gpu will generate addresses in millions compressed and uncompressed form similar to vanity address generators save only the addresses
Would you mind telling us what's your purpose? It seems like you want to... generate vanity addresses?Yes i want to generate vanity address using this Type 1 deterministic wallet
A type 1 deterministic wallet is a simple method of generating addresses from a known starting string, as such it does not allow advanced features such as a Master Public Key. To generate a private key take SHA256(string + n), where n is an ASCII-coded number that starts from 1 and increments as additional keys are needed.
Its a real shame really while these kind of programs can generate millions of addresses while not have a simple option to input millions of private keys from a text file that otherwise would take forever to convert using python to convert using gpu and save the output to text file or otherwise save addresses with the matching pattern along with private keys
I'm a bit confused since you don't split what you write using dot or commas. But basically you need bitcoin address generator which use GPU (CUDA/OpenCL) with input defined by you? Anyway, if you don't plan to generate billion of address, it's more practical to use Bitcoin library which support generate address with custom private key you defined.
No i want that specifically since i want program similar to vanity generators that is use to make addresses with the matching pattern but use random seed i dont want to random seed/data i want my addresses to be generated deterministically using my string+n where n is an ASCII-coded number that starts from 1 and increments
Type 1 deterministic wallet
A type 1 deterministic wallet is a simple method of generating addresses from a known starting string, as such it does not allow advanced features such as a Master Public Key. To generate a private key take SHA256(string + n), where n is an ASCII-coded number that starts from 1 and increments as additional keys are needed.
This type of wallet can be created by Casascius Bitcoin Address Utility.
I want the above functionality with a simple twist since gpu will generate addresses in millions compressed and uncompressed form similar to vanity generators save only the addresses
that have the matching pattern along with the private key that generated that address and do that indefinately gpu either cuda or opencl i will appreciate if you make such program for free if not we can discuss this if you want you can contact me on telegram its same as my username since i am not that active.
A type 1 deterministic wallet is a simple method of generating addresses from a known starting string, as such it does not allow advanced features such as a Master Public Key. To generate a private key take SHA256(string + n), where n is an ASCII-coded number that starts from 1 and increments as additional keys are needed.
This type of wallet can be created by Casascius Bitcoin Address Utility.
I want the above functionality with a simple twist since gpu will generate addresses in millions compressed and uncompressed form similar to vanity generators save only the addresses
that have the matching pattern along with the private key that generated that address and do that indefinately gpu either cuda or opencl i will appreciate if you make such program for free if not we can discuss this if you want you can contact me on telegram its same as my username since i am not that active.
~
can somebody implement this please i have millions of private keys so it cannot be converted quickly to addresses with cpu because cpu is not powerful enough can somebody make small modification to the software where it read single hex private key to read those values from file this way we can convert millions of private keys using gpu thanks again for anyone out there who can help.
can somebody implement this please i have millions of private keys so it cannot be converted quickly to addresses with cpu because cpu is not powerful enough can somebody make small modification to the software where it read single hex private key to read those values from file this way we can convert millions of private keys using gpu thanks again for anyone out there who can help.
How exactly many millions are we talking about? Because GPUs cannot do disk I/O, so only the actual conversion of hex to WIF can be accelerated with CUDA. The reads and writes still have to be done on CPU, and then all that has to be copied to the GPU memory and then back again, because CUDA cannot read memory in RAM (unless you use their new feature called Unified Memory but honestly I don't know how fast that is), so what I'm trying to tell you is it might be better implementing this on CPU using multiple threads and the AVX instruction set and that should the job. The CPU can already do much more complicated address generation at millions of keys per second anyway.
Because none have made it as you said the conversation is possible with gpu and at the time of saving you can use cpu i think the program already does it can convert millions keys per second and cpu can save it in a minute this way is better then all the way to cpu
the -cp option at the moment does not convert private key hex to uncompressed address format i am sure this is not a bug also for convenience can you update -><
-cp option update:
add read from input file for -cp option where it can read bunch of private key in hex format from text file instead of single computation to leverage gpu horse power for converting pre computed private keys and converting to compressed and uncompressed address format there is no tool out there does this using gpu i am pretty most people want their pre computed private keys to be converted as a side benefit.
-cp option update:
add read from input file for -cp option where it can read bunch of private key in hex format from text file instead of single computation to leverage gpu horse power for converting pre computed private keys and converting to compressed and uncompressed address format there is no tool out there does this using gpu i am pretty most people want their pre computed private keys to be converted as a side benefit.
can somebody implement this please i have millions of private keys so it cannot be converted quickly to addresses with cpu because cpu is not powerful enough can somebody make small modification to the software where it read single hex private key to read those values from file this way we can convert millions of private keys using gpu thanks again for anyone out there who can help.
Hello all,
is the problem with the "illegal memory access" solved? Any what i can do from my side? I have installed the latest nvidia driver 461.09 package from ASUS webside.
if i tray to create a single adress / key pair it works realy fast on my 3070 card, but from a input list with only 20 full adresses, the illegal memory access pops up.
Best regards,
Willi
is the problem with the "illegal memory access" solved? Any what i can do from my side? I have installed the latest nvidia driver 461.09 package from ASUS webside.
Code:
D:\VanitySearch>VanitySearch.exe -gpu -i test.txt
VanitySearch v1.19
Search: 34 addresses (Lookup size 34,[1,1]) [Compressed]
Start Wed Mar 10 17:34:38 2021
Base Key: 25EE5410ED0AB4D679AD315289852E072746B55186EE8D7D336B9B996C10C8F6
Number of CPU thread: 3
GPU: GPU #0 GeForce RTX 3070 (46x0 cores) Grid(368x128)
GPUEngine: Launch: an illegal memory access was encountered
VanitySearch v1.19
Search: 34 addresses (Lookup size 34,[1,1]) [Compressed]
Start Wed Mar 10 17:34:38 2021
Base Key: 25EE5410ED0AB4D679AD315289852E072746B55186EE8D7D336B9B996C10C8F6
Number of CPU thread: 3
GPU: GPU #0 GeForce RTX 3070 (46x0 cores) Grid(368x128)
GPUEngine: Launch: an illegal memory access was encountered
if i tray to create a single adress / key pair it works realy fast on my 3070 card, but from a input list with only 20 full adresses, the illegal memory access pops up.
Best regards,
Willi
uninstall the driver install cuda toolkit from nvidia website it comes with the drivers and see if the problem persists
driver deinstalled, CUDA pack installed, but the same problem
Hello all,
is the problem with the "illegal memory access" solved? Any what i can do from my side? I have installed the latest nvidia driver 461.09 package from ASUS webside.
if i tray to create a single adress / key pair it works realy fast on my 3070 card, but from a input list with only 20 full adresses, the illegal memory access pops up.
Best regards,
Willi
The problem, if I remember correctly, is the RIPEMD160 function when trying to do more than one address. So, you need to create the string function; meaning, take off like 7 or 8 characters on your addresses in your list and see if that works.is the problem with the "illegal memory access" solved? Any what i can do from my side? I have installed the latest nvidia driver 461.09 package from ASUS webside.
Code:
D:\VanitySearch>VanitySearch.exe -gpu -i test.txt
VanitySearch v1.19
Search: 34 addresses (Lookup size 34,[1,1]) [Compressed]
Start Wed Mar 10 17:34:38 2021
Base Key: 25EE5410ED0AB4D679AD315289852E072746B55186EE8D7D336B9B996C10C8F6
Number of CPU thread: 3
GPU: GPU #0 GeForce RTX 3070 (46x0 cores) Grid(368x128)
GPUEngine: Launch: an illegal memory access was encountered
VanitySearch v1.19
Search: 34 addresses (Lookup size 34,[1,1]) [Compressed]
Start Wed Mar 10 17:34:38 2021
Base Key: 25EE5410ED0AB4D679AD315289852E072746B55186EE8D7D336B9B996C10C8F6
Number of CPU thread: 3
GPU: GPU #0 GeForce RTX 3070 (46x0 cores) Grid(368x128)
GPUEngine: Launch: an illegal memory access was encountered
if i tray to create a single adress / key pair it works realy fast on my 3070 card, but from a input list with only 20 full adresses, the illegal memory access pops up.
Best regards,
Willi
Example:
turn address:
139743984739847328974982472347398
into
1397439847398473289749824
I do not know if it works with the latest release of VanitySearch but I know it works with version 17.
i don't understand what's the point, i want to have all the addresses in the input file, if i shorten the addresses, then i can't search for the addresses anymore....
Its a laptop? If it is then this is definately related to that my desktop gpu 1060 6gb works great with cuda have you tried changing power options it might be limiting the full potential if it still doesnt work then the gpu might not support such instructions that cuda code trying to execute you may also try to uninstall if any manufacturer software that exists
Hello all,
is the problem with the "illegal memory access" solved? Any what i can do from my side? I have installed the latest nvidia driver 461.09 package from ASUS webside.
if i tray to create a single adress / key pair it works realy fast on my 3070 card, but from a input list with only 20 full adresses, the illegal memory access pops up.
Best regards,
Willi
is the problem with the "illegal memory access" solved? Any what i can do from my side? I have installed the latest nvidia driver 461.09 package from ASUS webside.
Code:
D:\VanitySearch>VanitySearch.exe -gpu -i test.txt
VanitySearch v1.19
Search: 34 addresses (Lookup size 34,[1,1]) [Compressed]
Start Wed Mar 10 17:34:38 2021
Base Key: 25EE5410ED0AB4D679AD315289852E072746B55186EE8D7D336B9B996C10C8F6
Number of CPU thread: 3
GPU: GPU #0 GeForce RTX 3070 (46x0 cores) Grid(368x128)
GPUEngine: Launch: an illegal memory access was encountered
VanitySearch v1.19
Search: 34 addresses (Lookup size 34,[1,1]) [Compressed]
Start Wed Mar 10 17:34:38 2021
Base Key: 25EE5410ED0AB4D679AD315289852E072746B55186EE8D7D336B9B996C10C8F6
Number of CPU thread: 3
GPU: GPU #0 GeForce RTX 3070 (46x0 cores) Grid(368x128)
GPUEngine: Launch: an illegal memory access was encountered
if i tray to create a single adress / key pair it works realy fast on my 3070 card, but from a input list with only 20 full adresses, the illegal memory access pops up.
Best regards,
Willi
uninstall the driver install cuda toolkit from nvidia website it comes with the drivers and see if the problem persists
the -cp option at the moment does not convert private key hex to uncompressed address format i am sure this is not a bug also for convenience can you update -><
Currently it just converts a private key WIF to a public key hex and then exits. And it looks like there is an flag to do uncompressed key conversion called isComp which is passed to the internal function that does the conversion but it's not enabled by default. https://github.com/JeanLucPons/VanitySearch/blob/1bc508a19e2066777f3fb1a020f68f8705daf0f4/main.cpp#L469
-cp option update:
add read from input file for -cp option where it can read bunch of private key in hex format from text file instead of single computation to leverage gpu horse power for converting pre computed private keys and converting to compressed and uncompressed address format there is no tool out there does this using gpu i am pretty most people want their pre computed private keys to be converted as a side benefit.
add read from input file for -cp option where it can read bunch of private key in hex format from text file instead of single computation to leverage gpu horse power for converting pre computed private keys and converting to compressed and uncompressed address format there is no tool out there does this using gpu i am pretty most people want their pre computed private keys to be converted as a side benefit.
Why with GPUs? That option is basically a conversion utility that already runs quickly, it doesn't start a vanity address search like the others.
i see however i have large amount of pre computed private keys which is costing me dearly to convert it to addresses as the cpu is not powerful enough to convert millions of private key to address the tool already does that it will be not hard for it to read bunch of private keys in hex format and do what it does with gpu if you search for converting pre computed private keys you see hundreds of result but all made for cpu but most people want it to be fast this is the only tool that takes single private key hex format and convert it to address however the power of gpu is wasted since many people have millions of private keys
Re: Vanitygen: Vanity bitcoin address generator/miner [v0.22]
vanitygen -seed option update:
instead of using seed plus random numbers have option to concatenate seed+n where n is a number that starts 1 to n times n has no upper limit such as seed1 seed2 etc.. and hash it using sha256(to_string(seed+n)) and convert that sha256 to address compressed and uncompressed format can you add such functionality ?
instead of using seed plus random numbers have option to concatenate seed+n where n is a number that starts 1 to n times n has no upper limit such as seed1 seed2 etc.. and hash it using sha256(to_string(seed+n)) and convert that sha256 to address compressed and uncompressed format can you add such functionality ?
-cp option update:
add read from input file for -cp option where it can read bunch of private key in hex format from text file instead of single computation to leverage gpu horse power for converting pre computed private keys and converting to compressed and uncompressed address format there is no tool out there does this using gpu i am pretty most people want their pre computed private keys to be converted as a side benefit.
add read from input file for -cp option where it can read bunch of private key in hex format from text file instead of single computation to leverage gpu horse power for converting pre computed private keys and converting to compressed and uncompressed address format there is no tool out there does this using gpu i am pretty most people want their pre computed private keys to be converted as a side benefit.