Bitcoin puzzle transaction ~32 BTC prize to who solves it

[TherapOne]

I really need help pls BTC

Go to page 281 and you will found tutorial from @WanderingPhilosopher how to use mara..dont forget to give him reward for his contribution..and keep away from scammer here

true , best man !!

[saatoshi_falling]

The amount of stupidity in this thread is approaching critical mass. I'm not sure how much longer this puzzle (or ChatGPT servers) can withstand.

[ee1234ee]

Can someone help me transfer funds #71? I don't have much experience. The guy who solved #67 and #68 gave a clue on how to do it, but the truth is I don't know how to do it with Mara.
I would greatly appreciate your help

Really? How much cost did you spend to solve this 71 puzzle?

[nebnebneb]

Can a P2PKH address be spendable only via an uncompressed public key?

Post:

I'm investigating a case where a P2PKH address receives funds, but the UTXOs can only be signed using the uncompressed public key — even though the address itself was derived from the compressed version.

Details:

A private key generates both compressed and uncompressed public keys.

The compressed key produces a valid P2PKH address (e.g. 1QL1PF34BBVcMcP4vm289MCgeUPtuoFQB4).

Funds are sent to that address.

However, the UTXOs linked to it have a scriptPubKey that matches the hash160 of the uncompressed public key.

The transaction can only be signed successfully using the uncompressed key.

This suggests that although the address matches the compressed key, the locking script was built using the uncompressed key — meaning only that version can unlock the funds.

Questions:

Is this expected behavior in custom scripts or puzzle transactions?


Can two different public keys (compressed vs uncompressed) lead to the same address but incompatible scriptPubKey expectations?

What’s the best way to detect which key format is required when sweeping legacy UTXOs?

Any insights or confirmations from others who’ve encountered this would be appreciated. I'm documenting this as part of a broader study on key format compatibility and puzzle resolution.


🛠️ Technical Clarification
Just to clarify a subtle but critical point regarding key formats:

While both compressed and uncompressed public keys can generate valid P2PKH addresses, the locking script (scriptPubKey) is built using the hash160 of a specific version of the public key. Therefore, only the exact public key version used to derive the hash160 in the script can unlock the funds — they are not interchangeable.

This means:

If the scriptPubKey contains the hash160 of the compressed key, you must sign with the compressed version.

If it contains the hash160 of the uncompressed key, only that version will work.

Even if both versions produce the same address visually, the underlying hash160 differs — and that’s what matters for validation.

Thanks to those who pointed this out. The original post was a verification of compatibility, not a transaction or signature. This correction ensures the narrative remains technically precise.

[Cricktor]

Just post a signed message of #71 and everybody here will believe

"Nice" try, you moron! Don't pretend you didn't know that this would expose the public key of #71, but it very very likely doesn't matter anyway, because I'm pretty sure, he didn't solve #71. And we all know what it means to expose the public key of such low entropy ranges.

Well, I had you already on my ignore list, but when stupidity or malevolence shine brightly, I'll make exceptions and suffer to read and comment eventually.

Shame on you, shame!


The "correct" public proof of a solver would be to post the SHA256(public key of #71), while the redeem transaction is sitting in MARA's hidden Slipstream mempool to be confirmed.

[Denevron]

why still trying to solve this puzzle

It's simple: if you're lucky, you'll find Bitcoin and become rich. If you're not, you're unlucky. The main thing at this point is not to go crazy. And if you read the forum thread, some people are truly nuts 

[Menowa*]

Just post a signed message of #71 and everybody here will believe

"Nice" try, you moron! Don't pretend you didn't know that this would expose the public key of #71, but it very very likely doesn't matter anyway, because I'm pretty sure, he didn't solve #71. And we all know what it means to expose the public key of such low entropy ranges.

Well, I had you already on my ignore list, but when stupidity or malevolence shine brightly, I'll make exceptions and suffer to read and comment eventually.

Shame on you, shame!


The "correct" public proof of a solver would be to post the SHA256(public key of #71), while the redeem transaction is sitting in MARA's hidden Slipstream mempool to be confirmed.

I will not pretend, cause I really thought it wouldn’t be dangerous. I apologize for that mistake

[Solving135puzzle]

Can anyone tell what's the hardest part to solve #135 puzzle: time complexity or space complexity? Can anyone give estimates of time and space complexity required for #135 as compared to #130 and #125.

#120, #125, #130 has been solved 2 years ago, but still no one have been able to solve #135!


I am newbie, sorry if my questions seems too naive!

[nebnebneb]

Can someone with more resources and a clear mind check the script python and the result?

Code:

import sys, hashlib, base58, requests, binascii, struct
from ecdsa import SigningKey, SECP256k1
from bitcoin import privtopub, pubtoaddr, sign
from bitcoin.transaction import mk_pubkey_script
from datetime import datetime
from binascii import hexlify
import time
import requests
from ecdsa.util import sigencode_der_canonize




PUZZLE_ADDRESS = "1PWo3JeB9jrGwfHDNpdGK54CRas7fsVzXU"
DEST_ADDRESS = "1QL1PF34BBVcMcP4vm289MCgeUPtuoFQB4"
key_key_input ="0000000000000000000000000000000000000000000000649a737f258abb8058"

FEE_RATE = 100
BTC_EUR = 94234.97

def show_victory_animation(privkey, address, btc_amount):
    animation = f"""
🎯 PUZZLE 71 RESUELTO 🎯
Clave privada encontrada: {privkey}
Dirección: {address}
Fondos: 💰 {btc_amount:.8f} BTC
Mensaje OP_RETURN: "Puzzle 71 solved by nebnebneb"
"""
    print(animation)
    with open("PUZZLE71_VICTORY.txt", "w", encoding="utf-8") as f:
        f.write(animation)

def int_to_varint(i):
    if i < 0xfd: return struct.pack('<B', i)
    elif i <= 0xffff: return b'\xfd' + struct.pack('<H', i)
    elif i <= 0xffffffff: return b'\xfe' + struct.pack('<I', i)
    else: return b'\xff' + struct.pack('<Q', i)

def create_raw_tx(inputs, outputs, dummy=False):
    version = struct.pack('<I', 1)
    tx_in_count = int_to_varint(len(inputs))
    tx_out_count = int_to_varint(len(outputs))
    locktime = struct.pack('<I', 0)

    tx_ins = b''
    for txin in inputs:
        txid = binascii.unhexlify(txin['txid'])[::-1]
        vout = struct.pack('<I', txin['vout'])
        script = binascii.unhexlify('00' * 107) if dummy else b''
        script_len = int_to_varint(len(script))
        sequence = binascii.unhexlify('ffffffff')
        tx_ins += txid + vout + script_len + script + sequence

    tx_outs = b''
    for txout in outputs:
        value = struct.pack('<Q', txout['value'])
        script = binascii.unhexlify(txout['script']) if 'script' in txout else binascii.unhexlify(mk_pubkey_script(txout['address']))
        script_len = int_to_varint(len(script))
        tx_outs += value + script_len + script

    raw_tx = version + tx_in_count + tx_ins + tx_out_count + tx_outs + locktime
    return binascii.hexlify(raw_tx).decode()

def create_op_return_output(message):
    op_code = b'\x6a'
    msg_bytes = message.encode()
    length = len(msg_bytes)
    script = op_code + bytes([length]) + msg_bytes
    return {
        'value': 0,
        'script': binascii.hexlify(script).decode()
    }

def derive_address(hex_privkey, compressed=True):
    privkey_bytes = bytes.fromhex(hex_privkey)
    sk = SigningKey.from_string(privkey_bytes, curve=SECP256k1)
    vk = sk.verifying_key
    pubkey_bytes = vk.to_string()
    prefix = b'\x02' if pubkey_bytes[63] % 2 == 0 else b'\x03'
    pubkey = prefix + pubkey_bytes[:32] if compressed else b'\x04' + pubkey_bytes
    sha256 = hashlib.sha256(pubkey).digest()
    ripemd160 = hashlib.new('ripemd160', sha256).digest()
    versioned = b'\x00' + ripemd160
    checksum = hashlib.sha256(hashlib.sha256(versioned).digest()).digest()[:4]
    return base58.b58encode(versioned + checksum).decode()

def wif_to_hex(wif):
    decoded = base58.b58decode(wif)
    return decoded[1:-4].hex()

def get_utxos(addr):
    url = f"https://blockstream.info/api/address/{addr}/utxo"
    return requests.get(url).json()

def broadcast_tx(raw_tx):
    url = "https://blockstream.info/api/tx"
    return requests.post(url, data=raw_tx).text

def broadcast_all(raw_tx):
    print("📡 Iniciando broadcast múltiple...")
    for url in [
        "https://slipstream.mara.com/api/v1/tx",
        "https://www.viabtc.com/tools/broadcast",
        "https://bitref.com/accelerator/",
        "https://mempool.space/api/tx"
    ]:
        try:
            r = requests.post(url, data=raw_tx, headers={"Content-Type": "text/plain"}, timeout=10)
            r.raise_for_status()
            print(f"✅ Broadcast OK → {url}")
        except Exception as e:
            print(f"❌ Error → {url}: {e}")
    print("📍 Finalizado.")

def save_log(content):
    ts = datetime.now().strftime("%Y%m%d_%H%M%S")
    with open(f"puzzle71_log_{ts}.txt", "w", encoding="utf-8") as f:
        f.write(content)

def insert_op_nop_in_all_scriptSigs(tx_hex, input_count):
    tx = bytearray.fromhex(tx_hex)
    offset = 4 + 1
    for _ in range(input_count):
        offset += 32 + 4
        script_len = tx[offset]
        script_start = offset + 1
        script_end = script_start + script_len
        script = tx[script_start:script_end]

        sig_len = script[0]
        sig = script[1:1 + sig_len]
        pubkey_start = 1 + sig_len + 1
        pubkey_len = script[1 + sig_len]
        pubkey = script[pubkey_start:pubkey_start + pubkey_len]

        modified_script = bytearray()
        modified_script += bytes([sig_len]) + sig
        modified_script += b'\x61'
        modified_script += bytes([pubkey_len]) + pubkey

        tx[offset] = len(modified_script)
        tx = tx[:script_start] + modified_script + tx[script_end:]
        offset = script_start + len(modified_script) + 4
    return tx.hex()

def is_tx_mined(txid):
    url = f"https://mempool.space/api/tx/{txid}"
    try:
        r = requests.get(url, timeout=10)
        r.raise_for_status()
        data = r.json()
        return data.get("status", {}).get("confirmed", False)
    except:
        return False

def defend_until_mined(txid, raw_tx):
    print(f"🛡️ Vigilando TXID: {txid}")
    while not is_tx_mined(txid):
        broadcast_all(raw_tx)
        print("⏳ Esperando 30 segundos...")
        time.sleep(30)
    print("✅ Transacción minada. Defensa finalizada.")
def decode_tx_locally(raw_tx_hex):
    import struct, binascii

    raw = bytes.fromhex(raw_tx_hex)
    offset = 0

    def read(fmt):
        nonlocal offset
        size = struct.calcsize(fmt)
        val = struct.unpack(fmt, raw[offset:offset+size])[0]
        offset += size
        return val

    def read_varint():
        nonlocal offset
        prefix = raw[offset]
        offset += 1
        if prefix < 0xfd:
            return prefix
        elif prefix == 0xfd:
            val = struct.unpack('<H', raw[offset:offset+2])[0]
            offset += 2
            return val
        elif prefix == 0xfe:
            val = struct.unpack('<I', raw[offset:offset+4])[0]
            offset += 4
            return val
        else:
            val = struct.unpack('<Q', raw[offset:offset+8])[0]
            offset += 8
            return val

    def read_bytes(n):
        nonlocal offset
        val = raw[offset:offset+n]
        offset += n
        return val

    tx = {
        'version': read('<I'),
        'inputs': [],
        'outputs': [],
        'locktime': None
    }

    input_count = read_varint()
    for i in range(input_count):
        txid = read_bytes(32)[::-1].hex()
        vout = read('<I')
        script_len = read_varint()
        script_sig = read_bytes(script_len).hex()
        sequence = read_bytes(4).hex()
        tx['inputs'].append({
            'index': i + 1,
            'txid': txid,
            'vout': vout,
            'scriptSig': script_sig,
            'sequence': sequence
        })

    output_count = read_varint()
    for i in range(output_count):
        value = read('<Q')
        script_len = read_varint()
        script_pubkey = read_bytes(script_len).hex()
        tx['outputs'].append({
            'index': i,
            'value_sats': value,
            'value_btc': value / 1e8,
            'scriptPubKey': script_pubkey
        })

    tx['locktime'] = read('<I')
    return tx








def sign_with_compressed_key(raw_tx_hex, input_index, privkey_hex, script_pubkey_hex):
    from ecdsa import SigningKey, SECP256k1
    from ecdsa.util import sigencode_der

    privkey_bytes = bytes.fromhex(privkey_hex)
    sk = SigningKey.from_string(privkey_bytes, curve=SECP256k1)
    vk = sk.verifying_key

    pubkey_bytes = vk.to_string()
    prefix = b'\x02' if pubkey_bytes[63] % 2 == 0 else b'\x03'
    pubkey_compressed = prefix + pubkey_bytes[:32]

    sighash = create_sighash(raw_tx_hex, input_index, script_pubkey_hex)
    signature = sk.sign_digest(sighash, sigencode=sigencode_der_canonize) + b'\x01'

    script_sig = (
        bytes([len(signature)]) + signature +
        bytes([len(pubkey_compressed)]) + pubkey_compressed
    )

    tx = bytearray.fromhex(raw_tx_hex)
    offset = 4 + 1  # versión + input count

    for i in range(input_index):
        offset += 32 + 4
        script_len = tx[offset]
        offset += 1 + script_len + 4

    offset += 32 + 4
    script_len_offset = offset
    offset += 1
    original_script_len = tx[script_len_offset]
    offset += original_script_len + 4

    tx[script_len_offset] = len(script_sig)
    tx = tx[:script_len_offset + 1] + script_sig + tx[script_len_offset + 1 + original_script_len:]

    return tx.hex()










def create_sighash(raw_tx_hex, input_index, script_pubkey_hex):
    import struct

    tx = bytearray.fromhex(raw_tx_hex)
    version = tx[:4]
    locktime = tx[-4:]

    # Número de inputs
    input_count = tx[4]
    offset = 5

    inputs = []
    for i in range(input_count):
        txid = tx[offset:offset+32]
        offset += 32
        vout = tx[offset:offset+4]
        offset += 4
        script_len = tx[offset]
        offset += 1
        script = tx[offset:offset+script_len]
        offset += script_len
        sequence = tx[offset:offset+4]
        offset += 4

        if i == input_index:
            script = bytes.fromhex(script_pubkey_hex)
            script_len = len(script)
        else:
            script = b''
            script_len = 0

        inputs.append(txid + vout + bytes([script_len]) + script + sequence)

    # Número de outputs
    output_count = tx[offset]
    offset += 1
    outputs = tx[offset:-4]

    # Construye el tx para firmar
    tx_to_sign = (
        version +
        bytes([input_count]) +
        b''.join(inputs) +
        bytes([output_count]) +
        outputs +
        locktime +
        struct.pack('<I', 1)  # SIGHASH_ALL
    )

    return hashlib.sha256(hashlib.sha256(tx_to_sign).digest()).digest()

def get_script_pubkey(txid, vout):
    url = f"https://blockstream.info/api/tx/{txid}"
    try:
        r = requests.get(url, timeout=10)
        r.raise_for_status()
        tx_data = r.json()
        return tx_data['vout'][vout]['scriptpubkey']
    except Exception as e:
        print(f"❌ Error al obtener scriptPubKey para {txid}:{vout} → {e}")
        return None

def extract_r_s_from_scriptSig(scriptSig_hex):
    try:
        sig_len = int(scriptSig_hex[0:2], 16)
        sig_hex = scriptSig_hex[2:2 + sig_len * 2]
        sig_bytes = bytes.fromhex(sig_hex[:-2])  # excluye SIGHASH

        if sig_bytes[0] != 0x30:
            return None, None

        r_len = sig_bytes[3]
        r = sig_bytes[4:4 + r_len].hex()
        s_start = 4 + r_len + 2
        s_len = sig_bytes[s_start - 1]
        s = sig_bytes[s_start:s_start + s_len].hex()
        return r, s
    except Exception as e:
        return None, None







def main():
    key_input = sys.argv[1].strip() if len(sys.argv) == 2 else "0000000000000000000000000000000000000000000000649a737f258abb8058"

    key_input =key_key_input
    hex_privkey = key_input if len(key_input) == 64 else wif_to_hex(key_input)

    addr_compressed = derive_address(hex_privkey, True)
    addr_uncompressed = derive_address(hex_privkey, False)

    log = f"🔐 Clave introducida: {key_input}\n📬 Comprimida: {addr_compressed}\n📬 No comprimida: {addr_uncompressed}\n🎯 Puzzle: {PUZZLE_ADDRESS}\n"
    if addr_compressed == PUZZLE_ADDRESS:
        log += "✅ Coincide con dirección comprimida\n"
    elif addr_uncompressed == PUZZLE_ADDRESS:
        log += "✅ Coincide con dirección no comprimida\n"
    else:
        log += "❌ No coincide\n"

    show_victory_animation(key_input, PUZZLE_ADDRESS, 7.10019626)

    utxos_raw = get_utxos(PUZZLE_ADDRESS)
    utxos = [u for u in utxos_raw if u.get('status', {}).get('confirmed', False)]
    inputs = [{'txid': u['txid'], 'vout': u['vout']} for u in utxos]
    total_value = sum(u['value'] for u in utxos)

    estimated_size = len(inputs) * 148 + 5 * 34 + 10
    fee = estimated_size * FEE_RATE
    send_value = total_value - fee
    if send_value <= 0:
        log += f"❌ Saldo insuficiente. Total: {total_value}, Fee: {fee}\n"
        save_log(log)
        return

    timestamp = datetime.utcnow().strftime("%Y-%m-%dT%H:%M:%SZ")
    raw_tx_temp = create_raw_tx(inputs, [
        {'address': DEST_ADDRESS, 'value': send_value},
        create_op_return_output(f"DEST:{DEST_ADDRESS};TIME:{timestamp};TXID:pending")
    ])
    tx_signed_temp = raw_tx_temp
    
    
    
    for i in range(len(inputs)):
        txid = inputs[i]['txid']
        vout = inputs[i]['vout']
        script_pubkey_hex = get_script_pubkey(txid, vout)

        tx_signed_temp = sign_with_compressed_key(tx_signed_temp, i, hex_privkey, script_pubkey_hex)

    tx_bytes = bytes.fromhex(tx_signed_temp)
    txid = hashlib.sha256(hashlib.sha256(tx_bytes).digest()).digest()[::-1].hex()

   
   

   
    #op_return_text = f"TXID:{txid}"
    op_return_text = "Puzzle 71 solved by nebnebneb"

    # Construcción final
    outputs_final = [
    {'address': DEST_ADDRESS, 'value': send_value},
    create_op_return_output(op_return_text)
    ]

    raw_tx_final = create_raw_tx(inputs, outputs_final)
    tx_signed_final = raw_tx_final
    
    
    for i in range(len(inputs)):
        txid = inputs[i]['txid']
        vout = inputs[i]['vout']
        script_pubkey_hex = get_script_pubkey(txid, vout)

        tx_signed_final = sign_with_compressed_key(tx_signed_final, i, hex_privkey, script_pubkey_hex)



    
    log += f"\n✅ Transacción firmada:\n{tx_signed_final}\n"

    # 🚀 Transmitir si la dirección coincide
    if addr_compressed == PUZZLE_ADDRESS or addr_uncompressed == PUZZLE_ADDRESS:
        txid = broadcast_tx(tx_signed_final)
        log += f"\n🚀 Transacción enviada. TXID: {txid}\n"
        print (f"Transacción enviada. TXID: {txid}\n")
        broadcast_all(tx_signed_final)
        # 🛡️ Defensa activa: retransmitir hasta que se mine
        print(f"🛡️ Vigilando TXID: {txid}")
        while not is_tx_mined(txid):
            print("⏳ Aún no minada. Reintentando broadcast...")
            broadcast_all(tx_signed_final)
            time.sleep(30)  # espera 30 segundos entre intentos
        print("✅ Transacción minada. Defensa finalizada.")
        log += f"\n✅ Confirmada en bloque. TXID: {txid}\n"



        
    ## fee = total_value - total_outputs
    log +=f"(Envio : {send_value} sats)\n"
    log += f"(Fee: {fee} sats)\n"
    print (f"Send value: {send_value} sats\n")
 
    print (f"💸 Fee: {fee} sats\n")
    tx_hex = tx_signed_final  # tu transacción firmada
    tx_decoded = decode_tx_locally(tx_hex)
    print(tx_decoded)
   
    tx = decode_tx_locally(tx_hex)
    print("scriptSig : ",tx['inputs'][0]['scriptSig'])

    for vin in tx['inputs']:
        print(f"🔹 Input {vin['index']}: TXID {vin['txid']} vout {vin['vout']}")

    for vout in tx['outputs']:
        print(f"🔸 Output {vout['index']}: {vout['value_sats']} sats → script {vout['scriptPubKey']}")
    for vin in tx['inputs']:
        r, s = extract_r_s_from_scriptSig(vin['scriptSig'])
        print(f"🔹 Input {vin['index']}: TXID {vin['txid']} vout {vin['vout']}")
        print(f"   R = {r}")
        print(f"   S = {s}")


    save_log(log)

if __name__ == "__main__":
    main()

TX_RAW

Code:

010000000f6441384445a0f426ee689e2532e41fc6947dda41558026b80f5b1dfd7c58455d130000006a4730440220776b48273d32199747a79afd337e5557d0b36ea090fd56f2cb7f0c074443293b0220083625d69ed72bde0b5eb0aada168ccee85f49db82fb806ebcb6d29ae5bb4af8012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72ffffffffd75cde98aa9f12263be992c6cb9b8de775724319d86c54d069794cd65604a28a050000006b483045022100b363fcadd6bf44143b4c4272ce678a92af862fd30403dd5fa1b0c7701b075a6c0220754138d42f64bfd2275c4b95c85e87422b7742f9b509e129523f8bbc61843685012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72ffffffff15cda65f1e46982fc082b15c8dbb60985d12a7e60b0c742263608cc9349f3808460000006b483045022100c71a524b87714f19aef7f617c9f92614c5dc07e0132a69c77b4b71b89abdd8960220297fb73a9bf38c75160fccd231946098bfaa71b5102ebadd9e293e23b9602085012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72ffffffffb7c07d3cfd91d9718f03002b8a1bbba6ba35849305b26519cd35f3d640b0758c000000006a47304402202349ac9899e8b85be64b0d0101fc3b987fe6f45e07c55382c83e5d31f90913810220135bade969ce307d0d7878c72b08e4c786ccf40e317e5af647b058bfca24834e012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72ffffffffcc909efae3117d475edf77a53ab8531aee0d2f22c8426a88bd7c8600221a9ee2020000006b483045022100d69532633267ca3e0f177a4597c514a621efd1c7c4a6366a5b43816a06d34cd50220457ccb31402e6499c22892d7584bac384d43f2fba1bbb6d96442bc95f9252c15012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72ffffffff11cc7142c66d1711a1722f7aa8c2c32bf7d75fa34d9a0933d676b013f6cc182a000000006b483045022100bb999851c65913699a721460d91870f6c21990229c5b7fe56cec999d3e8fa6ba0220672deda3d2565d2a524d21f59073b693b0c04de0c80222fc8a8f2be95ad4ca0c012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72ffffffff10d650ec671f51e730c36da55623e6c9ae1f1803ea3cbb4cf82edc1f3e066358000000006b483045022100be6c36621498ac4f648fed92271fc3acf70efb07e4a62599fb72479b9d65e4e20220264bb51c8981a409ddc694033f3a0ce55d3216cf18fb30eb9502bc733bfcfdcb012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72ffffffff4bd20891f24cfc53a7e20c1cf503cf044350c8f9d06b32600557ebb1d85a89dc010000006b4830450221008d2b80809f0d61bd7e0c42ff724c77c76a05b9809e135101b35fe94d4bd6e69f02200ddb706f2615af395ab9d1a053710031432de61199f16cbd347938f1bd63668f012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72ffffffff5e24638c73bbff287f002d3035ac13d43b373bed0470a8425b92ed7f601409b3000000006b483045022100e0d5025274823ca3f753f50e8cc4b7c0d5e6663617c9e19e0b9c08a6e9fcd246022001586c7cabdbc43c21360bb20e6fd6096166e7064092172f49fa15fd62b6fe15012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72ffffffffc529667091173e4672fe1a6f6cc6e16a73e5d422300aafc140cbd221fe88fa72000000006b483045022100baaabdedb5dca47bb0175942bfd14b19d57ba41c3f7d8351e56fe390f6f21a66022077096497dc2b6391f7cae61a9f19dc706ed664149fcfa58bd2616aa4a5c8472a012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72ffffffffb9c3debc7ce9051f42f4f112e9ca38860d7c9815cabca112005800310e826d07000000006b48304502210084c96696a2f0c16488302d6144f21d22ece06b584bb623b82b171072aa24750d0220323cbce9f4281f7cbb4b5edddc118e5bd59f29361010d720db6fa14f1746bc85012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72ffffffff7c26a0b6ac74f480d95c583cfca2ec3b4c0a3fddf443a6af2cc342cad4c74095000000006a473044022041601512351de036a3edaf6dbf2614bb8d7ab0129dccb9599f1ff196cccbfa58022012cb2fa43ff923ca775430e1ccec41a013ecbcea4cfc3ead4444baf88aeb8295012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72ffffffff0f0f5bf1b2224d211e1086ecd234bb036f749aeef5fdf638ef5430e04c856c96000000006b483045022100847ec72bbdb57e1d0fb0fa5800a7c80d6949efcbe1366c23814901b231da435302205c8ef5ab76d580079960eab22cc18c0779c6d2cac1dd54876933bbdea337d44c012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72ffffffffb3138da741af259146ca2c4895bac7e0c08147679f88ce3302fb4db0584bf312050000006a47304402200c81748f2148e2685366f020906bdb94679894300d18897a09a04b6256638f48022015afd4804780e19ef04f5b5e12a5670023605398755917a9bf8020cede0ca249012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72ffffffff1b4e65289b514c3ce6940a18126b3d43281c83a0921eb5500c119a718af23dc0000000006a47304402205e02b2e88b647a387309a2bfab523b6ef8da59a5c87ecde964101f0476f749a502207e31b1df844b225f9c066e37ff37fe6bcb7bad618bc213163b9d0f3215832058012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72ffffffff0294644e2a000000001976a914ffe31dcd70cc8c68f627689dd4aa1c3725c3f89188ac00000000000000001f6a1d50757a7a6c6520373120736f6c766564206279206e65626e65626e656200000000

[SRG02289]

big cheat?

Code:

📏 Size: 2299 bytes
💸 Fees: 0.00240000 BTC (104 sat/byte)
⏳ Time:
⬇️ Inputs (15):
🔗 0.63900000 BTC📎 Source TX: 5d45587cfd1d5b0fb826805541da7d94c61fe432259e68ee26f4a04544384164
🔗 0.00000002 BTC📎 Source TX: 8aa20456d64c7969d0546cd819437275e78d9bcbc692e93b26129faa98de5cd7
🔗 0.07100000 BTC📎 Source TX: 08389f34c98c606322740c0be6a7125d9860bb8d5cb182c02f98461e5fa6cd15
🔗 0.00000600 BTC📎 Source TX: 8c75b040d6f335cd1965b205938435baa6bb1b8a2b00038f71d991fd3c7dc0b7
🔗 0.00008880 BTC📎 Source TX: e29e1a2200867cbd886a42c8222f0dee1a53b83aa577df5e477d11e3fa9e90cc
🔗 0.00001000 BTC📎 Source TX: 2a18ccf613b076d633099a4da35fd7f72bc3c2a87a2f72a111176dc64271cc11
🔗 0.00003770 BTC📎 Source TX: 5863063e1fdc2ef84cbb3cea03181faec9e62356a56dc330e7511f67ec50d610
🔗 0.00000710 BTC📎 Source TX: dc895ad8b1eb570560326bd0f9c8504304cf03f51c0ce2a753fc4cf29108d24b
🔗 0.00001000 BTC📎 Source TX: b30914607fed925b42a87004ed3b373bd413ac35302d007f28ffbb738c63245e
🔗 0.00001000 BTC📎 Source TX: 72fa88fe21d2cb40c1af0a3022d4e5736ae1c66c6f1afe72463e1791706629c5
🔗 0.00000001 BTC📎 Source TX: 076d820e3100580012a1bcca15987c0d8638cae912f1f4421f05e97cbcdec3b9
🔗 0.00001000 BTC📎 Source TX: 9540c7d4ca42c32cafa643f4dd3f0a4c3beca2fc3c585cd980f474acb6a0267c
🔗 0.00001767 BTC📎 Source TX: 966c854ce03054ef38f6fdf5ee9a746f03bb34d2ec86101e214d22b2f15b0f0f
🔗 6.39000000 BTC📎 Source TX: 12f34b58b04dfb0233ce889f674781c0e0c7ba95482cca469125af41a78d13b3
🔗 0.00000898 BTC📎 Source TX: c03df28a719a110c50b51e92a0831c28433d6b12180a94e63c4c519b28654e1b

⬆️ Outputs (2):
💰 7.09780628 BTC → 1QL1PF34BBVcMcP4vm289MCgeUPtuoFQB4
💰 0.00000000 BTC → OP_RETURN (data)
{
    "result": {
        "txid": "93ea55fb32923b0d283e8c6c63470ed8074da0359b9414c5bb01dce430c94c29",
        "hash": "93ea55fb32923b0d283e8c6c63470ed8074da0359b9414c5bb01dce430c94c29",
        "version": 1,
        "size": 2299,
        "vsize": 2299,
        "weight": 9196,
        "locktime": 0,
        "vin": [
            {
                "txid": "5d45587cfd1d5b0fb826805541da7d94c61fe432259e68ee26f4a04544384164",
                "vout": 19,
                "scriptSig": {
                    "asm": "30440220776b48273d32199747a79afd337e5557d0b36ea090fd56f2cb7f0c074443293b0220083625d69ed72bde0b5eb0aada168ccee85f49db82fb806ebcb6d29ae5bb4af8[ALL] 02ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72",
                    "hex": "4730440220776b48273d32199747a79afd337e5557d0b36ea090fd56f2cb7f0c074443293b0220083625d69ed72bde0b5eb0aada168ccee85f49db82fb806ebcb6d29ae5bb4af8012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72"
                },
                "sequence": 4294967295
            },
            {
                "txid": "8aa20456d64c7969d0546cd819437275e78d9bcbc692e93b26129faa98de5cd7",
                "vout": 5,
                "scriptSig": {
                    "asm": "3045022100b363fcadd6bf44143b4c4272ce678a92af862fd30403dd5fa1b0c7701b075a6c0220754138d42f64bfd2275c4b95c85e87422b7742f9b509e129523f8bbc61843685[ALL] 02ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72",
                    "hex": "483045022100b363fcadd6bf44143b4c4272ce678a92af862fd30403dd5fa1b0c7701b075a6c0220754138d42f64bfd2275c4b95c85e87422b7742f9b509e129523f8bbc61843685012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72"
                },
                "sequence": 4294967295
            },
            {
                "txid": "08389f34c98c606322740c0be6a7125d9860bb8d5cb182c02f98461e5fa6cd15",
                "vout": 70,
                "scriptSig": {
                    "asm": "3045022100c71a524b87714f19aef7f617c9f92614c5dc07e0132a69c77b4b71b89abdd8960220297fb73a9bf38c75160fccd231946098bfaa71b5102ebadd9e293e23b9602085[ALL] 02ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72",
                    "hex": "483045022100c71a524b87714f19aef7f617c9f92614c5dc07e0132a69c77b4b71b89abdd8960220297fb73a9bf38c75160fccd231946098bfaa71b5102ebadd9e293e23b9602085012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72"
                },
                "sequence": 4294967295
            },
            {
                "txid": "8c75b040d6f335cd1965b205938435baa6bb1b8a2b00038f71d991fd3c7dc0b7",
                "vout": 0,
                "scriptSig": {
                    "asm": "304402202349ac9899e8b85be64b0d0101fc3b987fe6f45e07c55382c83e5d31f90913810220135bade969ce307d0d7878c72b08e4c786ccf40e317e5af647b058bfca24834e[ALL] 02ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72",
                    "hex": "47304402202349ac9899e8b85be64b0d0101fc3b987fe6f45e07c55382c83e5d31f90913810220135bade969ce307d0d7878c72b08e4c786ccf40e317e5af647b058bfca24834e012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72"
                },
                "sequence": 4294967295
            },
            {
                "txid": "e29e1a2200867cbd886a42c8222f0dee1a53b83aa577df5e477d11e3fa9e90cc",
                "vout": 2,
                "scriptSig": {
                    "asm": "3045022100d69532633267ca3e0f177a4597c514a621efd1c7c4a6366a5b43816a06d34cd50220457ccb31402e6499c22892d7584bac384d43f2fba1bbb6d96442bc95f9252c15[ALL] 02ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72",
                    "hex": "483045022100d69532633267ca3e0f177a4597c514a621efd1c7c4a6366a5b43816a06d34cd50220457ccb31402e6499c22892d7584bac384d43f2fba1bbb6d96442bc95f9252c15012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72"
                },
                "sequence": 4294967295
            },
            {
                "txid": "2a18ccf613b076d633099a4da35fd7f72bc3c2a87a2f72a111176dc64271cc11",
                "vout": 0,
                "scriptSig": {
                    "asm": "3045022100bb999851c65913699a721460d91870f6c21990229c5b7fe56cec999d3e8fa6ba0220672deda3d2565d2a524d21f59073b693b0c04de0c80222fc8a8f2be95ad4ca0c[ALL] 02ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72",
                    "hex": "483045022100bb999851c65913699a721460d91870f6c21990229c5b7fe56cec999d3e8fa6ba0220672deda3d2565d2a524d21f59073b693b0c04de0c80222fc8a8f2be95ad4ca0c012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72"
                },
                "sequence": 4294967295
            },
            {
                "txid": "5863063e1fdc2ef84cbb3cea03181faec9e62356a56dc330e7511f67ec50d610",
                "vout": 0,
                "scriptSig": {
                    "asm": "3045022100be6c36621498ac4f648fed92271fc3acf70efb07e4a62599fb72479b9d65e4e20220264bb51c8981a409ddc694033f3a0ce55d3216cf18fb30eb9502bc733bfcfdcb[ALL] 02ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72",
                    "hex": "483045022100be6c36621498ac4f648fed92271fc3acf70efb07e4a62599fb72479b9d65e4e20220264bb51c8981a409ddc694033f3a0ce55d3216cf18fb30eb9502bc733bfcfdcb012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72"
                },
                "sequence": 4294967295
            },
            {
                "txid": "dc895ad8b1eb570560326bd0f9c8504304cf03f51c0ce2a753fc4cf29108d24b",
                "vout": 1,
                "scriptSig": {
                    "asm": "30450221008d2b80809f0d61bd7e0c42ff724c77c76a05b9809e135101b35fe94d4bd6e69f02200ddb706f2615af395ab9d1a053710031432de61199f16cbd347938f1bd63668f[ALL] 02ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72",
                    "hex": "4830450221008d2b80809f0d61bd7e0c42ff724c77c76a05b9809e135101b35fe94d4bd6e69f02200ddb706f2615af395ab9d1a053710031432de61199f16cbd347938f1bd63668f012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72"
                },
                "sequence": 4294967295
            },
            {
                "txid": "b30914607fed925b42a87004ed3b373bd413ac35302d007f28ffbb738c63245e",
                "vout": 0,
                "scriptSig": {
                    "asm": "3045022100e0d5025274823ca3f753f50e8cc4b7c0d5e6663617c9e19e0b9c08a6e9fcd246022001586c7cabdbc43c21360bb20e6fd6096166e7064092172f49fa15fd62b6fe15[ALL] 02ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72",
                    "hex": "483045022100e0d5025274823ca3f753f50e8cc4b7c0d5e6663617c9e19e0b9c08a6e9fcd246022001586c7cabdbc43c21360bb20e6fd6096166e7064092172f49fa15fd62b6fe15012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72"
                },
                "sequence": 4294967295
            },
            {
                "txid": "72fa88fe21d2cb40c1af0a3022d4e5736ae1c66c6f1afe72463e1791706629c5",
                "vout": 0,
                "scriptSig": {
                    "asm": "3045022100baaabdedb5dca47bb0175942bfd14b19d57ba41c3f7d8351e56fe390f6f21a66022077096497dc2b6391f7cae61a9f19dc706ed664149fcfa58bd2616aa4a5c8472a[ALL] 02ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72",
                    "hex": "483045022100baaabdedb5dca47bb0175942bfd14b19d57ba41c3f7d8351e56fe390f6f21a66022077096497dc2b6391f7cae61a9f19dc706ed664149fcfa58bd2616aa4a5c8472a012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72"
                },
                "sequence": 4294967295
            },
            {
                "txid": "076d820e3100580012a1bcca15987c0d8638cae912f1f4421f05e97cbcdec3b9",
                "vout": 0,
                "scriptSig": {
                    "asm": "304502210084c96696a2f0c16488302d6144f21d22ece06b584bb623b82b171072aa24750d0220323cbce9f4281f7cbb4b5edddc118e5bd59f29361010d720db6fa14f1746bc85[ALL] 02ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72",
                    "hex": "48304502210084c96696a2f0c16488302d6144f21d22ece06b584bb623b82b171072aa24750d0220323cbce9f4281f7cbb4b5edddc118e5bd59f29361010d720db6fa14f1746bc85012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72"
                },
                "sequence": 4294967295
            },
            {
                "txid": "9540c7d4ca42c32cafa643f4dd3f0a4c3beca2fc3c585cd980f474acb6a0267c",
                "vout": 0,
                "scriptSig": {
                    "asm": "3044022041601512351de036a3edaf6dbf2614bb8d7ab0129dccb9599f1ff196cccbfa58022012cb2fa43ff923ca775430e1ccec41a013ecbcea4cfc3ead4444baf88aeb8295[ALL] 02ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72",
                    "hex": "473044022041601512351de036a3edaf6dbf2614bb8d7ab0129dccb9599f1ff196cccbfa58022012cb2fa43ff923ca775430e1ccec41a013ecbcea4cfc3ead4444baf88aeb8295012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72"
                },
                "sequence": 4294967295
            },
            {
                "txid": "966c854ce03054ef38f6fdf5ee9a746f03bb34d2ec86101e214d22b2f15b0f0f",
                "vout": 0,
                "scriptSig": {
                    "asm": "3045022100847ec72bbdb57e1d0fb0fa5800a7c80d6949efcbe1366c23814901b231da435302205c8ef5ab76d580079960eab22cc18c0779c6d2cac1dd54876933bbdea337d44c[ALL] 02ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72",
                    "hex": "483045022100847ec72bbdb57e1d0fb0fa5800a7c80d6949efcbe1366c23814901b231da435302205c8ef5ab76d580079960eab22cc18c0779c6d2cac1dd54876933bbdea337d44c012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72"
                },
                "sequence": 4294967295
            },
            {
                "txid": "12f34b58b04dfb0233ce889f674781c0e0c7ba95482cca469125af41a78d13b3",
                "vout": 5,
                "scriptSig": {
                    "asm": "304402200c81748f2148e2685366f020906bdb94679894300d18897a09a04b6256638f48022015afd4804780e19ef04f5b5e12a5670023605398755917a9bf8020cede0ca249[ALL] 02ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72",
                    "hex": "47304402200c81748f2148e2685366f020906bdb94679894300d18897a09a04b6256638f48022015afd4804780e19ef04f5b5e12a5670023605398755917a9bf8020cede0ca249012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72"
                },
                "sequence": 4294967295
            },
            {
                "txid": "c03df28a719a110c50b51e92a0831c28433d6b12180a94e63c4c519b28654e1b",
                "vout": 0,
                "scriptSig": {
                    "asm": "304402205e02b2e88b647a387309a2bfab523b6ef8da59a5c87ecde964101f0476f749a502207e31b1df844b225f9c066e37ff37fe6bcb7bad618bc213163b9d0f3215832058[ALL] 02ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72",
                    "hex": "47304402205e02b2e88b647a387309a2bfab523b6ef8da59a5c87ecde964101f0476f749a502207e31b1df844b225f9c066e37ff37fe6bcb7bad618bc213163b9d0f3215832058012102ed65c797bfb5c842a9584acc5f3713f86b5e3fdcc75ecb0b41e16e60b714df72"
                },
                "sequence": 4294967295
            }
        ],
        "vout": [
            {
                "value": "7.09780628",
                "n": 0,
                "scriptPubKey": {
                    "asm": "OP_DUP OP_HASH160 ffe31dcd70cc8c68f627689dd4aa1c3725c3f891 OP_EQUALVERIFY OP_CHECKSIG",
                    "desc": "addr(1QL1PF34BBVcMcP4vm289MCgeUPtuoFQB4)#55t0d9at",
                    "hex": "76a914ffe31dcd70cc8c68f627689dd4aa1c3725c3f89188ac",
                    "address": "1QL1PF34BBVcMcP4vm289MCgeUPtuoFQB4",
                    "type": "pubkeyhash"
                }
            },
            {
                "value": "0.00000000",
                "n": 1,
                "scriptPubKey": {
                    "asm": "OP_RETURN 50757a7a6c6520373120736f6c766564206279206e65626e65626e6562",
                    "desc": "raw(6a1d50757a7a6c6520373120736f6c766564206279206e65626e65626e6562)#apduvy37",
                    "hex": "6a1d50757a7a6c6520373120736f6c766564206279206e65626e65626e6562",
                    "type": "nulldata"
                }
            }
        ]
    },
    "error": null
}

[teguh54321]

I believe i discover something based all similar prefix i found.

Any idea to implement my discovery ? 🙏.

Example the private key hex answer contain "EE"
The position can be anywhere,but surely it contain
"EE"

How to implement this filter to vanity mybe 🤔🤔

[BlackAKAAngel]

I believe i discover something based all similar prefix i found.

Any idea to implement my discovery ? 🙏.

Example the private key hex answer contain "EE"
The position can be anywhere,but surely it contain
"EE"

How to implement this filter to vanity mybe 🤔🤔

 

i can write small scypt for you python that its easy

[kTimesG]

I believe i discover something based all similar prefix i found.

Any idea to implement my discovery ? 🙏.

Example the private key hex answer contain "EE"
The position can be anywhere,but surely it contain
"EE"

How to implement this filter to vanity mybe 🤔🤔

I was thinking that after 600 pages and countless similar discussions things were clear...

Adding a filter anywhere inside the iteration engine slows down the execution speed.
Adding a filter on every scalar (key) is not just a programming nightmare - it's also the safest way to bring down the performance to total shit. Scanners don't even care about private keys, they only traverse the curve points, before they get hashed.

So arithmetically, the rational choice is to scan everything at the highest possible speed, rather than scanning, let's say, just 10% of everything (even if you somehow believe that you have 100% chances of success), but at a speed that's 10 times slower.

Also, WTF does "EE" being contained in the hex" even mean? What exactly does splitting some binary number in groups of 4 digits (least to most significant, and then reversing them visually) and favoring consecutive groups of value "1110 1110" has to do with a random string of 70 bits which have a 50% chance of either 0 or 1 of appearing at any given position?

[mcdouglasx]

Can someone with more resources and a clear mind check the script python and the result?

There's no need to complicate your life with Python scripts. Just import your private key into Electrum, create the transaction like any other, click Pay or Preview (without transmitting the TX), sign it, and export it, saving it to a file. This file contains your signed transaction in hex format, ready to be entered into Mara Splitstream, thus preventing your funds from being stolen later by bots.

Warning: Do not transmit the TX from Electrum; only use it to create the transaction.

[nebnebneb]

KtimesG brings us down to earth. But he is right. Either we have a computing power, which I believe most of us do not have, or we have an ALMOST INFINITE LUCK.
And there is a saying in Spanish that goes, "Luck is for the one who finds it, not for the one who seeks it," very appropriately applied to the PUZZLE.
In the case that someone is very, very lucky.... can we TRUST the Python script posted above to sweep the address? Is the transaction correct, the script? Of course, by changing the correct private key.

mcdouglasx
thanks for replying... to pass the hours while waiting for resolution... privkey, to make sure we have time to carry out the transaction safely. Keep sending TX as long as it hasn't been mined...

[crytoestudo]

USING already compiled code you have to trust too much.

KtimesG brings us down to earth. But he is right. Either we have a computing power, which I believe most of us do not have, or we have an ALMOST INFINITE LUCK.
And there is a saying in Spanish that goes, "Luck is for the one who finds it, not for the one who seeks it," very appropriately applied to the PUZZLE.
In the case that someone is very, very lucky.... can we TRUST the Python script posted above to sweep the address? Is the transaction correct, the script? Of course, by changing the correct private key.

mcdouglasx
thanks for replying... to pass the hours while waiting for resolution... privkey, to make sure we have time to carry out the transaction safely. Keep sending TX as long as it hasn't been mined...

the pool sorts two puzzles 71 and 72 in order without losing speed

https://bitcoinpuzzle.ru/forum/bitcoinpuzzle.html

[FREIVOGEL231]

I believe i discover something based all similar prefix i found.

I  think I have a mathematical techniques  that does it how to make changes to a specific digits
Any idea to implement my discovery ? 🙏.

Example the private key hex answer contain "EE"
The position can be anywhere,but surely it contain
"EE"

How to implement this filter to vanity mybe 🤔🤔

 

i can write small scypt for you python that its easy

I think I have a mathematical techniques for that you can manipulate specific digits of any number

[username666187]

I have some great ideas that have gained alot of traction but I don't have anyone to help me and I'm afraid if I tell anyone they will take my ideas solve the puzzle and I'll be left with nothing it's so frustrating because I don't have the skills to put it all together

[uvindele]

I have some great ideas that have gained alot of traction but I don't have anyone to help me and I'm afraid if I tell anyone they will take my ideas solve the puzzle and I'll be left with nothing it's so frustrating because I don't have the skills to put it all together

Don’t worry too much. Once you learn more about how everything works and how to connect the pieces, you’ll probably see that some of those ideas either already exist or don’t work quite the way you imagined

[Denevron]

I have some great ideas that have gained alot of traction but I don't have anyone to help me and I'm afraid if I tell anyone they will take my ideas solve the puzzle and I'll be left with nothing it's so frustrating because I don't have the skills to put it all together

  You're worrying in vain, but if you can't write the code yourself, but want to test your ideas, then at least you can ask the AI ​​to write you a small code for this (for small ranges), thereby you will test your theories