Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 207. (Read 215272 times)

Quote from: WanderingPhilospher on April 05, 2023, 12:07:53 PM

And even better, what if we can apply the prefix concept on hash160 too. Instead of looking for address prefix, we look for hash160 prefix. Even more speed. In fact, this would be the fastest way ever.

Won't work, rmd160 has 40 characters and by searching for their prefix, should we stop hashing half way? Meaning converting sha256 hash of public key into rmd160 but only looking for a specific prefix, either we generate the whole hash and compare with our target or we can't generate just a prefix to compare because it would break the function and we wouldn't know the result.

About brute force tools, bitcrack, vanity etc they all convert rmd160 to address, otherwise why would they accept an address as an input to check against?

Say huh?! You have it backwards. Or at least saying it backwards. Vanity takes addresses and converts to 160.
I also believe it converts the partial strings to 160 as well; I’d have to recheck on that but I’m pretty sure it does.

If that's the case then there is another way to speed up the process but this would work for addresses with known public key. Searching only for the public key, saves us a sha256 and rmd160 to skip.

Yeah that’s already a thing…for at least 2 years now.

digaran

copper member

Activity: 1330

Merit: 899

🖤😏

Quote from: digaran on April 05, 2023, 11:08:52 AM

Quote from: digaran on April 05, 2023, 11:08:52 AM

And even better, what if we can apply the prefix concept on hash160 too. Instead of looking for address prefix, we look for hash160 prefix. Even more speed. In fact, this would be the fastest way ever.

Won't work, rmd160 has 40 characters and by searching for their prefix, should we stop hashing half way? Meaning converting sha256 hash of public key into rmd160 but only looking for a specific prefix, either we generate the whole hash and compare with our target or we can't generate just a prefix to compare because it would break the function and we wouldn't know the result.

About brute force tools, bitcrack, vanity etc they all convert rmd160 to address, otherwise why would they accept an address as an input to check against?

Say huh?! You have it backwards. Or at least saying it backwards. Vanity takes addresses and converts to 160.
I also believe it converts the partial strings to 160 as well; I’d have to recheck on that but I’m pretty sure it does.

~~If that's the case then there is another way to speed up the process but this would work for addresses with known public key. Searching only for the public key, saves us a sha256 and rmd160 to skip.~~

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

And even better, what if we can apply the prefix concept on hash160 too. Instead of looking for address prefix, we look for hash160 prefix. Even more speed. In fact, this would be the fastest way ever.

Won't work, rmd160 has 40 characters and by searching for their prefix, should we stop hashing half way? Meaning converting sha256 hash of public key into rmd160 but only looking for a specific prefix, either we generate the whole hash and compare with our target or we can't generate just a prefix to compare because it would break the function and we wouldn't know the result.

About brute force tools, bitcrack, vanity etc they all convert rmd160 to address, otherwise why would they accept an address as an input to check against?

Say huh?! You have it backwards. Or at least saying it backwards. Vanity takes addresses and converts to 160.
I also believe it converts the partial strings to 160 as well; I’d have to recheck on that but I’m pretty sure it does.

digaran

copper member

Activity: 1330

Merit: 899

🖤😏

Quote from: WanderingPhilospher on April 05, 2023, 07:04:44 AM

And even better, what if we can apply the prefix concept on hash160 too. Instead of looking for address prefix, we look for hash160 prefix. Even more speed. In fact, this would be the fastest way ever.

Won't work, rmd160 has 40 characters and by searching for their prefix, should we stop hashing half way? Meaning converting sha256 hash of public key into rmd160 but only looking for a specific prefix, either we generate the whole hash and compare with our target or we can't generate just a prefix to compare because it would break the function and we wouldn't know the result.

~~About brute force tools, bitcrack, vanity etc they all convert rmd160 to address, otherwise why would they accept an address as an input to check against?~~

Evillo

member

Activity: 185

Merit: 15

Two things you should never abandon: Family & BTC

Quote from: Evillo on April 05, 2023, 06:56:17 AM

Quote from: WanderingPhilospher on April 05, 2023, 06:45:45 AM

Quote from: Evillo on April 05, 2023, 06:56:17 AM

I found a way to speed up the brute force attack method, drop the hash160 conversion to address, because that conversion requires a SHA-256D, that is equal as mining bitcoin, now if we skip that part, what percentage can we gain in speed increase?

True. It's how Brainflayer and keyhunt in RMD160 mode work. Much much faster and results in the same output eventually. I wish bitcrack would update to rmd mode. Might double speed.

Are y'all talking about loading/searching for hash160 versus address? I ask because this comment kind of confused me, "drop the hash160 conversion to address".

Yes

Then you are correct. This has been known and Vanity, KeyhuntCuda, do in fact already do this. I’m not sure about bitcrack; I’d have to look at the code.

Yeah Bitcrack is a classic try-the-privatekey-and-convert-to-full-address-then-compare-to-input-address thingy. It's fast and works on all GPU types, although it failed test on all RX 500 series 8GB GPUs for some reason. There is a random search version of it that generates millions of random sub-ranges and start searching through them sequentially. Good stuff. Not fast enough compared to Vanbitcracken. If we can drop the convert-all-the-way-to-address process, this can save a lot of time by generating output faster. Keyhuntcuda is a great example for this.

And even better, what if we can apply the prefix concept on hash160 too. Instead of looking for address prefix, we look for hash160 prefix. Even more speed. In fact, this would be the fastest way ever.

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote from: WanderingPhilospher on April 05, 2023, 06:45:45 AM

Quote from: WanderingPhilospher on April 05, 2023, 06:43:38 AM

I found a way to speed up the brute force attack method, drop the hash160 conversion to address, because that conversion requires a SHA-256D, that is equal as mining bitcoin, now if we skip that part, what percentage can we gain in speed increase?

True. It's how Brainflayer and keyhunt in RMD160 mode work. Much much faster and results in the same output eventually. I wish bitcrack would update to rmd mode. Might double speed.

Are y'all talking about loading/searching for hash160 versus address? I ask because this comment kind of confused me, "drop the hash160 conversion to address".

Yes

Then you are correct. This has been known and Vanity, KeyhuntCuda, do in fact already do this. I’m not sure about bitcrack; I’d have to look at the code.

Evillo

member

Activity: 185

Merit: 15

Two things you should never abandon: Family & BTC

Doing some testing on 76 bit...

Code:

KangaBGStrider v1.01
Range Start :0 (0 bit)
Range End   :FFFFFFFFFFFFFFFFFFF (76 bit)
Public Key(s) :1
Creating Stride Table...
CPU thread(s) : 8
Stride Table Complete: Max Stride: 2^36
Stride Avg Distance: 2^34.09
Number of Striders: 2^13.00
Suggested DP: 22
Expected operations: 2^41.39
Simulated DP size: 32 [0x00000000FFFFFFFF]
[31.88 MS/s][GPU 0.00 MS/s][Total Collision Checks 2^32.97][05:04 (Avg 1.0d)]
Key# 0 [1S]Pub:  0x02BF6E9A6F10A15DC828E968FC96CF9BC80A98F42227CCBE2AC4947B637B3E8FB1
       Priv: 0x865CE114686A1301A4C

Done: Total time 05:05

This code be revolutionary if stretched all the way up to say 128 bits. Might get speed that no one managed to reach before. Congrats WP, another great build.

Evillo

member

Activity: 185

Merit: 15

Two things you should never abandon: Family & BTC

Quote from: WanderingPhilospher on April 05, 2023, 06:45:45 AM

I found a way to speed up the brute force attack method, drop the hash160 conversion to address, because that conversion requires a SHA-256D, that is equal as mining bitcoin, now if we skip that part, what percentage can we gain in speed increase?

True. It's how Brainflayer and keyhunt in RMD160 mode work. Much much faster and results in the same output eventually. I wish bitcrack would update to rmd mode. Might double speed.

Are y'all talking about loading/searching for hash160 versus address? I ask because this comment kind of confused me, "drop the hash160 conversion to address".

Yes

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

I found a way to speed up the brute force attack method, drop the hash160 conversion to address, because that conversion requires a SHA-256D, that is equal as mining bitcoin, now if we skip that part, what percentage can we gain in speed increase?

True. It's how Brainflayer and keyhunt in RMD160 mode work. Much much faster and results in the same output eventually. I wish bitcrack would update to rmd mode. Might double speed.

Are y'all talking about loading/searching for hash160 versus address? I ask because this comment kind of confused me, "drop the hash160 conversion to address".

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Doing some testing on 76 bit...

Code:

KangaBGStrider v1.01
Range Start :0 (0 bit)
Range End :FFFFFFFFFFFFFFFFFFF (76 bit)
Public Key(s) :1
Creating Stride Table...
CPU thread(s) : 8
Stride Table Complete: Max Stride: 2^36
Stride Avg Distance: 2^34.09
Number of Striders: 2^13.00
Suggested DP: 22
Expected operations: 2^41.39
Simulated DP size: 32 [0x00000000FFFFFFFF]
[31.88 MS/s][GPU 0.00 MS/s][Total Collision Checks 2^32.97][05:04 (Avg 1.0d)]
Key# 0 [1S]Pub: 0x02BF6E9A6F10A15DC828E968FC96CF9BC80A98F42227CCBE2AC4947B637B3E8FB1
Priv: 0x865CE114686A1301A4C

Done: Total time 05:05

Evillo

member

Activity: 185

Merit: 15

Two things you should never abandon: Family & BTC