Bitcoin puzzle transaction ~32 BTC prize to who solves it

[nomachine]

P.S. Removed the stride option—to avoid further confusion, since this option does nothing.

I think it's my fault. I asked for that option—to make it similar to Keyhunt. 

STRIDE is also not working in KEYHUNT

nevertheless, the range file option is way better than stride...  

It’s much easier to talk about a particular option than to make it work in practice. Better yet, how much time did you spend on it to actually make it work? I’d rather go fishing.  

[Akito S. M. Hosana]

I’d rather go fishing.  

Maybe you would have solved the puzzle if you hadn't gone fishing? 

[nochkin]

Maybe you would have solved the puzzle if you hadn't gone fishing? 

Not necessary. But if you go phishing instead of fishing, then it's definitely. Not nice though.

[FrozenThroneGuy]

P.S. Removed the stride option—to avoid further confusion, since this option does nothing.

I think it's my fault. I asked for that option—to make it similar to Keyhunt. 

STRIDE is also not working in KEYHUNT

nevertheless, the range file option is way better than stride...  

It’s much easier to talk about a particular option than to make it work in practice. Better yet, how much time did you spend on it to actually make it work? I’d rather go fishing.  

Hello NoMachine! Do you think about ShaNi intrinsic for speeding up SHA256? It is not so difficult like AVX Secp256k1, but it can speed up computing sha up to 2-3 times.
I was trying to do this, but the speed decrease from 6ns per hash to 150ns.

[kTimesG]

It's interesting to see how all sorts of complexities attempt to simplify the situation.

I guess it's now stride's week. How does it help? Well, it's boring to keep the algorithm straightforward. And it of course increases chances, since it's covering more terrain, I assume.

Code:

priv -> pub -> sha[0] -> rmd[0] -> check
[priv + 1] -> pub + G -> sha[1] -> rmd[1] -> check
...
{privs} -> {pubs batch} -> {shas} -> {rmds} -> check

Now, I have the ultimate maximum performance and speed method:

- compute k*G from 1 to 2**N / 2 (this is a one-time only step anyway)
- compute (2**(N-1) + k*(2**(N - 1) / 2))*G to get the middle key of the scan interval
- do a single batch addition to compute all the public keys of the interval; reuse the batched inverses (and you'll ever need a single inversion! wowza!)

Voila. At some point during the last step of this batch addition, you'll hit the key.

Genius. Don't thank me - script it!

[nomachine]

It is not so difficult like AVX Secp256k1

Yo, fam! If your code’s crawling at 150ns when it should be flying at 6ns, something’s off. AVX2’s 256-bit registers can handle 4 or 8 hashes at once like a pro. That W array expansion (the σ0/σ1 math) is begging for SIMD. sha256rnds2 goes brrr—like 5x faster than scalar.

You’re probably vectorizing just ONE hash instead of stacking 4-8 like pancakes. Double-check if you’re using the flags: -mavx2 -mbmi2 -madx -fwrapv.

Shoutout to the guy who nailed it:
https://github.com/ulhaocheng/avxecc

The core math is similar, just different numbers.

Key takeaways:

AVX2-optimized field multiplication (the slowest part of ECC).

Parallel limb ops (256-bit registers crunching 32/64-bit chunks).

Just tweak it for Secp256k1’s constants, and you’re golden

[Akito S. M. Hosana]

Shoutout to the guy who nailed it:
https://github.com/ulhaocheng/avxecc

Man, I’d way rather learn Chinese than mess with these crazy formulas from here:
https://sacworkshop.org/SAC20/files/preproceedings/27-HighThroughput.pdf

So, what's the idea here? To create a completely new form of AVX2-accelerated ECC from scratch with secp256k1 parameters?

 

[nomachine]

So, what's the idea here? To create a completely new form of AVX2-accelerated ECC from scratch with secp256k1 parameters?

It can’t be any other way. There is nothing similar using 'limb-slicing' published on GitHub.

[360videosro]

Besides bitcrack which wasn't updated for the last 5+ years,  is there any similar tool using the cuda GPU but to generate randomly within a range?

[kTimesG]

Shoutout to the guy who nailed it:
https://github.com/ulhaocheng/avxecc

Key takeaways:

AVX2-optimized field multiplication (the slowest part of ECC).

Parallel limb ops (256-bit registers crunching 32/64-bit chunks).

Just tweak it for Secp256k1’s constants, and you’re golden

I think you meant scalar multiplication there... which is basically a no-op if scanning ranges with sequential keys.

I bet libsecp256k1 is faster than that though, since it's already SIMD-ed by the compiler, because it uses carry-free independent limbs. That's like, free vectorization out of the box, less cycles / op, and so on.

Ideal for ending up with a fried CPU, which seems like it's what people want.

[nomachine]

Ideal for ending up with a fried CPU, which seems like it's what people want.

A fried CPU could indeed be the problem here.

[Akito S. M. Hosana]

Ideal for ending up with a fried CPU, which seems like it's what people want.

A fried CPU could indeed be the problem here.

What about the AOCC compiler that was mentioned earlier?

https://www.amd.com/en/developer/aocc.html

AOCC automatically converts scalar operations into SIMD instructions

[fixedpaul]

Besides bitcrack which wasn't updated for the last 5+ years,  is there any similar tool using the cuda GPU but to generate randomly within a range?

You can check my GitHub, VanitySearch-bitcrack has a random mode

[nomachine]

What about the AOCC compiler that was mentioned earlier?

https://www.amd.com/en/developer/aocc.html

AOCC automatically converts scalar operations into SIMD instructions

This is a great thing, but on one condition: all the code must be extremely pedantic. Even then, the CPU might overheat. You’ll need very good cooling.  

[360videosro]

Besides bitcrack which wasn't updated for the last 5+ years,  is there any similar tool using the cuda GPU but to generate randomly within a range?

You can check my GitHub, VanitySearch-bitcrack has a random mode

I don't see

VanitySeacrh [-check] [-v] [-u] [-b] [-c] [-gpu] [-stop] [-i inputfile]
             [-gpuId gpuId1[,gpuId2,...]] [-g gridSize1[,gridSize2,...]]
             [-o outputfile] [-m maxFound] [-ps seed] [-s seed] [-t nbThread]
             [-nosse] [-r rekey] [-check] [-kp] [-sp startPubKey]
             [-rp privkey partialkeyfile] [prefix]

 prefix: prefix to search (Can contains wildcard '?' or '*')
 -v: Print version
 -u: Search uncompressed addresses
 -b: Search both uncompressed or compressed addresses
 -c: Case unsensitive search
 -gpu: Enable gpu calculation
 -stop: Stop when all prefixes are found
 -i inputfile: Get list of prefixes to search from specified file
 -o outputfile: Output results to the specified file
 -gpu gpuId1,gpuId2,...: List of GPU(s) to use, default is 0
 -g gridSize1,gridSize2,...: Specify GPU(s) kernel gridsize, default is 8*(MP number)
 -m: Specify maximun number of prefixes found by each kernel call
 -t threadNumber: Specify number of CPU thread, default is number of core
 -nosse: Disable SSE hash function
 -l: List cuda enabled devices
 -check: Check CPU and GPU kernel vs CPU
 -kp: Generate key pair
 -rp privkey partialkeyfile: Reconstruct final private key(s) from partial key(s) info.
 -sp startPubKey: Start the search with a pubKey (for private key splitting)
 -r rekey: Rekey interval in MegaKey, cpu=1000 gpu=100000

 --keyspace START
            START:END
            START:+COUNT
            :+COUNT
            :END
            Where START, END, COUNT are in hex format
 --share M / N: Divide the keyspace into N equal shares, process the Mth share
 --continue sessfile: Save / load progress from specified file

[fixedpaul]

Besides bitcrack which wasn't updated for the last 5+ years,  is there any similar tool using the cuda GPU but to generate randomly within a range?

You can check my GitHub, VanitySearch-bitcrack has a random mode

I don't see

https://github.com/FixedPaul/VanitySearch-Bitcrack

[360videosro]

Besides bitcrack which wasn't updated for the last 5+ years,  is there any similar tool using the cuda GPU but to generate randomly within a range?

You can check my GitHub, VanitySearch-bitcrack has a random mode

I don't see

https://github.com/FixedPaul/VanitySearch-Bitcrack

Thanks. Can you publish one release please? "Releases No releases published"

[fixedpaul]

Besides bitcrack which wasn't updated for the last 5+ years,  is there any similar tool using the cuda GPU but to generate randomly within a range?

You can check my GitHub, VanitySearch-bitcrack has a random mode

I don't see

https://github.com/FixedPaul/VanitySearch-Bitcrack

Thanks. Can you publish one release please? "Releases No releases published"

Yes i'll do, you can find compiled version in folder in meantime

[analyticnomad]

Yeah, I agree but that’s the price of ignorance. He might not be in this forum and that was his fault for not being very careful and looked for information of how to withdraw safely. For new users, learn about Mara.

"For new users, learn about Mara."


Can you point a bro in the right direction about this, please?

[360videosro]

Besides bitcrack which wasn't updated for the last 5+ years,  is there any similar tool using the cuda GPU but to generate randomly within a range?

You can check my GitHub, VanitySearch-bitcrack has a random mode

I don't see

https://github.com/FixedPaul/VanitySearch-Bitcrack

Thanks. Can you publish one release please? "Releases No releases published"

Yes i'll do, you can find compiled version in folder in meantime

It's not working on windows 10 64bits, it says it's a 16 bit application https://imgur.com/a/1pubub1