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

    • dastic
    Jr. Member
    *
    Offline Offline

    Activity: 35
    Merit: 1


    View Profile
    March 11, 2025, 05:35:10 AM
     #7861
    1MVD14nafRFEHGSYgbup1GeF8wtYcmHpvZ - DB09BA36C67BDAC17

    1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ - Target

  • kTimesG
    Full Member
    ***
    Offline Offline

    Activity: 546
    Merit: 178


    View Profile
    March 11, 2025, 07:46:34 AM
     #7862
    Quote from: Bram24732 on March 10, 2025, 11:09:52 PM
    Quote from: kTimesG on March 10, 2025, 05:28:52 PM
    That's why I said it can be a good improvement to find vanity addresses faster, but since there are skipped ranges, other matching prefixes might get lost, there is no violation. But this is not something that a vanity search would ever care about. Only something that should worry someone who wants to solve a puzzle in an efficient matter (e.g. an exact match).

    I still dont see how skipping is more efficient than scanning everything.
    A certain density of X bits prefixes (what you call being lucky) in an arbitrary range has zero impact on the probability of finding something on the next key, or on 100m keys later.
    You can think of it this way : since distribution is random, any key can be replaced by any other key. As a result changing the traversal order does not improve odds of success.

    Yes, you can replace any key by other key. However, let's say that we get to the density you mention BEFORE we finish scanning the arbitrary range (or set, more precisely). So let's say we reach some 90% probability we won't find another element in the current range/set.

    A logical speedup is to ignore the rest of the elements in the range/set, and choose a new range/set, to maximize chances to find another new element.

    But it's easier to skip a range rather than creating some weird permutation, which might work just the same. Do you not agree? This does not affect at all the laws of the uniform distribution, it's just a tradeoff between missing the key with finding smth with a certain prefix.

    Quote from: mcdouglasx on March 10, 2025, 10:09:24 PM
    Fun fact: after the pubkeys of the puzzles were released in 2019, puzzle 75 took 10 days to be solved. I wonder where those mathematicians and computer experts who boast around here were back then? Why didn't they solve it earlier? Does it have something to do with the AI not being very good? Or maybe because JLP appeared in 2020? It's curious how nowadays everyone is an expert.

    I first heard of this puzzle in 2024. Why didn't you buy BTC in 2011? It was, like a few cents. Maybe you didn't heard about it until it was too late to make sense?
    Not everything around SW revolves around crypto, you know.
    Off the grid, training pigeons to broadcast signed messages.

  • bibilgin
    Newbie
    *
    Offline Offline

    Activity: 249
    Merit: 0


    View Profile
    March 11, 2025, 08:35:47 AM
     #7863
    Quote from: Bram24732 on March 10, 2025, 11:09:52 PM
    I still dont see how skipping is more efficient than scanning everything.
    A certain density of X bits prefixes (what you call being lucky) in an arbitrary range has zero impact on the probability of finding something on the next key, or on 100m keys later.
    You can think of it this way : since distribution is random, any key can be replaced by any other key. As a result changing the traversal order does not improve odds of success.

    Everyone can say that scanning by jumping is not logical.

    But I explained that it is possible with PROBABILITY calculation and some data.

    Example;
    You bought mixed colored candies sold in the market. You prioritize the colors or flavors you like. Then it is up to you to eat or not eat the others.

    Actually, the range is within a certain area. But since your hardware power is too much, I understand that you do not want to miss it.

    Edit:
    I can prove it to you like this.
    Send me a few wallets with the prefix 1MVDYgVaS, which are in order. I will tell you in which direction and how far away the nearest 1MVDYgVaSN prefix is ​​on AVERAGE.

  • frozenen
    Newbie
    *
    Offline Offline

    Activity: 43
    Merit: 0


    View Profile
    March 11, 2025, 09:39:29 AM
     #7864
    UNTESTED!! but surely we can automate Mara withdrawal:

    # pip install ecdsa base58 requests selenium webdriver-manager bit
    # need bitcrack.exe in same folder
    import ecdsa
    import hashlib
    import base58
    import requests
    import time
    import random
    import subprocess
    from selenium import webdriver
    from selenium.webdriver.chrome.service import Service
    from webdriver_manager.chrome import ChromeDriverManager
    from bit import PrivateKey

    # =========================== #
    #    STEP 0: GENERATE SEED & RUN BITCRACK     #
    # =========================== #

    def generate_random_seed():
        # Generate a truly random 10-digit number (not starting with 0)
        return random.randint(2113081981, 2113081983)   # default range (1000000000, 9999999999) test#67 (2113081981, 2113081983)

    def find_private_key():
        while True:
            # Generate a new random seed for each iteration
            seed_value = generate_random_seed()
            print(f'\nUsing Seed: {seed_value}')

            # Set the random seed
            random.seed(seed_value)

            # Generate a random range for the command
            #67range a = random.randrange(2**30, 2**31) #68range a = random.randrange(2**31, 2**32)
            a = random.randrange(2**30, 2**31)
            random_start = "%00x" % a
            random_range = (random_start + "000000000:" + random_start + "fffffffff")

            # Print the generated seed and range
            print(f'Seed: {seed_value} KHex: {random_start}\n')

            # Run the BitCrack command with the generated range #67 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9  #68 1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ
            cmd_command = f'BitCrack.exe -b 128 -t 256 -p 512 -o foundkey.txt --keyspace {random_range} 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9\n'
            subprocess.call(cmd_command, shell=True)

            # Check if 'foundkey.txt' contains any private key, and if so, exit the loop
            try:
                with open('foundkey.txt', 'r') as f:
                    found_data = f.read().strip()
                    if found_data:
                        print(f"Private key found: {found_data.split()[1]}")
                        private_key_hex = found_data.split()[1]  # The private key is in the second position
                        return private_key_hex  # Return the private key to proceed to Steps 1-8
            except FileNotFoundError:
                print("Found key file not yet generated.")
           
            # Optional: Add a delay before retrying
            time.sleep(2)

    # =========================== #
    #    STEP 1: CREATE WALLET    #
    # =========================== #

    # Get private key from Step 0
    private_key_hex = find_private_key()

    # Private key in hex format
    private_key = PrivateKey.from_hex(private_key_hex)  # Use `bit` library to handle key

    btc_address = private_key.address
    print(f"Bitcoin Address: {btc_address}")

    # =========================== #
    #   STEP 2: FETCH BALANCE     #
    # =========================== #

    api_url = f'https://blockchain.info/rawaddr/{btc_address}'
    response = requests.get(api_url)
    data = response.json()

    balance = data.get('final_balance', 0) 10**8  # Convert satoshis to BTC
    print(f"Balance: {balance:.8f} BTC")

    if balance == 0:
        print("No funds available in the address.")

    # =========================== #
    #   STEP 3: LAST TXs       #
    # =========================== #

    if "txs" not in data or not data["txs"]:
        print("No transactions found for this address.")
    else:
        print("\nLast Transactions:")
        transactions = data["txs"][:1]  # Get the last numberof transactions

        for tx in transactions:
            tx_id = tx["hash"][:10]  # Shorten transaction ID for readability
            print(f"\nTransaction ID: {tx_id}...")

            # SENT Transactions
            sent_any = False
            for output in tx["out"]:
                if output.get("addr") and output["addr"] != btc_address:
                    sent_any = True
                    print(f"  → Sent to: {output['addr']} | Amount: {output['value'] 10**8:.8f} BTC")

            if not sent_any:
                print("  → No outgoing transactions in this TX.")

            # RECEIVED Transactions
            received_any = False
            for input_tx in tx["inputs"]:
                if "prev_out" in input_tx and input_tx["prev_out"].get("addr") == btc_address:
                    received_any = True
                    amount_received = input_tx["prev_out"]["value"] 10**8  # Convert satoshis to BTC
                    print(f"  ← Received from: {input_tx['prev_out']['addr']} | Amount: {amount_received:.8f} BTC")

            if not received_any:
                print("  ← No incoming transactions in this TX.")

    # =========================== #
    #   STEP 4: FETCH UTXOs       #
    # =========================== #

    utxos = []
    for tx in data["txs"]:
        for output in tx["out"]:
            if output.get("addr") == btc_address and not output.get("spent"):
                utxos.append({"txid": tx["hash"], "vout": output["n"], "value": output["value"]})

    if not utxos:
        print("No available UTXOs. Exiting...")
        exit()

    # =========================== #
    #   STEP 5: SET TARGET & FEES #
    # =========================== #

    fee_url = 'https://mempool.space/api/v1/fees/recommended'
    fee_response = requests.get(fee_url)
    fee_data = fee_response.json()
    high_fee_rate = fee_data['fastestFee']  # sat/byte
    print(f"Using a fee rate of {high_fee_rate} sat/byte")

    target_address = "bc1qxfj9gsqpjduvfqyq58rkj6cgngrr672x6nm98f"

    # =========================== #
    #   STEP 6: CREATE TX         #
    # =========================== #

    # Calculate total input amount from UTXOs
    total_input = sum(utxo["value"] for utxo in utxos)
    estimated_size = 10 + (len(utxos) * 180) + (1 * 34) + 10  # Approximate transaction size in bytes
    fee = estimated_size * high_fee_rate  # Total fee in satoshis

    if total_input <= fee:
        print("Not enough funds to cover transaction fees. Exiting...")
        exit()

    send_amount = total_input - fee  # Amount to send after deducting fees

    print(f"Total input: {total_input 10**8:.8f} BTC")
    print(f"Transaction fee: {fee 10**8:.8f} BTC")
    print(f"Sending: {send_amount 10**8:.8f} BTC to {target_address}")

    # =========================== #
    #   STEP 7: SIGN TRANSACTION  #
    # =========================== #

    # Create transaction using `bit` library
    outputs = [(target_address, send_amount, 'btc')]
    signed_tx_hex = private_key.create_transaction(outputs, fee=fee 10**8, absolute_fee=True)

    print("\nRaw Signed Transaction Hex:")
    print(signed_tx_hex)

    # =========================== #
    #   STEP 8: SUBMIT TO SLIPSTREAM #
    # =========================== #

    service = Service(ChromeDriverManager().install())  # Auto-download latest ChromeDriver
    driver = webdriver.Chrome(service=service)
    driver.get('https://slipstream.mara.com/')
    time.sleep(5)

    textarea = driver.find_element("xpath", '//textarea[@placeholder="Paste your raw transaction here"]')
    submit_button = driver.find_element("xpath", '//button[text()="Activate Slipstream"]')

    textarea.send_keys(signed_tx_hex)
    submit_button.click()

    time.sleep(5)

    print("Transaction submitted successfully to Mara Slipstream. It is not yet broadcasted to the network.")
    driver.quit()

  • zahid888
    Member
    **
    Online Online

    Activity: 329
    Merit: 24

    the right steps towerds the goal


    View Profile
    March 11, 2025, 02:43:43 PM
     #7865
    Quote from: frozenen on March 11, 2025, 09:39:29 AM
    UNTESTED!! but surely we can automate Mara withdrawal:

    Code:
    # pip install ecdsa base58 requests selenium webdriver-manager bit
    # need bitcrack.exe in same folder
    import ecdsa
    import hashlib
    import base58
    import requests
    import time
    import random
    import subprocess
    from selenium import webdriver
    from selenium.webdriver.chrome.service import Service
    from webdriver_manager.chrome import ChromeDriverManager
    from bit import PrivateKey

    # =========================== #
    #    STEP 0: GENERATE SEED & RUN BITCRACK     #
    # =========================== #

    def generate_random_seed():
        # Generate a truly random 10-digit number (not starting with 0)
        return random.randint(2113081981, 2113081983)   # default range (1000000000, 9999999999) test#67 (2113081981, 2113081983)

    def find_private_key():
        while True:
            # Generate a new random seed for each iteration
            seed_value = generate_random_seed()
            print(f'\nUsing Seed: {seed_value}')

            # Set the random seed
            random.seed(seed_value)

            # Generate a random range for the command
            #67range a = random.randrange(2**30, 2**31) #68range a = random.randrange(2**31, 2**32)
            a = random.randrange(2**30, 2**31)
            random_start = "%00x" % a
            random_range = (random_start + "000000000:" + random_start + "fffffffff")

            # Print the generated seed and range
            print(f'Seed: {seed_value} KHex: {random_start}\n')

            # Run the BitCrack command with the generated range #67 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9  #68 1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ
            cmd_command = f'BitCrack.exe -b 128 -t 256 -p 512 -o foundkey.txt --keyspace {random_range} 1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9\n'
            subprocess.call(cmd_command, shell=True)

            # Check if 'foundkey.txt' contains any private key, and if so, exit the loop
            try:
                with open('foundkey.txt', 'r') as f:
                    found_data = f.read().strip()
                    if found_data:
                        print(f"Private key found: {found_data.split()[1]}")
                        private_key_hex = found_data.split()[1]  # The private key is in the second position
                        return private_key_hex  # Return the private key to proceed to Steps 1-8
            except FileNotFoundError:
                print("Found key file not yet generated.")
            
            # Optional: Add a delay before retrying
            time.sleep(2)

    # =========================== #
    #    STEP 1: CREATE WALLET    #
    # =========================== #

    # Get private key from Step 0
    private_key_hex = find_private_key()

    # Private key in hex format
    private_key = PrivateKey.from_hex(private_key_hex)  # Use `bit` library to handle key

    btc_address = private_key.address
    print(f"Bitcoin Address: {btc_address}")

    # =========================== #
    #   STEP 2: FETCH BALANCE     #
    # =========================== #

    api_url = f'https://blockchain.info/rawaddr/{btc_address}'
    response = requests.get(api_url)
    data = response.json()

    balance = data.get('final_balance', 0) 10**8  # Convert satoshis to BTC
    print(f"Balance: {balance:.8f} BTC")

    if balance == 0:
        print("No funds available in the address.")

    # =========================== #
    #   STEP 3: LAST TXs       #
    # =========================== #

    if "txs" not in data or not data["txs"]:
        print("No transactions found for this address.")
    else:
        print("\nLast Transactions:")
        transactions = data["txs"][:1]  # Get the last numberof transactions

        for tx in transactions:
            tx_id = tx["hash"][:10]  # Shorten transaction ID for readability
            print(f"\nTransaction ID: {tx_id}...")

            # SENT Transactions
            sent_any = False
            for output in tx["out"]:
                if output.get("addr") and output["addr"] != btc_address:
                    sent_any = True
                    print(f"  → Sent to: {output['addr']} | Amount: {output['value'] 10**8:.8f} BTC")

            if not sent_any:
                print("  → No outgoing transactions in this TX.")

            # RECEIVED Transactions
            received_any = False
            for input_tx in tx["inputs"]:
                if "prev_out" in input_tx and input_tx["prev_out"].get("addr") == btc_address:
                    received_any = True
                    amount_received = input_tx["prev_out"]["value"] 10**8  # Convert satoshis to BTC
                    print(f"  ← Received from: {input_tx['prev_out']['addr']} | Amount: {amount_received:.8f} BTC")

            if not received_any:
                print("  ← No incoming transactions in this TX.")

    # =========================== #
    #   STEP 4: FETCH UTXOs       #
    # =========================== #

    utxos = []
    for tx in data["txs"]:
        for output in tx["out"]:
            if output.get("addr") == btc_address and not output.get("spent"):
                utxos.append({"txid": tx["hash"], "vout": output["n"], "value": output["value"]})

    if not utxos:
        print("No available UTXOs. Exiting...")
        exit()

    # =========================== #
    #   STEP 5: SET TARGET & FEES #
    # =========================== #

    fee_url = 'https://mempool.space/api/v1/fees/recommended'
    fee_response = requests.get(fee_url)
    fee_data = fee_response.json()
    high_fee_rate = fee_data['fastestFee']  # sat/byte
    print(f"Using a fee rate of {high_fee_rate} sat/byte")

    target_address = "bc1qxfj9gsqpjduvfqyq58rkj6cgngrr672x6nm98f"

    # =========================== #
    #   STEP 6: CREATE TX         #
    # =========================== #

    # Calculate total input amount from UTXOs
    total_input = sum(utxo["value"] for utxo in utxos)
    estimated_size = 10 + (len(utxos) * 180) + (1 * 34) + 10  # Approximate transaction size in bytes
    fee = estimated_size * high_fee_rate  # Total fee in satoshis

    if total_input <= fee:
        print("Not enough funds to cover transaction fees. Exiting...")
        exit()

    send_amount = total_input - fee  # Amount to send after deducting fees

    print(f"Total input: {total_input 10**8:.8f} BTC")
    print(f"Transaction fee: {fee 10**8:.8f} BTC")
    print(f"Sending: {send_amount 10**8:.8f} BTC to {target_address}")

    # =========================== #
    #   STEP 7: SIGN TRANSACTION  #
    # =========================== #

    # Create transaction using `bit` library
    outputs = [(target_address, send_amount, 'btc')]
    signed_tx_hex = private_key.create_transaction(outputs, fee=fee 10**8, absolute_fee=True)

    print("\nRaw Signed Transaction Hex:")
    print(signed_tx_hex)

    # =========================== #
    #   STEP 8: SUBMIT TO SLIPSTREAM #
    # =========================== #

    service = Service(ChromeDriverManager().install())  # Auto-download latest ChromeDriver
    driver = webdriver.Chrome(service=service)
    driver.get('https://slipstream.mara.com/')
    time.sleep(5)

    textarea = driver.find_element("xpath", '//textarea[@placeholder="Paste your raw transaction here"]')
    submit_button = driver.find_element("xpath", '//button[text()="Activate Slipstream"]')

    textarea.send_keys(signed_tx_hex)
    submit_button.click()

    time.sleep(5)

    print("Transaction submitted successfully to Mara Slipstream. It is not yet broadcasted to the network.")
    driver.quit()

    Great job achieving full utilization of my script— You know what, while i was searching for 66, I stumbled upon a seed that turned out to be someone’s mobile number.  Cheesy Anything could be a seed, so give it your best shot! And when you finally crack it, don’t forget to mention me in your success (and send some appreciation fee too BTC  Wink). I’m not writing a tutorial here like wondering philosopher.. Lol Wink—I’m sharing ideas to help others. So, it’s only fair that those who benefit remember to give credit where it’s due!  Best of Luck!
    1BGvwggxfCaHGykKrVXX7fk8GYaLQpeixA

  • mcdouglasx
    Sr. Member
    ****
    Offline Offline

    Activity: 714
    Merit: 391



    View Profile WWW
    March 11, 2025, 03:22:38 PM
     #7866
    Quote from: Bram24732 on March 10, 2025, 11:09:52 PM
    Quote from: kTimesG on March 10, 2025, 05:28:52 PM
    That's why I said it can be a good improvement to find vanity addresses faster, but since there are skipped ranges, other matching prefixes might get lost, there is no violation. But this is not something that a vanity search would ever care about. Only something that should worry someone who wants to solve a puzzle in an efficient matter (e.g. an exact match).

    I still dont see how skipping is more efficient than scanning everything.
    A certain density of X bits prefixes (what you call being lucky) in an arbitrary range has zero impact on the probability of finding something on the next key, or on 100m keys later.
    You can think of it this way : since distribution is random, any key can be replaced by any other key. As a result changing the traversal order does not improve odds of success.

    I clarify my methodology: it's not that I skip keys and guess the result. My approach only prioritizes the statistically most probable ranges but maintains the logic of scanning the entire range, like yours. This is a substantial statistical improvement. You, with your pool, also use statistics because you divide and create sub-ranges, and choose the ranges at random. I could tell you that you might end up leaving the range at the end "in the worst-case scenario" and scan 95% to find it. But although it is true that there is a probability, it is a fallacy to tell you since thanks to the birthday paradox, you would normally have to scan half or a little more. That is what some do to counteract ideas based on the logic "in the worst-case scenario".
    ▄▄█████████████████▄▄
    ▄█████████████████████▄
    ███▀▀█████▀▀░░▀▀███████
    ███▄░░▀▀░░▄▄██▄░░██████
    █████░░░████████░░█████
    ████▌░▄░░█████▀░░██████
    ███▌░▐█▌░░▀▀▀▀░░▄██████
    ███░░▌██░░▄░░▄█████████
    ███▌░▀▄▀░░█▄░░█████████
    ████▄░░░▄███▄░░▀▀█▀▀███
    ██████████████▄▄░░░▄███
    ▀█████████████████████▀
    ▀▀█████████████████▀▀
    Rainbet.com
    CRYPTO CASINO & SPORTSBOOK
    		|
    █▄█▄█▄███████▄█▄█▄█
    ███████████████████
    ███████████████████
    ███████████████████
    █████▀█▀▀▄▄▄▀██████
    █████▀▄▀████░██████
    █████░██░█▀▄███████
    ████▄▀▀▄▄▀███████
    █████████▄▀▄███
    █████████████████
    ███████████████████
    ███████████████████
    ███████████████████
     
     $20,000 
    WEEKLY RAFFLE
    		|



    ▄█████████▄
    █████████ ██
    ▄▄█░▄░▄█▄░▄░█▄▄
    ▀██░▐█████▌░██▀
    ▄█▄░▀▀▀▀▀░▄█▄
    ▀▀▀█▄▄░▄▄█▀▀▀
    ▀█▀░▀█▀
    		10K
    WEEKLY
    RACE    		100K
    MONTHLY
    RACE    		|

    ██









    █████
    		███████▄█
    ████████    ██▄
    ███████    █    ████▄▄
    ████▄███████████▄
    ██████████████████▄
    ░▄█████████████████▄
    ▄███████████████████▄
    █████████████████▀████
    ██████████▀███████████
    ▀█████████████████████
    ░████████████████████▀
    ░░▀█████████████████▀
    ████▀▀███    ███████▀▀
    ████████████████████   ██
     
    [..►PLAY..]
     
    ████████   ██████████████

  • WanderingPhilospher
    Sr. Member
    ****
    Offline Offline

    Activity: 1386
    Merit: 269

    Shooters Shoot...


    View Profile
    March 11, 2025, 03:35:16 PM
     #7867
    Quote from: WanderingPhilospher on March 10, 2025, 01:47:16 PM
    1MVDYgVaSN6Qy3d7W5nqGAUziqwJpKyhGu

    e2bff95aa8cdb927745977699198ec9bacad30c79f69cff90bca05aaccfd3f91

    I did some mods and let it run for about 8 hours. (3 x 4060Ti & 3 x 3060Ti)

    Code:
    1MVDYgVaSN1JTo9pwJJKiNHAca2kNjHbDP
    1MVDYgVaSN1sZBZSCk38D7ohCYj43SHcyt
    1MVDYgVaSN1xeojrxfnFW3E3heMELmvnM2
    1MVDYgVaSN3EohGpJ9Li6WjLYrLtQ3Wkzr
    1MVDYgVaSN3jgetxwjmj8ArWtWYdpVsj4E
    1MVDYgVaSN3zgpX52Nmitgoig5hcRSafKm
    1MVDYgVaSN472hPnitkjZUNrC8XJJGdzHw
    1MVDYgVaSNDLJJ4yp8UKD5YbSGt1ZAujmp
    1MVDYgVaSNDYSeJgEgP8aPCQKAjd9Stzfp
    1MVDYgVaSNEsfcKsYFw7RAedk62s9Nd1JL
    1MVDYgVaSNF38wgY1xRa4somkUeqRB5inu
    1MVDYgVaSNGX3x4AVSzhqLtd3PMjArLBXJ
    1MVDYgVaSNLnTA6qyw3uEscRqcL8JmdugH
    1MVDYgVaSNMweHV1KQUDmHnXALcD7XqmRb
    1MVDYgVaSNQUNbobPgeig3xo2rH3LtCkKp
    1MVDYgVaSNS4x5BzFWnjwH5tSo5qsk43Hs
    1MVDYgVaSNW3UPZhv9nDAqGfwU1ex1mdBm
    1MVDYgVaSNXWfpVEsRwb4UBkBWaxBoVnkp
    1MVDYgVaSNY4H8sJJxfAZMCKGwfzDbj8fr
    1MVDYgVaSNZx7E7MFpYnoSMDqwFvvxh3zj
    1MVDYgVaSNcEiELEZme1WxWWF861Px5kGJ
    1MVDYgVaSNdz1yW72SEayYWecydRevY2Fe
    1MVDYgVaSNeeWafDg426zSCoeFLHoSpVGB
    1MVDYgVaSNg5gUysSqfcNbkxNg3D73vCL1
    1MVDYgVaSNgUczGrsZ157sUqYyHFT16b8Y
    1MVDYgVaSNjWkWqoMnT7rvevq6Vt5SN1Ym
    1MVDYgVaSNn1FafqWqz5Ygij4tZyhTgkyt
    1MVDYgVaSNodV2dkMm5CCXwDPUFYHqVXsH
    1MVDYgVaSNoiUfFhwXU5HmNX5hD4oCo2Rc
    1MVDYgVaSNpR3YYyWkoeMVkjeQoC13R9jt
    1MVDYgVaSNvjoWr1t84E8JMQ6rcvs1vokb
    1MVDYgVaSNwLxrobWt44mwfKMKQMEsDjkR
    1MVDYgVaSNyZQaKvyZdxqZCPtsaBDf4i5V

  • bibilgin
    Newbie
    *
    Offline Offline

    Activity: 249
    Merit: 0


    View Profile
    March 11, 2025, 04:04:33 PM
     #7868
    Quote from: WanderingPhilospher on March 11, 2025, 03:35:16 PM
    I did some mods and let it run for about 8 hours. (3 x 4060Ti & 3 x 3060Ti)

    Code:
    1MVDYgVaSN1JTo9pwJJKiNHAca2kNjHbDP
    1MVDYgVaSN1sZBZSCk38D7ohCYj43SHcyt
    1MVDYgVaSN1xeojrxfnFW3E3heMELmvnM2
    1MVDYgVaSN3EohGpJ9Li6WjLYrLtQ3Wkzr
    1MVDYgVaSN3jgetxwjmj8ArWtWYdpVsj4E
    1MVDYgVaSN3zgpX52Nmitgoig5hcRSafKm
    1MVDYgVaSN472hPnitkjZUNrC8XJJGdzHw
    1MVDYgVaSNDLJJ4yp8UKD5YbSGt1ZAujmp
    1MVDYgVaSNDYSeJgEgP8aPCQKAjd9Stzfp
    1MVDYgVaSNEsfcKsYFw7RAedk62s9Nd1JL
    1MVDYgVaSNF38wgY1xRa4somkUeqRB5inu
    1MVDYgVaSNGX3x4AVSzhqLtd3PMjArLBXJ
    1MVDYgVaSNLnTA6qyw3uEscRqcL8JmdugH
    1MVDYgVaSNMweHV1KQUDmHnXALcD7XqmRb
    1MVDYgVaSNQUNbobPgeig3xo2rH3LtCkKp
    1MVDYgVaSNS4x5BzFWnjwH5tSo5qsk43Hs
    1MVDYgVaSNW3UPZhv9nDAqGfwU1ex1mdBm
    1MVDYgVaSNXWfpVEsRwb4UBkBWaxBoVnkp
    1MVDYgVaSNY4H8sJJxfAZMCKGwfzDbj8fr
    1MVDYgVaSNZx7E7MFpYnoSMDqwFvvxh3zj
    1MVDYgVaSNcEiELEZme1WxWWF861Px5kGJ
    1MVDYgVaSNdz1yW72SEayYWecydRevY2Fe
    1MVDYgVaSNeeWafDg426zSCoeFLHoSpVGB
    1MVDYgVaSNg5gUysSqfcNbkxNg3D73vCL1
    1MVDYgVaSNgUczGrsZ157sUqYyHFT16b8Y
    1MVDYgVaSNjWkWqoMnT7rvevq6Vt5SN1Ym
    1MVDYgVaSNn1FafqWqz5Ygij4tZyhTgkyt
    1MVDYgVaSNodV2dkMm5CCXwDPUFYHqVXsH
    1MVDYgVaSNoiUfFhwXU5HmNX5hD4oCo2Rc
    1MVDYgVaSNpR3YYyWkoeMVkjeQoC13R9jt
    1MVDYgVaSNvjoWr1t84E8JMQ6rcvs1vokb
    1MVDYgVaSNwLxrobWt44mwfKMKQMEsDjkR
    1MVDYgVaSNyZQaKvyZdxqZCPtsaBDf4i5V


    You are great, it helped me a lot.  Grin

  • DmitryMerk
    Newbie
    *
    Offline Offline

    Activity: 4
    Merit: 0


    View Profile
    March 11, 2025, 04:24:50 PM
     #7869
    Quote from: WanderingPhilospher on March 11, 2025, 03:35:16 PM
    Quote from: WanderingPhilospher on March 10, 2025, 01:47:16 PM
    1MVDYgVaSN6Qy3d7W5nqGAUziqwJpKyhGu

    e2bff95aa8cdb927745977699198ec9bacad30c79f69cff90bca05aaccfd3f91

    I did some mods and let it run for about 8 hours. (3 x 4060Ti & 3 x 3060Ti)

    Code:
    1MVDYgVaSN1JTo9pwJJKiNHAca2kNjHbDP
    1MVDYgVaSN1sZBZSCk38D7ohCYj43SHcyt
    1MVDYgVaSN1xeojrxfnFW3E3heMELmvnM2
    1MVDYgVaSN3EohGpJ9Li6WjLYrLtQ3Wkzr
    1MVDYgVaSN3jgetxwjmj8ArWtWYdpVsj4E
    1MVDYgVaSN3zgpX52Nmitgoig5hcRSafKm
    1MVDYgVaSN472hPnitkjZUNrC8XJJGdzHw
    1MVDYgVaSNDLJJ4yp8UKD5YbSGt1ZAujmp
    1MVDYgVaSNDYSeJgEgP8aPCQKAjd9Stzfp
    1MVDYgVaSNEsfcKsYFw7RAedk62s9Nd1JL
    1MVDYgVaSNF38wgY1xRa4somkUeqRB5inu
    1MVDYgVaSNGX3x4AVSzhqLtd3PMjArLBXJ
    1MVDYgVaSNLnTA6qyw3uEscRqcL8JmdugH
    1MVDYgVaSNMweHV1KQUDmHnXALcD7XqmRb
    1MVDYgVaSNQUNbobPgeig3xo2rH3LtCkKp
    1MVDYgVaSNS4x5BzFWnjwH5tSo5qsk43Hs
    1MVDYgVaSNW3UPZhv9nDAqGfwU1ex1mdBm
    1MVDYgVaSNXWfpVEsRwb4UBkBWaxBoVnkp
    1MVDYgVaSNY4H8sJJxfAZMCKGwfzDbj8fr
    1MVDYgVaSNZx7E7MFpYnoSMDqwFvvxh3zj
    1MVDYgVaSNcEiELEZme1WxWWF861Px5kGJ
    1MVDYgVaSNdz1yW72SEayYWecydRevY2Fe
    1MVDYgVaSNeeWafDg426zSCoeFLHoSpVGB
    1MVDYgVaSNg5gUysSqfcNbkxNg3D73vCL1
    1MVDYgVaSNgUczGrsZ157sUqYyHFT16b8Y
    1MVDYgVaSNjWkWqoMnT7rvevq6Vt5SN1Ym
    1MVDYgVaSNn1FafqWqz5Ygij4tZyhTgkyt
    1MVDYgVaSNodV2dkMm5CCXwDPUFYHqVXsH
    1MVDYgVaSNoiUfFhwXU5HmNX5hD4oCo2Rc
    1MVDYgVaSNpR3YYyWkoeMVkjeQoC13R9jt
    1MVDYgVaSNvjoWr1t84E8JMQ6rcvs1vokb
    1MVDYgVaSNwLxrobWt44mwfKMKQMEsDjkR
    1MVDYgVaSNyZQaKvyZdxqZCPtsaBDf4i5V


    Quote from: aby3er on March 07, 2025, 08:21:39 AM
    Hey everyone/
    if someone needed for 68 :
    1MVDYgVaSN odV2dkMm5CCXwDPUFYHqVXsH
    (WIF): p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdCwdaSJRsEgap7BZBes
    (HEX): C28A55EDE39083727
     
    1MVDYgVaSN GX3x4AVSzhqLtd3PMjArLBXJ
    (WIF): p2pkh: KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qdabi5xJwfkBFCZ5Q2AY
    (HEX): D2CA721767ADAD06A

    you welcome  Wink

    WanderingPhilospher, You have minimum 2 keys not yours  Undecided
    Maybe it took not 8 hours?  Smiley

  • JimsR
    Newbie
    *
    Offline Offline

    Activity: 8
    Merit: 0


    View Profile
    March 11, 2025, 04:35:29 PM
     #7870
    Quote from: bibilgin on March 11, 2025, 08:35:47 AM
    Quote from: Bram24732 on March 10, 2025, 11:09:52 PM
    I still dont see how skipping is more efficient than scanning everything.
    A certain density of X bits prefixes (what you call being lucky) in an arbitrary range has zero impact on the probability of finding something on the next key, or on 100m keys later.
    You can think of it this way : since distribution is random, any key can be replaced by any other key. As a result changing the traversal order does not improve odds of success.

    Everyone can say that scanning by jumping is not logical.

    But I explained that it is possible with PROBABILITY calculation and some data.

    Example;
    You bought mixed colored candies sold in the market. You prioritize the colors or flavors you like. Then it is up to you to eat or not eat the others.

    Actually, the range is within a certain area. But since your hardware power is too much, I understand that you do not want to miss it.

    Edit:
    I can prove it to you like this.
    Send me a few wallets with the prefix 1MVDYgVaS, which are in order. I will tell you in which direction and how far away the nearest 1MVDYgVaSN prefix is ​​on AVERAGE.

    You want to prove something like this ?

    b71b3ed7348484a74 -> Address: 1MVDYM7EJ783viaKHqnELxmjmChE7r1pqz   -> e0b8a17fadc11deab8283c551a2b7b64afcc82fb
    b7b96fbb25f78bd6f   -> Address: 1MVDYN3C8NRQaSkukCurdFjKRDBSEVGAYX -> e0b8a18ecf2119138251d432f6c565f648db4f4a


    and continue to the next prefix?
    1MVDYgVaSN6iKKEsbyjwnJhmjw8FFcGFWh -> e0b8a2baee1b77fc703455f37934dcda00c9acc0
    1MVDYgVaSN6iKKEsbyrjzeEecNkBtnrAYw -> e0b8a2baee1b77fc703455f37f6a9743ac4bb6d4
    1MVDYgVaSN6iKKEsbz2NL978m2L1drKTAj -> e0b8a2baee1b77fc703455f388362c96c023dbc1
    1MVDYgVaSN6iKKEsbz4MVwBjXREGNsM2w9 -> e0b8a2baee1b77fc703455f38a069c9cac5acaf5
    1MVDYgVaSN6iKKEsbz8Ns2ByakjEZR9ScZ -> e0b8a2baee1b77fc703455f38db3b065bdc4ba1a
    1MVDYgVaSN6iKKEsbzDYbcWpXTPKPajKQV -> e0b8a2baee1b77fc703455f3926c6ae481234a3e
    1MVDYgVaSN6iKKEsbzJUSjn7GFZzjpGbMp -> e0b8a2baee1b77fc703455f396ed249a7d44a59b
    1MVDYgVaSN6iKKEsbzLMJFCnBjRxyQM58K -> e0b8a2baee1b77fc703455f398a41cf3cee942c0
    1MVDYgVaSN6iKKEsbzN9YUX9yK8skSHq58 -> e0b8a2baee1b77fc703455f39a487fee2fb09828
                                    ||
    1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ
    ^^^^^^^^^^^^^^

    untill the next Prefix ??

  • DmitryMerk
    Newbie
    *
    Offline Offline

    Activity: 4
    Merit: 0


    View Profile
    March 11, 2025, 04:39:40 PM
     #7871
    Quote from: JimsR on March 11, 2025, 04:35:29 PM

    1MVDYgVaSN6iKKEsbyjwnJhmjw8FFcGFWh -> e0b8a2baee1b77fc703455f37934dcda00c9acc0
    1MVDYgVaSN6iKKEsbyrjzeEecNkBtnrAYw -> e0b8a2baee1b77fc703455f37f6a9743ac4bb6d4
    1MVDYgVaSN6iKKEsbz2NL978m2L1drKTAj -> e0b8a2baee1b77fc703455f388362c96c023dbc1
    1MVDYgVaSN6iKKEsbz4MVwBjXREGNsM2w9 -> e0b8a2baee1b77fc703455f38a069c9cac5acaf5
    1MVDYgVaSN6iKKEsbz8Ns2ByakjEZR9ScZ -> e0b8a2baee1b77fc703455f38db3b065bdc4ba1a
    1MVDYgVaSN6iKKEsbzDYbcWpXTPKPajKQV -> e0b8a2baee1b77fc703455f3926c6ae481234a3e
    1MVDYgVaSN6iKKEsbzJUSjn7GFZzjpGbMp -> e0b8a2baee1b77fc703455f396ed249a7d44a59b
    1MVDYgVaSN6iKKEsbzLMJFCnBjRxyQM58K -> e0b8a2baee1b77fc703455f398a41cf3cee942c0
    1MVDYgVaSN6iKKEsbzN9YUX9yK8skSHq58 -> e0b8a2baee1b77fc703455f39a487fee2fb09828
                                    ||
    1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ
    ^^^^^^^^^^^^^^


    How did you find that? what soft? what GPU?

  • teguh54321
    Newbie
    *
    Offline Offline

    Activity: 115
    Merit: 0


    View Profile
    March 11, 2025, 04:41:12 PM
    Last edit: March 11, 2025, 04:55:19 PM by teguh54321
     #7872
    Hello, fellow puzzlers! Just curious—

    I have a mining rig with 5x RTX 3080, which I'm currently using to run BitCrack for Puzzle 68, just hoping for some luck 😅.

    But compared to my main PC with 3x RTX 3080, the mining rig seems to have a slower hash rate each  card in BitCrack. Could it be bottlenecked by the PCIe x1 risers?


    Has anyone here used a mining rig with PCIe x1 risers for BitCrack? I'm wondering if the risers cause any bottlenecks,or only cause by slow cpu ?

    If it x1 riser then I'll have to modify my entire mining rig for BitCrack 🙃.
    I hope using all 8 of my mining rigs can solve Puzzle 68. 😅✌️

  • bibilgin
    Newbie
    *
    Offline Offline

    Activity: 249
    Merit: 0


    View Profile
    March 11, 2025, 04:56:44 PM
     #7873
    Quote from: JimsR on March 11, 2025, 04:35:29 PM
    You want to prove something like this ?

    b71b3ed7348484a74 -> Address: 1MVDYM7EJ783viaKHqnELxmjmChE7r1pqz   -> e0b8a17fadc11deab8283c551a2b7b64afcc82fb
    b7b96fbb25f78bd6f   -> Address: 1MVDYN3C8NRQaSkukCurdFjKRDBSEVGAYX -> e0b8a18ecf2119138251d432f6c565f648db4f4a


    and continue to the next prefix?
    1MVDYgVaSN6iKKEsbyjwnJhmjw8FFcGFWh -> e0b8a2baee1b77fc703455f37934dcda00c9acc0
    1MVDYgVaSN6iKKEsbyrjzeEecNkBtnrAYw -> e0b8a2baee1b77fc703455f37f6a9743ac4bb6d4
    1MVDYgVaSN6iKKEsbz2NL978m2L1drKTAj -> e0b8a2baee1b77fc703455f388362c96c023dbc1
    1MVDYgVaSN6iKKEsbz4MVwBjXREGNsM2w9 -> e0b8a2baee1b77fc703455f38a069c9cac5acaf5
    1MVDYgVaSN6iKKEsbz8Ns2ByakjEZR9ScZ -> e0b8a2baee1b77fc703455f38db3b065bdc4ba1a
    1MVDYgVaSN6iKKEsbzDYbcWpXTPKPajKQV -> e0b8a2baee1b77fc703455f3926c6ae481234a3e
    1MVDYgVaSN6iKKEsbzJUSjn7GFZzjpGbMp -> e0b8a2baee1b77fc703455f396ed249a7d44a59b
    1MVDYgVaSN6iKKEsbzLMJFCnBjRxyQM58K -> e0b8a2baee1b77fc703455f398a41cf3cee942c0
    1MVDYgVaSN6iKKEsbzN9YUX9yK8skSHq58 -> e0b8a2baee1b77fc703455f39a487fee2fb09828
                                    ||
    1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ
    ^^^^^^^^^^^^^^

    untill the next Prefix ??



    No, it's not like that.

    1MVDYgVaSN6iKKEsbyjwnJhmjw8FFcGFWh -> e0b8a2baee1b77fc703455f37934dcda00c9acc0
    1MVDYgVaSN6iKKEsbyrjzeEecNkBtnrAYw -> e0b8a2baee1b77fc703455f37f6a9743ac4bb6d4
    1MVDYgVaSN6iKKEsbz2NL978m2L1drKTAj -> e0b8a2baee1b77fc703455f388362c96c023dbc1
    1MVDYgVaSN6iKKEsbz4MVwBjXREGNsM2w9 -> e0b8a2baee1b77fc703455f38a069c9cac5acaf5
    1MVDYgVaSN6iKKEsbz8Ns2ByakjEZR9ScZ -> e0b8a2baee1b77fc703455f38db3b065bdc4ba1a.....

    I don't think most of these are in the 68 bit range.

    1MVDYgVaSN - This is the prefix I'm targeting
    After finding the 1MVDYgVaSN prefix, I do the Hex calculations and move on to the next one.
    Then I do the Hash160 comparison and calculations. Then I figure out which hex ranges it's likely to be in and continue scanning again.

  • teguh54321
    Newbie
    *
    Offline Offline

    Activity: 115
    Merit: 0


    View Profile
    March 11, 2025, 05:03:21 PM
     #7874
    Based on our previous discussions, does this mean the key is likely between D1xxx and EFxxx? Or could it still be in lowercase?

    I also had an idea for filtering:

    Skip keys with 4 or more repeating characters, like xxxx, aaaa, bbbb.

    Skip keys with 4 or more consecutive sequences, like abcd, 1234.

    Skip keys with 4 or more descending sequences, like 4321, 5432.

    Skip keys with 3 or more repeating patterns, such as ababab, acacac, 121212, abcabcabc.


    Any ideas on how to implement these filters in BitCrack? It might help reduce a lot of unnecessary checks 😅.

  • dastic
    Jr. Member
    *
    Offline Offline

    Activity: 35
    Merit: 1


    View Profile
    March 11, 2025, 05:10:27 PM
     #7875
    Quote from: teguh54321 on March 11, 2025, 05:03:21 PM
    Based on our previous discussions, does this mean the key is likely between D1xxx and EFxxx? Or could it still be in lowercase?

    I also had an idea for filtering:

    Skip keys with 4 or more repeating characters, like xxxx, aaaa, bbbb.

    Skip keys with 4 or more consecutive sequences, like abcd, 1234.

    Skip keys with 4 or more descending sequences, like 4321, 5432.

    Skip keys with 3 or more repeating patterns, such as ababab, acacac, 121212, abcabcabc.


    Any ideas on how to implement these filters in BitCrack? It might help reduce a lot of unnecessary checks 😅.



    No, this Vanity Search does not prove anything, it can be 8 , it can be f

  • teguh54321
    Newbie
    *
    Offline Offline

    Activity: 115
    Merit: 0


    View Profile
    March 11, 2025, 05:21:44 PM
     #7876
    Quote from: dastic on March 11, 2025, 05:10:27 PM
    Quote from: teguh54321 on March 11, 2025, 05:03:21 PM
    Based on our previous discussions, does this mean the key is likely between D1xxx and EFxxx? Or could it still be in lowercase?

    I also had an idea for filtering:

    Skip keys with 4 or more repeating characters, like xxxx, aaaa, bbbb.

    Skip keys with 4 or more consecutive sequences, like abcd, 1234.

    Skip keys with 4 or more descending sequences, like 4321, 5432.

    Skip keys with 3 or more repeating patterns, such as ababab, acacac, 121212, abcabcabc.


    Any ideas on how to implement these filters in BitCrack? It might help reduce a lot of unnecessary checks 😅.



    No, this Vanity Search does not prove anything, it can be 8 , it can be f

    Hmm... so there's no useful or relatable pattern to help with cracking? 😅🤔


    Maybe a proximity-based address, or just completely random? 🙃

  • JimsR
    Newbie
    *
    Offline Offline

    Activity: 8
    Merit: 0


    View Profile
    March 11, 2025, 05:30:44 PM
     #7877
    Quote from: DmitryMerk on March 11, 2025, 04:39:40 PM
    Quote from: JimsR on March 11, 2025, 04:35:29 PM

    1MVDYgVaSN6iKKEsbyjwnJhmjw8FFcGFWh -> e0b8a2baee1b77fc703455f37934dcda00c9acc0
    1MVDYgVaSN6iKKEsbyrjzeEecNkBtnrAYw -> e0b8a2baee1b77fc703455f37f6a9743ac4bb6d4
    1MVDYgVaSN6iKKEsbz2NL978m2L1drKTAj -> e0b8a2baee1b77fc703455f388362c96c023dbc1
    1MVDYgVaSN6iKKEsbz4MVwBjXREGNsM2w9 -> e0b8a2baee1b77fc703455f38a069c9cac5acaf5
    1MVDYgVaSN6iKKEsbz8Ns2ByakjEZR9ScZ -> e0b8a2baee1b77fc703455f38db3b065bdc4ba1a
    1MVDYgVaSN6iKKEsbzDYbcWpXTPKPajKQV -> e0b8a2baee1b77fc703455f3926c6ae481234a3e
    1MVDYgVaSN6iKKEsbzJUSjn7GFZzjpGbMp -> e0b8a2baee1b77fc703455f396ed249a7d44a59b
    1MVDYgVaSN6iKKEsbzLMJFCnBjRxyQM58K -> e0b8a2baee1b77fc703455f398a41cf3cee942c0
    1MVDYgVaSN6iKKEsbzN9YUX9yK8skSHq58 -> e0b8a2baee1b77fc703455f39a487fee2fb09828
                                    ||
    1MVDYgVaSN6iKKEsbzRUAYFrYJadLYZvvZ
    ^^^^^^^^^^^^^^


    How did you find that? what soft? what GPU?

    No Man I am just asking method to @bibilgin

    i am using math + Probability, i dont have such GPU Power, Only 1 RTX4050

    Code:
    Bits: 1, Expected Result: 1, Log2: 0.0000000000000, Nearby Value: 1, Difference: 0, Percentage Difference: 0.00%
    Bits: 2, Expected Result: 3, Log2: 1.5849625007212, Nearby Value: 2, Difference: 1, Percentage Difference: 50.00%
    Bits: 3, Expected Result: 7, Log2: 2.8073549220576, Nearby Value: 4, Difference: 3, Percentage Difference: 75.00%
    Bits: 4, Expected Result: 8, Log2: 3.0000000000000, Nearby Value: 8, Difference: 0, Percentage Difference: 0.00%
    Bits: 5, Expected Result: 21, Log2: 4.3923174227788, Nearby Value: 16, Difference: 5, Percentage Difference: 31.25%
    Bits: 6, Expected Result: 49, Log2: 5.6147098441152, Nearby Value: 32, Difference: 17, Percentage Difference: 53.12%
    Bits: 7, Expected Result: 76, Log2: 6.2479275134436, Nearby Value: 64, Difference: 12, Percentage Difference: 18.75%
    Bits: 8, Expected Result: 224, Log2: 7.8073549220576, Nearby Value: 128, Difference: 96, Percentage Difference: 75.00%
    Bits: 9, Expected Result: 467, Log2: 8.8672787397097, Nearby Value: 256, Difference: 211, Percentage Difference: 82.42%
    Bits: 10, Expected Result: 514, Log2: 9.0056245491939, Nearby Value: 512, Difference: 2, Percentage Difference: 0.39%
    Bits: 11, Expected Result: 1155, Log2: 10.1736771363034, Nearby Value: 1024, Difference: 131, Percentage Difference: 12.79%
    Bits: 12, Expected Result: 2683, Log2: 11.3896313392605, Nearby Value: 2048, Difference: 635, Percentage Difference: 31.01%
    Bits: 13, Expected Result: 5216, Log2: 12.3487281542311, Nearby Value: 4096, Difference: 1120, Percentage Difference: 27.34%
    Bits: 14, Expected Result: 10544, Log2: 13.3641346550081, Nearby Value: 8192, Difference: 2352, Percentage Difference: 28.71%
    Bits: 15, Expected Result: 26867, Log2: 14.7135476169127, Nearby Value: 16384, Difference: 10483, Percentage Difference: 63.98%
    Bits: 16, Expected Result: 51510, Log2: 15.6525649196107, Nearby Value: 32768, Difference: 18742, Percentage Difference: 57.20%
    Bits: 17, Expected Result: 95823, Log2: 16.5480843612244, Nearby Value: 65536, Difference: 30287, Percentage Difference: 46.21%
    Bits: 18, Expected Result: 198669, Log2: 17.6000072487084, Nearby Value: 131072, Difference: 67597, Percentage Difference: 51.57%
    Bits: 19, Expected Result: 357535, Log2: 18.4477249522854, Nearby Value: 262144, Difference: 95391, Percentage Difference: 36.39%
    Bits: 20, Expected Result: 863317, Log2: 19.7195308720262, Nearby Value: 524288, Difference: 339029, Percentage Difference: 64.66%
    Bits: 21, Expected Result: 1811764, Log2: 20.7889636117923, Nearby Value: 1048576, Difference: 763188, Percentage Difference: 72.78%
    Bits: 22, Expected Result: 3007503, Log2: 21.5201347458221, Nearby Value: 2097152, Difference: 910351, Percentage Difference: 43.41%
    Bits: 23, Expected Result: 5598802, Log2: 22.4166867297878, Nearby Value: 4194304, Difference: 1404498, Percentage Difference: 33.49%
    Bits: 24, Expected Result: 14428676, Log2: 23.7824355859485, Nearby Value: 8388608, Difference: 6040068, Percentage Difference: 72.00%
    Bits: 25, Expected Result: 33185509, Log2: 24.9840500666973, Nearby Value: 16777216, Difference: 16408293, Percentage Difference: 97.80%
    Bits: 26, Expected Result: 54538862, Log2: 25.7007812617129, Nearby Value: 33554432, Difference: 20984430, Percentage Difference: 62.54%
    Bits: 27, Expected Result: 111949941, Log2: 26.7382785269586, Nearby Value: 67108864, Difference: 44841077, Percentage Difference: 66.82%
    Bits: 28, Expected Result: 227634408, Log2: 27.7621434032948, Nearby Value: 134217728, Difference: 93416680, Percentage Difference: 69.60%
    Bits: 29, Expected Result: 400708894, Log2: 28.5779792907975, Nearby Value: 268435456, Difference: 132273438, Percentage Difference: 49.28%
    Bits: 30, Expected Result: 1033162084, Log2: 29.9444194580824, Nearby Value: 536870912, Difference: 496291172, Percentage Difference: 92.44%
    Bits: 31, Expected Result: 2102388551, Log2: 30.9693821782806, Nearby Value: 1073741824, Difference: 1028646727, Percentage Difference: 95.80%
    Bits: 32, Expected Result: 3093472814, Log2: 31.5265802093279, Nearby Value: 2147483648, Difference: 945989166, Percentage Difference: 44.05%
    Bits: 33, Expected Result: 7137437912, Log2: 32.7327591446279, Nearby Value: 4294967296, Difference: 2842470616, Percentage Difference: 66.18%
    Bits: 34, Expected Result: 14133072157, Log2: 33.7183560524728, Nearby Value: 8589934592, Difference: 5543137565, Percentage Difference: 64.53%
    Bits: 35, Expected Result: 20112871792, Log2: 34.2274000386858, Nearby Value: 17179869184, Difference: 2933002608, Percentage Difference: 17.07%
    Bits: 36, Expected Result: 42387769980, Log2: 35.3029290170967, Nearby Value: 34359738368, Difference: 8028031612, Percentage Difference: 23.36%
    Bits: 37, Expected Result: 100251560595, Log2: 36.5448337387469, Nearby Value: 68719476736, Difference: 31532083859, Percentage Difference: 45.89%
    Bits: 38, Expected Result: 146971536592, Log2: 37.0967458247161, Nearby Value: 137438953472, Difference: 9532583120, Percentage Difference: 6.94%
    Bits: 39, Expected Result: 323724968937, Log2: 38.2359776888025, Nearby Value: 274877906944, Difference: 48847061993, Percentage Difference: 17.77%
    Bits: 40, Expected Result: 1003651412950, Log2: 39.8683954197573, Nearby Value: 549755813888, Difference: 453895599062, Percentage Difference: 82.56%
    Bits: 41, Expected Result: 1458252205147, Log2: 40.4073773944234, Nearby Value: 1099511627776, Difference: 358740577371, Percentage Difference: 32.63%
    Bits: 42, Expected Result: 2895374552463, Log2: 41.3968871293596, Nearby Value: 2199023255552, Difference: 696351296911, Percentage Difference: 31.67%
    Bits: 43, Expected Result: 7409811047825, Log2: 42.7525738925369, Nearby Value: 4398046511104, Difference: 3011764536721, Percentage Difference: 68.48%
    Bits: 44, Expected Result: 15404761757071, Log2: 43.8084416040305, Nearby Value: 8796093022208, Difference: 6608668734863, Percentage Difference: 75.13%
    Bits: 45, Expected Result: 19996463086597, Log2: 44.1848100766020, Nearby Value: 17592186044416, Difference: 2404277042181, Percentage Difference: 13.67%
    Bits: 46, Expected Result: 51408670348612, Log2: 45.5470769317498, Nearby Value: 35184372088832, Difference: 16224298259780, Percentage Difference: 46.11%
    Bits: 47, Expected Result: 119666659114170, Log2: 46.7660145806977, Nearby Value: 70368744177664, Difference: 49297914936506, Percentage Difference: 70.06%
    Bits: 48, Expected Result: 191206974700443, Log2: 47.4421284782178, Nearby Value: 140737488355328, Difference: 50469486345115, Percentage Difference: 35.86%
    Bits: 49, Expected Result: 409118905032525, Log2: 48.5395135328857, Nearby Value: 281474976710656, Difference: 127643928321869, Percentage Difference: 45.35%
    Bits: 50, Expected Result: 611140496167764, Log2: 49.1184974103066, Nearby Value: 562949953421312, Difference: 48190542746452, Percentage Difference: 8.56%
    Bits: 51, Expected Result: 2058769515153876, Log2: 50.8707037486876, Nearby Value: 1125899906842624, Difference: 932869608311252, Percentage Difference: 82.86%
    Bits: 52, Expected Result: 4216495639600700, Log2: 51.9049658858182, Nearby Value: 2251799813685248, Difference: 1964695825915452, Percentage Difference: 87.25%
    Bits: 53, Expected Result: 6763683971478124, Log2: 52.5867306756910, Nearby Value: 4503599627370496, Difference: 2260084344107628, Percentage Difference: 50.18%
    Bits: 54, Expected Result: 9974455244496707, Log2: 53.1471594739162, Nearby Value: 9007199254740992, Difference: 967255989755715, Percentage Difference: 10.74%
    Bits: 55, Expected Result: 30045390491869460, Log2: 54.7379931905113, Nearby Value: 18014398509481984, Difference: 12030991982387476, Percentage Difference: 66.79%
    Bits: 56, Expected Result: 44218742292676575, Log2: 55.2955075095681, Nearby Value: 36028797018963968, Difference: 8189945273712607, Percentage Difference: 22.73%
    Bits: 57, Expected Result: 138245758910846492, Log2: 56.9400128353741, Nearby Value: 72057594037927936, Difference: 66188164872918556, Percentage Difference: 91.85%
    Bits: 58, Expected Result: 199976667976342049, Log2: 57.4726092982930, Nearby Value: 144115188075855872, Difference: 55861479900486177, Percentage Difference: 38.76%
    Bits: 59, Expected Result: 525070384258266191, Log2: 58.8652884381768, Nearby Value: 288230376151711744, Difference: 236840008106554447, Percentage Difference: 82.17%
    Bits: 60, Expected Result: 1135041350219496382, Log2: 59.9774505646693, Nearby Value: 576460752303423488, Difference: 558580597916072894, Percentage Difference: 96.90%
    Bits: 61, Expected Result: 1425787542618654982, Log2: 60.3064647289927, Nearby Value: 1152921504606846976, Difference: 272866038011808006, Percentage Difference: 23.67%
    Bits: 62, Expected Result: 3908372542507822062, Log2: 61.7612736982093, Nearby Value: 2305843009213693952, Difference: 1602529533294128110, Percentage Difference: 69.50%
    Bits: 63, Expected Result: 8993229949524469768, Log2: 62.9635450656771, Nearby Value: 4611686018427387904, Difference: 4381543931097081864, Percentage Difference: 95.01%
    Bits: 64, Expected Result: 17799667357578236628, Log2: 63.9484840830372, Nearby Value: 9223372036854775808, Difference: 8576295320723460820, Percentage Difference: 92.98%
    Bits: 65, Expected Result: 30568377312064202855, Log2: 64.7286737732734, Nearby Value: 18446744073709551616, Difference: 12121633238354651239, Percentage Difference: 65.71%
    Bits: 66, Expected Result: 46346217550346335726, Log2: 65.3290854039754, Nearby Value: 36893488147419103232, Difference: 9452729402927232494, Percentage Difference: 25.62%
    Bits: 67, Expected Result: 132656943602386256302, Log2: 66.8462620896241, Nearby Value: 73786976294838206464, Difference: 58869967307548049838, Percentage Difference: 79.78%

    And for Prefix b71b3ed7348484a74 is on percentage difference value 43.02%

    Code:
    42.98                     211001237412719335204.000000000000000000000 00000000000000000000000000000000000000000000000b703afb7e90ff9724       1GPehbiNvKDNSASUF4NhhKvDS76uXxUMt2
    42.99                     211015994807978302846.000000000000000000000 00000000000000000000000000000000000000000000000b706f694467381d7e       1JxRoK9y2pEKoLbjYRFryVdqeM7avb7xwT
    43.00                     211030752203237270487.000000000000000000000 00000000000000000000000000000000000000000000000b70a3d70a3d70a3d7       1KFfF35qcQ7NxK8gauwHwxRgTWHAvaHZ6D
    43.01                     211045509598496238128.000000000000000000000 00000000000000000000000000000000000000000000000b70d844d013a92a30       1JpgcZmzVuLvLqwWLpYNaLSGx9CjUZrEkf
    43.02                     211060266993755205770.000000000000000000000 00000000000000000000000000000000000000000000000b710cb295e9e1b08a       18BVqGUPsX6fxSLzZNDhCCQiZ8S1JpGvom
    43.03                     211075024389014173411.000000000000000000000 00000000000000000000000000000000000000000000000b7141205bc01a36e3       1D5oiTz7uDFPAa95keAoRKyV3CUqg41Bgo
    43.04                     211089781784273141052.000000000000000000000 00000000000000000000000000000000000000000000000b71758e219652bd3c       1KftDprtTmBc3FACjoc4McR7CzGzvi2MiL
    43.05                     211104539179532108694.000000000000000000000 00000000000000000000000000000000000000000000000b71a9fbe76c8b4396       1JeauK2ii3QVN3ptNJksV672KbfqxJZ7X9
    43.06                     211119296574791076335.000000000000000000000 00000000000000000000000000000000000000000000000b71de69ad42c3c9ef       18b5GGEXjiPn7rmko6DBwixPfQMuqPwjwW
    43.07                     211134053970050043976.000000000000000000000 00000000000000000000000000000000000000000000000b7212d77318fc5048       1K9bZ1W4FXELDoYGBL838aeX2HGP9GSZtj
    43.08                     211148811365309011617.000000000000000000000 00000000000000000000000000000000000000000000000b72474538ef34d6a1       18TKaZY7Y5QhwvqLAWpcz2CpJLsyeXM1D9
    43.09                     211163568760567979259.000000000000000000000 00000000000000000000000000000000000000000000000b727bb2fec56d5cfb       1CdSAgDiNEXuFNBSA7UiB7nsw9Y4gY96vz

    And using Custom mnemonic. Not standard mnemonic need to make some trick here. cause to using mnemonic is need minimum 128Bit,  for 68 bit it showing 9 Words with start A and B words. so can saving alot off words reduce from 2048 to something 250 words.

    https://ibb.co.com/TMkgQyjP

    i need partner who can develop GPU Version to make it fast.   Roll Eyes

  • teguh54321
    Newbie
    *
    Offline Offline

    Activity: 115
    Merit: 0


    View Profile
    March 11, 2025, 05:38:25 PM
     #7878
    Just for fun—
    Estimated time to solve Puzzle 68 using a single RTX 3080 across the full range . With bitcrack
    Rtx3080 1300 MH/s +-

    Total 8(16^16) 147,573,952,589,676,412,928
    / 1,300,000,000
    = 113,518,425,068 sec
    = 1,891,973,751 min
    =31,532,895 hour
    =1,313,870 days
    = 3,599 years

    With 100 gpu still 35 years 🙃

  • kTimesG
    Full Member
    ***
    Offline Offline

    Activity: 546
    Merit: 178


    View Profile
    March 11, 2025, 06:32:05 PM
     #7879
    I almost forgot why we can't have thoughtful discussion on this thread.

    lowercase hex, make code faster by skipping patterns, solve 68 in home garage, looking for unicorn dev partners to implement GPU... all of these in a few hours, lol. WTF happened, has BTC price surged, or what?

    I guess everyone is busy cracking 68 without bothering to even spend 10 minutes to read a few pages.

    I'll give you a hint: most likely, you will have to hash 2434970217729660813312 bytes that will not be useful in any way at all.

    Only 33 bytes are useful. That is, 99.99999999999999999864474728% of all the work is useless.

    It does not matter what strategy you use.
    Off the grid, training pigeons to broadcast signed messages.

  • teguh54321
    Newbie
    *
    Offline Offline

    Activity: 115
    Merit: 0


    View Profile
    March 11, 2025, 06:53:07 PM
     #7880
    Quote from: kTimesG on March 11, 2025, 06:32:05 PM
    I almost forgot why we can't have thoughtful discussion on this thread.

    lowercase hex, make code faster by skipping patterns, solve 68 in home garage, looking for unicorn dev partners to implement GPU... all of these in a few hours, lol. WTF happened, has BTC price surged, or what?

    I guess everyone is busy cracking 68 without bothering to even spend 10 minutes to read a few pages.

    I'll give you a hint: most likely, you will have to hash 2434970217729660813312 bytes that will not be useful in any way at all.

    Only 33 bytes are useful. That is, 99.99999999999999999864474728% of all the work is useless.

    It does not matter what strategy you use.

    Yeah, the puzzle is just too big 😔. I've been running traditional BitCrack with one rig (5x RTX 3080) and one PC (3x RTX 3080) for six months already. Better to buy a lottery ticket instead? Haha
    Pages: « 1 ... 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 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 ... 570 »
      Print  
Page 393
Viewing Page: 394

IRLBTC™ © 2025 IRLBTC.com