Quote from: digaran on September 02, 2023, 11:59:18 AM

Quote from: kalos15btc on September 02, 2023, 11:28:34 AM

i already find two puzzle with my methode of hash160 lowering the range of searching,and still im going to 130 135 my methode is working its just lowering and find the range in subed pub key to lower bit range 2 times yes when you find same 14 digits of hash160 than means that adress is in that range, but the search is not for one adress, i get a lot of addresses im trying , and no im not going to share the pk of any address i work hard for this, i advise you to try on 120 my methode, and get your bitcoin cash prize, ps: ill leave 50 satoshi on 130 for you, thank you

So you already solved 120 and 125? Can we see their private keys? Since you have worked hard for them, and don't want to share them, you could sign a message with them without revealing them.

I advise you to grind all the puzzles with no mercy, don't even leave a single sat for anyone.
Kalos the merciless.😅

Ps, keep your pk ( whatever that means ) for your collection.

Can someone help to make this script working?

Code:

class EllipticCurve:
    def __init__(self, p, a, b, g_x, g_y, n):
        self.p = p
        self.a = a
        self.b = b
        self.g_x = g_x
        self.g_y = g_y
        self.n = n

    def add_points(self, p1, p2):
        # Point addition logic here
        pass

    def subtract_points(self, p1, p2):
        # Point subtraction logic here
        pass

    def scalar_multiply(self, point, scalar):
        # Scalar multiplication logic here
        pass

# Replace these values with your desired parameters
N = ...
P = ...
G = (..., ...) # (x-coordinate, y-coordinate)

# Create an instance of the EllipticCurve class with your parameters
curve = EllipticCurve(P, 0, 7, G[0], G[1], N)

# Replace with your target public key and desired number of subtractions
target_public_key = "..."
num = 100

# Example of point subtraction loop
subtract_point = G # Initialize subtract_point with base point G

for t in range(num + 1):
    # Perform point subtraction
    result = curve.subtract_points(subtract_point, G)

    # Convert the result to hexadecimal representation
    h = (result[0], result[1])

    # Print or store the result as needed
    print("Subtraction result for iteration {}: {}".format(t, h))

    # Update subtract_point for the next iteration
    subtract_point = result

# Note: You need to implement the add_points and subtract_points methods
# with the actual point addition and subtraction logic for your curve.

Code:

Pcurve = 2**256 - 2**32 - 2**9 - 2**8 - 2**7 - 2**6 - 2**4 -1 # The proven prime
N=0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141 # Number of points in the field
Acurve = 0; Bcurve = 7 # This defines the curve. y^2 = x^3 + Acurve * x + Bcurve
Gx = 55066263022277343669578718895168534326250603453777594175500187360389116729240
Gy = 32670510020758816978083085130507043184471273380659243275938904335757337482424

def ECsub(point1x,point1y,point2x,point2y):

neg_yq = Pcurve - point2y

return ECadd(point1x,point1y,point2x,neg_yq) # point1-point2

you can use ready ice library, it will be faster

Ice.pointnegatition finds the inverse of the point. It will be extracted with ice.pointadd

The simple logic of the subtraction is to subtract the cord y from the total point point