<<  >> (p.419)
    Author Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it  (Read 351085 times)

    • nomachine
    Full Member
    ***
    Offline Offline

    Activity: 756
    Merit: 114


    View Profile
    March 28, 2025, 09:44:50 PM
    Last edit: March 29, 2025, 06:12:43 AM by nomachine
     #8361
    Quote from: pbies on March 28, 2025, 09:28:48 PM
    Quote from: nomachine on March 28, 2025, 09:06:46 PM
    Quote from: pbies on March 28, 2025, 08:22:35 PM
    Random number generation fails later

    Random mode doesn't need saving  to file. I'll remove this option very soon because it's an anomaly.


    Look at the numbers, they stay the same later at the same values. That's the problem.

    The current code uses a combination of thread ID and time for seeding, but if multiple threads start at nearly the same time, they might get identical seeds.

    The random seed is being reinitialized with the current time in nanoseconds (std::chrono::high_resolution_clock::now())

    When saving/loading progress in random mode, multiple saves can occur within the same nanosecond.

    I will replace the current ThreadRNG initialization.

    Done....
    Quote
    Progress Save #1 at 20.0001 sec: TotalChecked=562725504, ElapsedTime=00:00:15, Mkeys/s=37.51
    Thread Key 0: 000000000000000000000000000000000000000000000000000000D70F4FFDCD
    Thread Key 1: 000000000000000000000000000000000000000000000000000000BE20EF4E22
    Thread Key 2: 000000000000000000000000000000000000000000000000000000E6FBE038F1
    Thread Key 3: 00000000000000000000000000000000000000000000000000000085B6EE1A44
    Thread Key 4: 000000000000000000000000000000000000000000000000000000DC3EF0E60B
    Thread Key 5: 000000000000000000000000000000000000000000000000000000A642129164
    Thread Key 6: 000000000000000000000000000000000000000000000000000000827ECA4F43
    Thread Key 7: 000000000000000000000000000000000000000000000000000000CFFDF45C8B
    Thread Key 8: 000000000000000000000000000000000000000000000000000000E6505F7635
    Thread Key 9: 00000000000000000000000000000000000000000000000000000081F1DBAE4A
    Thread Key 10: 000000000000000000000000000000000000000000000000000000906C35E1C9
    Thread Key 11: 000000000000000000000000000000000000000000000000000000A602C29DA6

    Progress Save #2 at 40.0001 sec: TotalChecked=1248416640, ElapsedTime=00:00:35, Mkeys/s=35.66
    Thread Key 0: 000000000000000000000000000000000000000000000000000000FB80C3A22D
    Thread Key 1: 000000000000000000000000000000000000000000000000000000A1F08AD161
    Thread Key 2: 000000000000000000000000000000000000000000000000000000DCBA47622C
    Thread Key 3: 000000000000000000000000000000000000000000000000000000B11640B862
    Thread Key 4: 000000000000000000000000000000000000000000000000000000D98BA3DC28
    Thread Key 5: 000000000000000000000000000000000000000000000000000000BFEC23CC1C
    Thread Key 6: 000000000000000000000000000000000000000000000000000000EC3C75E919
    Thread Key 7: 00000000000000000000000000000000000000000000000000000085EE1FB309
    Thread Key 8: 000000000000000000000000000000000000000000000000000000922880EA8B
    Thread Key 9: 000000000000000000000000000000000000000000000000000000E096061943
    Thread Key 10: 000000000000000000000000000000000000000000000000000000A03AE42AB4
    Thread Key 11: 000000000000000000000000000000000000000000000000000000FA1B55C229
    BTC: bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8

  • fixedpaul
    Jr. Member
    *
    Offline Offline

    Activity: 59
    Merit: 17


    View Profile WWW
    March 29, 2025, 12:20:06 AM
    Merited by WanderingPhilospher (5)
     #8362
    Hello everyone. I have published my optimized versions of VanitySearch (CUDA) with speed boost in case anyone is interested  Smiley

    The "bitcrack" version is specific to the puzzle and allows searching for addresses and prefixes (compressed) within a given range. The speed is about 6900 MKey/s on a 4090 and 8800 MKey/s on 5090.

    The second version, on the other hand, performs a standard search for vanity addresses (not just P2PKH compressed) but with the same optimizations in terms of math and CUDA code. Random searches with endomorphisms.

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

    https://github.com/FixedPaul/VanitySearch

  • Denevron
    Newbie
    *
    Offline Offline

    Activity: 121
    Merit: 0


    View Profile
    March 29, 2025, 12:53:48 AM
     #8363
    Quote from: nomachine on March 28, 2025, 03:46:03 PM
    Quote from: filo1992 on March 28, 2025, 03:25:14 PM
    can the progress made be used so that I don't always have to start the search from the beginning?

    Yes.

    Quote from: Akito S. M. Hosana on March 28, 2025, 03:26:05 PM
    You removed Xoshiro256plus why ?  Tongue

    Because the Mersenne Twister performed better on smaller puzzles. Specifically, I tested it on puzzle 40.

    Quote
    ================= WORK IN PROGRESS =================
    Puzzle/Bits       : 40
    Target Hash160: 95a156cd21b4a69...6864f4c8b82a82a
    Prefix length     : 9 bytes
    Mode                : Random
    CPU Threads     : 12
    Mkeys/s           : 35.95
    Total Checked   : 118821993408
    Elapsed Time    : 00:55:05
    Start Range      : 8000000000
    End Range        : ffffffffff
    Progress           : N/A
    Progress Save   : 5
    Stride               : 1
    ================== FOUND MATCH! ====================
    Private Key    : 000000000000000000000000000000000000000000000000000000E9AE4933D6
    Public Key      : 03A2EFA402FD5268400C77C20E574BA86409EDEDEE7C4020E4B9F0EDBEE53DE0D4
    Total Checked : 118875620444
    Elapsed Time  : 00:55:06
    Speed            : 35.9366 Mkeys/s


    Try to solve puzzle 40 in Python using random mode in less than an hour.  Grin

    Code:
    ✅ Key found : 0000000000000000000000000000000000000000000000000000004b5f8303e9 -> 0b304f2a79a027270276533fe1ed4eff30910876!     
     
    ⏳ Full time: 2.70 sec.

    here is the 40th puzzle, a python script  Grin

  • E36cat
    Newbie
    *
    Offline Offline

    Activity: 45
    Merit: 0


    View Profile
    March 29, 2025, 01:30:25 AM
    Last edit: March 30, 2025, 02:30:00 AM by hilariousandco
     #8364
    Quote from: Denevron on March 29, 2025, 12:53:48 AM
    Quote from: nomachine on March 28, 2025, 03:46:03 PM
    Quote from: filo1992 on March 28, 2025, 03:25:14 PM
    can the progress made be used so that I don't always have to start the search from the beginning?

    Yes.

    Quote from: Akito S. M. Hosana on March 28, 2025, 03:26:05 PM
    You removed Xoshiro256plus why ?  Tongue

    Because the Mersenne Twister performed better on smaller puzzles. Specifically, I tested it on puzzle 40.

    Quote
    ================= WORK IN PROGRESS =================
    Puzzle/Bits       : 40
    Target Hash160: 95a156cd21b4a69...6864f4c8b82a82a
    Prefix length     : 9 bytes
    Mode                : Random
    CPU Threads     : 12
    Mkeys/s           : 35.95
    Total Checked   : 118821993408
    Elapsed Time    : 00:55:05
    Start Range      : 8000000000
    End Range        : ffffffffff
    Progress           : N/A
    Progress Save   : 5
    Stride               : 1
    ================== FOUND MATCH! ====================
    Private Key    : 000000000000000000000000000000000000000000000000000000E9AE4933D6
    Public Key      : 03A2EFA402FD5268400C77C20E574BA86409EDEDEE7C4020E4B9F0EDBEE53DE0D4
    Total Checked : 118875620444
    Elapsed Time  : 00:55:06
    Speed            : 35.9366 Mkeys/s


    Try to solve puzzle 40 in Python using random mode in less than an hour.  Grin

    Code:
    ✅ Key found : 0000000000000000000000000000000000000000000000000000004b5f8303e9 -> 0b304f2a79a027270276533fe1ed4eff30910876!      
     
    ⏳ Full time: 2.70 sec.

    here is the 40th puzzle, a python script  Grin


    that is not puzzle 40

    Quote from: nomachine on March 28, 2025, 03:46:03 PM
    Quote from: filo1992 on March 28, 2025, 03:25:14 PM
    can the progress made be used so that I don't always have to start the search from the beginning?

    Yes.

    Quote from: Akito S. M. Hosana on March 28, 2025, 03:26:05 PM
    You removed Xoshiro256plus why ?  Tongue

    Because the Mersenne Twister performed better on smaller puzzles. Specifically, I tested it on puzzle 40.

    Quote
    ================= WORK IN PROGRESS =================
    Puzzle/Bits       : 40
    Target Hash160: 95a156cd21b4a69...6864f4c8b82a82a
    Prefix length     : 9 bytes
    Mode                : Random
    CPU Threads     : 12
    Mkeys/s           : 35.95
    Total Checked   : 118821993408
    Elapsed Time    : 00:55:05
    Start Range      : 8000000000
    End Range        : ffffffffff
    Progress           : N/A
    Progress Save   : 5
    Stride               : 1
    ================== FOUND MATCH! ====================
    Private Key    : 000000000000000000000000000000000000000000000000000000E9AE4933D6
    Public Key      : 03A2EFA402FD5268400C77C20E574BA86409EDEDEE7C4020E4B9F0EDBEE53DE0D4
    Total Checked : 118875620444
    Elapsed Time  : 00:55:06
    Speed            : 35.9366 Mkeys/s


    Try to solve puzzle 40 in Python using random mode in less than an hour.  Grin



    ================= WORK IN PROGRESS =================
    Puzzle/Bits   : 40
    Target Hash160: 95a156cd21b4a69...6864f4c8b82a82a
    Prefix length : 10 bytes
    Mode          : Random
    CPU Threads   : 80
    Mkeys/s       : 131.21
    Total Checked : 1312160832
    Elapsed Time  : 00:00:10
    Start Range   : 8000000000
    End Range     : ffffffffff
    Progress      : N/A
    Progress Save : 0
    Stride        : 1
    ================== FOUND MATCH! ====================
    Private Key   : 000000000000000000000000000000000000000000000000000000E9AE4933D6
    Public Key    : 03A2EFA402FD5268400C77C20E574BA86409EDEDEE7C4020E4B9F0EDBEE53DE0D4
    Total Checked : 1627205328
    Elapsed Time  : 00:00:12


    12 seconds

  • Denevron
    Newbie
    *
    Offline Offline

    Activity: 121
    Merit: 0


    View Profile
    March 29, 2025, 01:51:20 AM
     #8365
    Quote from: E36cat on March 29, 2025, 01:30:25 AM
    Quote from: Denevron on March 29, 2025, 12:53:48 AM
    Quote from: nomachine on March 28, 2025, 03:46:03 PM
    Quote from: filo1992 on March 28, 2025, 03:25:14 PM
    can the progress made be used so that I don't always have to start the search from the beginning?

    Yes.

    Quote from: Akito S. M. Hosana on March 28, 2025, 03:26:05 PM
    You removed Xoshiro256plus why ?  Tongue

    Because the Mersenne Twister performed better on smaller puzzles. Specifically, I tested it on puzzle 40.

    Quote
    ================= WORK IN PROGRESS =================
    Puzzle/Bits       : 40
    Target Hash160: 95a156cd21b4a69...6864f4c8b82a82a
    Prefix length     : 9 bytes
    Mode                : Random
    CPU Threads     : 12
    Mkeys/s           : 35.95
    Total Checked   : 118821993408
    Elapsed Time    : 00:55:05
    Start Range      : 8000000000
    End Range        : ffffffffff
    Progress           : N/A
    Progress Save   : 5
    Stride               : 1
    ================== FOUND MATCH! ====================
    Private Key    : 000000000000000000000000000000000000000000000000000000E9AE4933D6
    Public Key      : 03A2EFA402FD5268400C77C20E574BA86409EDEDEE7C4020E4B9F0EDBEE53DE0D4
    Total Checked : 118875620444
    Elapsed Time  : 00:55:06
    Speed            : 35.9366 Mkeys/s


    Try to solve puzzle 40 in Python using random mode in less than an hour.  Grin

    Code:
    ✅ Key found : 0000000000000000000000000000000000000000000000000000004b5f8303e9 -> 0b304f2a79a027270276533fe1ed4eff30910876!     
     
    ⏳ Full time: 2.70 sec.

    here is the 40th puzzle, a python script  Grin


    that is not puzzle 40

    Sorry, 39 puzzle)

  • nomachine
    Full Member
    ***
    Offline Offline

    Activity: 756
    Merit: 114


    View Profile
    March 29, 2025, 06:05:37 AM
    Last edit: March 29, 2025, 07:56:17 AM by nomachine
     #8366
    Quote from: E36cat on March 29, 2025, 01:37:17 AM
    Elapsed Time  : 00:00:12

    12 seconds

    Congratulations.


    Quote from: Denevron on March 29, 2025, 01:51:20 AM

    Code:
    ✅ Key found : 0000000000000000000000000000000000000000000000000000004b5f8303e9 -> 0b304f2a79a027270276533fe1ed4eff30910876!      
     
    ⏳ Full time: 2.70 sec.

    here is the 40th puzzle, a python script  Grin


    Yes, but in which context and which script? (I didn't mean a kangaroo.)

    When I said RANDOM, I meant a random script:
    Quote
    import sys, secrets, secp256k1 as ice
    while True:
        dec = secrets.SystemRandom().randrange(549755813887, 1099511627775)
        h160 = ice.privatekey_to_h160(0, True, dec).hex()
        if h160 == "95a156cd21b4a69de969eb6716864f4c8b82a82a":
            HEX = "%064x" % dec;wifc = ice.btc_pvk_to_wif(HEX)
            with open("KEYFOUNDKEYFOUND.txt", "a") as f:
              f.write(f'Private key (wif) Compressed : {wifc}\n')
            break
    You'll be waiting a long time...


    Quote from: fixedpaul on March 29, 2025, 12:20:06 AM
    Hello everyone. I have published my optimized versions of VanitySearch (CUDA) with speed boost in case anyone is interested  Smiley

    Thank you.   Wink
    BTC: bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8

  • b0dre
    Jr. Member
    *
    Offline Offline

    Activity: 61
    Merit: 1


    View Profile
    March 29, 2025, 06:20:26 AM
     #8367
    Quote from: fixedpaul on March 29, 2025, 12:20:06 AM
    Hello everyone. I have published my optimized versions of VanitySearch (CUDA) with speed boost in case anyone is interested  Smiley

    The "bitcrack" version is specific to the puzzle and allows searching for addresses and prefixes (compressed) within a given range. The speed is about 6900 MKey/s on a 4090 and 8800 MKey/s on 5090.

    The second version, on the other hand, performs a standard search for vanity addresses (not just P2PKH compressed) but with the same optimizations in terms of math and CUDA code. Random searches with endomorphisms.

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

    https://github.com/FixedPaul/VanitySearch

    Thanks! Grin
    why not multi-gpu?

  • nomachine
    Full Member
    ***
    Offline Offline

    Activity: 756
    Merit: 114


    View Profile
    March 29, 2025, 06:34:41 AM
    Last edit: March 29, 2025, 06:45:13 AM by nomachine
     #8368
    Quote from: user_not_here on March 29, 2025, 05:25:31 AM
    i would use....

    The Cyclone script processes keys in large batches (POINTS_BATCH_SIZE = 256) for efficiency.
    Processes hashes in AVX2-optimized batches (HASH_BATCH_SIZE = 8 ) .
    Uses IntGroup for batch modular inversions.
    Precomputes points in batches.

    The simple division doesn't account for these batch boundaries, potentially causing:
    Threads may end their ranges mid-batch.
    Some keys near thread boundaries might get processed twice or missed.

    But go ahead—open GitHub, clone the repository, and modify it. That’s the goal: getting everyone involved in improving the scripts, even if they seem useless. Why? Because sooner or later, as more people engage, someone will come up with a brilliant idea . Which doesn't even have to be related to solving puzzles.  Wink
    BTC: bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8

  • Akito S. M. Hosana
    Jr. Member
    *
    Offline Offline

    Activity: 392
    Merit: 8


    View Profile
    March 29, 2025, 06:53:24 AM
     #8369
    Quote from: nomachine on March 29, 2025, 06:34:41 AM
    That’s the goal: getting everyone involved in improving the scripts, even if they seem useless. Why? Because sooner or later, as more people engage, someone will come up with a brilliant idea . Which doesn't even have to be related to solving puzzles.  Wink

    You mean this activates brain activity and exercises the brain, plus you learn a programming language. That makes sense. At least my head will grow, even if my wallet doesn't.  Tongue

  • nomachine
    Full Member
    ***
    Offline Offline

    Activity: 756
    Merit: 114


    View Profile
    March 29, 2025, 06:58:21 AM
     #8370
    Quote from: Akito S. M. Hosana on March 29, 2025, 06:53:24 AM
    At least my head will grow

    Buddy, unless you're a Marvel superhero or a bobblehead, your head stopped growing a long time ago. Grin
    BTC: bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8

  • fixedpaul
    Jr. Member
    *
    Offline Offline

    Activity: 59
    Merit: 17


    View Profile WWW
    March 29, 2025, 07:50:27 AM
     #8371
    Quote from: b0dre on March 29, 2025, 06:20:26 AM
    Quote from: fixedpaul on March 29, 2025, 12:20:06 AM
    Hello everyone. I have published my optimized versions of VanitySearch (CUDA) with speed boost in case anyone is interested  Smiley

    The "bitcrack" version is specific to the puzzle and allows searching for addresses and prefixes (compressed) within a given range. The speed is about 6900 MKey/s on a 4090 and 8800 MKey/s on 5090.

    The second version, on the other hand, performs a standard search for vanity addresses (not just P2PKH compressed) but with the same optimizations in terms of math and CUDA code. Random searches with endomorphisms.

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

    https://github.com/FixedPaul/VanitySearch

    Thanks! Grin
    why not multi-gpu?

    The "standard" version allows multi GPUs

    The "bitcrack" version does not. since the range size is a power of 2 the number of GPUs must be as well in order not to have overlapping keys. It would also be slightly slower because the threads of one GPU have to wait for the threads of the other to finish, which is a problem if the 2 GPUs do not have the same speed.

    It was a choice to keep things simpler and a little more efficient Smiley

  • Akito S. M. Hosana
    Jr. Member
    *
    Offline Offline

    Activity: 392
    Merit: 8


    View Profile
    March 29, 2025, 08:12:02 AM
     #8372
    Quote from: pbies on March 28, 2025, 07:27:35 PM
    Speed a little too slow seems to be.

    AMD 9950X with 32 threads, here 24 active.

    It would be awesome to make Cyclone work on cloud server with 192 threads!...
    I know there are other versions on github but they don't have random mode.

    I achieve 40M keys/s, but after 25 minutes, it drops to a constant 37M keys/s. Is this normal on AMD?

    I think he already has AVX-512, but he hasn't published it on GitHub yet. There are pictures of his screen showing 128 cores  Tongue

  • brainless
    Member
    **
    Offline Offline

    Activity: 435
    Merit: 35


    View Profile
    March 29, 2025, 08:15:26 AM
     #8373
    Quote from: fixedpaul on March 29, 2025, 07:50:27 AM
    Quote from: b0dre on March 29, 2025, 06:20:26 AM
    Quote from: fixedpaul on March 29, 2025, 12:20:06 AM
    Hello everyone. I have published my optimized versions of VanitySearch (CUDA) with speed boost in case anyone is interested  Smiley

    The "bitcrack" version is specific to the puzzle and allows searching for addresses and prefixes (compressed) within a given range. The speed is about 6900 MKey/s on a 4090 and 8800 MKey/s on 5090.

    The second version, on the other hand, performs a standard search for vanity addresses (not just P2PKH compressed) but with the same optimizations in terms of math and CUDA code. Random searches with endomorphisms.

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

    https://github.com/FixedPaul/VanitySearch

    Thanks! Grin
    why not multi-gpu?

    The "standard" version allows multi GPUs

    The "bitcrack" version does not. since the range size is a power of 2 the number of GPUs must be as well in order not to have overlapping keys. It would also be slightly slower because the threads of one GPU have to wait for the threads of the other to finish, which is a problem if the 2 GPUs do not have the same speed.

    It was a choice to keep things simpler and a little more efficient Smiley
    Cuda 8 version available?
    13sXkWqtivcMtNGQpskD78iqsgVy9hcHLF

  • nomachine
    Full Member
    ***
    Offline Offline

    Activity: 756
    Merit: 114


    View Profile
    March 29, 2025, 08:26:05 AM
    Last edit: March 29, 2025, 09:02:26 AM by nomachine
     #8374
    Quote from: Akito S. M. Hosana on March 29, 2025, 08:12:02 AM
    Quote from: pbies on March 28, 2025, 07:27:35 PM
    Speed a little too slow seems to be.

    AMD 9950X with 32 threads, here 24 active.

    It would be awesome to make Cyclone work on cloud server with 192 threads!...
    I know there are other versions on github but they don't have random mode.

    I achieve 40M keys/s, but after 25 minutes, it drops to a constant 37M keys/s. Is this normal on AMD?

    I think he already has AVX-512, but he hasn't published it on GitHub yet. There are pictures of his screen showing 128 cores  Tongue

    The performance drop you're seeing (from 40M keys/s to 37M keys/s) is pretty normal, depending on your system setup and workload.

    After 20 minutes of non-stop running, your CPU might heat up and trigger thermal throttling, which causes a slight slowdown to keep things cool.

    Yeah, I have the AVX-512 version, but it's even worse. If you're using a dedicated machine (like a root server), this aggressive script could totally fry the CPU because they usually have tiny stock cooler.

    That's why I'm kinda iffy about uploading it – I don't wanna be on the hook if someone melts their $7-8K processor.

    P.S. Cloud servers usually don't give full physical access to hardware – you’ll never hit max speed. Plus, they'll kick you out of there pretty quickly.
    BTC: bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8

  • POD5
    Member
    **
    Offline Offline

    Activity: 332
    Merit: 10

    Keep smiling if you're loosing!


    View Profile
    March 29, 2025, 09:21:08 AM
     #8375
    If you ask DeepSeek for

    "Is it possible to control hardware temperature when running a script?"

    you'll get some interesting answers...  Grin
    bc1qygk0yjdqx4j2sspswmu4dvc76s6hxwn9z0whlu

  • Akito S. M. Hosana
    Jr. Member
    *
    Offline Offline

    Activity: 392
    Merit: 8


    View Profile
    March 29, 2025, 10:35:09 AM
     #8376
    Quote from: POD5 on March 29, 2025, 09:21:08 AM
    If you ask DeepSeek for

    "Is it possible to control hardware temperature when running a script?"

    you'll get some interesting answers...  Grin

    He told me I gotta use liquid nitrogen, lol. Tongue

  • Dom1nic
    Newbie
    *
    Offline Offline

    Activity: 20
    Merit: 0


    View Profile
    March 29, 2025, 12:14:05 PM
     #8377
    Quote from: Denevron on March 29, 2025, 01:51:20 AM
    Quote from: E36cat on March 29, 2025, 01:30:25 AM
    Quote from: Denevron on March 29, 2025, 12:53:48 AM

    Code:
    ✅ Key found : 0000000000000000000000000000000000000000000000000000004b5f8303e9 -> 0b304f2a79a027270276533fe1ed4eff30910876!     
     
    ⏳ Full time: 2.70 sec.

    here is the 40th puzzle, a python script  Grin


    that is not puzzle 40

    Sorry, 39 puzzle)



    did you get some tips from coffee grounds  Smiley

  • fixedpaul
    Jr. Member
    *
    Offline Offline

    Activity: 59
    Merit: 17


    View Profile WWW
    March 29, 2025, 01:59:39 PM
     #8378
    Quote from: brainless on March 29, 2025, 08:15:26 AM
    Quote from: fixedpaul on March 29, 2025, 07:50:27 AM
    Quote from: b0dre on March 29, 2025, 06:20:26 AM
    Quote from: fixedpaul on March 29, 2025, 12:20:06 AM
    Hello everyone. I have published my optimized versions of VanitySearch (CUDA) with speed boost in case anyone is interested  Smiley

    The "bitcrack" version is specific to the puzzle and allows searching for addresses and prefixes (compressed) within a given range. The speed is about 6900 MKey/s on a 4090 and 8800 MKey/s on 5090.

    The second version, on the other hand, performs a standard search for vanity addresses (not just P2PKH compressed) but with the same optimizations in terms of math and CUDA code. Random searches with endomorphisms.

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

    https://github.com/FixedPaul/VanitySearch

    Thanks! Grin
    why not multi-gpu?

    The "standard" version allows multi GPUs

    The "bitcrack" version does not. since the range size is a power of 2 the number of GPUs must be as well in order not to have overlapping keys. It would also be slightly slower because the threads of one GPU have to wait for the threads of the other to finish, which is a problem if the 2 GPUs do not have the same speed.

    It was a choice to keep things simpler and a little more efficient Smiley
    Cuda 8 version available?


    Nope sorry:(

  • nomachine
    Full Member
    ***
    Offline Offline

    Activity: 756
    Merit: 114


    View Profile
    March 29, 2025, 10:13:24 PM
     #8379

    Added AVX2-256 vectorized copy for aligned chunks in the Montgomery multiplication routine.

    https://github.com/NoMachine1/Cyclone/commit/51f6785ab4cd88df6763dc19bfc8a1df48ea7d97
    BTC: bc1qdwnxr7s08xwelpjy3cc52rrxg63xsmagv50fa8

  • Akito S. M. Hosana
    Jr. Member
    *
    Offline Offline

    Activity: 392
    Merit: 8


    View Profile
    March 29, 2025, 10:25:26 PM
     #8380
    Quote from: nomachine on March 29, 2025, 10:13:24 PM

    Added AVX2-256 vectorized copy for aligned chunks in the Montgomery multiplication routine.

    https://github.com/NoMachine1/Cyclone/commit/51f6785ab4cd88df6763dc19bfc8a1df48ea7d97

    42 Mkeys/s here Tongue
    Pages: « 1 ... 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 [419] 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 ... 603 »
      Print  
Page 418
Viewing Page: 419

IRLBTC™ © 2025 IRLBTC.com