Possibility of a stride to search the left of the keyspace?

[gitgoingnow]

I have a private key I am searching for in the format
????????????????????????????????FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF
(i.e. the right half of the key is known).

Is there a way to conduct this search with Kangaroo? I realize that the unknown part is currently too long, but aside from that, how can this search be performed in Kangaroo?

[mirameshs]

Instead of question marks, you can use the minimum private key you can(guess) And you must also have the public key of the wallet you want You cannot use a question mark

…

On Fri, Jan 20, 2023 at 9:07 AM gitgoingnow ***@***.***> wrote: I have a private key I am searching for in the format ????????????????????????????????FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF (i.e. the right half of the key is known). Is there a way to conduct this search with Kangaroo? I realize that the unknown part is currently too long, but aside from that, how can this search be performed in Kangaroo? — Reply to this email directly, view it on GitHub <#102>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/AH4VUUW3EELV47C2U5FSORDWTIP77ANCNFSM6AAAAAAUBEOTVU> . You are receiving this because you are subscribed to this thread.Message ID: ***@***.***>

[gitgoingnow]

Thanks for the reply. I have the public key.

Using a search range between (as per the documentation)
00000000000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF
FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF

Is an impossible search, as it would include keys such as
00000000000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF1
00000000000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF2
00000000000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF3

etc which are incorrect/unnecessary. I only need to search the left side.

So I need to search :
00000000000000000000000000000001FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF
00000000000000000000000000000002FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF
00000000000000000000000000000003FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF
etc

I don't think this is possible with the software as is? But I'm wondering if it should be theoretically and technically possible to search in increments of 340282366920938463463374607431768211456 ?

[mirameshs]

I got what you mean. As far as I know, this is not possible with kangaroo.

…

On Fri, Jan 20, 2023 at 12:18 PM gitgoingnow ***@***.***> wrote: Thanks for the reply. I have the public key. Using a search range between (as per the documentation) 00000000000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF Is an impossible search, as it would include keys such as 00000000000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF1 00000000000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF2 00000000000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF3 etc which are correct/necessary. I only need to search the left side. So I need to search : 00000000000000000000000000000001FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF 00000000000000000000000000000002FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF 00000000000000000000000000000003FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF etc I don't think this is possible with the software as is? But I'm wondering if it should be theoretically and technically possible to search in increments of 340282366920938463463374607431768211456 ? — Reply to this email directly, view it on GitHub <#102 (comment)>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/AH4VUUXUHCFI6C2625IGKYDWTJGNHANCNFSM6AAAAAAUBEOTVU> . You are receiving this because you commented.Message ID: ***@***.***>

[WanderingPhilosopher]

Actually, the program, and counting in hex, your examples are wrong.

The program takes your starting range and subtracts it from your supplied start range and end range.

So the starting range is "0" and the end range is end range - start range.

Also,
00000000000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF
FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF

the next key would be
0000000000000000000000000000000100000000000000000000000000000000
not
00000000000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF1

[gitgoingnow]

I want to search in increments of 340282366920938463463374607431768211456.
So the first key I want to search is
00000000000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF

Then I want to search
00000000000000000000000000000001FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF

Then I want to search
00000000000000000000000000000002FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF

And so on.

I understand that
0000000000000000000000000000000100000000000000000000000000000000
comes after 00000000000000000000000000000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF if you are counting in increments of 1.

But I am not interested in that - the private key is going to have the last 32 characters as all F so I'm not interested in searching any option where one of them is not F, i.e. a search where the second number is 340282366920938463463374607431768211456 after my starting range, the third number is 340282366920938463463374607431768211456 + 340282366920938463463374607431768211456 after my starting range etc.

Is that possible with the software as is, or would a modification be needed? And if so, how could it be modified?