Bitcoin puzzle transaction ~32 BTC prize to who solves it

[albert0bsd]

I was wondering, have you guys ever seen a wallet to generate a private key consisting of only decimal numbers without a single hex character? Well I haven't, and it is the case with only hex chars as well, so is there any way (possible way) to skip brute forcing all hex, all decimal keys and just search through the mixed keys? And what would happen to our search range if we could eliminate such keys, as in how many keys could we skip brute forcing? Isn't that an idea worth exploring?

In my case (keyhunt) and I think that it is a general case, hexadecimal is only used as output only for "friendly" representation. Internally the program works with decimal numbers a.k.a. "Big number" variable like mpz_t (from libgmp) or Int for (libsecp256k1 library).

So it should be the same performance.

[digaran]

I was wondering, have you guys ever seen a wallet to generate a private key consisting of only decimal numbers without a single hex character? Well I haven't, and it is the case with only hex chars as well, so is there any way (possible way) to skip brute forcing all hex, all decimal keys and just search through the mixed keys? And what would happen to our search range if we could eliminate such keys, as in how many keys could we skip brute forcing? Isn't that an idea worth exploring?

In my case (keyhunt) and I think that it is a general case, hexadecimal is only used as output only for "friendly" representation. Internally the program works with decimal numbers a.k.a. "Big number" variable like mpz_t (from libgmp) or Int for (libsecp256k1 library).

So it should be the same performance.

I was referring to the fact that an example string like "0xd56ff80b2c5aa58670bf455a" is being generated as a private key, and I haven't seen a wallet to generate a key like this "0x350090156477349068832154" have you? There is always  a-f  somewhere between the numbers, I am well aware of the inner workings of computers somehow, I was trying to say what if we could remove all private keys with only 0-9 numbers and somehow search the keys with hexadecimal mixed values?  

Here is how it could be, not sure how we could translate such complex algorithm for the CPU, since excluding some integers from the math equation could potentially break the function of the CPU. however here it is, if we convert the following hex representations

Code:

1000000000
2000000000
3000000000

into their decimal values we will see

Code:

68719476736
137438953472
206158430208

now let me give you a larger hex, you treat the following as hex, convert them to decimal and then treat the result again as hex to then converting them to decimal, do that until you see a-f mixed with 0-9,

Code:

528216165414251202501294350264944956991007754601639839861203467066178672860939717813863336428545439587781636107076910321618979511602500894461939292687226932251590796958660985476268182103670

what if we could skip searching such private keys? That would decrease the search range by what factor exactly?😉

[citb0in]

I was referring to the fact that an example string like "0xd56ff80b2c5aa58670bf455a" is being generated as a private key, and ...

you obviously has a thinking error here. The deterministic  wallet is not generating a hex string as a private key. It is generating an integer number. In your example it generated the number 66055669210921708841997387098. The string you specified is just a representation of it as a hex value.

Code:

#!/usr/bin/env python3
number = int(input("Please enter an integer number: "))

print("Hex: ", hex(number))
print("Octal: ", oct(number))
print("Binary: ", bin(number))

[Unplugged Taste]

I was wondering, have you guys ever seen a wallet to generate a private key consisting of only decimal numbers without a single hex character? Well I haven't, and it is the case with only hex chars as well, so is there any way (possible way) to skip brute forcing all hex, all decimal keys and just search through the mixed keys? And what would happen to our search range if we could eliminate such keys, as in how many keys could we skip brute forcing? Isn't that an idea worth exploring?

In my case (keyhunt) and I think that it is a general case, hexadecimal is only used as output only for "friendly" representation. Internally the program works with decimal numbers a.k.a. "Big number" variable like mpz_t (from libgmp) or Int for (libsecp256k1 library).

So it should be the same performance.

Hi Alberto!
I hope you are doing great!
I posted my 1 BTC lost case at this forum here https://bitcointalk.org/index.php?topic=5448332.msg62070769#msg62070769

I visited your keyhunt options for my issue but since I am not a fulltime programmer I am confused which one is best suited to my identical situation.

I'll gladly share with you 0.1 BTC on recovery of my 1 BTC.

I am in possession of 1 billion public keys. Those public keys have 1 billion private keys which are a sequence like starting private key for instance is 503, 504, 505, 506,..... upto 1 billion added.

I know the start and end range like that in BTC puzzle but its' not perfect like zeros and fffs, I'll not be sharing specifics for obvious reasons.

Plus I know the public key holding the funds. I am convinced that if Kangaroo algorithm is modified to take this 1 billion public keys in some way and find only one private key. Rest is a matter of adding or subtracting around it within 1 billion one can easily reach the private key holding funds.

[digaran]

you obviously has a thinking error here.

Prove me wrong! While you don't even know what I'm saying,  just show me a private key generated by a wallet from an integer which has a hex representation consisting of only the 0-9 numbers with no A-F characters.

Deep down every thing is 0 and 1, but on the surface things are different, and yet I'm waiting to see that wallet though.

Again excluding only numeral private keys from a bit range has a potential of at least 60% less bit space to search since there are more numeral only private keys than hex only and mixed hexadecimal keys combined. What I haven't figured out yet is how to actually erase such keys completely from the search table in a way that as if they were never existed so the CPU could process the numbers without any hiccups. Maybe working on a code that doesn't allow integers which would result in all numeral private keys, this could significantly reduce the entire bit range of all elliptic curves narrowing down the search space.!😉

[citb0in]

you obviously has a thinking error here.

Prove me wrong! While you don't even know what I'm saying,  just show me a private key generated by a wallet from an integer which has a hex representation consisting of only the 0-9 numbers with no A-F characters.

I really understand what you're saying and that's why I told you about your thinking error.

integer = 5373003642034717016865
hex = 1234567890987654321

I suggest to do a 101 primer, https://learnmeabitcoin.com/ is a good starting point.

[Evillo]

you obviously has a thinking error here.

Prove me wrong! While you don't even know what I'm saying,  just show me a private key generated by a wallet from an integer which has a hex representation consisting of only the 0-9 numbers with no A-F characters.

Deep down every thing is 0 and 1, but on the surface things are different, and yet I'm waiting to see that wallet though.

Again excluding only numeral private keys from a bit range has a potential of at least 60% less bit space to search since there are more numeral only private keys than hex only and mixed hexadecimal keys combined. What I haven't figured out yet is how to actually erase such keys completely from the search table in a way that as if they were never existed so the CPU could process the numbers without any hiccups. Maybe working on a code that doesn't allow integers which would result in all numeral private keys, this could significantly reduce the entire bit range of all elliptic curves narrowing down the search space.!

it's easy to do. i can generate such ranges with crunch then filter results with Golang until all keys are a mix of digits and letters. the only problem is, what kind of hard drive space can hold these trillions of keys before you can check them one by one. and if you think you can use keyhunt or bitcrack etc.. to do this exact task for you, think again.


BTW, i found this prefix for puzz #66 when i woke up this morning, 10 letter match prefix. I kinda find this rare enough:

Pub Addr: 13zb1hQbWVi8cYnLyEus3LFucU535Bm52s
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZwTz2AuZAUT3S519jUb
Priv (HEX): 0x00000000000000000000000000000000000000000000000345CCB1B178168878

found by Vanbitcracken random version.

[moderator's note: consecutive posts merged]

[digaran]

integer = 5373003642034717016865
hex = 1234567890987654321

Such a cool story, have you found a randomly generated private key having such hex representation as the above you posted, though? I don't think you could find a site that could explain what I am suggesting!.

Pub Addr: 13zb1hQbWVi8cYnLyEus3LFucU535Bm52s
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZwTz2AuZAUT3S519jUb
Priv (HEX): 0x00000000000000000000000000000000000000000000000345CCB1B178168878

Have you found any other similar addresses with private keys starting with 0x345CCB?

[Evillo]

Pub Addr: 13zb1hQbWVi8cYnLyEus3LFucU535Bm52s
Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qZwTz2AuZAUT3S519jUb
Priv (HEX): 0x00000000000000000000000000000000000000000000000345CCB1B178168878

Have you found any other similar addresses with private keys starting with 0x345CCB?

It doesn't work like that, there is a lot of hashing going on until you generate an address (or for our case, a prefix of that address). What i mean is, the process that takes you to a certain address gets completely random results once you change even 1 character. So finding this prefix in the range starting with 0x345CCB means nothing as a clue. In fact, the right private key will most likely reside way far from there.


------

Btw, based on your theory of "never a pvt key with all digits", if you somehow manage to remove those keys from the entire #66 range, and assuming key is not in the 20000000000000000:2ffffffffffffffff, you would end up with only around 10 million trillion keys instead of 18 million trillions. Huge progress, almost as if we're back to searching through #64 puzzle range.

Like i said, this filtered range can be easily generated; problem is how to pipe it into a cracking program without having to modify the cracking program itself.

[digaran]

Btw, based on your theory of "never a pvt key with all digits", if you somehow manage to remove those keys from the entire #66 range, and assuming key is not in the 20000000000000000:2ffffffffffffffff, you would end up with only around 10 million trillion keys instead of 18 million trillions. Huge progress, almost as if we're back to searching through #64 puzzle range.

Like i said, this filtered range can be easily generated; problem is how to pipe it into a cracking program without having to modify the cracking program itself.

Finally someone understands me! Now about how we could skip searching such keys? Isn't it obvious? We need to invent our own hexadecimal only key range. Honestly when I theorize such ideas, I don't really formulate them, because doing that takes a lot of time, I'd just introduce them to see if anyone is already versed in that area to see if they can formulate it faster.

[Evillo]

Btw, based on your theory of "never a pvt key with all digits", if you somehow manage to remove those keys from the entire #66 range, and assuming key is not in the 20000000000000000:2ffffffffffffffff, you would end up with only around 10 million trillion keys instead of 18 million trillions. Huge progress, almost as if we're back to searching through #64 puzzle range.

Like i said, this filtered range can be easily generated; problem is how to pipe it into a cracking program without having to modify the cracking program itself.

Finally someone understands me! Now about how we could skip searching such keys? Isn't it obvious? We need to invent our own hexadecimal only key range. Honestly when I theorize such ideas, I don't really formulate them, because doing that takes a lot of time, I'd just introduce them to see if anyone is already versed in that area to see if they can formulate it faster.

I'll try to do something about it. And guess what! Your theory also applies to "all letters" too. Too hard to find a pvt key consisting of all letters and no digits. So if we eliminate both types, we will end up with a smaller range.

That said, if puzz #66 turned out to have either of those
 two pvt key types in its 17 characters, I'll shoot myself 🙄

----

Edit: according to my calc. removing all digit-only keys from puzz 66 range will only save us 20k trillion keys. Not too huge compared to 36.8 million trillions but a progress still. Didn't calculate the letter-only keys amount though.

[WanderingPhilospher]

  I'll try to do something about it. And guess what! Your theory also applies to "all letters" too. Too hard to find a pvt key consisting of all letters and no digits. So if we eliminate both types, we will end up with a smaller range.

Generating the ranges to then feed them to a program is a waste of time.

There are only 16 total characters. 10 digits and 6 alphanumeric.

You would create an ungodly amount of small ranges.

Example:
1111a-1111f would be one single range.
Ffff0-ffff9 would be a single range.

The program would spend more time starting and stopping than actually getting through ranges.

If it’s hard coded in a program, maybe it would save some time, I’m just not sure how much.

Edit:

Let’s deal with #66
First 10 keys would be skipped
The next 6 would be checked
The next 10 skipped, the next 6 checked
Rinse n repeat

While a program is stopping n restarting to the next range; the same program would have checked millions of keys within that same time. A single core on keyhunt Cuda can do 3-4 million keys per second; it would take at least 2-3 seconds for a program to receive the end of range, shut down, and start the next range. I think if you are generating ranges to feed to a program, it will be much slower.

I think rotor Cuda dev had some program that skipped triples, such as 111 or fff, etc. I think it was for mini keys or WIF, I’m not 100 % sure. But he had the skips programmed into the program.

If it could be done with a key cracking program, I’d be interested in the speed comparisons.

[Evillo]

  I'll try to do something about it. And guess what! Your theory also applies to "all letters" too. Too hard to find a pvt key consisting of all letters and no digits. So if we eliminate both types, we will end up with a smaller range.

Generating the ranges to then feed them to a program is a waste of time.

There are only 16 total characters. 10 digits and 6 alphanumeric.

You would create an ungodly amount of small ranges.

Example:
1111a-1111f would be one single range.
Ffff0-ffff9 would be a single range.

The program would spend more time starting and stopping than actually getting through ranges.

If it’s hard coded in a program, maybe it would save some time, I’m just not sure how much.

Edit:

Let’s deal with #66
First 10 keys would be skipped
The next 6 would be checked
The next 10 skipped, the next 6 checked
Rinse n repeat

While a program is stopping n restarting to the next range; the same program would have checked millions of keys within that same time. A single core on keyhunt Cuda can do 3-4 million keys per second; it would take at least 2-3 seconds for a program to receive the end of range, shut down, and start the next range. I think if you are generating ranges to feed to a program, it will be much slower.

I think rotor Cuda dev had some program that skipped triples, such as 111 or fff, etc. I think it was for mini keys or WIF, I’m not 100 % sure. But he had the skips programmed into the program.

If it could be done with a key cracking program, I’d be interested in the speed comparisons.

Yeah i can see your point; rekeying is always a show stopper as it will force the cpu to stop and restart at a new key range which wastes precious time that could have been used to search more keys. But when you know you are eliminating  20,005,642,219,814,912 unnecessary keys (only-digits + only-letters) , it's worth seeking a solution, be it hard-coding it or something else.

My mind can't stop roaming around the idea.

[jareso]

I am using this solution candidate skipping approach in my custom solvers for long years.
The idea is that it should not be looked at given key range as hexadecimal representation of number and instead it should be seen as set of '0..9' and 'a..f' characters, numbers and letters, a 'string'.

Considering the fact that BTC puzzle keys were generated using Deterministic wallet and not by human mind, not intentionally formed, it is very unlikely that private keys, hexadecimal strings of longer range puzzle keys will be numbers only ('0..9') or letters only ('a..f').
Such as 0x20124579147074121, or 0x3FCAFDCBEDCABEFDA in case of puzzle #66, no way.

In 17 characters long key range, that is randomly generated, it is so unlikely that you can put your hand in the fire for the fact that there are numbers as well as letters in range string of correct solution leading to private key of puzzle #66 BTC address.

So why to waste hardware device resources to compute something that will never lead to desired solution? There is no point for that at all.
Those private key candidates can be effectively skipped without any hashing computation, thus resulting in solution finding speed-up.

How much speed-up depends on amount of ruled out potential key candidates that will very likely never lead to desired solution and doing it by far more parameters than just simple numbers only ('0..9') or letters only ('a..f').
Choosing correct prediction is the most essential in the way that will minimize the risk of skipping the right solution.

Such as guessing that not only there will be at least some letters ('a..f'), but also how much of those, will there be at least one letter, two letters, three letters?
Will be some letters repeated? Or next to each other, such as 'FF' or 'AA', or in-between 'letter-number-letter', 'letter-letter-number-number' somewhere in private key hexadecimal string, etc.
Same for numbers.

Ruling out key candidates like that results in hardware computational speed-ups that are tens, hundreds or even thousands multiplies of the original speed of the device, but naturally depending on parameters greatly increase risk of skipping the right solution.
This is of course primitive approach just for sake of example.

I went further with it and made approach tunable by far more advanced parameters, probability and combination of prediction systems that resulted in significant speed-up per hardware device, but is keeping it in relatively safe area for risk of skipping the right solution.
Safety and approach being tunable to reach right balance between risk and speed-up.

It is definitely far more fun than plain brute-force of one-by-one scanhashing and much more effective when keeping within safe parameters.

Btw. I effectively implemented the same method to cryptocurrency mining in various mining algorithms where my mining kernels by fine-tuning probability using prediction systems approach algorithmically manipulate chances, move chances of finding nonce to miner side, skipping non-interesting nonce candidates without any hashing at all giving miner the house edge, fine-tuneable to balance risk and the right solution.

That results in nonce being found more often in contrast to old-fashioned one-by-one scanhash brute-force mining, thus overall faster miner, how faster depending on internal fine-tuning.

Bruteforce mining one-by-one scanhash is sooooooo boring, 'prediction mining' and skipping nonce candidates without hashing is fully according to my taste.
But well that is another story.

[AlanJohnson]

I was thinking about the same. Why scanning ranges like 2FFFFFFFFxxxxxxxx etc...  I can bet the private key for 66 puzzle dont have more than two same digits one by one.

But then i realized it has only meaning in case of bruteforcing one by one. But when we are using random mode chance that we check whole ranges of keys with many the same digits are so small that it has no meaning.

Correct me if im wrong.  The best method is massive power and random seeking.

[zahid888]

@diagaran_or_what.. Please don't ask me again how I type such a long post It's difficult for me to answer such tough questions. Just like you asked me similar before and your fingers got tired scrolling through my post. Think about how much time it took to you just to read, so how much time and effort I had to put to type those posts. LoL  
 

 ================================ HX: 3002143f  ==================================

 ================================ VanBitCracken ==================================

SH256 : 3002143f
Addrs : 13z9shQvWHTR8E4zZ3fbrdJtZmJNcdeR8F
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^^^  ^^ ^                  ^ ^
CharM : 8
Range : 3002143f000000000:3002143ffffffffff

VanBitCrackenS v1.0
Keyspace start=3002143F000000000
Keyspace   end=3002143FFFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:01:16 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1118.000 MK/s (GPU 1118.000 MK/s) (2^36.14) [00:01:06 Elapsed Time][1]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:02:25 2023
 ================================ HX: 300ae2ac  ==================================

 ================================ VanBitCracken ==================================

SH256 : 300ae2ac
Addrs : 1HzmWtqZMjshESPgzvGR2ardzdBMNdhDZ2
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^ ^       ^  ^      ^    ^   ^^
CharM : 8
Range : 300ae2ac000000000:300ae2acfffffffff

VanBitCrackenS v1.0
Keyspace start=300AE2AC000000000
Keyspace   end=300AE2ACFFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:03:00 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1112.922 MK/s (GPU 1112.922 MK/s) (2^36.25) [00:01:12 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:04:14 2023
 ================================ HX: 300f8354  ==================================

 ================================ VanBitCracken ==================================

SH256 : 300f8354
Addrs : 13cLWybKWVivaSG6fsPoGK4knnCNfae8f3
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^^      ^^   ^        ^ ^  ^
CharM : 8
Range : 300f8354000000000:300f8354fffffffff

VanBitCrackenS v1.0
Keyspace start=300F8354000000000
Keyspace   end=300F8354FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:04:33 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1112.285 MK/s (GPU 1112.285 MK/s) (2^36.24) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:05:48 2023
 ================================ HX: 300fa98b  ==================================

 ================================ VanBitCracken ==================================

SH256 : 300fa98b
Addrs : 137Sh16tWXsH2gbZQur2LE4Vnre5zFHva1
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^^      ^ ^ ^  ^      ^ ^
CharM : 8
Range : 300fa98b000000000:300fa98bfffffffff

VanBitCrackenS v1.0
Keyspace start=300FA98B000000000
Keyspace   end=300FA98BFFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:05:48 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1099.703 MK/s (GPU 1099.703 MK/s) (2^36.22) [00:01:13 Elapsed Time][1]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:07:03 2023
 ================================ HX: 3016f0ee  ==================================

 ================================ VanBitCracken ==================================

SH256 : 3016f0ee
Addrs : 13pJ1FA4SGfMH4DXTZzcw415ndNL2ijVav
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^^  ^           ^^      ^^^
CharM : 8
Range : 3016f0ee000000000:3016f0eefffffffff

VanBitCrackenS v1.0
Keyspace start=3016F0EE000000000
Keyspace   end=3016F0EEFFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:07:32 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1103.726 MK/s (GPU 1103.726 MK/s) (2^36.23) [00:01:12 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:08:47 2023
 ================================ HX: 30197557  ==================================

 ================================ VanBitCracken ==================================

SH256 : 30197557
Addrs : 13GE15Q1XmrfDwFC87WZ2ZXnyHN3pQBxs6
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^^  ^ ^             ^     ^ ^   ^
CharM : 8
Range : 30197557000000000:30197557fffffffff

VanBitCrackenS v1.0
Keyspace start=30197557000000000
Keyspace   end=30197557FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:08:57 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1092.863 MK/s (GPU 1092.863 MK/s) (2^36.22) [00:01:12 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:10:11 2023
 ================================ HX: 301d9599  ==================================

 ================================ VanBitCracken ==================================

SH256 : 301d9599
Addrs : 1DhoJUEvWyxhPB7ZR46vTq4dwN8zpdZdsk
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^       ^     ^^      ^     ^^  ^
CharM : 8
Range : 301d9599000000000:301d9599fffffffff

VanBitCrackenS v1.0
Keyspace start=301D9599000000000
Keyspace   end=301D9599FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:10:28 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1088.180 MK/s (GPU 1088.180 MK/s) (2^36.22) [00:01:12 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:11:42 2023
 ================================ HX: 30305882  ==================================

 ================================ VanBitCracken ==================================

SH256 : 30305882
Addrs : 18cDftJmyEUnHdYNTZnP2bDpgJsbpQqTgo
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^               ^^^^^       ^    ^
CharM : 8
Range : 30305882000000000:30305882fffffffff

VanBitCrackenS v1.0
Keyspace start=30305882000000000
Keyspace   end=30305882FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:12:59 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1089.118 MK/s (GPU 1089.118 MK/s) (2^36.23) [00:01:12 Elapsed Time][1]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:14:13 2023
 ================================ HX: 3038c629  ==================================

 ================================ VanBitCracken ==================================

SH256 : 3038c629
Addrs : 1KzKNhuE6VYG2tk5Tczpib4MmTTjbBmoro
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^ ^  ^   ^  ^   ^     ^          ^
CharM : 8
Range : 3038c629000000000:3038c629fffffffff

VanBitCrackenS v1.0
Keyspace start=3038C629000000000
Keyspace   end=3038C629FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:14:49 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1098.044 MK/s (GPU 1098.044 MK/s) (2^36.23) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:16:03 2023
 ================================ HX: 3050b382  ==================================

 ================================ VanBitCracken ==================================

SH256 : 3050b382
Addrs : 1PzbDhyNE4XKNS7g6oGd2Ur5EfkipaKzr7
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^ ^^ ^       ^^     ^       ^
CharM : 8
Range : 3050b382000000000:3050b382fffffffff

VanBitCrackenS v1.0
Keyspace start=3050B382000000000
Keyspace   end=3050B382FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:17:49 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1111.363 MK/s (GPU 1111.363 MK/s) (2^36.24) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:19:03 2023
 ================================ HX: 305b134c  ==================================

 ================================ VanBitCracken ==================================

SH256 : 305b134c
Addrs : 1LwpshVdWhJyms4yTpqDi9VWuoNHpMa5sm
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^    ^  ^       ^         ^ ^  ^^
CharM : 8
Range : 305b134c000000000:305b134cfffffffff

VanBitCrackenS v1.0
Keyspace start=305B134C000000000
Keyspace   end=305B134CFFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:19:45 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1089.305 MK/s (GPU 1089.305 MK/s) (2^36.23) [00:01:12 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:21:00 2023
 ================================ HX: 3089a869  ==================================

 ================================ VanBitCracken ==================================

SH256 : 3089a869
Addrs : 12zbkhB295eL21a5qL2M2G2Pnt7EB1ERua
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^ ^^ ^      ^       ^^  ^
CharM : 8
Range : 3089a869000000000:3089a869fffffffff

VanBitCrackenS v1.0
Keyspace start=3089A869000000000
Keyspace   end=3089A869FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:24:07 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1106.989 MK/s (GPU 1106.989 MK/s) (2^36.24) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:25:22 2023
 ================================ HX: 3092ecc4  ==================================

 ================================ VanBitCracken ==================================

SH256 : 3092ecc4
Addrs : 13yzGJQbGTmcxT87T15P1m6zoYN5HYYC3J
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^^    ^^   ^    ^  ^      ^
CharM : 8
Range : 3092ecc4000000000:3092ecc4fffffffff

VanBitCrackenS v1.0
Keyspace start=3092ECC4000000000
Keyspace   end=3092ECC4FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:25:59 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1103.318 MK/s (GPU 1103.318 MK/s) (2^36.23) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:27:14 2023
 ================================ HX: 309fa528  ==================================

 ================================ VanBitCracken ==================================

SH256 : 309fa528
Addrs : 13fWs4QvTSrKNo7auWDQ2GYu1fNAGtxrDX
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^^    ^       ^     ^^ ^  ^
CharM : 8
Range : 309fa528000000000:309fa528fffffffff

VanBitCrackenS v1.0
Keyspace start=309FA528000000000
Keyspace   end=309FA528FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:28:04 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1101.627 MK/s (GPU 1101.627 MK/s) (2^36.24) [00:01:12 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:29:19 2023
 ================================ HX: 30a9e20c  ==================================

 ================================ VanBitCracken ==================================

SH256 : 30a9e20c
Addrs : 1Bdh6YCfdu2cT4CiUZMgBGbonrSNpWzSxo
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^          ^     ^   ^  ^  ^^    ^
CharM : 8
Range : 30a9e20c000000000:30a9e20cfffffffff

VanBitCrackenS v1.0
Keyspace start=30A9E20C000000000
Keyspace   end=30A9E20CFFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:30:00 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1100.394 MK/s (GPU 1100.394 MK/s) (2^36.24) [00:01:13 Elapsed Time][1]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:31:14 2023
 ================================ HX: 30aaf03b  ==================================

 ================================ VanBitCracken ==================================

SH256 : 30aaf03b
Addrs : 1Cb3hhbXNayuESmZXZncQWQ6tuT8WZhh4o
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^    ^       ^ ^ ^^           ^  ^
CharM : 8
Range : 30aaf03b000000000:30aaf03bfffffffff

VanBitCrackenS v1.0
Keyspace start=30AAF03B000000000
Keyspace   end=30AAF03BFFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:31:19 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1107.335 MK/s (GPU 1107.335 MK/s) (2^36.22) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:32:33 2023
 ================================ HX: 30b207b5  ==================================

 ================================ VanBitCracken ==================================

SH256 : 30b207b5
Addrs : 13zaiEgkJBsHwZuVMa5PzCcuXTkfEpahso
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^^^       ^        ^   ^        ^^
CharM : 8
Range : 30b207b5000000000:30b207b5fffffffff

VanBitCrackenS v1.0
Keyspace start=30B207B5000000000
Keyspace   end=30B207B5FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:33:01 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1097.762 MK/s (GPU 1097.762 MK/s) (2^36.23) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:34:16 2023
 ================================ HX: 30b24770  ==================================

 ================================ VanBitCracken ==================================

SH256 : 30b24770
Addrs : 13Ekb36F5nWRYSHNMU6P7sWunW7jMPu5go
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^^           ^     ^   ^^      ^ ^
CharM : 8
Range : 30b24770000000000:30b24770fffffffff

VanBitCrackenS v1.0
Keyspace start=30B24770000000000
Keyspace   end=30B24770FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:34:17 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1086.613 MK/s (GPU 1086.613 MK/s) (2^36.21) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:35:32 2023
 ================================ HX: 30bd7782  ==================================

 ================================ VanBitCracken ==================================

SH256 : 30bd7782
Addrs : 16mCuQQbWdY3L4NZWT9AbZQuKnqbYdkqsV
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^     ^^^      ^       ^     ^  ^
CharM : 8
Range : 30bd7782000000000:30bd7782fffffffff

VanBitCrackenS v1.0
Keyspace start=30BD7782000000000
Keyspace   end=30BD7782FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:36:17 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1101.150 MK/s (GPU 1101.150 MK/s) (2^36.24) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:37:31 2023
 ================================ HX: 30c4f92b  ==================================

 ================================ VanBitCracken ==================================

SH256 : 30c4f92b
Addrs : 1EtE1MXfWcFc4d7aTQnFpH4rkUx616VtdJ
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^   ^   ^  ^  ^ ^ ^   ^
CharM : 8
Range : 30c4f92b000000000:30c4f92bfffffffff

VanBitCrackenS v1.0
Keyspace start=30C4F92B000000000
Keyspace   end=30C4F92BFFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:38:01 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1094.076 MK/s (GPU 1094.076 MK/s) (2^36.23) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:39:16 2023
 ================================ HX: 30cbd619  ==================================

 ================================ VanBitCracken ==================================

SH256 : 30cbd619
Addrs : 1Nj21hybW5yX3fRBub142w16YPNoRhE5rU
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^   ^^ ^^           ^     ^    ^
CharM : 8
Range : 30cbd619000000000:30cbd619fffffffff

VanBitCrackenS v1.0
Keyspace start=30CBD619000000000
Keyspace   end=30CBD619FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:39:43 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1097.611 MK/s (GPU 1097.611 MK/s) (2^36.23) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:40:57 2023
 ================================ HX: 30cd35f8  ==================================

 ================================ VanBitCracken ==================================

SH256 : 30cd35f8
Addrs : 1GbPChQbZbXS268CqfnPHxBuDfjMVXqBZQ
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^    ^^^    ^     ^^   ^
CharM : 8
Range : 30cd35f8000000000:30cd35f8fffffffff

VanBitCrackenS v1.0
Keyspace start=30CD35F8000000000
Keyspace   end=30CD35F8FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:41:03 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1089.334 MK/s (GPU 1089.334 MK/s) (2^36.21) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:42:18 2023
 ================================ HX: 30d66252  ==================================

 ================================ VanBitCracken ==================================

SH256 : 30d66252
Addrs : 13FnwhQb3yKqec9gTW3oBd4Ju53YLRt5dU
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^^   ^^^        ^     ^        ^
CharM : 8
Range : 30d66252000000000:30d66252fffffffff

VanBitCrackenS v1.0
Keyspace start=30D66252000000000
Keyspace   end=30D66252FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:42:54 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1091.544 MK/s (GPU 1091.544 MK/s) (2^36.23) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:44:09 2023
 ================================ HX: 30dc02a9  ==================================

 ================================ VanBitCracken ==================================

SH256 : 30dc02a9
Addrs : 17Hb1F3BDoMTsFV7T3nP2GY3YRHRzJtJzP
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^  ^^           ^ ^^^^
CharM : 8
Range : 30dc02a9000000000:30dc02a9fffffffff

VanBitCrackenS v1.0
Keyspace start=30DC02A9000000000
Keyspace   end=30DC02A9FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:44:31 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1102.543 MK/s (GPU 1102.543 MK/s) (2^36.23) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:45:46 2023
 ================================ HX: 30e1ffdf  ==================================

 ================================ VanBitCracken ==================================

SH256 : 30e1ffdf
Addrs : 18RRYeQAPpCcXJccyFnQCYFcmdNMndhQh1
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^     ^    ^      ^      ^^  ^^
CharM : 8
Range : 30e1ffdf000000000:30e1ffdffffffffff

VanBitCrackenS v1.0
Keyspace start=30E1FFDF000000000
Keyspace   end=30E1FFDFFFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:46:10 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1100.246 MK/s (GPU 1100.246 MK/s) (2^36.23) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:47:24 2023
 ================================ HX: 30e9680f  ==================================

 ================================ VanBitCracken ==================================

SH256 : 30e9680f
Addrs : 1BcP1h5H6wi624imTZVpj8haRHimppoBEo
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^   ^^      ^   ^^          ^    ^
CharM : 8
Range : 30e9680f000000000:30e9680ffffffffff

VanBitCrackenS v1.0
Keyspace start=30E9680F000000000
Keyspace   end=30E9680FFFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:47:54 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1102.447 MK/s (GPU 1102.447 MK/s) (2^36.23) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:49:08 2023
 ================================ HX: 30ec981c  ==================================

 ================================ VanBitCracken ==================================

SH256 : 30ec981c
Addrs : 13A6i9qouwLc8KbZcHnbLLRufdWc5L45YS
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^^         ^   ^  ^    ^ ^     ^
CharM : 8
Range : 30ec981c000000000:30ec981cfffffffff

VanBitCrackenS v1.0
Keyspace start=30EC981C000000000
Keyspace   end=30EC981CFFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:49:22 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1089.554 MK/s (GPU 1089.554 MK/s) (2^36.22) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:50:36 2023
 ================================ HX: 30f1b497  ==================================

 ================================ VanBitCracken ==================================

SH256 : 30f1b497
Addrs : 1BDZz8QDtwsX2qByeogESGWzwANDpduRXM
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^     ^   ^ ^        ^    ^ ^^
CharM : 8
Range : 30f1b497000000000:30f1b497fffffffff

VanBitCrackenS v1.0
Keyspace start=30F1B497000000000
Keyspace   end=30F1B497FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:50:57 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1097.367 MK/s (GPU 1097.367 MK/s) (2^36.23) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:52:12 2023
 ================================ HX: 3107c9b6  ==================================

 ================================ VanBitCracken ==================================

SH256 : 3107c9b6
Addrs : 17zi1uQbAeP5NJgvhFsP9esdmsPLprhjTa
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^ ^ ^ ^^           ^        ^ ^
CharM : 8
Range : 3107c9b6000000000:3107c9b6fffffffff

VanBitCrackenS v1.0
Keyspace start=3107C9B6000000000
Keyspace   end=3107C9B6FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:53:40 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1101.443 MK/s (GPU 1101.443 MK/s) (2^36.24) [00:01:13 Elapsed Time][1]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:54:54 2023
 ================================ HX: 3130db9f  ==================================

 ================================ VanBitCracken ==================================

SH256 : 3130db9f
Addrs : 13RPTbh1CasDANbyJknr7Guun6Nxp4PvKU
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^^        ^       ^  ^ ^^ ^ ^
CharM : 9
Range : 3130db9f000000000:3130db9ffffffffff

VanBitCrackenS v1.0
Keyspace start=3130DB9F000000000
Keyspace   end=3130DB9FFFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:57:43 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1111.006 MK/s (GPU 1111.006 MK/s) (2^36.25) [00:01:12 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 09:58:57 2023
 ================================ HX: 313469e6  ==================================

 ================================ VanBitCracken ==================================

SH256 : 313469e6
Addrs : 16Yb1hYCYkbAXiDtNZ7sQ2He1HSdedhPzo
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^  ^^^           ^           ^^  ^
CharM : 8
Range : 313469e6000000000:313469e6fffffffff

VanBitCrackenS v1.0
Keyspace start=313469E6000000000
Keyspace   end=313469E6FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 09:59:11 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1101.664 MK/s (GPU 1101.664 MK/s) (2^36.23) [00:01:12 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 10:00:26 2023
 ================================ HX: 3138e1f1  ==================================

 ================================ VanBitCracken ==================================

SH256 : 3138e1f1
Addrs : 13PGohQTrdxRTS7PTQaRP8Vf6GwT1dHDtC
Addrr : 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
Match : ^^   ^^      ^^ ^            ^
CharM : 8
Range : 3138e1f1000000000:3138e1f1fffffffff

VanBitCrackenS v1.0
Keyspace start=3138E1F1000000000
Keyspace   end=3138E1F1FFFFFFFFF
Search: 15 prefixes (Lookup size 15) [Compressed]
Started at Thu Apr 13 10:00:44 2023
CPU threads used: 0
GPU: GPU #0 NVIDIA GeForce RTX 3060 Ti (38x128 cores) Grid(304x512)
1102.075 MK/s (GPU 1102.075 MK/s) (2^36.23) [00:01:13 Elapsed Time][0]
[EXIT] Reached end of keyspace.

Finish at Thu Apr 13 10:01:59 2023

Running in Sequence.. if CharM <=8, run Vanbitcracken, SH256 +=1 .. (30000000 to 3fffffff) done.. here some results..

13zb1hQbRXvkTa7QZiycsWg8HzPNsjCC5Z  3002143F43C981236
13zb1hQbzuw1u97oPKTTR5kLZyw2BBAuSE  300FA98B4015AA825
13zb1hQbM3D9dBABvLfKWGe2Qk9DAcbb5W  303058825C708578D
13zb1hQbufk8eJz3hdVBu5XfwWeYjyygSe  30A9E20C2ABD46369
13zb1hQb7pCrEh8kicBmsrhYMevZJG3v3Z  3107C9B72FC60BC10
13zb1hQbrydFXgVJYckdtUD6SagFv3cJ6m  3CD96992655860AE6
13zb1hQbbkFFrDtE2xN41tt2uRQX7KGwAs  3E0578EEC724646D3
13zb1hQbm57uDt9S9hqNGgqe2A4Z63Enos  3E7693F3E0AE23C22
13zb1hQbPRZRi1pcZJ4ubabLuYghEQM1Qg  3F24D5BE07CA26AAE

[Evillo]

I was thinking about the same. Why scanning ranges like 2FFFFFFFFxxxxxxxx etc...  I can bet the private key for 66 puzzle dont have more than two same digits one by one.

But then i realized it has only meaning in case of bruteforcing one by one. But when we are using random mode chance that we check whole ranges of keys with many the same digits are so small that it has no meaning.

Correct me if im wrong.  The best method is massive power and random seeking.

So True. When in random mode, programs will handle randomness for you that you won't even have to worry about running into letter-only or digit-only private keys

[citb0in]

@zahid888: can you explain please what you're trying to explain or show? as far as I know it does not matter if only certain substrings of the searched bitcoin address match or not, that does not help in finding the right key for #66. As we all know, the hash value changes completely if you change only a single character of the initial value. So I don't understand how your output from VanBitkracken is supposed to help.

[Evillo]

@zahid888: can you explain please what you're trying to explain or show? as far as I know it does not matter if only certain substrings of the searched bitcoin address match or not, that does not help in finding the right key for #66. As we all know, the hash value changes completely if you change only a single character of the initial value. So I don't understand how your output from VanBitkracken is supposed to help.

He is trying to do exactly what the human brain does with the universe; which is trying to find a pattern within chaos. I can't blame him for trying. Personally though, i think giving in to randomness will be the only way to find the exact puzzle address. I believe there's no shortcuts. Just the thought of sequential key search gives me headache lol.

[zahid888]

@zahid888: can you explain please what you're trying to explain or show? as far as I know it does not matter if only certain substrings of the searched bitcoin address match or not, that does not help in finding the right key for #66. As we all know, the hash value changes completely if you change only a single character of the initial value. So I don't understand how your output from VanBitkracken is supposed to help.

He is trying to do exactly what the human brain does with the universe; which is trying to find a pattern within chaos. I can't blame him for trying. Personally though, i think giving in to randomness will be the only way to find the exact puzzle address. I believe there's no shortcuts. Just the thought of sequential key search gives me headache lol.

Until we don't have the capability to count in a sequence, we will have to estimate some parts randomly and complete the remaining parts by counting them in the sequence. Besides this, we do not have any other alternative method available.

Therefore, I am dividing Puzzle 66 into two parts and as we know it will start with 2 or 3, I have assumed it will start with 3. Then, I am incrementing the 1 in the 8 hex ("30000000") up to ("3fffffff"). In this process, I am comparing the address of Puzzle 66 with the addresses obtained from incrementing the 8 hex. If the 8 or more character of Puzzle 66's address match with the address obtained from incrementing the 8 hex, I took that 8 hex as first part of 17 hex of P66 and counting the remaining 9 hex using VanBitCracken. This process gave me approximately 427 ranges, and it took me about 70 seconds to complete one range. Thus, it took me about 8 hours to complete 427 ranges. I believe that using some logical approach for counting, instead of generating completely random hex, may lead to a solution. I am aware that this is also a random method, but with a little logic. I know there is unequivocally no shortcut to solve this puzzle. However, unless I have the capacity to count in a sequence, I will have to resort to some shortcut method.

 

================================ Comparision ==================================

Addrs : 164Y9q9JMK6iCJZBVZ4NMsf2v2mtvj8G87         Privs  : f7051f270000739b
Addrr : 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN         Privr  : f7051f270b9112d4
Match : ^^ ^ ^ ^    ^ ^              ^             Match  : ^^^^^^^^^
CharM : 8                                          CharM  : 9

 ================================ Comparision ==================================

Addrs : 14sifqdJowM5C3ZadhPVhFR9mZggDT6PUB         Privs  : f7051f27000308b3
Addrr : 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN         Privr  : f7051f270b9112d4
Match : ^    ^ ^    ^ ^   ^    ^   ^               Match  : ^^^^^^^^^
CharM : 8                                          CharM  : 9

 ================================ Comparision ==================================

Addrs : 16uHrkWJny7puWZygUn8L1MrCUr1X9ykWo         Privs  : f7051f2700067f2d
Addrr : 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN         Privr  : f7051f270b9112d4
Match : ^^     ^^     ^^   ^          ^            Match  : ^^^^^^^^^
CharM : 8                                          CharM  : 9

 ================================ Comparision ==================================

Addrs : 1Beseq1iUxp7C5ZCfBL8JqS1GxoMWTNvTn         Privs  : f7051f2700135bfa
Addrr : 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN         Privr  : f7051f270b9112d4
Match : ^    ^   ^ ^^ ^  ^ ^                       Match  : ^^^^^^^^^
CharM : 8                                          CharM  : 9

 ================================ Comparision ==================================

Addrs : 16gNjvB86BF2C5ZpVNVUjjvndTqgsjRXK1         Privs  : f7051f27001434bb
Addrr : 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN         Privr  : f7051f270b9112d4
Match : ^^          ^ ^         ^  ^ ^ ^           Match  : ^^^^^^^^^
CharM : 8                                          CharM  : 9

 ================================ Comparision ==================================

Addrs : 18jymmaJexHnPHZPQgKtjckvMqbaWWcGQa         Privs  : f7051f270014994b
Addrr : 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN         Privr  : f7051f270b9112d4
Match : ^ ^    ^ ^   ^^      ^          ^          Match  : ^^^^^^^^^
CharM : 8                                          CharM  : 9

 ================================ Comparision ==================================

Addrs : 16j388zpRpTHmHaP7JNZAeN9u5dC8yTbQN         Privs  : f7051f27001a672c
Addrr : 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN         Privr  : f7051f270b9112d4
Match : ^^^          ^         ^ ^      ^^         Match  : ^^^^^^^^^
CharM : 8                                          CharM  : 9

 ================================ Comparision ==================================

Addrs : 166N7qi5jSBu4MzvJBJvDRadM5hdG8JnQL         Privs  : f7051f27001f5543
Addrr : 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN         Privr  : f7051f270b9112d4
Match : ^^  ^^           ^    ^  ^      ^          Match  : ^^^^^^^^^
CharM : 8                                          CharM  : 9

Here i observe one more thing if i put allready known 8hex it represent more faster to generate 8 matching charaters of addresses.