Author

Topic: Bitcoin puzzle transaction ~32 BTC prize to who solves it - page 167. (Read 215479 times)

jr. member
Activity: 75
Merit: 5

I keep asking myself how that works but  always get very confused too. If there were an alleged calculator you could prescribe and a little bit of some explanation as to how the addition and subtraction works it'd be very understandable. I even tried to write a code to add and multiply below is the code. still all I got was an awkward result.

"import argparse
import ecdsa
from ecdsa.ellipticcurve import Point

# Function ato perform point addition
def point_addition(point1, point2):
    return point1 + point2

# Function to perform point subtraction
def point_subtraction(point1, point2):
    return point1 - point2

# Function to perform point multiplication
def point_multiplication(point, scalar):
    return scalar * point

# Function to perform point division (using scalar multiplication by the inverse)
def point_division(point, scalar):
    return point_multiplication(point, ecdsa.numbertheory.inverse_mod(scalar, curve.order()))

# Parse command-line arguments
parser = argparse.ArgumentParser(description="Elliptic Curve Point Operations")
parser.add_argument("-p1", dest="public_key1", type=str, help="Public key 1 (in hexadecimal)")
parser.add_argument("-p2", dest="public_key2", type=str, help="Public key 2 (in hexadecimal)")
parser.add_argument("operation", choices=["+", "-", "*", "/"], help="Operation to perform (+ for add, - for subtract, * for multiply, / for divide)")

args = parser.parse_args()

# Define the elliptic curve parameters (SECP256k1 in Bitcoin)
curve = ecdsa.SECP256k1

# Parse the public keys from the command-line arguments
public_key1 = ecdsa.VerifyingKey.from_string(bytes.fromhex(args.public_key1), curve=curve).pubkey.point
public_key2 = ecdsa.VerifyingKey.from_string(bytes.fromhex(args.public_key2), curve=curve).pubkey.point

# Perform the specified operation on the public keys
if args.operation == "+":
    result_point = point_addition(public_key1, public_key2)
elif args.operation == "-":
    result_point = point_subtraction(public_key1, public_key2)
elif args.operation == "*":
    scalar = int(input("Enter the scalar value (private key): "), 16)
    result_point = point_multiplication(public_key1, scalar)
elif args.operation == "/":
    scalar = int(input("Enter the scalar value (private key): "), 16)
    result_point = point_division(public_key1, scalar)

# Print the coordinates of the result point
result_x, result_y = ecdsa.util.number_to_string(result_point.x(), curve.order), ecdsa.util.number_to_string(result_point.y(), curve.order)
print("Result Point (x, y):", result_x.hex(), ",", result_y.hex())" result was awkward but anyway,

how do we go about the addition and subtraction, division and multiplication and how do we make sense off of the result from this process??
what tools are required?
Calculators and procedures involved. I'm down to learn too
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 modinv(a,n=Pcurve): #Extended Euclidean Algorithm/'division' in elliptic curves
    lm, hm = 1,0
    low, high = a%n,n
    while low > 1:
        ratio = high/low
        nm, new = hm-lm*ratio, high-low*ratio
        lm, low, hm, high = nm, new, lm, low
    return int(lm % n)

def ECadd(xp,yp,xq,yq): # Not true addition, invented for EC. It adds Point-P with Point-Q.
    m = ((yq-yp) * mod_inverse(xq-xp,Pcurve)) % Pcurve
    xr = (m*m-xp-xq) % Pcurve
    yr = (m*(xp-xr)-yp) % Pcurve
    return (xr,yr)

def ECdouble(xp,yp): # EC point doubling,  invented for EC. It doubles Point-P.
    LamNumer = 3*xp*xp+Acurve
    LamDenom = 2*yp
    Lam = (LamNumer * mod_inverse(LamDenom,Pcurve)) % Pcurve
    xr = (Lam*Lam-2*xp) % Pcurve
    yr = (Lam*(xp-xr)-yp) % Pcurve
    return (xr,yr)

def EccMultiply(xs,ys,Scalar): # Double & add. EC Multiplication, Not true multiplication
    #if Scalar == 0 or Scalar >= N: raise Exception("Invalid Scalar/Private Key")
    ScalarBin = str(bin(Scalar))[2:]
    Qx,Qy=xs,ys
    for i in range (1, len(ScalarBin)): # This is invented EC multiplication.
        Qx,Qy=ECdouble(Qx,Qy); # print "DUB", Qx; print
        #print(Qx,Qy)
        if ScalarBin[i] == "1":
            Qx,Qy=ECadd(Qx,Qy,xs,ys); # print "ADD", Qx; print
    return (Qx,Qy)


You can understand how it works by looking at the code.



Thank you very much for this code.
i will study the code further to understand how it works as I'm still a newbie in this but learning is my thing. thanks a lot.
jr. member
Activity: 54
Merit: 1

I keep asking myself how that works but  always get very confused too. If there were an alleged calculator you could prescribe and a little bit of some explanation as to how the addition and subtraction works it'd be very understandable. I even tried to write a code to add and multiply below is the code. still all I got was an awkward result.

"import argparse
import ecdsa
from ecdsa.ellipticcurve import Point

# Function ato perform point addition
def point_addition(point1, point2):
    return point1 + point2

# Function to perform point subtraction
def point_subtraction(point1, point2):
    return point1 - point2

# Function to perform point multiplication
def point_multiplication(point, scalar):
    return scalar * point

# Function to perform point division (using scalar multiplication by the inverse)
def point_division(point, scalar):
    return point_multiplication(point, ecdsa.numbertheory.inverse_mod(scalar, curve.order()))

# Parse command-line arguments
parser = argparse.ArgumentParser(description="Elliptic Curve Point Operations")
parser.add_argument("-p1", dest="public_key1", type=str, help="Public key 1 (in hexadecimal)")
parser.add_argument("-p2", dest="public_key2", type=str, help="Public key 2 (in hexadecimal)")
parser.add_argument("operation", choices=["+", "-", "*", "/"], help="Operation to perform (+ for add, - for subtract, * for multiply, / for divide)")

args = parser.parse_args()

# Define the elliptic curve parameters (SECP256k1 in Bitcoin)
curve = ecdsa.SECP256k1

# Parse the public keys from the command-line arguments
public_key1 = ecdsa.VerifyingKey.from_string(bytes.fromhex(args.public_key1), curve=curve).pubkey.point
public_key2 = ecdsa.VerifyingKey.from_string(bytes.fromhex(args.public_key2), curve=curve).pubkey.point

# Perform the specified operation on the public keys
if args.operation == "+":
    result_point = point_addition(public_key1, public_key2)
elif args.operation == "-":
    result_point = point_subtraction(public_key1, public_key2)
elif args.operation == "*":
    scalar = int(input("Enter the scalar value (private key): "), 16)
    result_point = point_multiplication(public_key1, scalar)
elif args.operation == "/":
    scalar = int(input("Enter the scalar value (private key): "), 16)
    result_point = point_division(public_key1, scalar)

# Print the coordinates of the result point
result_x, result_y = ecdsa.util.number_to_string(result_point.x(), curve.order), ecdsa.util.number_to_string(result_point.y(), curve.order)
print("Result Point (x, y):", result_x.hex(), ",", result_y.hex())" result was awkward but anyway,

how do we go about the addition and subtraction, division and multiplication and how do we make sense off of the result from this process??
what tools are required?
Calculators and procedures involved. I'm down to learn too
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 modinv(a,n=Pcurve): #Extended Euclidean Algorithm/'division' in elliptic curves
    lm, hm = 1,0
    low, high = a%n,n
    while low > 1:
        ratio = high/low
        nm, new = hm-lm*ratio, high-low*ratio
        lm, low, hm, high = nm, new, lm, low
    return int(lm % n)

def ECadd(xp,yp,xq,yq): # Not true addition, invented for EC. It adds Point-P with Point-Q.
    m = ((yq-yp) * mod_inverse(xq-xp,Pcurve)) % Pcurve
    xr = (m*m-xp-xq) % Pcurve
    yr = (m*(xp-xr)-yp) % Pcurve
    return (xr,yr)

def ECdouble(xp,yp): # EC point doubling,  invented for EC. It doubles Point-P.
    LamNumer = 3*xp*xp+Acurve
    LamDenom = 2*yp
    Lam = (LamNumer * mod_inverse(LamDenom,Pcurve)) % Pcurve
    xr = (Lam*Lam-2*xp) % Pcurve
    yr = (Lam*(xp-xr)-yp) % Pcurve
    return (xr,yr)

def EccMultiply(xs,ys,Scalar): # Double & add. EC Multiplication, Not true multiplication
    #if Scalar == 0 or Scalar >= N: raise Exception("Invalid Scalar/Private Key")
    ScalarBin = str(bin(Scalar))[2:]
    Qx,Qy=xs,ys
    for i in range (1, len(ScalarBin)): # This is invented EC multiplication.
        Qx,Qy=ECdouble(Qx,Qy); # print "DUB", Qx; print
        #print(Qx,Qy)
        if ScalarBin[i] == "1":
            Qx,Qy=ECadd(Qx,Qy,xs,ys); # print "ADD", Qx; print
    return (Qx,Qy)


You can understand how it works by looking at the code.

copper member
Activity: 198
Merit: 1
Hello, all.
Hope you are doing well.
I am new to here, and would like to attend this puzzle.
What tool can I use in my pc(Windows10)?

Thanks

Nvidia GPU, also not open source, modified version of 2 different tools.
https://bitcointalksearch.org/topic/m.56699222

Bitcrack :
https://bitcointalksearch.org/topic/bitcrack-a-tool-for-brute-forcing-private-keys-4453897

I'd suggest to dive into the ocean of public keys, learn how to add/subtract/divide, your chance of success is better than brute forcing for keys.

I keep asking myself how that works but  always get very confused too. If there were an alleged calculator you could prescribe and a little bit of some explanation as to how the addition and subtraction works it'd be very understandable. I even tried to write a code to add and multiply below is the code. still all I got was an awkward result.

"import argparse
import ecdsa
from ecdsa.ellipticcurve import Point

# Function ato perform point addition
def point_addition(point1, point2):
    return point1 + point2

# Function to perform point subtraction
def point_subtraction(point1, point2):
    return point1 - point2

# Function to perform point multiplication
def point_multiplication(point, scalar):
    return scalar * point

# Function to perform point division (using scalar multiplication by the inverse)
def point_division(point, scalar):
    return point_multiplication(point, ecdsa.numbertheory.inverse_mod(scalar, curve.order()))

# Parse command-line arguments
parser = argparse.ArgumentParser(description="Elliptic Curve Point Operations")
parser.add_argument("-p1", dest="public_key1", type=str, help="Public key 1 (in hexadecimal)")
parser.add_argument("-p2", dest="public_key2", type=str, help="Public key 2 (in hexadecimal)")
parser.add_argument("operation", choices=["+", "-", "*", "/"], help="Operation to perform (+ for add, - for subtract, * for multiply, / for divide)")

args = parser.parse_args()

# Define the elliptic curve parameters (SECP256k1 in Bitcoin)
curve = ecdsa.SECP256k1

# Parse the public keys from the command-line arguments
public_key1 = ecdsa.VerifyingKey.from_string(bytes.fromhex(args.public_key1), curve=curve).pubkey.point
public_key2 = ecdsa.VerifyingKey.from_string(bytes.fromhex(args.public_key2), curve=curve).pubkey.point

# Perform the specified operation on the public keys
if args.operation == "+":
    result_point = point_addition(public_key1, public_key2)
elif args.operation == "-":
    result_point = point_subtraction(public_key1, public_key2)
elif args.operation == "*":
    scalar = int(input("Enter the scalar value (private key): "), 16)
    result_point = point_multiplication(public_key1, scalar)
elif args.operation == "/":
    scalar = int(input("Enter the scalar value (private key): "), 16)
    result_point = point_division(public_key1, scalar)

# Print the coordinates of the result point
result_x, result_y = ecdsa.util.number_to_string(result_point.x(), curve.order), ecdsa.util.number_to_string(result_point.y(), curve.order)
print("Result Point (x, y):", result_x.hex(), ",", result_y.hex())" result was awkward but anyway,

how do we go about the addition and subtraction, division and multiplication and how do we make sense off of the result from this process??
what tools are required?
Calculators and procedures involved. I'm down to learn too

https://github.com/albertobsd/ecctools
jr. member
Activity: 75
Merit: 5
Hello, all.
Hope you are doing well.
I am new to here, and would like to attend this puzzle.
What tool can I use in my pc(Windows10)?

Thanks

Nvidia GPU, also not open source, modified version of 2 different tools.
https://bitcointalksearch.org/topic/m.56699222

Bitcrack :
https://bitcointalksearch.org/topic/bitcrack-a-tool-for-brute-forcing-private-keys-4453897

I'd suggest to dive into the ocean of public keys, learn how to add/subtract/divide, your chance of success is better than brute forcing for keys.

I keep asking myself how that works but  always get very confused too. If there were an alleged calculator you could prescribe and a little bit of some explanation as to how the addition and subtraction works it'd be very understandable. I even tried to write a code to add and multiply below is the code. still all I got was an awkward result.

"import argparse
import ecdsa
from ecdsa.ellipticcurve import Point

# Function ato perform point addition
def point_addition(point1, point2):
    return point1 + point2

# Function to perform point subtraction
def point_subtraction(point1, point2):
    return point1 - point2

# Function to perform point multiplication
def point_multiplication(point, scalar):
    return scalar * point

# Function to perform point division (using scalar multiplication by the inverse)
def point_division(point, scalar):
    return point_multiplication(point, ecdsa.numbertheory.inverse_mod(scalar, curve.order()))

# Parse command-line arguments
parser = argparse.ArgumentParser(description="Elliptic Curve Point Operations")
parser.add_argument("-p1", dest="public_key1", type=str, help="Public key 1 (in hexadecimal)")
parser.add_argument("-p2", dest="public_key2", type=str, help="Public key 2 (in hexadecimal)")
parser.add_argument("operation", choices=["+", "-", "*", "/"], help="Operation to perform (+ for add, - for subtract, * for multiply, / for divide)")

args = parser.parse_args()

# Define the elliptic curve parameters (SECP256k1 in Bitcoin)
curve = ecdsa.SECP256k1

# Parse the public keys from the command-line arguments
public_key1 = ecdsa.VerifyingKey.from_string(bytes.fromhex(args.public_key1), curve=curve).pubkey.point
public_key2 = ecdsa.VerifyingKey.from_string(bytes.fromhex(args.public_key2), curve=curve).pubkey.point

# Perform the specified operation on the public keys
if args.operation == "+":
    result_point = point_addition(public_key1, public_key2)
elif args.operation == "-":
    result_point = point_subtraction(public_key1, public_key2)
elif args.operation == "*":
    scalar = int(input("Enter the scalar value (private key): "), 16)
    result_point = point_multiplication(public_key1, scalar)
elif args.operation == "/":
    scalar = int(input("Enter the scalar value (private key): "), 16)
    result_point = point_division(public_key1, scalar)

# Print the coordinates of the result point
result_x, result_y = ecdsa.util.number_to_string(result_point.x(), curve.order), ecdsa.util.number_to_string(result_point.y(), curve.order)
print("Result Point (x, y):", result_x.hex(), ",", result_y.hex())" result was awkward but anyway,

how do we go about the addition and subtraction, division and multiplication and how do we make sense off of the result from this process??
what tools are required?
Calculators and procedures involved. I'm down to learn too
copper member
Activity: 1330
Merit: 899
🖤😏
Hello, all.
Hope you are doing well.
I am new to here, and would like to attend this puzzle.
What tool can I use in my pc(Windows10)?

Thanks

Nvidia GPU, also not open source, modified version of 2 different tools.
https://bitcointalksearch.org/topic/m.56699222

Bitcrack :
https://bitcointalksearch.org/topic/bitcrack-a-tool-for-brute-forcing-private-keys-4453897

I'd suggest to dive into the ocean of public keys, learn how to add/subtract/divide, your chance of success is better than brute forcing for keys.
newbie
Activity: 4
Merit: 0

@puzzle-dev We apologize for that, but we are a sensitive community, so please we respectfully ask you to upload its source code just incase for us to be in the safe side.

Thanks,
Did you just use good cop, bad cop method on him? Lol.
If he wanted to share the code, he'd have done it at the first place and nobody would have attacked him.

In case some of you haven't noticed, around these woods we paint toads and sell them as porsche!

Personally I have nothing against him, I know enough not to run the tool, even if I do I have nothing of value on my system.
Besides, his tool, your tool, my tool, none of them really help unless you have 100+ GPUs, then having that many GPUs, you wouldn't go for #66, you'd use them to search for #130. So if we are talking about "luck" searching a site like keys.lol should do the trick, if it's up to your "luck" clicking on page numbers is enough or buying a lottery ticket could also give a better result. Being "lucky" is not exclusive to finding a puzzle key, So your and his argument is not reasonable.


Hello, all.
Hope you are doing well.
I am new to here, and would like to attend this puzzle.
What tool can I use in my pc(Windows10)?

Thanks
copper member
Activity: 1330
Merit: 899
🖤😏

@puzzle-dev We apologize for that, but we are a sensitive community, so please we respectfully ask you to upload its source code just incase for us to be in the safe side.

Thanks,
Did you just use good cop, bad cop method on him? Lol.
If he wanted to share the code, he'd have done it at the first place and nobody would have attacked him.

In case some of you haven't noticed, around these woods we paint toads and sell them as porsche!

Personally I have nothing against him, I know enough not to run the tool, even if I do I have nothing of value on my system.
Besides, his tool, your tool, my tool, none of them really help unless you have 100+ GPUs, then having that many GPUs, you wouldn't go for #66, you'd use them to search for #130. So if we are talking about "luck" searching a site like keys.lol should do the trick, if it's up to your "luck" clicking on page numbers is enough or buying a lottery ticket could also give a better result. Being "lucky" is not exclusive to finding a puzzle key, So your and his argument is not reasonable.
member
Activity: 177
Merit: 14
Guys, stop the hate and the harassment of him!

Yes there's a doubt; The "Developer" could be suspected; Yes it could be a scam; Yes it could have a trojan; But it could be also real!

It's just a doubt, you are guys acting like he's 100% fake and scammer which is of course not the case! Nobody knows if he's real or not, but at least you could've friendly just asked him to upload his source code to GitHub instead of attacking him like this! What if he's real? You can't imagine how bad he will feel. You guys are hurting him so stop it please! We don't know if he's real or not, so we can't judge him that early!!

Maybe he's real and really developed a tool for CPU users for help. Who knows? And yes, it's his right for him to ask for 50% since he is the developer of it.

@puzzle-dev We apologize for that, but we are a sensitive community, so please we respectfully ask you to upload its source code just incase for us to be in the safe side.

Thanks,
copper member
Activity: 1330
Merit: 899
🖤😏
i just offer a different approach an my tool is quite fast on CPUs and it would be very interesting to see the keyrates on modern CPUs.

Why don't you share this different approach in details with the rest of us? If it was working, you wouldn't be here talking, instead you'd have rented hundreds of CPUs to find #66.
newbie
Activity: 10
Merit: 0
Quote
I downloaded them this morning and ran them through the online scanner and they were all clean. Ran the generic on wsl and it worked 1 thread as about 2 mil/second older Xeon it seems to make a file that is either a checkpoint or remembers the addresses tried or both. works well but since I paid for a rtx GPU and made a control program so it runs unattended I am going to use that, but for CPU users it should be ok. Suggestion: put them on github and maybe others will be more comfortable then being on a file share website which makes others a little suspicious. you can open a free account there.
Thanks for your trust and reply!

I don't know if it helps to gain more trust, but i updated the tool, removed the executeable permissions and included a warning about running binaries from unknown sources in the README.txt and added some hints how to run binaries if you do not trust the developer. Actually there are serveral tools on github where binaries are included (like iceland and the pool) and there are no sources available for these tools available, so i don't see a big difference if i would use github. I do not exspect anybody to trust me, but at least to be fair. i just offer a different approach an my tool is quite fast on CPUs and it would be very interesting to see the keyrates on modern CPUs.
jr. member
Activity: 76
Merit: 4
This is my last reply regarding useless speed comparisions:


you simply have to compare the speed of my tool with your prefered tool on your own!!!
MY TOOL IS FOR CPU *NOT* FOR GPU - GPUs ARE FASTER - I KNOW IT - EVERYBODY KNOWS IT!



i just gave you a number for my very slow CPU and only on one core and this is a mobile CPU! This does not say anything about keyrates on your CPU!
if your prefered tool is faster, then use it and be happy with it! On my CPU my tool is faster - is this so hard to understand?

Quote
you are talking about an increased chance of searching - how is this statement justified?
only through tests...
i run competiton tests between my tool and other CPU tools and my tool always found the key faster, so i guess my search logic works somehow better than a simple random search, but you cannot exspect miracles like a 10x speed improvement.



I downloaded them this morning and ran them through the online scanner and they were all clean. Ran the generic on wsl and it worked 1 thread as about 2 mil/second older Xeon it seems to make a file that is either a checkpoint or remembers the addresses tried or both. works well but since I paid for a rtx GPU and made a control program so it runs unattended I am going to use that, but for CPU users it should be ok. Suggestion: put them on github and maybe others will be more comfortable then being on a file share website which makes others a little suspicious. you can open a free account there.
member
Activity: 239
Merit: 53
New ideas will be criticized and then admired.
You can't even read...

 and there are also online virus-scanners where you could upload the executeables, but you just want to tell lies...


online scanner Lol, to bypass all antivirus you only need tools like pyarmor and other techniques that I will not mention for the sake of honest people.
newbie
Activity: 10
Merit: 0
this is a mobile CPU! This does not say anything about keyrates on your CPU!
very strange argument.
Next time, tell me about new mathematics right away.
newbie
Activity: 10
Merit: 0
This is my last reply regarding useless speed comparisions:


you simply have to compare the speed of my tool with your prefered tool on your own!!!
MY TOOL IS FOR CPU *NOT* FOR GPU - GPUs ARE FASTER - I KNOW IT - EVERYBODY KNOWS IT!



i just gave you a number for my very slow CPU and only on one core and this is a mobile CPU! This does not say anything about keyrates on your CPU!
if your prefered tool is faster, then use it and be happy with it! On my CPU my tool is faster - is this so hard to understand?

Quote
you are talking about an increased chance of searching - how is this statement justified?
only through tests...
i run competiton tests between my tool and other CPU tools and my tool always found the key faster, so i guess my search logic works somehow better than a simple random search, but you cannot exspect miracles like a 10x speed improvement.


newbie
Activity: 10
Merit: 0
Quote
Speed? No benchmark? We already have GPU enabled tools which are 20 to 30 times faster than CPU versions, I don't know what you are promising, but definitely your tool is not faster than others whatsoever, besides searching with CPU is useless.

On my slow CPU i get about 30% more speed (now i get about 2.6 million keys/s on one core), but the speedgain may be different on other CPUs - hard to say. I would be happy if some users would post keyrates of their CPUs.


what cave did you come out of?
KEYHUNT by alberto 4 million keys per stream.
bitcrack 3 million keys per stream.
I personally have GPU generation - 4 billion keys per second.
And this is in open source - which the developers provided for free.
newbie
Activity: 10
Merit: 0
I have developed a new tool to solve #66:

- ONLY CPU / highly optimized for speed and about 30% faster (on my CPU) than the fastest tool i know
- ONLY LINUX x86_64 / there is no and NEVER will be a WINDOWS/MAC version (DO NOT ASK!!!), but it may run on Windows Subsystem for Linux (WSL) / not tested
- SPECIAL SEARCH ALGORITHM/LOGIC that allows resuming search and has a higher chance to find the key (sucessfully tested on the solved puzzles!) / no stupid random or incremental search
- DUE TO LEGAL REASONS PRECOMPILED/PRECONFIGURED FOR #66 / i will release an update for #67 once #66 is solved

30 percent faster than what? Can I have a specific example?
you are talking about an increased chance of searching - how is this statement justified?
PS do not install code from an unknown source.
member
Activity: 77
Merit: 19

Never ever run anything compiled by unknown individuals without the possibility of inspecting the source code. Never trust individuals who include "forcing" the sending of a private key in file contents, no matter how it sounds. Never run it on an instance where you have your own wallet, preferably on a VM instance without internet access, and in general, compiled programs without source code should be automatically blocked.
newbie
Activity: 10
Merit: 0
Quote
Speed? No benchmark? We already have GPU enabled tools which are 20 to 30 times faster than CPU versions, I don't know what you are promising, but definitely your tool is not faster than others whatsoever, besides searching with CPU is useless.

You can benchmark it for yourself:
- run the fastest CPU tool you know and compare the keyrate with my tool!
On my slow CPU i get about 30% more speed (now i get about 2.6 million keys/s on one core), but the speedgain may be different on other CPUs - hard to say. I would be happy if some users would post keyrates of their CPUs.

I never talked about GPUs and said that my tool can compete with them - of course GPUs are faster, but not everybody (like me) has access to a fast GPU, but some people here may have access to fast multicore CPUs and using several cores of a modern CPU could give in total a quite good rate, even if a GPU may still be faster. All i say is that my approach/logic for searching is different and that i took a big effort in improving speed for CPUs - that's it.

Solving #66 requires not only speed, it also requires luck and with luck even a slow CPU could solve #66 - unlikely, but possible - in the end it's more lotto than a puzzle  Wink

So, if you have a fast GPU then you should use it and in this case my tool is of course not helpfull for you at all.
copper member
Activity: 1330
Merit: 899
🖤😏
I have developed a new tool to solve #66:

- ONLY CPU / highly optimized for speed and about 30% faster (on my CPU) than the fastest tool i know
- ONLY LINUX x86_64 / there is no and NEVER will be a WINDOWS/MAC version (DO NOT ASK!!!), but it may run on Windows Subsystem for Linux (WSL) / not tested
- SPECIAL SEARCH ALGORITHM/LOGIC that allows resuming search and has a higher chance to find the key (sucessfully tested on the solved puzzles!) / no stupid random or incremental search
- DUE TO LEGAL REASONS PRECOMPILED/PRECONFIGURED FOR #66 / i will release an update for #67 once #66 is solved

In short:
My tool is afaik the best option if you have access to one or more modern powerfull multicore CPUs and want to solve #66.
It still will not be easy to solve #66, but at least your chance to solve it will be higher!
All i ask you for is to split the reward (50:50) with me, if you use my tool.

If you are interested: the download link is in my profile.

NOTE: For anything regarding this tool leave me a private message! It may take some time, but i will try to answer all messages - thanks!




Speed? No benchmark? We already have GPU enabled tools which are 20 to 30 times faster than CPU versions, I don't know what you are promising, but definitely your tool is not faster than others whatsoever, besides searching with CPU is useless.
newbie
Activity: 11
Merit: 0
I'm making a 50$ contest Cool Cool Cool
Jump to: