Post
Topic
Board Development & Technical Discussion
Re: Pubkey scaling/subtracting/other tips for reducing search time
by
WanderingPhilospher
on 06/07/2021, 17:44:11 UTC
This discussion was forked from the various Bitcrack, VanitySearch, and Kangaroo threads about public key scaling.

for 20 bit down = 1024*1024 = 1048576 pubkeys
~

1048576 and 1073741824 pubkeys with each other addition and mutiplication will return you 260 pubkeys apear where 16 pubkeys sure inside 10 bit down from main pubkey
these 260 pubkeys again played for get 30 bit down for 1/720 pubkeys

I don't get this tip. When I tried to shift down #120 by 20 bit I was looking at 2^20 total pubkeys generated from this. How do you manage to make do with only 260 or 720 of them? That's even less than the 1024 pubkeys I obtained from shifting 10 bits down.
Here is one tip, division equals twice as many pubkeys. Look at my post above, I can shift 16 bits down with the expense of only 2^15 keys, cutting the fat by half.
With brainless, who knows, he is a wizard at pubkey/range reduction.

Yeah that part was obvious to me, since in order to shift down by a bit you have to multiply the total number of result pubkeys by 2, effectively increasing the power.

The thing is that 260 and 720 are not powers of two so it would be helpful if brainless could explain what he's doing here to get this result.
Yeah that has nothing to do with what I was really saying. When you divide, you create double the pubkeys versus other methods, to get down to the same bit range.

Brainless is his own person, he will give you tips but not the whole formula  Smiley