Bitcoin puzzle transaction ~32 BTC prize to who solves it

[zahid888]

F79BE2BABD037D4DC9B64B34C2C76437BEB66C4E9DFBB9394F1E5023A4F18955  1HuCMWoxTwgWxnh2UR3PE9LwEpZu6BQkrF
F79BE2BABD037D4DC9B64B34C2C76437BEB66C4E9DFBB8B95377D1596399CA8D  1HuCMWoxTwgX231mNzS91ZaPSvcL4zjdZE

0CA5E6EB0FD609B6EE0A06EA55EB01F49F84C2D22BA0B3862CE4ECDD74FA9591  13xhQeaLbumHXSz6VRBKZnSYkz8JLXVp9d
0CA5E6EB0FD609B6EE0A06EA55EB01F49F84C2D22BA0B346E6055D14E27FA4EE  13xhQeaLbumHeRCS6NtwFRh1QUnVYfD55j

4DB8FF8591EE14E71F104410146ADD5EB70E20B9066F8EADE2544C43DD252CFA  1Di28C7sDrqmamFdoXfCzAiEQS6pK9TMNM
4DB8FF8591EE14E71F104410146ADD5EB70E20B9066F8EAE7734EC352C6A99B7  1Di28C7sDrqmbJxnppgdEdfCHLiPMTNw6g

can we do something with puzzle addresses like those colliders are working ?

[zahid888]

Which script did you use to get those keys?
https://github.com/JeanLucPons/BTCCollider

[alek76]

Which script did you use to get those keys?

This method does not work for the puzzle.

[mcdouglasx]

BSGS with binaries soon...

[WanderingPhilospher]

BSGS with binaries soon...

It will be interesting to see your spin on BSGS with binaries, however, I doubt it can match the existing BSGS scripts/programs out there.

BSGS eats up some disk space (mine is about 4GB) but Once the binary file is built, it doesn't eat up any RAM during the search (Cuda).

And on a single mid-level GPU, I check a 2^66 range, each second.

Looking forward to your spin on it.

[LuckyRandomFisher]

guys, it's 29 days in a row. My 4090 + i9 are working in random mode day & night... I feel that my 6.6 BTC is coming for Christmas for me

4090: 23972MB | 1 target 3452.78 MKey/s (8,836,475,512,684,544 total) [29d:03h:52m:46s]
i9: Total 377,340,264,155,136 keys in 2322490 seconds: ~162 Mkeys/s (162472287 keys/s)

My only question: shall I restart the scripts or keep going?

[mabdlmonem]

Hello all, is there any python code for public key addition and checking it's hash ?

[MoreForUs]

Working on a script to run on a quantum computer, WE SHALL SEE THE RESULTS 

Code:

.from qiskit import QuantumCircuit, execute, Aer
from qiskit.circuit.library import PhaseOracle

target_address_hex = "20d45a6a762535700ce9e0b216e31994335db8a5"
target_address_decimal = int(target_address_hex, 16)

def sha256_compression_function(qc, message_bits):
    # Implement SHA-256 compression using quantum gates
    # You need to add the actual logic here

    # For demonstration purposes, we'll just apply a simple quantum oracle
    oracle = PhaseOracle(message_bits, target=target_address_decimal)
    qc.append(oracle, range(qc.num_qubits))

# Define the range for iteration
start_range = 36893488147419103232
end_range = -73786976294838206464

# Main loop
for decimal_value in range(start_range, end_range+1):
    # Convert decimal value to bytes and binary string
    message_bytes = decimal_value.to_bytes(32, byteorder="big")
    binary_message = ''.join(format(byte, '08b') for byte in message_bytes)

    # Create quantum circuit
    qc = QuantumCircuit(256)

    # Apply bit operations to encode the initial state and message onto the qubits
    # Implement encoding logic based on your requirements

    # Implement the SHA-256 compression function using a quantum oracle
    sha256_compression_function(qc, binary_message)

    # Measure the final state of the qubits
    qc.measure_all()

    # Simulate the circuit
    job = execute(qc, backend=Aer.get_backend('qasm_simulator'), shots=1024)

    # Get the results and extract the final state
    counts = job.result().get_counts(qc)
    final_state = [int(bits, 2) for bits in counts.keys()][0]

    # Check if the generated hash matches the target address
    if final_state == target_address_decimal:
        print(f"Target address found!")
        print(f"Decimal Value: {decimal_value}")
        print(f"Simulated Bitcoin hash160: {hex(final_state)[2:].zfill(40)}")
        break

[mcdouglasx]

BSGS with binaries soon...

It will be interesting to see your spin on BSGS with binaries, however, I doubt it can match the existing BSGS scripts/programs out there.

BSGS eats up some disk space (mine is about 4GB) but Once the binary file is built, it doesn't eat up any RAM during the search (Cuda).

And on a single mid-level GPU, I check a 2^66 range, each second.

Looking forward to your spin on it.

At the moment I have it in python, it is working, sequential. I haven't had time to add new options to upload it, work has me tied up.

[WanderingPhilospher]

BSGS with binaries soon...

It will be interesting to see your spin on BSGS with binaries, however, I doubt it can match the existing BSGS scripts/programs out there.

BSGS eats up some disk space (mine is about 4GB) but Once the binary file is built, it doesn't eat up any RAM during the search (Cuda).

And on a single mid-level GPU, I check a 2^66 range, each second.

Looking forward to your spin on it.

At the moment I have it in python, it is working, sequential. I haven't had time to add new options to upload it, work has me tied up.

Let me know when you upload it. I'll run some tests for you and find any bugs

Hello all, is there any python code for public key addition and checking it's hash ?

Yes, look at the iceland2k14/secp256k1 script and create your script to fit within his script.

Also, what do you mean by "checking it's hash"? H160?

[mabdlmonem]

Hello all, is there any python code for public key addition and checking it's hash ?

Yes, look at the iceland2k14/secp256k1 script and create your script to fit within his script.

Also, what do you mean by "checking it's hash"? H160?

Yes , hash160 . I saw his code , I am just good at math but very bad at programming so I couldn't understand the code honestly

[nomachine]

Hello all, is there any python code for public key addition and checking it's hash ?

Yes, look at the iceland2k14/secp256k1 script and create your script to fit within his script.

Also, what do you mean by "checking it's hash"? H160?

Yes , hash160 . I saw his code , I am just good at math but very bad at programming so I couldn't understand the code honestly

Simplest

Code:

import sys, secrets, secp256k1 as ice
while True:
    dec = secrets.SystemRandom().randrange(36893488147419103231, 73786976294838206463)
    h160 = ice.privatekey_to_h160(0, True, dec).hex()
    message = "\r{}".format(h160);messages = []
    messages.append(message);output = "\033[01;33m" + ''.join(messages) + "\r"
    sys.stdout.write(output);sys.stdout.flush()
    if h160 == "20d45a6a762535700ce9e0b216e31994335db8a5":
        HEX = "%064x" % dec;wifc = ice.btc_pvk_to_wif(HEX)
        with open("KEYFOUNDKEYFOUND.txt", "a") as f:
          f.write(f'Private key (wif) Compressed : {wifc}\n')
        break

[mabdlmonem]

Hello all, is there any python code for public key addition and checking it's hash ?

Yes, look at the iceland2k14/secp256k1 script and create your script to fit within his script.

Also, what do you mean by "checking it's hash"? H160?

Yes , hash160 . I saw his code , I am just good at math but very bad at programming so I couldn't understand the code honestly

Simplest

Code:

import sys, secrets, secp256k1 as ice
while True:
    dec = secrets.SystemRandom().randrange(36893488147419103231, 73786976294838206463)
    h160 = ice.privatekey_to_h160(1, True, dec).hex()
    message = "\r{}".format(h160);messages = []
    messages.append(message);output = "\033[01;33m" + ''.join(messages) + "\r"
    sys.stdout.write(output);sys.stdout.flush()
    if h160 == "20d45a6a762535700ce9e0b216e31994335db8a5":
        HEX = "%064x" % dec;wifc = ice.btc_pvk_to_wif(HEX)
        with open("KEYFOUNDKEYFOUND.txt", "a") as f:
          f.write(f'Private key (wif) Compressed : {wifc}\n')
        break

Thank you, but that is not what I asked for, I asked about script for public key addition, this script is for generating address from private

[nomachine]

Thank you, but that is not what I asked for, I asked about script for public key  

Public key ??  

Here you go (but you must know the target public key)........

puzzle 65

Code:

import sys, secrets, secp256k1 as ice
while True:
    A0 = secrets.SystemRandom().randrange(18446744073709551615, 36893488147419103231)
    A1 = ice.scalar_multiplication(A0);B0 = ice.to_cpub(A1.hex())
    message = "\r{}".format(B0);messages = []
    messages.append(message);output = "\033[01;33m" + ''.join(messages) + "\r"
    sys.stdout.write(output);sys.stdout.flush()
    if B0 == "0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b":
        HEX = "%064x" % A0;wifc = ice.btc_pvk_to_wif(HEX)
        with open("KEYFOUNDKEYFOUND.txt", "a") as f:
          f.write(f'Private key (wif) Compressed : {wifc}\n')
        break

[mabdlmonem]

Thank you, but that is not what I asked for, I asked about script for public key 

Public key ?? 

Here you go

puzzle 65

Code:

import sys, secrets, secp256k1 as ice
while True:
    A0 = secrets.SystemRandom().randrange(18446744073709551615, 36893488147419103231)
    A1 = ice.scalar_multiplication(A0);B0 = ice.to_cpub(A1.hex())
    message = "\r{}".format(B0);messages = []
    messages.append(message);output = "\033[01;33m" + ''.join(messages) + "\r"
    sys.stdout.write(output);sys.stdout.flush()
    if B0 == "0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b":
        HEX = "%064x" % dec;wifc = ice.btc_pvk_to_wif(HEX)
        with open("KEYFOUNDKEYFOUND.txt", "a") as f:
          f.write(f'Private key (wif) Compressed : {wifc}\n')
        break

It's the same idea, it generate public from private then compare. It's not public key addition

[nomachine]

It's the same idea, it generate public from private then compare. It's not public key addition

And how else do you imagine generating a public key for a specific range, with a glass ball by magic?
The problem is that we don't know any public keys. Except the Puzzle 130 and above...

[mabdlmonem]

It's the same idea, it generate public from private then compare. It's not public key addition

And how else do you imagine generating a public key for a range, with a glass ball by magic?
The problem is that we don't know any public keys. Except the Puzzle 130 and above...

I never talked about generating public key, I asked for public point addition with python script, that's all

[WanderingPhilospher]

Thank you, but that is not what I asked for, I asked about script for public key  

Public key ??  

Here you go

puzzle 65

Code:

import sys, secrets, secp256k1 as ice
while True:
    A0 = secrets.SystemRandom().randrange(18446744073709551615, 36893488147419103231)
    A1 = ice.scalar_multiplication(A0);B0 = ice.to_cpub(A1.hex())
    message = "\r{}".format(B0);messages = []
    messages.append(message);output = "\033[01;33m" + ''.join(messages) + "\r"
    sys.stdout.write(output);sys.stdout.flush()
    if B0 == "0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b":
        HEX = "%064x" % dec;wifc = ice.btc_pvk_to_wif(HEX)
        with open("KEYFOUNDKEYFOUND.txt", "a") as f:
          f.write(f'Private key (wif) Compressed : {wifc}\n')
        break

It's the same idea, it generate public from private then compare. It's not public key addition

Maybe provide step by step of what you are wanting.

Sounds like you want to add public key a to public key b and look at the resulting hash160.

So you'd have to provide 2 public keys, if that's the case.

[mabdlmonem]

Thank you, but that is not what I asked for, I asked about script for public key  

Public key ??  

Here you go

puzzle 65

Code:

import sys, secrets, secp256k1 as ice
while True:
    A0 = secrets.SystemRandom().randrange(18446744073709551615, 36893488147419103231)
    A1 = ice.scalar_multiplication(A0);B0 = ice.to_cpub(A1.hex())
    message = "\r{}".format(B0);messages = []
    messages.append(message);output = "\033[01;33m" + ''.join(messages) + "\r"
    sys.stdout.write(output);sys.stdout.flush()
    if B0 == "0230210c23b1a047bc9bdbb13448e67deddc108946de6de639bcc75d47c0216b1b":
        HEX = "%064x" % dec;wifc = ice.btc_pvk_to_wif(HEX)
        with open("KEYFOUNDKEYFOUND.txt", "a") as f:
          f.write(f'Private key (wif) Compressed : {wifc}\n')
        break

It's the same idea, it generate public from private then compare. It's not public key addition

Maybe provide step by step of what you are wanting.

Sounds like you want to add public key a to public key b and look at the resulting hash160.

So you'd have to provide 2 public keys, if that's the case.

I want to make sure from something about binary and public key. So I need a script to see what happens when we add 2 to the public key A and see the results of B . If what I think works I will share with everyone my idea, that's all

[WanderingPhilospher]

I want to make sure from something about binary and public key. So I need a script to see what happens when we add 2 to the public key A and see the results of B . If what I think works I will share with everyone my idea, that's all

Ok, so again, still confusing, at least to me.

You want to take a known public key "A" and add decimal number 2, to it, and see what the results are, "B"?