Pages:
Author

Topic: VanitySearch (Yet another address prefix finder) - page 8. (Read 32072 times)

hero member
Activity: 1438
Merit: 513
Again, the service isn't ready but at this point right now feedback is crucial as we near launch. We strive to be the definitive service in splitkey generation.
I don't think that sending private keys via email is a good option, especially when we know most people are using one email address and it's most likely gmail.
Just for fun I tested the pricing using various characters and I think price is fair (few bucks only) if I pick up to six characters, but it grows much higher adding just one more character.
I have to be honest and say that I honestly don't know why would I use 1splitkey when I can just generate my own vanity address for free with my computer.

Last year I did something similar, just for Luada's funeral:

We are not targeting guys like you that already know how to do it but if you lack power please feel free to use our service when it's officially announced.
We accept BTC and LN ,(implemented and tested working)
Again, the service isn't ready but at this point right now feedback is crucial as we near launch. We strive to be the definitive service in splitkey generation.
I offer you guys a preview at 1splitkey.com

Literally one line above your quote stated we aren't targeting people who know how to do it,
At this current point in time there is only 3 legitimate services relevant to vanity splitkey generation
LoyceV's service,
bitcoin-uni.de's service
and our's.
all the rest are scams or not yet scams as they do not provide split key generation options at all.
We still haven't zero 'ed in on pricing but are getting close.
We do not log base keys (since we use rekey options we don't even see them in cli, we have learned switching up base keys generally yields results quicker, some basekeys simply dont yield results even on low difficulty wallets ),
All we have logged is the following.
Pubkey
Wallet Address
Partial Priv
and email
without a base key, the only flaws we can consider but won't are end users security practices.
even if someone's email where hacked or phished there isnt much that can be done with the partial priv and wallet besides speculating. unless they imported the wallet to some online source and it too was comprimised.
If end user truly kept the partial priv offline and lack of basekey brute forcing is to a moot end.
we tried to create a zero liability system by design.
We should be launching a finished product and announcing it on may 5th-8th'ish as our spamscore will be green light.
In concerns to the pricing  our competitors start charging $2 after 3 digits,  We don't start charging $2 until around the 7th digit or a certain difficulty, so it may feel expensive but its not.
bitcoin-uni.de 1ABCDEFGH=$432         -c $130.41,   1ABCDEFGHi -Cannot even submit this order 11111111 with -c enabled $26.91 and an email/refund apologizing that it cant be done.
 1splitkey.com 1ABCDEFGH=$117.50     -c $58.70,    1ABCDEFGHi -  $6818.10 and will deliver around 1636~ hours later. (66 days) 11111111 without -c enabled (since it cant be done that way) = $166799.90 we will get it done, it might take a year or 2 but we have ways to accomplish this weather it be on vast.ai rentals or A100 instances or an agreement with lambda labs

The difference in our services is we've done the research we had a viable product even before bitcoin-uni.de came out but saw many issues and challenges to overcome in our beta product.
We wanted everyone to be able to use our product not just the technically inclined.
When my child whom is under 10 years old was able to navigate and utilize the service we knew we where onto something. However my wife ,not so much. One's in 3rd grade the other is perusing a MBA.
One thing we are trying to factor in and solve is a proper workflow for assumptive behavior online.  

@dkbit98 I would love it if you tried the service in full fashion and then came back here to report the process, test out 1dkbit, use a burner email we dont care maybe next time you need something like 1Lauda you can know and trust our service and save a lot of time. (not that its time consuming or anything if you know how)
The neat thing about our service its all automated.
Ona side note are you referencing user Lauda I was unaware they passed away. Regardless of whom your referring to I send my condolences.


legendary
Activity: 2212
Merit: 7064
Again, the service isn't ready but at this point right now feedback is crucial as we near launch. We strive to be the definitive service in splitkey generation.
I don't think that sending private keys via email is a good option, especially when we know most people are using one email address and it's most likely gmail.
Just for fun I tested the pricing using various characters and I think price is fair (few bucks only) if I pick up to six characters, but it grows much higher adding just one more character.
I have to be honest and say that I honestly don't know why would I use 1splitkey when I can just generate my own vanity address for free with my computer.

Last year I did something similar, just for Luada's funeral:

member
Activity: 351
Merit: 37
reality is that if you're too long on one address it goes to aml blacklist. And then you best option is black exchange rate . So i don't see much sense in all this stuff anymore.
hero member
Activity: 1438
Merit: 513

Again, the service isn't ready but at this point right now feedback is crucial as we near launch. We strive to be the definitive service in splitkey generation.



I had never heard of vanity addresses until WhyFhy introduced me to them. The process I went through to create the public/private key was a breeze thanks to his instructions. I have zero experience in coding and/or brute forcing, so this was a neat project to be a part of. At no point was I asked for the private key. In my experience, no compromise in security. Now i've got a Vanity Address to show off and share my experience.

Thank you for vectorizing the logo and churching it up , some of the work you asked for was eye opening as well such as the difficulty differences.
copper member
Activity: 92
Merit: 96

Again, the service isn't ready but at this point right now feedback is crucial as we near launch. We strive to be the definitive service in splitkey generation.



I had never heard of vanity addresses until WhyFhy introduced me to them. The process I went through to create the public/private key was a breeze thanks to his instructions. I have zero experience in coding and/or brute forcing, so this was a neat project to be a part of. At no point was I asked for the private key. In my experience, no compromise in security. Now i've got a Vanity Address to show off and share my experience.
hero member
Activity: 1438
Merit: 513
We are building something special, still working on a difficulty calculator like no other so we can offer up to 7 digits free
We could use some help solving this here as we have discovered JL's VS difficulty calculator is inaccurate at some points/pivots/bits.
problem is our difficulty calculator has to be more accurate than even vanitysearch's, so our quotes will be accurate so we dont operate at loss or email you guys saying we cant do it.
We run about 16,000 MK/S with -sp applied (so far)
We run a combination eth mining rigs to achieve this with proprietary software assigning workers, logging speeds and an api callback server relaying said data.
We've essentially created a real vanity searching mining pool(workaround) ,
We plan to use smi or wmic to pull card data and catagorize speeds against collected data such as DaveF's list and auto configure arguments.
and relay to website for time estimates. even a simple 7digit case insensitive can be done in under a few mins, It's like not hitting a mining share for few mins.
Our quotes are still broken, until we solve for a few x's on difficulty calculations via pivots/bits
We have a few other bugs to work out.
emails being marked as spam, or our personal smtp server not sending email in the first place thinking we are sending spam
We do not want to quote on wallet length like all the competition does. Our process if fully automated.
This has been a work in progress for about 16 months. Some of you tried our google form based beta. We took all the feedback with grace and went back to the drawing board.
We are not targeting guys like you that already know how to do it but if you lack power please feel free to use our service when it's officially announced.
We accept BTC and LN ,(implemented and tested working)
Again, the service isn't ready but at this point right now feedback is crucial as we near launch. We strive to be the definitive service in splitkey generation.
I offer you guys a preview at 1splitkey.com


hero member
Activity: 1008
Merit: 960
Hello

I try to understand big numbers I mean, thousand of years and so on.

Please write mi in words how many years it is:

1.055e+06y


One million and fifty five thousand years.

By that time some interesting things will happen:

Betelgeuse, one of the top ten brightest stars in our sky, will have exploded in a supernova. It will be so bright that it will be visible on Earth in day time. [1]

A couple of Uranus moons, Desdemona and Cressida, will probably have already collided with each other. [2]

inlovewiththedj will probably have obtained his vanity address. [3]

[1]: https://earthsky.org/brightest-stars/betelgeuse-will-explode-someday
[2]: https://astronomy.com/news/2017/09/uranus-colliding-moons
[3]: https://bitcointalksearch.org/topic/m.59427656
member
Activity: 330
Merit: 34
Please write mi in words how many years it is:

1.055e+06y
The simpler method is to just move the decimal point depending on the value of "e+number".

From your example:
1.055(e+06 = move by 6 decimal places)
10.55=  move by 1 place
105.5=  move by 2 places
1055.=  move by 3 places
10550.=  move by 4 places
105500.=  move by 5 places
1055000.=  move by 6 places

Other note: You can use your forum signature for off-topic messages.
You can access it in: "Profile->Forum Profile Information".

Thanks!



Am I correct with  6.02311e+07y?

6.02311    (e+07 = move by 7 decimal places)
60.2311      =  move by 1 place
602.311      =  move by 2 places
6023.11      =  move by 3 places
60231.1      =  move by 4 places
602311.      =  move by 5 places
6023110.      =  move by 6 places
60231100.      =  move by 7 places
use big calc
https://www.calculator.net/big-number-calculator.html
member
Activity: 93
Merit: 12
Please write mi in words how many years it is:

1.055e+06y
The simpler method is to just move the decimal point depending on the value of "e+number".

From your example:
1.055(e+06 = move by 6 decimal places)
10.55=  move by 1 place
105.5=  move by 2 places
1055.=  move by 3 places
10550.=  move by 4 places
105500.=  move by 5 places
1055000.=  move by 6 places

Other note: You can use your forum signature for off-topic messages.
You can access it in: "Profile->Forum Profile Information".

Thanks!



Am I correct with  6.02311e+07y?

6.02311    (e+07 = move by 7 decimal places)
60.2311      =  move by 1 place
602.311      =  move by 2 places
6023.11      =  move by 3 places
60231.1      =  move by 4 places
602311.      =  move by 5 places
6023110.      =  move by 6 places
60231100.      =  move by 7 places
legendary
Activity: 2534
Merit: 6080
Self-proclaimed Genius
Please write mi in words how many years it is:

1.055e+06y
The simpler method is to just move the decimal point depending on the value of "e+number".

From your example:
1.055(e+06 = move by 6 decimal places)
10.55=  move by 1 place
105.5=  move by 2 places
1055.=  move by 3 places
10550.=  move by 4 places
105500.=  move by 5 places
1055000.=  move by 6 places

Other note: You can use your forum signature for off-topic messages.
You can access it in: "Profile->Forum Profile Information".
copper member
Activity: 821
Merit: 1992
Quote
1.055e+06y
You can split such string into some pieces: "1.055", "e+06", "y". Then, "e+number" means "10^number", so in this case it is "1000000", you have six zeros, because of "+06". So, it means 1055000 years, because you have multiplication of "1.055" by one million, and that "y" in the end means "years".
member
Activity: 93
Merit: 12
Hello

I try to understand big numbers I mean, thousand of years and so on.

Please write mi in words how many years it is:

1.055e+06y



where can I find online calculator to count and show such big numbers to readable words?


Peace in Ukraine, death to Putin!!!!!!!!!
legendary
Activity: 3500
Merit: 2792
Enjoy 500% bonus + 70 FS
368x128 is the default grid

GPU: GPU #2 NVIDIA GeForce RTX 3070 (46x0 cores) Grid(368x128)
GPU: GPU #1 NVIDIA GeForce RTX 3070 (46x0 cores) Grid(368x128)
GPU: GPU #0 NVIDIA GeForce RTX 3070 (46x0 cores) Grid(368x128)
hero member
Activity: 1438
Merit: 513
any ideas at which grid size, these 3070 cards run in best speed?

VanitySearch.exe -l
GPU #0 NVIDIA GeForce RTX 3070 (46x0 cores) (Cap 8.6) (8191.4 MB) (Multiple host threads)
GPU #1 NVIDIA GeForce RTX 3070 (46x0 cores) (Cap 8.6) (8191.5 MB) (Multiple host threads)
GPU #2 NVIDIA GeForce RTX 3070 (46x0 cores) (Cap 8.6) (8191.5 MB) (Multiple host threads)
Try for 368x128
hero member
Activity: 1438
Merit: 513


------
Take the RTX 3070 for example.
  Bitcrack gives out 800mk.
Vanitysearch, gives out 1600-1700mk.
So why not use vanitysearch for search, if it is twice as fast?
Therefore, I asked about the possibility of searching in a fixed range, in vanitysearch.
You can read up, I've answered this before.

When vanity search lands on a single private key, it actually checks that single key against 6 possibilities, because it is checking Point + endo1 + endo2 + symmetries. While vanitysearch modded is faster than bitcrack, the precompiled version is checking more points per single private key which is why the speed seems a lot faster.

this explains why 1 of 6 will be valid if split gen right?


Yes. But this is due only to the way the programs we use to reassemble the pieces for the final private key work.

Let s (Q = sG) be the secret private key (the public key). Only one person knows 's'.

Then he sends only Q to another person, who run a "split gen" program.

Usually "split gen" works like this:

it computes only (s+1)G = Q + G, (s+2)G = Q + 2G, …, (s+k)G = Q + kG = P

until it gets a public key P with a particular address.

The program knows only k (the partial private key).

Then you need to compute k' (k' G = P):

k' = (s + k)  mod n.


Now suppose you get P in this way: - (Q + kG) = P

then in order to get from the partial private key k the correct final private key k' = (-s -k) mod n
you need to know how k was obtained (exploiting the symmetry).


If you get P in this way: λ(Q + kG) = P

(exploiting the endomorphism) the correct final private k' will be: λ*(s + k) mod n   and so on.
I'm quoting this for research purposes.
bip32
Code:
ExtKey masterKey = new ExtKey();
Console.WriteLine("Master key : " + masterKey.ToString(Network.Main));
for (int i = 0 ; i < 5 ; i++)
{
 ExtKey key = masterKey.Derive((uint)i);
 Console.WriteLine("Key " + i + " : " + key.ToString(Network.Main));
}

base58
Code:
ExtPubKey masterPubKey = masterKey.Neuter();
for (int i = 0 ; i < 5 ; i++)
{
 ExtPubKey pubkey = masterPubKey.Derive((uint)i);
 Console.WriteLine("PubKey " + i + " : " + pubkey.ToString(Network.Main));
}

legendary
Activity: 3500
Merit: 2792
Enjoy 500% bonus + 70 FS
any ideas at which grid size, these 3070 cards run in best speed?

VanitySearch.exe -l
GPU #0 NVIDIA GeForce RTX 3070 (46x0 cores) (Cap 8.6) (8191.4 MB) (Multiple host threads)
GPU #1 NVIDIA GeForce RTX 3070 (46x0 cores) (Cap 8.6) (8191.5 MB) (Multiple host threads)
GPU #2 NVIDIA GeForce RTX 3070 (46x0 cores) (Cap 8.6) (8191.5 MB) (Multiple host threads)
member
Activity: 78
Merit: 133
Sorry I made a new thread to not clutter this one up. Thank you both!
full member
Activity: 233
Merit: 253
legendary
Activity: 1568
Merit: 6660
bitcoincleanup.com / bitmixlist.org
I have a question. Recently there was a flood and a notebook containing a offline wallet was damage and it destroyed part of a WIF private key, so now I basically have:

Kw**********(I have the next 40 characters, just not posting for obvious reasons), so I am missing 10 characters in all.

I also have the public key. Is it possible to use this software to start a search at Kw... and iterate over the missing 10 characters with the known 40 characters also in the key.

For example : 1GuqEWwH5iRZ89oo5xw26FqmyZFMWZrtPi - is the public address

and for the WIF private key I'd have Kw**********JzXaqU2rcFSoaLaehAQHqoQX1cWCo92tAA3ihLJ7

basically I want to always have search for private key start at 'Kw', then search for missing 10, and end with 'JzXaqU2rcFSoaLaehAQHqoQX1cWCo92tAA3ihLJ7'

Any advice is appreciated and examples are even more appreciated

Thank you,
S.

The "K" at the beginning stands for an uncompressed private key so effectively one character is ruled out.

You should probably use bitcrack with a stride of "244 62 8 66 47 124 80 157 248 14 101 42 20 166 75 38 90 171 48 143 193 217 43 86 127 213 68 99 176 225 142 231 221 232 209 1 232 119 87 59 159 250 92" (these are grouped in three digits - where there's less than three digits then put zeros at the beginning).

Then you set the start range to "62 15 48 27 224 252 140 123 196 154 246 145 249 147 190 242 245 119 253 137 57 120 87 229 177 249 235 57 188 105 162 106 16 38 232 62 226 68 207 61 60 159 137 16 30 135 117 115 185 255 165 192" (3E 0F 30 1B E0 FC 8C 7B C4 9A F6 91 F9 93 BE F2 F5 77 FD 89 39 78 57 E5 B1 F9 EB 39 BC 69 A2 6A 10 26 E8 3E E2 44 CF 3D 3C 9F 89 10 1E 87 75 73 B9 FF A5 C0, or: w1111111111JzXa.....)

and the end range to "63 53 101 37 224 105 133 154 79 164 116 14 184 245 198 239 210 247 218 39 60 17 143 67 53 249 245 92 6 253 234 184 11 67 248 114 161 110 81 101 39 66 237 125 158 135 117 115 185 255 165 192" (3F 35 65 25 E0 69 85 9A 4F A4 74 0E B8 F5 C6 EF D2 F7 DA 27 3C 11 8F 43 35 F9 F5 5C 06 FD EA B8 0B 43 F8 72 A1 6E 51 65 27 42 ED 7D 9E 87 75 73 B9 FF A5 C0, or: wzzzzzzzzzzJzXa....).

Make sure you only search for uncompressed keys to speed things up.

In one command:

./bitcrack -u --keyspace 0x3E0F301BE0FC8C7BC49AF691F993BEF2F577FD89397857E5B1F9EB39BC69A26A1026E83EE244C F3D3C9F89101E877573B9FFA5C0:0x3F356525E069859A4FA4740EB8F5C6EFD2F7DA273C118F4335F9F55C06FDEAB80B43F872A16E5 1652742ED7D9E877573B9FFA5C0 --stride 2440620080660471240801572480141010420201660750380901710481431932170430861272130 68099176225142231221232209001232119087059159250092

It has a difficulty of log2(58**10) = 58.5798 bits, this is doable if you have a few GPUs.
member
Activity: 78
Merit: 133
I have a question. Recently there was a flood and a notebook containing a offline wallet was damage and it destroyed part of a WIF private key, so now I basically have:

Kw**********(I have the next 40 characters, just not posting for obvious reasons), so I am missing 10 characters in all.

I also have the public key. Is it possible to use this software to start a search at Kw... and iterate over the missing 10 characters with the known 40 characters also in the key.

For example : 1GuqEWwH5iRZ89oo5xw26FqmyZFMWZrtPi - is the public address

and for the WIF private key I'd have Kw**********JzXaqU2rcFSoaLaehAQHqoQX1cWCo92tAA3ihLJ7

basically I want to always have search for private key start at 'Kw', then search for missing 10, and end with 'JzXaqU2rcFSoaLaehAQHqoQX1cWCo92tAA3ihLJ7'

Any advice is appreciated and examples are even more appreciated

Thank you,
S.
Pages:
Jump to: