Bitcoin Forum
February 16, 2025, 03:52:25 AM *
News: Community Awards voting is open
 
   Home   Help Search Login Register More  
Pages: « 1 ... 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 [254] 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 ... 368 »
  Print  
Author Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it  (Read 254503 times)
nomachine
Member
**
Offline Offline

Activity: 509
Merit: 38


View Profile
May 22, 2024, 10:08:46 PM
Last edit: May 22, 2024, 10:59:13 PM by nomachine
 #5061

Any sort of strategy is useless if you use either Python or ASM as long as any sort of higher-level op like SHA / RIPEMD is the actual bottleneck.

Nothing better (faster) and regularly updated is available than the following:

https://github.com/JayDDee/cpuminer-opt/tree/master/algo/ripemd (ripemd)
https://github.com/JayDDee/cpuminer-opt/tree/master/algo/sha (sha)

4-way, 8-way, avx2/avx512vl optimizations.

I don't see these implemented in the tools we use here; they are only used in the miner.

These existing ones have been deprecated.

Unfortunately, I don't have the time to address this myself.

bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8
aminsolhi
Newbie
*
Offline Offline

Activity: 15
Merit: 0


View Profile
May 22, 2024, 10:26:53 PM
Last edit: May 22, 2024, 10:48:14 PM by aminsolhi
 #5062


are you key hunt creator?
nice too meet you


Hi, Yes I developed the CPU version all other are copies, if you have some doubt about it please use the next topic: https://bitcointalk.org/index.php?topic=5322040

Of course it is, and you are the main programmer and developer
nice to meet you
I have also written various programs for this work, soon I will post a complete version on GitHub

Do you know how to search randomly in KeyhuntCuda version 2   ?

Version 1 with -r key and the value of key space was sequential with random
Like
KeyHunt-Cuda.exe -t 0 -g --gpui 0 --gpux 24,256 -m address --coin BTC --range 20000000000000000:40000000000000000 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so -r 2000
kTimesG
Member
**
Offline Offline

Activity: 372
Merit: 67


View Profile
May 22, 2024, 11:49:17 PM
 #5063

Any sort of strategy is useless if you use either Python or ASM as long as any sort of higher-level op like SHA / RIPEMD is the actual bottleneck.

Nothing better (faster) and regularly updated is available than the following:

https://github.com/JayDDee/cpuminer-opt/tree/master/algo/ripemd (ripemd)
https://github.com/JayDDee/cpuminer-opt/tree/master/algo/sha (sha)

4-way, 8-way, avx2/avx512vl optimizations.

I don't see these implemented in the tools we use here; they are only used in the miner.

These existing ones have been deprecated.

Unfortunately, I don't have the time to address this myself.

Code:
   while (1) {
#if defined(USE_CUSTOM_SHA256)
        sha256_init(&s256ctx);
        sha256_update(&s256ctx, compressed_pubkey, 33);
        sha256_final(&s256ctx, sha256hash);
#else
#if defined(__APPLE__) && defined(USE_CC_SHA)
        CC_SHA256(compressed_pubkey, 33, sha256hash);
#else
        SHA256(compressed_pubkey, 33, sha256hash);
#endif
#endif

//        RIPEMD160(sha256hash, 32, rmd_hash);

        ++count;
        if (count % (1 << 26) == 0) {
            ticks = clock();
            speed = count * CLOCKS_PER_SEC / (ticks - start);
            printf("SHA hashes: %" PRIu64 " speed: %" PRIu64 " hashes/s\n", count, (uint64_t) speed);
        }
    }

SHA hashes: 134217728 speed: 7485947 hashes/s


Code:
SHA256_Init(&shaCtx);
 while (1) {
       //...
       SHA256_Update(&shaCtx, compressed_pubkey, 33);

       ++count;
       if (count % (1 << 26) == 0) {
            ticks = clock();
            speed = count * CLOCKS_PER_SEC / (ticks - start);
            printf("Hashed bytes: %" PRIu64 " speed: %" PRIu64 " MB/s\n", count * 33, (uint64_t) (speed * 33) >> 20);
      }    
}

Hashed bytes: 22145925120 speed: 1712 MB/s


So 1.7 GB/s with your everyday SHA hasher is not bad, what's bad is that it's doing a single hash of a 22 GB message, not hundreds of millions of hashes of 33 bytes.
In our case, the hash context needs to be reinitialized for every public key we need to hash, so AVX512 and so on maybe can bring a 50% speed-up, nothing to write home about.

Benchmarked OpenSSL / Apple CommonCrypto and fast SHA with SSE3.2 intrinsics (last one was like 10% faster, probably because of inlining). I would bet that the CPUs that have hardware support for SHA instructions are actually used by the SHA routines available from the system APIs, and we wouldn't need to hack them ourself.

For AVX you'd actually need a distributed scheduling: https://github.com/minio/sha256-simd

Off the grid, training pigeons to broadcast signed messages.
nomachine
Member
**
Offline Offline

Activity: 509
Merit: 38


View Profile
May 23, 2024, 01:08:04 AM
Last edit: May 24, 2024, 05:16:58 AM by nomachine
 #5064


AVX512 and so on maybe can bring a 50% speed-up, nothing to write home about.

Benchmarked OpenSSL / Apple CommonCrypto and fast SHA with SSE3.2 intrinsics (last one was like 10% faster, probably because of inlining). I would bet that the CPUs that have hardware support for SHA instructions are actually used by the SHA routines available from the system APIs, and we wouldn't need to hack them ourself.

For AVX you'd actually need a distributed scheduling: https://github.com/minio/sha256-simd


I achieved a 20% performance increase in Keyhunt on Zen3 architecture compared to GCC versions 12, 13, and 14.
To compile with Clang, I used the AOCC compiler located at /opt/AMD/aocc-compiler-4.2.0/bin/clang.

However, it was essential to remove all Intel intrinsics (_builtin_ia32) from the code since these intrinsics are specific to Intel processors and incompatible with AMD processors.

In my case, I need to rewrite both the SHA and RIPEMD implementations for Zen3 to achieve a significant performance boost.

Imagine achieving a 70% performance increase!  Grin

Additionally, optimizing for Zen4 by leveraging its specific architectural features can lead to even greater efficiency gains.

bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8
nomachine
Member
**
Offline Offline

Activity: 509
Merit: 38


View Profile
May 24, 2024, 04:40:52 AM
Last edit: May 24, 2024, 05:27:11 AM by nomachine
 #5065



I've tried
AMD Ryzen 9 7950X - 4.5GHZ, 16c/32th + 128GB - 4ek on start, reaches 6ek after week


I have ~120 Ekeys/s in BSGS/keyhunt on AMD after used  the AOCC compiler  Grin


I've been tweaking linux for months to get every atom out of Dual CPU configuration.

#RT kernel
Code:
wget -qO - https://dl.xanmod.org/archive.key | sudo gpg --dearmor -o /usr/share/keyrings/xanmod-archive-keyring.gpg
echo 'deb [signed-by=/usr/share/keyrings/xanmod-archive-keyring.gpg] http://deb.xanmod.org releases main' | sudo tee /etc/apt/sources.list.d/xanmod-release.list
sudo apt-get -y update && sudo apt install linux-xanmod-rt-x64v3

Code:
sudo apt install -y tuned tuned-utils tuned-utils-systemtap
sudo tuned-adm profile latency-performance

Code:
cat /sys/devices/system/cpu/cpu*/cpufreq/scaling_governor
should be performance for all cores

/etc/default/grub
Code:
quiet msr.allow_writes=on nosoftlockup mce=ignore_ce skew_tick=1 clocksource=hpet iommu=soft noresume mitigations=off nmi_watchdog=0


Nvme config (It must be a good Heatsink on Nvme, otherwise it goes over 50 C/I have had white smoke from them more than once - SAMSUNG MZVL2512HCJQ.)

Code:
sudo nvme smart-log /dev/nvme0 | grep -i '^temperature'
temperature            : 42 C
Temperature Sensor 1           : 42 C
Temperature Sensor 2           : 50 C


/etc/fstab
Code:
ext4 noatime,nodiratime,errors=remount-ro,inode_readahead_blks=0 0 1

AMD EPYC config
Code:
wrmsr -a 0xc0011020 0x4400000000000
wrmsr -a 0xc0011021 0x4000000000040
wrmsr -a 0xc0011022 0x8680000401570000
wrmsr -a 0xc001102b 0x2040cc10

And so on and on....This is only part of it.


bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8
viljy
Legendary
*
Offline Offline

Activity: 2030
Merit: 1401



View Profile
May 25, 2024, 11:50:08 AM
 #5066


I have ~120 Ekeys/s in BSGS/keyhunt on AMD after used  the AOCC compiler  Grin


Is this the speed at which public keys are checked in the hash table (using a bloom filter?), or is this the real speed at which the processor generates public keys?
Quite a high speed even for BSGS on a video card

░░░▄████████████████████████
░▄████████████████████████████
████████████████████████████
████████████████████████████
█████████████████████████████
█████████████████████████████
██████████████████████████████
████████████████████████████▀
█████████████████████████▀
████████████████████
█████████████████████
██████████████████████
░░███████████████████▀
█████████████████████████
█████████████████████████
█████░▄▄█████████████████
█████░███████████████████
█████░███████░███████████
████████████░████████████
██████████░█████████████
██████████░██████████████
██████████░██████████████
██████████░██████████████
████████░████████████████
█████████████████████████
█████████████████████████
 100% 
WELCOME BONUS
 UP TO 15% 
CASHBACK
 NO KYC 
PROVABLY FAIR
█████████████████████████
█████████████████████████
█████████████████████████
█████░██░░██░██░░██░█████
████░████████████████████
█████████░░███░░█████████
█████░░██████████████████
███████░░████████████████
█████████░█████████████
█████████████████████████
█████████████████████████
█████████████████████████
█████████████████████████
 
  Play Now  
WanderingPhilospher
Sr. Member
****
Offline Offline

Activity: 1288
Merit: 253

Shooters Shoot...


View Profile
May 25, 2024, 03:15:22 PM
 #5067

keyhunt not good

you should learn to configure it, defaul thread subrange is 32 bits, for small ranges with multiple threads you should lower the N value  with "-n number" if the range is less than 1 Million keys you should use -n 0x10000
where 0x10000 its a 16 bits subrange per thread

Look



Found i less than a second

are you key hunt creator?
nice too meet you
It was my mistake, I apologize, dear friend
ok , thank you
I meant https://github.com/WanderingPhilosopher/KeyHuntCudaClient
i use of first version keyhunt cuda

Zero clues of how or what you ran, but with a single CPU core, using keyhunt-cuda, it is found pretty much as the program starts:

Code:
KeyHunt-Cuda v1.08

COMP MODE    : COMPRESSED
COIN TYPE    : BITCOIN
SEARCH MODE  : Single Address
DEVICE       : CPU
CPU THREAD   : 1
SSE          : YES
RKEY         : 0 Mkeys
MAX FOUND    : 65536
BTC ADDRESS  : 1E5V4LbVrTbFrfj7VN876DamzkaNiGAvFo
OUTPUT FILE  : Found.txt

Start Time   : Sat May 25 10:11:49 2024
Global start : 20000000000000000 (66 bit)
Global end   : 21000000000000000 (66 bit)
Global range : 1000000000000000 (61 bit)


[00:00:02] [CPU+GPU: 5.28 Mk/s] [GPU: 0.00 Mk/s] [C: 0.000000 %] [R: 0] [T: 10,706,944 (24 bit)] [F: 1]

BYE

SO maybe you entered wrong things/flags when trying to run the program.
Tepan
Jr. Member
*
Offline Offline

Activity: 79
Merit: 1


View Profile
May 25, 2024, 07:05:37 PM
 #5068

hi guys! who can help me to develop rust coding language?! (don't judge my statement and result, since i just new for learning this puzzle and trying new stuff)

i run this like 4-5 hours straight, i use pool keyspace and multi thread, the search only use CPU, let's find out can develop it with GPU power.

it's sequential and not random.

the thread is dividing key ranges and make the 1,5 bytes changed from left padding following how many thread are used.

  • Puzzle search
  • Script started at: 2024-05-25 20:56:03.700485 +07:00
  • from:0x23000000000000000 to:0x3ffffffffffffffff
  • target:13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
0000000000000000000000000000000000000000000000035200000002cc179e| 13zbaq4dADzLenZB6VdSdmAaqV8TABkHEf

average current speed is 15.000 Key/sec for each thread.

with some GPU power, i think my codes (?) can solve that in couple months.
my codes still make some bug, the address display is misleading the corresponding of private key, but it's still same prefix.
all of that still can search the matched, but the displaying of progress is not correct.
🙏🏻

example of pre-run.

000000000000000000000000000000000000000000000003c600000000002b0f  | 13zbpbczKXAcx9q4NvTuEa5szGu3 000000000000000000000000000000000000000000000003520000000000a039 | 13zbNacfa9Nrz8YttQbzLVqT7y4w 000000000000000000000000000000000000000000000003c60000000000d456 | 13zbFwGk1JussoSK3gax39256VBu 000000000000000000000000000000000000000000000002de000000000103a3 | 13zbt3NfsVUjJu8FQWxFfxdePAFP 0000000000000000000000000000000000000000000000026a00000000010bd3 | 13zbix1E22g4FRk5hUcoMV1Hhvpd 000000000000000000000000000000000000000000000002de0000000001333e | 13zbDQnUKS1N8AqmynykC1QYNgwc 000000000000000000000000000000000000000000000002de00000000013e02 | 13zb7xLuqjuPKdbGt7rshDEjdprK 00000000000000000000000000000000000000000000000352000000000168ae | 13zbm8dR61ur1GqnQEmjrRsM5knP 000000000000000000000000000000000000000000000002300000000001923c | 13zbpdWGSwZpHK2zyR2o5XqgfXdv 0000000000000000000000000000000000000000000000026a0000000001c928 | 13zbp7u1bEeK94RCMtsvuNtqBrYo 0000000000000000000000000000000000000000000000038c0000000001e94a | 13zb56DAy494Drdngk2YchYRNfvF 0000000000000000000000000000000000000000000000023000000000023728 | 13zbFaEpeoY7Hrx6sTLdM3ZvvUW5 0000000000000000000000000000000000000000000000031800000000023ade | 13zbtT9na4bJdYoexnZ6YSt6KDHp
Tepan
Jr. Member
*
Offline Offline

Activity: 79
Merit: 1


View Profile
May 25, 2024, 07:31:02 PM
Last edit: May 25, 2024, 09:18:54 PM by Mr. Big
 #5069

hi guys! who can help me to develop rust coding language?! (don't judge my statement and result, since i just new for learning this puzzle and trying new stuff)

i run this like 4-5 hours straight, i use pool keyspace and multi thread, the search only use CPU, let's find out can develop it with GPU power.

it's sequential and not random.

the thread is dividing key ranges and make the 1,5 bytes changed from left padding following how many thread are used.

  • Puzzle search
  • Script started at: 2024-05-25 20:56:03.700485 +07:00
  • from:0x23000000000000000 to:0x3ffffffffffffffff
  • target:13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
0000000000000000000000000000000000000000000000035200000002cc179e| 13zbaq4dADzLenZB6VdSdmAaqV8TABkHEf

average current speed is 15.000 Key/sec for each thread.

with some GPU power, i think my codes (?) can solve that in couple months.
my codes still make some bug, the address display is misleading the corresponding of private key, but it's still same prefix.
all of that still can search the matched, but the displaying of progress is not correct.
🙏🏻

example of pre-run.

000000000000000000000000000000000000000000000003c600000000002b0f  | 13zbpbczKXAcx9q4NvTuEa5szGu3 000000000000000000000000000000000000000000000003520000000000a039 | 13zbNacfa9Nrz8YttQbzLVqT7y4w 000000000000000000000000000000000000000000000003c60000000000d456 | 13zbFwGk1JussoSK3gax39256VBu 000000000000000000000000000000000000000000000002de000000000103a3 | 13zbt3NfsVUjJu8FQWxFfxdePAFP 0000000000000000000000000000000000000000000000026a00000000010bd3 | 13zbix1E22g4FRk5hUcoMV1Hhvpd 000000000000000000000000000000000000000000000002de0000000001333e | 13zbDQnUKS1N8AqmynykC1QYNgwc 000000000000000000000000000000000000000000000002de00000000013e02 | 13zb7xLuqjuPKdbGt7rshDEjdprK 00000000000000000000000000000000000000000000000352000000000168ae | 13zbm8dR61ur1GqnQEmjrRsM5knP 000000000000000000000000000000000000000000000002300000000001923c | 13zbpdWGSwZpHK2zyR2o5XqgfXdv 0000000000000000000000000000000000000000000000026a0000000001c928 | 13zbp7u1bEeK94RCMtsvuNtqBrYo 0000000000000000000000000000000000000000000000038c0000000001e94a | 13zb56DAy494Drdngk2YchYRNfvF 0000000000000000000000000000000000000000000000023000000000023728 | 13zbFaEpeoY7Hrx6sTLdM3ZvvUW5 0000000000000000000000000000000000000000000000031800000000023ade | 13zbtT9na4bJdYoexnZ6YSt6KDHp


my search techniques uses this
2^31 and 2^36
(36 bit)
MacBook-Pro:Desktop tepan$ python3 subs.py
Enter the range x: 31  
Enter the range y: 36

> 0x91000000 <

let's hunt.

    let begin: u128 = 0x910000000;
    let end: u128 = 0x9ffffffff;

const TARGET: &str = "1Be2UF9NLfyLFbtm3TCbmuocc9N1Kduci1";


result :

  • Puzzle search
  • Script started at: 2024-05-26 02:25:21.816449 +07:00
  • from:0x910000000 to:0x9ffffffff
  • target:1Be2UF9NLfyLFbtm3TCbmuocc9N1Kduci1

 00000000000000000000000000000000000000000000000000000009f7a02888| 1Be2JoBBasXePHijh1AD1FK5Wsui 00000000000000000000000000000000000000000000000000000009f3702fc4| 1Be2m52dDvKNf2wrvbvSoh4V4t8Q 00000000000000000000000000000000000000000000000000000009e2b0702a| 1Be2DebJWkfJWXb8cszjA8mN6fvh 00000000000000000000000000000000000000000000000000000009e6e07a23| 1Be2wkS3jkyDGWnVpiNXVzUYdTtY 00000000000000000000000000000000000000000000000000000009eb10e589| 1Be2f5NaU8Qv35nPzJk4S6Jntzvs 00000000000000000000000000000000000000000000000000000009fbd0fcef| 1Be2uQTHQC5V9QPTqSkHvGNpFA5H 00000000000000000000000000000000000000000000000000000009e2b117d2| 1Be2nTuUQDYvYgyHPfE6S4hBTVNc 00000000000000000000000000000000000000000000000000000009eb119a5e| 1Be2ncy8U6oS9UzUGQU13CW7prqo 00000000000000000000000000000000000000000000000000000009f371a027| 1Be2tHcpUiDPVcqdvu2v2KmtA1m9 00000000000000000000000000000000000000000000000000000009e6e1b74a| 1Be22Wi2usp5z2J1wRvfovS8pD7R 00000000000000000000000000000000000000000000000000000009fbd1be53| 1Be2eU7ktk7abQsFRHgVP1qmmpZW 00000000000000000000000000000000000000000000000000000009f371d249| 1Be2zLYgYPdSjL9cog8kCsWUVjax 00000000000000000000000000000000000000000000000000000009f7a1e133| 1Be2xv3Q6XtLnBAz4SmbqbaSkhs8 00000000000000000000000000000000000000000000000000000009de820a7c| 1Be2UF9NLfyLFbtm3TCbmuocc9N1 00000000000000000000000000000000000000000000000000000009e2b20b15|
  • --------------------------------------------------------------------------------
  • KEY FOUND! 2024-05-26 02:29:44.164813 +07:00
  • private key (WIF): KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qYjgd9Mg1Upu7eJAtiDr
  • private key (hex): 00000000000000000000000000000000000000000000000000000009de820a7c
  • public key: 02b3e772216695845fa9dda419fb5daca28154d8aa59ea302f05e916635e47b9f6
  • address: 1Be2UF9NLfyLFbtm3TCbmuocc9N1Kduci1
  • --------------------------------------------------------------------------------
  • Search completed Smiley


it's like 3 minutes for search by address.



look at this, example of use.

34   2^33...2^34-1   200000000...3ffffffff | x : 29 y: 34 - > > 0x330000000 < [ 0x330000000:0x3ffffffff ] [found on 0x34a65911d ]

38   2^37...2^38-1   2000000000...3fffffffff | x : 33 y: 38 - > > 0x2100000000 < [0x2100000000:0x2ffffffffff] [found on 0x22382facd0 ]

.. etc
i make this premature codes for saving more times with lowkey cpu speed for search, but work until 79 bit, rest of that, the output result for keyspace is not correct.
sorry i cant provide the real codes, because someone can brute that easily with his huge mining GPU farm Smiley

kTimesG
Member
**
Offline Offline

Activity: 372
Merit: 67


View Profile
May 25, 2024, 08:30:01 PM
 #5070


I have ~120 Ekeys/s in BSGS/keyhunt on AMD after used  the AOCC compiler  Grin


Is this the speed at which public keys are checked in the hash table (using a bloom filter?), or is this the real speed at which the processor generates public keys?
Quite a high speed even for BSGS on a video card

120 exakeys = 120.000.000.000 gigakeys

Pretending some 4Ghz CPU generates, sequentially, one key per cycle (it doesn't, more like one key over 300 cycles on average, and that's with all possible optimizations) it would still take 30.000.000.000 CPU cores to reach that speed.

Or (300 cycles/key): 9.000.000.000.000 cores that are running all at 100% with no OS, nothing else running, all working at full speed doing nothing except crunching numbers inside the CPU registers.

I think maybe that speed reflects space coverage rather than operating time, and space coverage speed is logarithmic not linear.

Off the grid, training pigeons to broadcast signed messages.
madogss
Newbie
*
Offline Offline

Activity: 42
Merit: 0


View Profile
May 26, 2024, 08:40:29 AM
 #5071

hi guys! who can help me to develop rust coding language?! (don't judge my statement and result, since i just new for learning this puzzle and trying new stuff)

i run this like 4-5 hours straight, i use pool keyspace and multi thread, the search only use CPU, let's find out can develop it with GPU power.

it's sequential and not random.

the thread is dividing key ranges and make the 1,5 bytes changed from left padding following how many thread are used.

  • Puzzle search
  • Script started at: 2024-05-25 20:56:03.700485 +07:00
  • from:0x23000000000000000 to:0x3ffffffffffffffff
  • target:13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so
0000000000000000000000000000000000000000000000035200000002cc179e| 13zbaq4dADzLenZB6VdSdmAaqV8TABkHEf

average current speed is 15.000 Key/sec for each thread.

with some GPU power, i think my codes (?) can solve that in couple months.
my codes still make some bug, the address display is misleading the corresponding of private key, but it's still same prefix.
all of that still can search the matched, but the displaying of progress is not correct.
🙏🏻

example of pre-run.

000000000000000000000000000000000000000000000003c600000000002b0f  | 13zbpbczKXAcx9q4NvTuEa5szGu3 000000000000000000000000000000000000000000000003520000000000a039 | 13zbNacfa9Nrz8YttQbzLVqT7y4w 000000000000000000000000000000000000000000000003c60000000000d456 | 13zbFwGk1JussoSK3gax39256VBu 000000000000000000000000000000000000000000000002de000000000103a3 | 13zbt3NfsVUjJu8FQWxFfxdePAFP 0000000000000000000000000000000000000000000000026a00000000010bd3 | 13zbix1E22g4FRk5hUcoMV1Hhvpd 000000000000000000000000000000000000000000000002de0000000001333e | 13zbDQnUKS1N8AqmynykC1QYNgwc 000000000000000000000000000000000000000000000002de00000000013e02 | 13zb7xLuqjuPKdbGt7rshDEjdprK 00000000000000000000000000000000000000000000000352000000000168ae | 13zbm8dR61ur1GqnQEmjrRsM5knP 000000000000000000000000000000000000000000000002300000000001923c | 13zbpdWGSwZpHK2zyR2o5XqgfXdv 0000000000000000000000000000000000000000000000026a0000000001c928 | 13zbp7u1bEeK94RCMtsvuNtqBrYo 0000000000000000000000000000000000000000000000038c0000000001e94a | 13zb56DAy494Drdngk2YchYRNfvF 0000000000000000000000000000000000000000000000023000000000023728 | 13zbFaEpeoY7Hrx6sTLdM3ZvvUW5 0000000000000000000000000000000000000000000000031800000000023ade | 13zbtT9na4bJdYoexnZ6YSt6KDHp
I believe Keyhuntcuda2 from siupune has this functioning on the gpu
aminsolhi
Newbie
*
Offline Offline

Activity: 15
Merit: 0


View Profile
May 26, 2024, 10:45:34 AM
Last edit: May 26, 2024, 11:22:20 PM by aminsolhi
 #5072

keyhunt not good

you should learn to configure it, defaul thread subrange is 32 bits, for small ranges with multiple threads you should lower the N value  with "-n number" if the range is less than 1 Million keys you should use -n 0x10000
where 0x10000 its a 16 bits subrange per thread

Look

https://talkimg.com/images/2024/05/21/1iVIH.png

Found i less than a second

are you key hunt creator?
nice too meet you
It was my mistake, I apologize, dear friend
ok , thank you
I meant https://github.com/WanderingPhilosopher/KeyHuntCudaClient
i use of first version keyhunt cuda

Zero clues of how or what you ran, but with a single CPU core, using keyhunt-cuda, it is found pretty much as the program starts:

Code:
KeyHunt-Cuda v1.08

COMP MODE    : COMPRESSED
COIN TYPE    : BITCOIN
SEARCH MODE  : Single Address
DEVICE       : CPU
CPU THREAD   : 1
SSE          : YES
RKEY         : 0 Mkeys
MAX FOUND    : 65536
BTC ADDRESS  : 1E5V4LbVrTbFrfj7VN876DamzkaNiGAvFo
OUTPUT FILE  : Found.txt

Start Time   : Sat May 25 10:11:49 2024
Global start : 20000000000000000 (66 bit)
Global end   : 21000000000000000 (66 bit)
Global range : 1000000000000000 (61 bit)


[00:00:02] [CPU+GPU: 5.28 Mk/s] [GPU: 0.00 Mk/s] [C: 0.000000 %] [R: 0] [T: 10,706,944 (24 bit)] [F: 1]

BYE

SO maybe you entered wrong things/flags when trying to run the program.




this is 1 milion key after start 200000000000f4240
and this is p2ph compressed public key  :  1E5V4LbVrTbFrfj7VN876DamzkaNiGAvFo

KeyHunt-Cuda.exe -t 0 -g --gpui 0 --gpux 24,256 -m address --coin BTC --range 20000000000000000:40000000000000000 1E5V4LbVrTbFrfj7VN876DamzkaNiGAvFo


my keyhunt cuda speed is 60 Mk/s . In fact, Cuda should find it in less than 1 second, but it takes about 1:40 minute

KeyHunt-Cuda.exe -t 0 -g --gpui 0 --gpux 24,256 -m address --coin BTC --range 20000000000000000:40000000000000000 1E5V4LbVrTbFrfj7VN876DamzkaNiGAvFo

KeyHunt-Cuda v1.07

COMP MODE    : COMPRESSED
COIN TYPE    : BITCOIN
SEARCH MODE  : Single Address
DEVICE       : GPU
CPU THREAD   : 0
GPU IDS      : 0
GPU GRIDSIZE : 24x256
SSE          : YES
RKEY         : 0 Mkeys
MAX FOUND    : 65536
BTC ADDRESS  : 1E5V4LbVrTbFrfj7VN876DamzkaNiGAvFo
OUTPUT FILE  : Found.txt

Start Time   : Sun May 26 14:04:50 2024
Global start : 20000000000000000 (66 bit)
Global end   : 40000000000000000 (67 bit)
Global range : 20000000000000000 (66 bit)

GPU          : GPU #0 Quadro P1000 (4x128 cores) Grid(24x256)

[00:01:36] [CPU+GPU: 62.21 Mk/s] [GPU: 62.21 Mk/s] [C: 0.000000 %] [R: 0] [T: 5,976,883,200 (33 bit)] [F: 0]

The problem is that Cuda performs the same task in all graphics cores in parallel and repetitively, and instead of the cores each helping the program, each of them repeats the same task as an island, for example, each core in parallel from the same start. He does and moves forward. And maybe in the best case, it divides the entire collection into the number of cores and each core starts working in that interval, in this case, once you exit the program, all your efforts will end in an unknown place, which will be used the next time you run the program. You don't know where to start

Of course, it seems that you are using a higher version of this software  v1.08. But anyway, I have to tell the truth. You have written a very good software. I really enjoyed your code ideas.
dextronomous
Full Member
***
Offline Offline

Activity: 438
Merit: 105


View Profile
May 26, 2024, 11:29:23 AM
 #5073


I have ~120 Ekeys/s in BSGS/keyhunt on AMD after used  the AOCC compiler  Grin


Is this the speed at which public keys are checked in the hash table (using a bloom filter?), or is this the real speed at which the processor generates public keys?
Quite a high speed even for BSGS on a video card

Hi there nomachine, you got a way for a working make file already done for this one , for amd..
right now i have not yet been able to do so, little time many works, thanks for your effort.

nomachine
Member
**
Offline Offline

Activity: 509
Merit: 38


View Profile
May 26, 2024, 11:08:10 PM
Last edit: May 26, 2024, 11:21:44 PM by nomachine
Merited by viljy (1)
 #5074

Is this the speed at which public keys are checked in the hash table (using a bloom filter?)

Yes.

I am runung custom compiled BSGS with  1TB RAM on AMD EPYC x2 (128 cores)

bpfile size ~704 GB
bloom size ~110.47 GB

bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8
viljy
Legendary
*
Offline Offline

Activity: 2030
Merit: 1401



View Profile
May 27, 2024, 08:45:35 AM
 #5075

Is this the speed at which public keys are checked in the hash table (using a bloom filter?)

Yes.

I am runung custom compiled BSGS with  1TB RAM on AMD EPYC x2 (128 cores)

bpfile size ~704 GB
bloom size ~110.47 GB

Wow, that's a cool config you have. When I tried to search for keys before, I did not reach a speed of more than 2 Ekeys

░░░▄████████████████████████
░▄████████████████████████████
████████████████████████████
████████████████████████████
█████████████████████████████
█████████████████████████████
██████████████████████████████
████████████████████████████▀
█████████████████████████▀
████████████████████
█████████████████████
██████████████████████
░░███████████████████▀
█████████████████████████
█████████████████████████
█████░▄▄█████████████████
█████░███████████████████
█████░███████░███████████
████████████░████████████
██████████░█████████████
██████████░██████████████
██████████░██████████████
██████████░██████████████
████████░████████████████
█████████████████████████
█████████████████████████
 100% 
WELCOME BONUS
 UP TO 15% 
CASHBACK
 NO KYC 
PROVABLY FAIR
█████████████████████████
█████████████████████████
█████████████████████████
█████░██░░██░██░░██░█████
████░████████████████████
█████████░░███░░█████████
█████░░██████████████████
███████░░████████████████
█████████░█████████████
█████████████████████████
█████████████████████████
█████████████████████████
█████████████████████████
 
  Play Now  
Fllear
Newbie
*
Offline Offline

Activity: 5
Merit: 0


View Profile
May 29, 2024, 02:53:08 PM
Last edit: May 29, 2024, 03:04:52 PM by Fllear
 #5076

Tell me, is there a quick python code for generating a hex private key in the required range? So that the result is saved in a text file. Well, then maybe there is a script to create a public key from this text file, also with saving. I just found some, but they are very slow, they generate 100 million hex per day, as well as public keys.

I searched and couldn't find anything in C++. The computer is capable of generating at least 100 million keys per second. But all the scripts I found are very slow. You just need the hex to be in a separate file and the public keys to be in a separate file. Thank you very much in advance if anyone decides to help.

First I generate hex with this code.

Code:
import random
path = './file.txt'
start = 21778071482940061661655974875633165533184

stop = 27222589353675077077069968594541456916480


while start <= stop:
  step = random.randint(start,stop)
  start + step
  print('0000000000000000000000000000000' + hex(step).lstrip("0x"))
with open(path, 'w+') as f:
   f.write('0000000000000000000000000000000' + hex(step).lstrip("0x"))

Relatively fast, but still slow

Next, I generate wif from hex

Code:
import binascii, hashlib, base58, sys
arq = open('WIF.txt', 'w')

def convert(z):

    private_key_static = z

    extended_key = "80"+private_key_static+"01"

    first_sha256 = hashlib.sha256(binascii.unhexlify(extended_key)).hexdigest()

    second_sha256 = hashlib.sha256(binascii.unhexlify(first_sha256)).hexdigest()

    final_key = extended_key+second_sha256[:8]

    WIF = base58.b58encode(binascii.unhexlify(final_key)).decode ('ascii')


    arq.write("%s \n" % WIF)

with open("file.txt") as file:
    for line in file:
        print (str.strip(line))
        convert(str.strip(line))

And it's sooooo slow

And at the end I generate a public key from wif

from bitcoin import *

Code:
with open("WIF.txt") as f:
for line in f:
print(privtopub((line.strip())))

I won’t do anything this way even before retirement.
kTimesG
Member
**
Offline Offline

Activity: 372
Merit: 67


View Profile
May 29, 2024, 03:55:16 PM
 #5077

I searched and couldn't find anything in C++. The computer is capable of generating at least 100 million keys per second. But all the scripts I found are very slow. You just need the hex to be in a separate file and the public keys to be in a separate file. Thank you very much in advance if anyone decides to help.

What world do you live in, in which the computer can generate "at least 100 million keys per second", I wanna move there.

If you are simply talking about a private key, then a "computer" can generate "number of cores" * "core frequency" private keys per second, but what the hell are you gonna do with a bunch of numbers?

Do you understand the difference between a public key and a private key, and how the first one is computed through the second one? I mean, all the math that's required is not some simple a + b.


Off the grid, training pigeons to broadcast signed messages.
pbies
Full Member
***
Offline Offline

Activity: 321
Merit: 196



View Profile
May 29, 2024, 04:38:17 PM
 #5078

...

I think you fall for some programs that you've seen which were generating huge amounts of keys per second,
and you think this is possible,
but they were fake.

BTC: bc1qmrexlspd24kevspp42uvjg7sjwm8xcf9w86h5k
Fllear
Newbie
*
Offline Offline

Activity: 5
Merit: 0


View Profile
May 29, 2024, 05:06:53 PM
 #5079

I searched and couldn't find anything in C++. The computer is capable of generating at least 100 million keys per second. But all the scripts I found are very slow. You just need the hex to be in a separate file and the public keys to be in a separate file. Thank you very much in advance if anyone decides to help.

What world do you live in, in which the computer can generate "at least 100 million keys per second", I wanna move there.

If you are simply talking about a private key, then a "computer" can generate "number of cores" * "core frequency" private keys per second, but what the hell are you gonna do with a bunch of numbers?

Do you understand the difference between a public key and a private key, and how the first one is computed through the second one? I mean, all the math that's required is not some simple a + b.



I know how and what is generated. I need this for my experiment, but at this rate it's a perversion. And my hardware is quite powerful, 72 cores and 128GB of RAM. The same keyhunt, when brute force, produces 350 million keys at maximum load. But I need exactly this algorithm, hex separately from the public key. So that when I found a public key from the list, I knew its hex.
pbies
Full Member
***
Offline Offline

Activity: 321
Merit: 196



View Profile
May 29, 2024, 07:03:17 PM
 #5080

I know how and what is generated. I need this for my experiment, but at this rate it's a perversion. And my hardware is quite powerful, 72 cores and 128GB of RAM. The same keyhunt, when brute force, produces 350 million keys at maximum load. But I need exactly this algorithm, hex separately from the public key. So that when I found a public key from the list, I knew its hex.

Producing hex numbers is fast. But converting them to public keys is not. You use SHA256 here, mostly twice. This is resource demanding and it is not only adding two numbers.
Second: you need to look up the public key in a table, good if it will be in RAM, but still you need to search at least a b-tree, complexity O(log(N)).

BTC: bc1qmrexlspd24kevspp42uvjg7sjwm8xcf9w86h5k
Pages: « 1 ... 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 [254] 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 ... 368 »
  Print  
 
Jump to:  

Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!