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

    • Wanderingaran
    Newbie
    *
    Offline Offline

    Activity: 32
    Merit: 0


    View Profile
    June 15, 2025, 01:33:28 PM
     #10621
    Quote from: GoVanza108@23 on June 13, 2025, 10:22:20 AM
    This puzzle gives you an understanding of the beauty of Mathematics. I am very glad that it exists. I think one address will be Mine! There are a huge number of options to search for.


    I've been watching everything that's happening here since 2016, all the Ideas that you propose and dispute. Interesting. The Creator has given a field of action, Want to be rich, be the first to figure out how to deal with 16 numbers. Thanks to Him the Creator for His generosity, and to everyone who is trying to find a method that can give wealth for many centuries for all children and children from children.

    While I admire your passion for the puzzle, statistically speaking, you might have better odds of winning the lottery than cracking a 16-number mystery designed to be unsolvable. At least with the lottery, the rules are clear....

  • analyticnomad
    Newbie
    *
    Offline Offline

    Activity: 48
    Merit: 0


    View Profile
    June 15, 2025, 03:08:51 PM
     #10622
    Quote from: Wanderingaran on June 15, 2025, 01:33:28 PM
    Quote from: GoVanza108@23 on June 13, 2025, 10:22:20 AM
    This puzzle gives you an understanding of the beauty of Mathematics. I am very glad that it exists. I think one address will be Mine! There are a huge number of options to search for.


    I've been watching everything that's happening here since 2016, all the Ideas that you propose and dispute. Interesting. The Creator has given a field of action, Want to be rich, be the first to figure out how to deal with 16 numbers. Thanks to Him the Creator for His generosity, and to everyone who is trying to find a method that can give wealth for many centuries for all children and children from children.

    While I admire your passion for the puzzle, statistically speaking, you might have better odds of winning the lottery than cracking a 16-number mystery designed to be unsolvable. At least with the lottery, the rules are clear....

    What do you mean? There is a 100% certainty a 16 character number can be found. Bram found two within a month of each other, using clear and defined rules eg: math/speed.



     

  • Menowa*
    Newbie
    *
    Offline Offline

    Activity: 32
    Merit: 0


    View Profile
    June 15, 2025, 03:57:32 PM
     #10623
    Quote from: analyticnomad on June 15, 2025, 03:08:51 PM
    Quote from: Wanderingaran on June 15, 2025, 01:33:28 PM
    Quote from: GoVanza108@23 on June 13, 2025, 10:22:20 AM
    This puzzle gives you an understanding of the beauty of Mathematics. I am very glad that it exists. I think one address will be Mine! There are a huge number of options to search for.


    I've been watching everything that's happening here since 2016, all the Ideas that you propose and dispute. Interesting. The Creator has given a field of action, Want to be rich, be the first to figure out how to deal with 16 numbers. Thanks to Him the Creator for His generosity, and to everyone who is trying to find a method that can give wealth for many centuries for all children and children from children.

    While I admire your passion for the puzzle, statistically speaking, you might have better odds of winning the lottery than cracking a 16-number mystery designed to be unsolvable. At least with the lottery, the rules are clear....

    What do you mean? There is a 100% certainty a 16 character number can be found. Bram found two within a month of each other, using clear and defined rules eg: math/speed.



     
    Of course it can be found. But do you have a GPU farm to find it in a month? Otherwise the chance of finding it its slower thant winning lottery

  • analyticnomad
    Newbie
    *
    Offline Offline

    Activity: 48
    Merit: 0


    View Profile
    June 15, 2025, 04:03:29 PM
     #10624
    Quote from: Menowa* on June 15, 2025, 03:57:32 PM
    Quote from: analyticnomad on June 15, 2025, 03:08:51 PM
    Quote from: Wanderingaran on June 15, 2025, 01:33:28 PM
    Quote from: GoVanza108@23 on June 13, 2025, 10:22:20 AM
    This puzzle gives you an understanding of the beauty of Mathematics. I am very glad that it exists. I think one address will be Mine! There are a huge number of options to search for.


    I've been watching everything that's happening here since 2016, all the Ideas that you propose and dispute. Interesting. The Creator has given a field of action, Want to be rich, be the first to figure out how to deal with 16 numbers. Thanks to Him the Creator for His generosity, and to everyone who is trying to find a method that can give wealth for many centuries for all children and children from children.

    While I admire your passion for the puzzle, statistically speaking, you might have better odds of winning the lottery than cracking a 16-number mystery designed to be unsolvable. At least with the lottery, the rules are clear....

    What do you mean? There is a 100% certainty a 16 character number can be found. Bram found two within a month of each other, using clear and defined rules eg: math/speed.



     
    Of course it can be found. But do you have a GPU farm to find it in a month? Otherwise the chance of finding it its slower thant winning lottery

    I'm not talking about resources. You tailored what I said into a conversation that only existed in your head and then replied to it.

    The guy said it was "designed to be unsolvable". It was literally designed to be even more solvable by reducing the range and exposing pub keys.

  • hoanghuy2912
    Newbie
    *
    Offline Offline

    Activity: 47
    Merit: 0


    View Profile
    June 15, 2025, 05:23:42 PM
     #10625
    I think we should give up because of the lack of reality.

  • Wanderingaran
    Newbie
    *
    Offline Offline

    Activity: 32
    Merit: 0


    View Profile
    June 15, 2025, 07:02:32 PM
     #10626
    Quote from: analyticnomad on June 15, 2025, 04:03:29 PM
    It was literally designed to be even more solvable by reducing the range and exposing pub keys.

    Give me the public key for puzzle 71

  • analyticnomad
    Newbie
    *
    Offline Offline

    Activity: 48
    Merit: 0


    View Profile
    June 15, 2025, 07:10:15 PM
     #10627
    Quote from: Wanderingaran on June 15, 2025, 07:02:32 PM
    Quote from: analyticnomad on June 15, 2025, 04:03:29 PM
    It was literally designed to be even more solvable by reducing the range and exposing pub keys.

    Give me the public key for puzzle 71

    No. But I'll give you a dramatically reduced range. Somewhere in there: 400000000000000000:7fffffffffffffffff

    Stop complaining about everything and try to find it with us.

  • _AFK_
    Newbie
    *
    Offline Offline

    Activity: 3
    Merit: 0


    View Profile
    June 15, 2025, 07:16:38 PM
     #10628
    Quote from: _AFK_ on June 15, 2025, 07:14:39 PM
    Quote from: Akito S. M. Hosana on June 15, 2025, 08:03:02 AM
    Quote from: mahmood1356 on June 15, 2025, 06:42:49 AM
    With an RTX 2070 graphics card, what is the maximum and fastest number of keys that can be scanned?

    It depends on which program is used:

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

    RTX2070 ~ 1600Mkeys/s

    RTX3060 ~ 2000Mkeys/s

    RTX5080 ~ 8200MKeys/s (custom code, not Vanity)

    PUZZLE #69

    SPEED: [8.2 GK/s] - SEARCH: [2^36.25 - 7.42%] - RUN: [00:00:10] - END: [00:02:05] - TOTAL: [1]

    =================================================================
    !!! ADDRESS FOUND !!!
    =================================================================

    SEARCH TIME: 00:00:10 (10.6 seconds)
    TOTAL KEYS SEARCHED: 81,604,378,624 KEYS

    ADDRESS: 19YZECXj3SxEZMoUeJ1yiPsw8xANe7M7QR
    KEY (WIF): KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qt5RQNhFCn1r58in2E78
    KEY (HEX): 0x349b84b6431a6c4ef1

    THE PRIVATE KEY FOR THIS ADDRESS HAS BEEN FOUND AND SAVED!
    CHECK YOUR OUTPUT FILE FOR THE PRIVATE KEY DETAILS.
    =================================================================

  • kTimesG
    Full Member
    ***
    Offline Offline

    Activity: 546
    Merit: 166


    View Profile
    June 15, 2025, 09:25:01 PM
     #10629
    Quote from: _AFK_ on June 15, 2025, 07:16:38 PM
    RTX5080 ~ 8200MKeys/s (custom code, not Vanity)

    Does your "custom code" actually do H160 in a specific key range (not endo, etc.)? 8.2 Gk/s with only 84 SM sounds too good to believe. Not impossible, though it would be really impressive, if actually true.
    Off the grid, training pigeons to broadcast signed messages.

  • _AFK_
    Newbie
    *
    Offline Offline

    Activity: 3
    Merit: 0


    View Profile
    June 15, 2025, 11:26:16 PM
     #10630
    Quote from: kTimesG on June 15, 2025, 09:25:01 PM
    Quote from: _AFK_ on June 15, 2025, 07:16:38 PM
    RTX5080 ~ 8200MKeys/s (custom code, not Vanity)

    Does your "custom code" actually do H160 in a specific key range (not endo, etc.)? 8.2 Gk/s with only 84 SM sounds too good to believe. Not impossible, though it would be really impressive, if actually true.

    Sent you a DM, just check it.  Wink

  • aby3er
    Newbie
    *
    Offline Offline

    Activity: 5
    Merit: 0


    View Profile
    June 16, 2025, 01:54:25 AM
     #10631
    RTX5080 ~ 8200MKeys/s (custom code, not Vanity)

    PUZZLE #69

    SPEED: [8.2 GK/s] - SEARCH: [2^36.25 - 7.42%] - RUN: [00:00:10] - END: [00:02:05] - TOTAL: [1]  Very NICE,ur code mast be faster then RC kangaroo code ,would u show how fast it's can find 85?
    RC kangaroo code make it in 2 and a half minutes with just 4070 and 2060 gpu


    >RCKangaroo.exe -gpu 01 -tames tames85.dat -dp 17 -range 85 -start 1000000000000000000000 -pubkey 0329c4574a4fd8c810b7e42a4b398882b381bcd85e40c6883712912d167c83e73a
    ********************************************************************************
    *                    RCKangaroo v3.0  (c) 2024 RetiredCoder                    *
    ********************************************************************************

    This software is free and open-source: https://github.com/RetiredC
    It demonstrates fast GPU implementation of SOTA Kangaroo method for solving ECDLP
    Windows version
    CUDA devices: 2, CUDA driver/runtime: 12.9/12.8
    GPU 0: NVIDIA GeForce RTX 4070 Ti, 11.99 GB, 60 CUs, cap 8.9, PCI 1, L2 size: 49152 KB
    GPU 1: NVIDIA GeForce RTX 2060 SUPER, 8.00 GB, 34 CUs, cap 7.5, PCI 4, L2 size: 4096 KB
    Total GPUs for work: 2

    MAIN MODE

    Solving public key
    X: 29C4574A4FD8C810B7E42A4B398882B381BCD85E40C6883712912D167C83E73A
    Y: 0E02C3AFD79913AB0961C95F12498F36A72FFA35C93AF27CEE30010FA6B51C53
    Offset: 0000000000000000000000000000000000000000001000000000000000000000

    Solving point: Range 85 bits, DP 17, start...
    SOTA method, estimated ops: 2^42.702, RAM for DPs: 2.220 GB. DP and GPU overheads not included!
    Estimated DPs per kangaroo: 36.804.
    load tames...
    tames loaded
    GPU 0: allocated 1128 MB, 368640 kangaroos. OldGpuMode: No
    GPU 1: allocated 3284 MB, 1114112 kangaroos. OldGpuMode: Yes
    GPUs started...
    MAIN: Speed: 5320 MKeys/s, Err: 0, DPs: 273121K/54571K, Time: 0d:00h:00m/0d:00h:22m
    MAIN: Speed: 5755 MKeys/s, Err: 0, DPs: 273566K/54571K, Time: 0d:00h:00m/0d:00h:20m
    MAIN: Speed: 5699 MKeys/s, Err: 0, DPs: 274003K/54571K, Time: 0d:00h:00m/0d:00h:20m
    MAIN: Speed: 5735 MKeys/s, Err: 0, DPs: 274439K/54571K, Time: 0d:00h:00m/0d:00h:20m
    MAIN: Speed: 5783 MKeys/s, Err: 0, DPs: 274873K/54571K, Time: 0d:00h:00m/0d:00h:20m
    MAIN: Speed: 5723 MKeys/s, Err: 0, DPs: 275310K/54571K, Time: 0d:00h:01m/0d:00h:20m
    MAIN: Speed: 5722 MKeys/s, Err: 0, DPs: 275744K/54571K, Time: 0d:00h:01m/0d:00h:20m
    MAIN: Speed: 5723 MKeys/s, Err: 0, DPs: 276172K/54571K, Time: 0d:00h:01m/0d:00h:20m
    MAIN: Speed: 5712 MKeys/s, Err: 0, DPs: 276606K/54571K, Time: 0d:00h:01m/0d:00h:20m
    MAIN: Speed: 5711 MKeys/s, Err: 0, DPs: 277042K/54571K, Time: 0d:00h:01m/0d:00h:20m
    MAIN: Speed: 5711 MKeys/s, Err: 0, DPs: 277476K/54571K, Time: 0d:00h:01m/0d:00h:20m
    MAIN: Speed: 5656 MKeys/s, Err: 0, DPs: 277912K/54571K, Time: 0d:00h:02m/0d:00h:21m
    MAIN: Speed: 5607 MKeys/s, Err: 0, DPs: 278332K/54571K, Time: 0d:00h:02m/0d:00h:21m
    MAIN: Speed: 5704 MKeys/s, Err: 0, DPs: 278769K/54571K, Time: 0d:00h:02m/0d:00h:20m
    MAIN: Speed: 5700 MKeys/s, Err: 0, DPs: 279205K/54571K, Time: 0d:00h:02m/0d:00h:20m
    MAIN: Speed: 5702 MKeys/s, Err: 0, DPs: 279638K/54571K, Time: 0d:00h:02m/0d:00h:20m
    MAIN: Speed: 5695 MKeys/s, Err: 0, DPs: 280066K/54571K, Time: 0d:00h:02m/0d:00h:20m
    MAIN: Speed: 5697 MKeys/s, Err: 0, DPs: 280500K/54571K, Time: 0d:00h:03m/0d:00h:20m
    MAIN: Speed: 5702 MKeys/s, Err: 0, DPs: 280937K/54571K, Time: 0d:00h:03m/0d:00h:20m
    MAIN: Speed: 5700 MKeys/s, Err: 0, DPs: 281363K/54571K, Time: 0d:00h:03m/0d:00h:20m
    Stopping work ...
    Point solved, K: 0.191 (with DP and GPU overheads)


    PRIVATE KEY: 00000000000000000000000000000000000000000011720C4F018D51B8CEBBA8

  • analyticnomad
    Newbie
    *
    Offline Offline

    Activity: 48
    Merit: 0


    View Profile
    June 16, 2025, 02:08:12 AM
     #10632
    Quote from: _AFK_ on June 15, 2025, 11:26:16 PM
    Quote from: kTimesG on June 15, 2025, 09:25:01 PM
    Quote from: _AFK_ on June 15, 2025, 07:16:38 PM
    RTX5080 ~ 8200MKeys/s (custom code, not Vanity)

    Does your "custom code" actually do H160 in a specific key range (not endo, etc.)? 8.2 Gk/s with only 84 SM sounds too good to believe. Not impossible, though it would be really impressive, if actually true.

    Sent you a DM, just check it.  Wink

    Think you could do this on CUDA?

  • _AFK_
    Newbie
    *
    Offline Offline

    Activity: 3
    Merit: 0


    View Profile
    June 16, 2025, 03:10:09 AM
     #10633
    Quote from: analyticnomad on June 16, 2025, 02:08:12 AM
    Quote from: _AFK_ on June 15, 2025, 11:26:16 PM
    Quote from: kTimesG on June 15, 2025, 09:25:01 PM
    Quote from: _AFK_ on June 15, 2025, 07:16:38 PM
    RTX5080 ~ 8200MKeys/s (custom code, not Vanity)

    Does your "custom code" actually do H160 in a specific key range (not endo, etc.)? 8.2 Gk/s with only 84 SM sounds too good to believe. Not impossible, though it would be really impressive, if actually true.

    Sent you a DM, just check it.  Wink

    Think you could do this on CUDA?

    It's CUDA

  • 0x1FFFFFF
    Newbie
    *
    Offline Offline

    Activity: 8
    Merit: 0


    View Profile
    June 16, 2025, 06:10:52 AM
    Last edit: June 16, 2025, 03:03:49 PM by 0x1FFFFFF
     #10634
    Quote from: Jorge54PT on June 15, 2025, 08:10:18 AM
    Great speed but dont have range Start and End.

    I have modified FixedPaul VanitySearch, which allow custom start:end range and add new pure (blind random) mode without any sequential approach, the current default random mode is using some hybrid approach.

    But in this process, I'd like to focus on spesific range, slice it using my own code for slicing the range based on bit length custom distance between sliced start:end , so i use sequential in this process :

    Code:
    PS C:\Users\Asus\Desktop\Vanbitxx> ./x64/Release/VanitySearch.exe -gpuId 0 -f newrx.txt -seq 1PWo3JeB

    VanitySearch-Bitcrack v2.2 by FixedPaul

    [*] Processing range file: newrx.txt
    [*] Found range file at: C:\Users\Asus\Desktop\Vanbitxx\newrx.txt
    [*] Loading ranges from file: C:\Users\Asus\Desktop\Vanbitxx\newrx.txt
    [*] File size: 16669574 bytes
    [*] Parsed 438673 non-empty lines
    [*] Found 438673 ranges in file
    [*] Successfully loaded 438673 ranges into cache

    Range file: C:\Users\Asus\Desktop\Vanbitxx\newrx.txt
    Range: 40BD1588A9B58ADC43 -> 40BD1588AC0996C042 (Keys: 10000000000, Remaining: 438672)

    Initial range from file:
    Start: 40BD1588A9B58ADC43
    End: 40BD1588AC0996C042
    Next: 40BD1588A9B58ADC43
    Sequential Mode Enabled !
    Search: 1PWo3JeB [Compressed]
    Current task START time: Sun Jun 15 20:58:00 2025
    GPU: GPU #0 NVIDIA GeForce RTX 2050 (16x128 cores) Grid(2048x256)
    Starting keys set in 0.21 seconds

    Range: 465C3F524916AE3D6E -> 465C3F524B6ABA216D (Keys: 10000000000, Remaining: 438561) - Speed: 564.2 [MK/s] - Found: 0
    Public Addr: 1PWo3JeBFpmV6hk6gyvUHRZ5yMtLSySU8p
    Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qzbxieRo41BuDkkstQDr
    Priv (HEX): 0x0000000000000000000000000000000000000000000000465C3F524B26D02B36

    Range: 4AD8C8A8E1D4D5FB6D -> 4AD8C8A8E428E1DF6C (Keys: 10000000000, Remaining: 438449) - Speed: 564.0 [MK/s] - Found: 1
    Public Addr: 1PWo3JeBHpRhh6uasKKNBSVFcREHB5X9P8
    Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3r2FdEJec4RhDmzHm8GkV
    Priv (HEX): 0x00000000000000000000000000000000000000000000004AD8C8A8E2772B6382

    Range: 45B791FF293F7EC654 -> 45B791FF2B938AAA53 (Keys: 10000000000, Remaining: 438272) - Speed: 564.7 [MK/s] - Found: 2

  • citb0in
    Hero Member
    *****
    Offline Offline

    Activity: 1036
    Merit: 783


    Bitcoin g33k


    View Profile
    June 16, 2025, 06:58:55 AM
     #10635
    Quote from: 0x1FFFFFF on June 16, 2025, 06:10:52 AM
    I have modified FixedPaul VanitySearch, which allow custom start:end range and add new totally random mode without any sequential approach, but since i also create my own version of range slicing code, i use sequential in this process -snip-

    reinventing the wheel?
    Some signs are invisible, some paths are hidden - but those who see, know what to do. Follow the trail - Follow your intuition - [bc1qqnrjshpjpypepxvuagatsqqemnyetsmvzqnafh]

  • MrGPBit
    Jr. Member
    *
    Offline Offline

    Activity: 44
    Merit: 1


    View Profile
    June 16, 2025, 09:43:20 AM
     #10636
    Quote from: 0x1FFFFFF on June 16, 2025, 06:10:52 AM
    Quote from: Jorge54PT on June 15, 2025, 08:10:18 AM
    Great speed but dont have range Start and End.

    I have modified FixedPaul VanitySearch, which allow custom start:end range and add new totally random mode without any sequential approach, but since i also create my own version of range slicing code, i use sequential in this process :

    Code:
    PS C:\Users\Asus\Desktop\Vanbitxx> ./x64/Release/VanitySearch.exe -gpuId 0 -f newrx.txt -seq 1PWo3JeB

    VanitySearch-Bitcrack v2.2 by FixedPaul

    [*] Processing range file: newrx.txt
    [*] Found range file at: C:\Users\Asus\Desktop\Vanbitxx\newrx.txt
    [*] Loading ranges from file: C:\Users\Asus\Desktop\Vanbitxx\newrx.txt
    [*] File size: 16669574 bytes
    [*] Parsed 438673 non-empty lines
    [*] Found 438673 ranges in file
    [*] Successfully loaded 438673 ranges into cache

    Range file: C:\Users\Asus\Desktop\Vanbitxx\newrx.txt
    Range: 40BD1588A9B58ADC43 -> 40BD1588AC0996C042 (Keys: 10000000000, Remaining: 438672)

    Initial range from file:
    Start: 40BD1588A9B58ADC43
    End: 40BD1588AC0996C042
    Next: 40BD1588A9B58ADC43
    Sequential Mode Enabled !
    Search: 1PWo3JeB [Compressed]
    Current task START time: Sun Jun 15 20:58:00 2025
    GPU: GPU #0 NVIDIA GeForce RTX 2050 (16x128 cores) Grid(2048x256)
    Starting keys set in 0.21 seconds

    Range: 465C3F524916AE3D6E -> 465C3F524B6ABA216D (Keys: 10000000000, Remaining: 438561) - Speed: 564.2 [MK/s] - Found: 0
    Public Addr: 1PWo3JeBFpmV6hk6gyvUHRZ5yMtLSySU8p
    Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qzbxieRo41BuDkkstQDr
    Priv (HEX): 0x0000000000000000000000000000000000000000000000465C3F524B26D02B36

    Range: 4AD8C8A8E1D4D5FB6D -> 4AD8C8A8E428E1DF6C (Keys: 10000000000, Remaining: 438449) - Speed: 564.0 [MK/s] - Found: 1
    Public Addr: 1PWo3JeBHpRhh6uasKKNBSVFcREHB5X9P8
    Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3r2FdEJec4RhDmzHm8GkV
    Priv (HEX): 0x00000000000000000000000000000000000000000000004AD8C8A8E2772B6382

    Range: 45B791FF293F7EC654 -> 45B791FF2B938AAA53 (Keys: 10000000000, Remaining: 438272) - Speed: 564.7 [MK/s] - Found: 2


    Can you please upload your version to github?

  • Frequence
    Newbie
    *
    Offline Offline

    Activity: 25
    Merit: 2


    View Profile
    June 16, 2025, 11:57:35 AM
     #10637
    Quote from: 0x1FFFFFF on June 16, 2025, 06:10:52 AM
    Quote from: Jorge54PT on June 15, 2025, 08:10:18 AM
    Great speed but dont have range Start and End.

    I have modified FixedPaul VanitySearch, which allow custom start:end range and add new totally random mode without any sequential approach, but since i also create my own version of range slicing code, i use sequential in this process :

    Code:
    PS C:\Users\Asus\Desktop\Vanbitxx> ./x64/Release/VanitySearch.exe -gpuId 0 -f newrx.txt -seq 1PWo3JeB

    VanitySearch-Bitcrack v2.2 by FixedPaul

    [*] Processing range file: newrx.txt
    [*] Found range file at: C:\Users\Asus\Desktop\Vanbitxx\newrx.txt
    [*] Loading ranges from file: C:\Users\Asus\Desktop\Vanbitxx\newrx.txt
    [*] File size: 16669574 bytes
    [*] Parsed 438673 non-empty lines
    [*] Found 438673 ranges in file
    [*] Successfully loaded 438673 ranges into cache

    Range file: C:\Users\Asus\Desktop\Vanbitxx\newrx.txt
    Range: 40BD1588A9B58ADC43 -> 40BD1588AC0996C042 (Keys: 10000000000, Remaining: 438672)

    Initial range from file:
    Start: 40BD1588A9B58ADC43
    End: 40BD1588AC0996C042
    Next: 40BD1588A9B58ADC43
    Sequential Mode Enabled !
    Search: 1PWo3JeB [Compressed]
    Current task START time: Sun Jun 15 20:58:00 2025
    GPU: GPU #0 NVIDIA GeForce RTX 2050 (16x128 cores) Grid(2048x256)
    Starting keys set in 0.21 seconds

    Range: 465C3F524916AE3D6E -> 465C3F524B6ABA216D (Keys: 10000000000, Remaining: 438561) - Speed: 564.2 [MK/s] - Found: 0
    Public Addr: 1PWo3JeBFpmV6hk6gyvUHRZ5yMtLSySU8p
    Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qzbxieRo41BuDkkstQDr
    Priv (HEX): 0x0000000000000000000000000000000000000000000000465C3F524B26D02B36

    Range: 4AD8C8A8E1D4D5FB6D -> 4AD8C8A8E428E1DF6C (Keys: 10000000000, Remaining: 438449) - Speed: 564.0 [MK/s] - Found: 1
    Public Addr: 1PWo3JeBHpRhh6uasKKNBSVFcREHB5X9P8
    Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3r2FdEJec4RhDmzHm8GkV
    Priv (HEX): 0x00000000000000000000000000000000000000000000004AD8C8A8E2772B6382

    Range: 45B791FF293F7EC654 -> 45B791FF2B938AAA53 (Keys: 10000000000, Remaining: 438272) - Speed: 564.7 [MK/s] - Found: 2

    Can you please upload this version ? Thanks

  • analyticnomad
    Newbie
    *
    Offline Offline

    Activity: 48
    Merit: 0


    View Profile
    June 16, 2025, 01:37:23 PM
     #10638
    Quote from: _AFK_ on June 16, 2025, 03:10:09 AM
    Quote from: analyticnomad on June 16, 2025, 02:08:12 AM
    Quote from: _AFK_ on June 15, 2025, 11:26:16 PM
    Quote from: kTimesG on June 15, 2025, 09:25:01 PM
    Quote from: _AFK_ on June 15, 2025, 07:16:38 PM
    RTX5080 ~ 8200MKeys/s (custom code, not Vanity)

    Does your "custom code" actually do H160 in a specific key range (not endo, etc.)? 8.2 Gk/s with only 84 SM sounds too good to believe. Not impossible, though it would be really impressive, if actually true.

    Sent you a DM, just check it.  Wink

    Think you could do this on CUDA?

    It's CUDA

    Nice man, Can you drop your Github?

  • 0x1FFFFFF
    Newbie
    *
    Offline Offline

    Activity: 8
    Merit: 0


    View Profile
    June 16, 2025, 03:06:59 PM
    Last edit: June 17, 2025, 09:43:10 AM by 0x1FFFFFF
     #10639
    Quote from: MrGPBit on June 16, 2025, 09:43:20 AM
    Quote from: 0x1FFFFFF on June 16, 2025, 06:10:52 AM
    Quote from: Jorge54PT on June 15, 2025, 08:10:18 AM
    Great speed but dont have range Start and End.

    I have modified FixedPaul VanitySearch, which allow custom start:end range and add new totally random mode without any sequential approach, but since i also create my own version of range slicing code, i use sequential in this process :

    Code:
    PS C:\Users\Asus\Desktop\Vanbitxx> ./x64/Release/VanitySearch.exe -gpuId 0 -f newrx.txt -seq 1PWo3JeB

    VanitySearch-Bitcrack v2.2 by FixedPaul

    [*] Processing range file: newrx.txt
    [*] Found range file at: C:\Users\Asus\Desktop\Vanbitxx\newrx.txt
    [*] Loading ranges from file: C:\Users\Asus\Desktop\Vanbitxx\newrx.txt
    [*] File size: 16669574 bytes
    [*] Found 438673 ranges in file
    [*] Successfully loaded 438673 ranges into cache

    Range file: C:\Users\Asus\Desktop\Vanbitxx\newrx.txt
    Range: 40BD1588A9B58ADC43 -> 40BD1588AC0996C042 (Keys: 10000000000, Remaining: 438672)

    Initial range from file:

    Start: 40BD1588A9B58ADC43
    End: 40BD1588AC0996C042

    Sequential Mode Enabled !
    Search: 1PWo3JeB [Compressed]
    Current task START time: Sun Jun 15 20:58:00 2025
    GPU: GPU #0 NVIDIA GeForce RTX 2050 (16x128 cores) Grid(2048x256)
    Starting keys set in 0.21 seconds

    Range: 465C3F524916AE3D6E -> 465C3F524B6ABA216D (Keys: 10000000000, Remaining: 438561) - Speed: 564.2 [MK/s] - Found: 0
    Public Addr: 1PWo3JeBFpmV6hk6gyvUHRZ5yMtLSySU8p
    Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qzbxieRo41BuDkkstQDr
    Priv (HEX): 0x0000000000000000000000000000000000000000000000465C3F524B26D02B36

    Range: 4AD8C8A8E1D4D5FB6D -> 4AD8C8A8E428E1DF6C (Keys: 10000000000, Remaining: 438449) - Speed: 564.0 [MK/s] - Found: 1
    Public Addr: 1PWo3JeBHpRhh6uasKKNBSVFcREHB5X9P8
    Priv (WIF): p2pkh:KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3r2FdEJec4RhDmzHm8GkV
    Priv (HEX): 0x00000000000000000000000000000000000000000000004AD8C8A8E2772B6382

    Range: 45B791FF293F7EC654 -> 45B791FF2B938AAA53 (Keys: 10000000000, Remaining: 438272) - Speed: 564.7 [MK/s] - Found: 2


    Can you please upload your version to github?

    Sure, I will upload it later to github.. maybe tomorrow after finalizing some minor fix

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

    Activity: 364
    Merit: 8


    View Profile
    June 16, 2025, 07:55:25 PM
     #10640
    Quote from: masoudtanhha on September 28, 2024, 07:28:33 PM
    Hello, what do you think about this idea?
    I hope it is useful and I am waiting for your comments

    Good idea. It will only take 100,000 years to find puzzle 71 private key.  Embarrassed

    Here is the AI script

    Code:
    import mnemonic
    import secp256k1 as ice
    import multiprocessing
    import time
    import random

    # Configuration
    TARGET_HASH160 = "f6f5431d25bbf7b12e8add9af5e3475c44a0a5b8"  # target hash160
    FIXED_WORDS = ["abandon"] * 16 + ["about"]  # Fixed part of mnemonic
    LANGUAGE = 'english'
    BATCH_SIZE = 10000  # Print progress every X valid attempts

    # Initialize components
    mnemo = mnemonic.Mnemonic(LANGUAGE)
    wordlist = mnemo.wordlist
    target_binary = bytes.fromhex(TARGET_HASH160)

    # Shared counters
    attempts = multiprocessing.Value('i', 0)        # Total tries
    valid_attempts = multiprocessing.Value('i', 0)  # Valid mnemonics only
    start_time = time.time()
    lock = multiprocessing.Lock()

    def worker(result_queue):
        while True:
            try:
                # Generate 7 random words
                random_words = random.choices(wordlist, k=7)

                # Build full mnemonic phrase
                candidate_words = FIXED_WORDS + random_words
                mnemonic_phrase = ' '.join(candidate_words)

                #Skip if mnemonic is not valid
                if not mnemo.check(mnemonic_phrase):
                    with lock:
                        attempts.value += 1  # Count total attempts
                    continue

                # Valid mnemonic found
                with lock:
                    attempts.value += 1
                    valid_attempts.value += 1

                    # Print progress based on valid attempts
                    if valid_attempts.value % BATCH_SIZE == 0:
                        elapsed = time.time() - start_time
                        rate = valid_attempts.value max(1, elapsed)
                        print(f"[Valid] {valid_attempts.value:,} | {rate:,.0f} valid/sec | Current: {' '.join(random_words)}")

                # Convert to private key
                entropy = mnemo.to_entropy(mnemonic_phrase.split())
                private_key_int = int.from_bytes(entropy, 'big')

                # Generate hash160
                h160 = ice.privatekey_to_h160(0, True, private_key_int)

                # Check for match
                if h160 == target_binary:
                    result_queue.put((
                        True,
                        mnemonic_phrase,
                        private_key_int.to_bytes(32, 'big').hex(),
                        h160.hex()
                    ))
                    return

            except Exception as e:
                continue  # Skip on error

    if __name__ == '__main__':
        print(f"Starting random mnemonic search with {multiprocessing.cpu_count()} workers...")

        result_queue = multiprocessing.Queue()
        processes = []

        # Start workers
        for _ in range(multiprocessing.cpu_count()):
            p = multiprocessing.Process(target=worker, args=(result_queue,))
            processes.append(p)
            p.start()

        # Wait for results
        while True:
            success, mnemonic_phrase, privkey_hex, found_hash160 = result_queue.get()
            if success:
                print("\nSUCCESS! Found matching mnemonic:")
                print(f"Full Mnemonic: {mnemonic_phrase}")
                print(f"Private Key: {privkey_hex}")
                print(f"Hash160: {found_hash160}")

                # Terminate all workers
                for p in processes:
                    p.terminate()
                break

        # Cleanup
        for p in processes:
            p.join()

        elapsed = time.time() - start_time
        print(f"\nTotal attempts: {attempts.value:,}")
        print(f"Valid mnemonics tested: {valid_attempts.value:,}")
        print(f"Time elapsed: {elapsed:.2f} seconds")
        print(f"Speed: {valid_attempts.value max(1, elapsed):,.0f} valid mnemonics/sec")
    Pages: « 1 ... 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 [532] 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 »
      Print  
Page 531
Viewing Page: 532

IRLBTC™ © 2025 IRLBTC.com