Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
He said it was from keyhunt, so unless he modified it, its straight brute force as pub key is not available for 66.
QUOTE:
"CPU (keyhunt)
Total 50247107966976 keys in 10095 seconds: ~4 Gkeys/s (4977425256 keys/s)
GPU (bitcrack)
NVIDIA GeForce R / 24217MB | 1 target 3307.00 MKey/s (11,423,035,949,056 total) [00:56:47]"
It depends on what the script calculates and how it calculates.
Are only compressed keys counted or all together? Is it a key or a hash?
Which parameters do you use in one script and which in the other? (user input)*
You can practice in Python to see how counting works.
...deleted...
Let's say in raw Python you can achieve about 3.98 MHash/s on 12 cores
In the same Python with the kangaroo algorithm I have about 50 MKeys/s (if you count jumps)
In C++ everything is 10 or 100 times more (if is GPU).
What exactly is counted depends on which algorithm was used and how is used.
*It even depends on how it is compiled for which platform - for example: AMD Ryzen 9 7950X3D
g++ -m64 -march=native -mtune=native -msse4.2 -pthread -O3 -I. -o ...etc...
The presence of SSE4.1 and SSE4.2 instruction sets can be particularly beneficial for cryptographic operations, as they include instructions that can accelerate certain mathematical operations required for SECPK1 calculations.
You can experiment with these flags for cryptographic workloads.
Effectiveness of this flag depends on the specific algorithms and code you are working with. It's a good practice to benchmark code with and without the flag.
QUOTE:
"CPU (keyhunt)
Total 50247107966976 keys in 10095 seconds: ~4 Gkeys/s (4977425256 keys/s)
GPU (bitcrack)
NVIDIA GeForce R / 24217MB | 1 target 3307.00 MKey/s (11,423,035,949,056 total) [00:56:47]"
How is that i9 able to outperform the 4090 in straight brute forcing?
It depends on what the script calculates and how it calculates.
Are only compressed keys counted or all together? Is it a key or a hash?
Which parameters do you use in one script and which in the other? (user input)*
You can practice in Python to see how counting works.
...deleted...
Let's say in raw Python you can achieve about 3.98 MHash/s on 12 cores
- Fri Oct 27 10:06:46 2023
- Puzzle = 66
- Ending characters missing: 18
- Public Key Hash (Hash 160): 20d45a6a762535700ce9e0b216e31994335db8a5
- Hashes per second: 3.98 MHash/s
In the same Python with the kangaroo algorithm I have about 50 MKeys/s (if you count jumps)
In C++ everything is 10 or 100 times more (if is GPU).
What exactly is counted depends on which algorithm was used and how is used.
*It even depends on how it is compiled for which platform - for example: AMD Ryzen 9 7950X3D
Code:
gcc -Q -march=native --help=target | grep -E '^\s+-.*(sse|march)'
g++ -m64 -march=native -mtune=native -msse4.2 -pthread -O3 -I. -o ...etc...
The presence of SSE4.1 and SSE4.2 instruction sets can be particularly beneficial for cryptographic operations, as they include instructions that can accelerate certain mathematical operations required for SECPK1 calculations.
You can experiment with these flags for cryptographic workloads.
Effectiveness of this flag depends on the specific algorithms and code you are working with. It's a good practice to benchmark code with and without the flag.