Quote from: Kamoheapohea on Today at 01:55:05 PM

Quote from: unclevito on December 13, 2023, 11:47:10 PM

# Implement the SHA-256 compression function using a quantum oracle search for target address prefix 20d45
sha256_compression_function(qc, binary_message, expression="message[0] == '1' and message[1] == '0' and message[2] == '1' and message[3] == '1'")

You are applying sha256 on the privatekey and compare it to the #66 hash160??? How should this ever return something related to #66?
Also is the sha256_compression_function just trying random bits?

I just looked at the whole code now...you are right.

The expression "message[0] == '1' and message[1] == '0' and message[2] == '1' and message[3] == '1'" in the sha256_compression_function is hardcoding specific conditions based on the target address. In a real scenario, the conditions would depend on the actual hash function and Bitcoin address generation process.

The absence of ecdsa.SigningKey.from_string is notable.
For example

Code:

signing_key = ecdsa.SigningKey.from_string(private_key_bytes, curve=ecdsa.SECP256k1)

If it doesn't have this, there must be an encoder that does it. Let's say fastecdsa SEC1Encoder

This method is commonly used in classical (non-quantum) code for dealing with ECDSA (Elliptic Curve Digital Signature Algorithm) signatures in Bitcoin. If you are working with Bitcoin addresses, you would typically use libraries like ecdsa/fastecdsa to handle key generation and signing.

I lose 0.001 part of a second just for that in Python.I would love to throw it out as well, but it can't. That's not how things work.

The code seems to be treating the quantum computation as a search problem, attempting to find a hash collision that matches the target address. However, the actual Bitcoin address generation process involves public key derivation, hash functions, and elliptic curve cryptography, which are not accurately represented in the code.