Database All Bitcoin private keys and Altcoin private keys there sites , https://allprivatekeys.com , https://privatekeys.pw
Topic: It is necessary to find one private key out of 10 million Bitcoin Addresses (Read 2204 times)
August 23, 2022, 08:54:46 AM
April 08, 2021, 02:15:12 PM
Sir , Can you please share link to python script that u mentioned.
-snip-
-snip-
Pls find that code below:
Code:
import gmpy2
modulo = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F
order = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141
Gx = 0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798
Gy = 0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8
class Point:
def __init__(self, x=0, y=0):
self.x = x
self.y = y
PG = Point(Gx,Gy)
Z = Point(0,0) # zero-point, infinite in real x,y - plane
# return (g, x, y) a*x + b*y = gcd(x, y)
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, x, y = egcd(b % a, a)
return (g, y - (b // a) * x, x)
def modinv(m, n = modulo):
while m < 0:
m += n
g, x, _ = egcd(m, n)
if g == 1:
return x % n
else: print (' no inverse exist')
def mul2(Pmul2, p = modulo):
R = Point(0,0)
#c = 3*Pmul2.x*Pmul2.x*modinv(2*Pmul2.y, p) % p
c = 3*Pmul2.x*Pmul2.x*gmpy2.invert(2*Pmul2.y, p) % p
R.x = (c*c-2*Pmul2.x) % p
R.y = (c*(Pmul2.x - R.x)-Pmul2.y) % p
return R
def add(Padd, Q, p = modulo):
if Padd.x == Padd.y == 0: return Q
if Q.x == Q.y == 0: return Padd
if Padd == Q: return mul2(Q)
R = Point()
dx = (Q.x - Padd.x) % p
dy = (Q.y - Padd.y) % p
c = dy * gmpy2.invert(dx, p) % p
#c = dy * modinv(dx, p) % p
R.x = (c*c - Padd.x - Q.x) % p
R.y = (c*(Padd.x - R.x) - Padd.y) % p
return R # 6 sub, 3 mul, 1 inv
def mulk(k, Pmulk, p = modulo):
if k == 0: return Z
if k == 1: return Pmulk
if (k % 2 == 0): return mulk(k//2, mul2(Pmulk, p), p)
return add(Pmulk, mulk((k-1)//2, mul2(Pmulk, p), p), p)
def sub(P1, P2, p = modulo): #scalar subtraction P1-P2
if P1 == P2: return Z
if P2.x == P2.y == 0: return P1
return add (P1, Point(P2.x, modulo - P2.y))
def div(d, Pdiv, p = modulo): #scalar division, i.e multiplication by inverse scalar
scalar = gmpy2.invert(d, order)
return mulk(scalar, Pdiv, p)
modulo = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F
order = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141
Gx = 0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798
Gy = 0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8
class Point:
def __init__(self, x=0, y=0):
self.x = x
self.y = y
PG = Point(Gx,Gy)
Z = Point(0,0) # zero-point, infinite in real x,y - plane
# return (g, x, y) a*x + b*y = gcd(x, y)
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, x, y = egcd(b % a, a)
return (g, y - (b // a) * x, x)
def modinv(m, n = modulo):
while m < 0:
m += n
g, x, _ = egcd(m, n)
if g == 1:
return x % n
else: print (' no inverse exist')
def mul2(Pmul2, p = modulo):
R = Point(0,0)
#c = 3*Pmul2.x*Pmul2.x*modinv(2*Pmul2.y, p) % p
c = 3*Pmul2.x*Pmul2.x*gmpy2.invert(2*Pmul2.y, p) % p
R.x = (c*c-2*Pmul2.x) % p
R.y = (c*(Pmul2.x - R.x)-Pmul2.y) % p
return R
def add(Padd, Q, p = modulo):
if Padd.x == Padd.y == 0: return Q
if Q.x == Q.y == 0: return Padd
if Padd == Q: return mul2(Q)
R = Point()
dx = (Q.x - Padd.x) % p
dy = (Q.y - Padd.y) % p
c = dy * gmpy2.invert(dx, p) % p
#c = dy * modinv(dx, p) % p
R.x = (c*c - Padd.x - Q.x) % p
R.y = (c*(Padd.x - R.x) - Padd.y) % p
return R # 6 sub, 3 mul, 1 inv
def mulk(k, Pmulk, p = modulo):
if k == 0: return Z
if k == 1: return Pmulk
if (k % 2 == 0): return mulk(k//2, mul2(Pmulk, p), p)
return add(Pmulk, mulk((k-1)//2, mul2(Pmulk, p), p), p)
def sub(P1, P2, p = modulo): #scalar subtraction P1-P2
if P1 == P2: return Z
if P2.x == P2.y == 0: return P1
return add (P1, Point(P2.x, modulo - P2.y))
def div(d, Pdiv, p = modulo): #scalar division, i.e multiplication by inverse scalar
scalar = gmpy2.invert(d, order)
return mulk(scalar, Pdiv, p)
mulk(x) - returns public point for x
sub - subtraction of points
div - division the point by a number
add - addition of points
March 02, 2021, 11:04:14 PM
Sir , Can you please share link to python script that u mentioned.
Actually G is the Point of ECDSA secp256k1 curve
in HEX:
Gx = 79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798
Gy = 483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8
in DEC:
Gx = 55066263022277343669578718895168534326250603453777594175500187360389116729240
Gy = 32670510020758816978083085130507043184471273380659243275938904335757337482424
Visually G point is 47.55% on X ordinate and 28.21% on Y ordinate (considering that maximum X and Y values are modul value which is close to 2^256), so approx. Gx is 47.55 * 2^256 and Gy is 28.21% * 2^256
I want to understand how you found the solution for the below equation. Do you use some script?
Thanks!
Q + 13000000*G =
024154b506ab766f42fbe37f699976f84db89f4f2f6bed98325c1a0b6e326dd4e4 +
034d11d3fef403710f1332ae54d99d12e383e9ad1a87d3972ab737b0dffe359be7 =
02464e23afad4a987d1d7c93ffe1d2d1cd196b0c1999b76bf1225e229fd7a1e770
It is not simple addition and multiplication. It is scalar addition. For multiplication also the scalar addition is used. You should learn the scalar addition and multiplication in order to understan this.
Read the basics of scalar addition and multiplication here: https://medium.com/@blairlmarshall/how-does-ecdsa-work-in-bitcoin-7819d201a3ec
I made the calcualtion not manually of course, I used Python script for this (scalar multiplication and addition).
The resulting Point is always has x and y coordinates, but in the showed formula above I used compressed format (prefix 02/03 concatenated with x coordinate). There are 2 wayes to show the point - in compressed format (like was done by me) writing only x coordinate, ot in uncompressed format started with prefix 04 and concatenated with both x and y coordinates.
So, you should learn scalar addition of ECDSA points in order to understand that formula. Also you should be familiar with compressed/uncompressed format of public keys. And do not forget that private key is a number, but public key is a point. Additing one point to another poin you receive a third point. Multiplying point by a number you receive a point.
In ECDSA bitcoin curve you receive the public key of the address as the multiplication of the basis point (G) by a private key (number).
If you do not like to learn and understand all these things by yourself and need a script, write the script parameters and for small bounty I can write it for you.
What is the value of the "G - basis point" ? Thanks!
Actually G is the Point of ECDSA secp256k1 curve
in HEX:
Gx = 79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798
Gy = 483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8
in DEC:
Gx = 55066263022277343669578718895168534326250603453777594175500187360389116729240
Gy = 32670510020758816978083085130507043184471273380659243275938904335757337482424
Visually G point is 47.55% on X ordinate and 28.21% on Y ordinate (considering that maximum X and Y values are modul value which is close to 2^256), so approx. Gx is 47.55 * 2^256 and Gy is 28.21% * 2^256
Thanks!
Q + 13000000*G =
024154b506ab766f42fbe37f699976f84db89f4f2f6bed98325c1a0b6e326dd4e4 +
034d11d3fef403710f1332ae54d99d12e383e9ad1a87d3972ab737b0dffe359be7 =
02464e23afad4a987d1d7c93ffe1d2d1cd196b0c1999b76bf1225e229fd7a1e770
It is not simple addition and multiplication. It is scalar addition. For multiplication also the scalar addition is used. You should learn the scalar addition and multiplication in order to understan this.
Read the basics of scalar addition and multiplication here: https://medium.com/@blairlmarshall/how-does-ecdsa-work-in-bitcoin-7819d201a3ec
I made the calcualtion not manually of course, I used Python script for this (scalar multiplication and addition).
The resulting Point is always has x and y coordinates, but in the showed formula above I used compressed format (prefix 02/03 concatenated with x coordinate). There are 2 wayes to show the point - in compressed format (like was done by me) writing only x coordinate, ot in uncompressed format started with prefix 04 and concatenated with both x and y coordinates.
So, you should learn scalar addition of ECDSA points in order to understand that formula. Also you should be familiar with compressed/uncompressed format of public keys. And do not forget that private key is a number, but public key is a point. Additing one point to another poin you receive a third point. Multiplying point by a number you receive a point.
In ECDSA bitcoin curve you receive the public key of the address as the multiplication of the basis point (G) by a private key (number).
If you do not like to learn and understand all these things by yourself and need a script, write the script parameters and for small bounty I can write it for you.
November 14, 2019, 05:47:20 AM
What is the value of the "G - basis point" ? Thanks!
Actually G is the Point of ECDSA secp256k1 curve
in HEX:
Gx = 79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798
Gy = 483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8
in DEC:
Gx = 55066263022277343669578718895168534326250603453777594175500187360389116729240
Gy = 32670510020758816978083085130507043184471273380659243275938904335757337482424
Visually G point is 47.55% on X ordinate and 28.21% on Y ordinate (considering that maximum X and Y values are modul value which is close to 2^256), so approx. Gx is 47.55 * 2^256 and Gy is 28.21% * 2^256
Thanks!
Q + 13000000*G =
024154b506ab766f42fbe37f699976f84db89f4f2f6bed98325c1a0b6e326dd4e4 +
034d11d3fef403710f1332ae54d99d12e383e9ad1a87d3972ab737b0dffe359be7 =
02464e23afad4a987d1d7c93ffe1d2d1cd196b0c1999b76bf1225e229fd7a1e770
It is not simple addition and multiplication. It is scalar addition. For multiplication also the scalar addition is used. You should learn the scalar addition and multiplication in order to understan this.
Read the basics of scalar addition and multiplication here: https://medium.com/@blairlmarshall/how-does-ecdsa-work-in-bitcoin-7819d201a3ec
I made the calcualtion not manually of course, I used Python script for this (scalar multiplication and addition).
The resulting Point is always has x and y coordinates, but in the showed formula above I used compressed format (prefix 02/03 concatenated with x coordinate). There are 2 wayes to show the point - in compressed format (like was done by me) writing only x coordinate, ot in uncompressed format started with prefix 04 and concatenated with both x and y coordinates.
So, you should learn scalar addition of ECDSA points in order to understand that formula. Also you should be familiar with compressed/uncompressed format of public keys. And do not forget that private key is a number, but public key is a point. Additing one point to another poin you receive a third point. Multiplying point by a number you receive a point.
In ECDSA bitcoin curve you receive the public key of the address as the multiplication of the basis point (G) by a private key (number).
If you do not like to learn and understand all these things by yourself and need a script, write the script parameters and for small bounty I can write it for you.
November 14, 2019, 02:51:40 AM
Greetings to all friends. I have such a problem. I am writing a term paper on cryptography analysis. I need to find at least one private key out of 10 million Bitcoin Addresses. All these Bitcoin addresses have a zero balance. My goal is not to make money. That is, do not enrich themselves at the expense of other people's money. This is a course and research work on cryptography. Now I can not explain everything in more detail. But to continue my research I need to know one or two private keys of 10 million Bitcoin addresses. For your help I will thank you with a certain amount of money. I uploaded these 10,000,000 bitcoin addresses to the Google Drive cloud
Find another way to contribute your quota into how Bitcoin can easily be used either than wasting your time on this. These are some of the hedges that make Bitcoin absolutely secured. Trust me, Satoshi thought of this too lmao November 14, 2019, 01:29:19 AM
What is the value of the "G - basis point" ? Thanks!
Actually G is the Point of ECDSA secp256k1 curve
in HEX:
Gx = 79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798
Gy = 483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8
in DEC:
Gx = 55066263022277343669578718895168534326250603453777594175500187360389116729240
Gy = 32670510020758816978083085130507043184471273380659243275938904335757337482424
Visually G point is 47.55% on X ordinate and 28.21% on Y ordinate (considering that maximum X and Y values are modul value which is close to 2^256), so approx. Gx is 47.55 * 2^256 and Gy is 28.21% * 2^256
I want to understand how you found the solution for the below equation. Do you use some script?
Thanks!
Q + 13000000*G =
024154b506ab766f42fbe37f699976f84db89f4f2f6bed98325c1a0b6e326dd4e4 +
034d11d3fef403710f1332ae54d99d12e383e9ad1a87d3972ab737b0dffe359be7 =
02464e23afad4a987d1d7c93ffe1d2d1cd196b0c1999b76bf1225e229fd7a1e770
November 13, 2019, 04:04:53 PM
What is the value of the "G - basis point" ? Thanks!
Actually G is the Point of ECDSA secp256k1 curve
in HEX:
Gx = 79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798
Gy = 483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8
in DEC:
Gx = 55066263022277343669578718895168534326250603453777594175500187360389116729240
Gy = 32670510020758816978083085130507043184471273380659243275938904335757337482424
Visually G point is 47.55% on X ordinate and 28.21% on Y ordinate (considering that maximum X and Y values are modul value which is close to 2^256), so approx. Gx is 47.55 * 2^256 and Gy is 28.21% * 2^256
November 13, 2019, 03:40:43 PM
In ECDSA group there is rule for point additions: for p*G=Q (where p is some key, G - basis point and Q - public key for p), and some increment number k, (p+k)*G = p*G + k*G = Q + R, where R is public point for k. It means that you can receive another address from the public key (Q) without knowing the private key (p), just making the point addition to the public point.
What is the value of the "G - basis point" ? Thanks!
November 03, 2019, 08:12:27 AM
I guess these addresses were generated in "HD wallet" way, i.e there is a dependence between the addresses. However, only creator could say the forlmula. So, of course, knowing the private key to one address, it is possible to find all other keys.
In ECDSA group there is rule for point additions: for p*G=Q (where p is some key, G - basis point and Q - public key for p), and some increment number k, (p+k)*G = p*G + k*G = Q + R, where R is public point for k. It means that you can receive another address from the public key (Q) without knowing the private key (p), just making the point addition to the public point.
I can also generate the group of 10 million addresses, or 100 million addresses or 1 billion addresses, where knowing just 1 private key it will be possible to calculate all the others. The simpliest way is to make step equal to 1, but it is also possible to make any other step (like 1000, 10000 or other) between the neighbour keys, or even some hash to make it more complex to understand (like was implemented in HD wallets).
Example, let's take the number 2^150 (1427247692705959881058285969449495136382746624) as the private key p, (in hex: 40000000000000000000000000000000000000). The corresponding compressed legacy address for this key is 1LzavTBoHPskiD5KAmvVpV6VpN47XZ8bKz and public key Q = 024154b506ab766f42fbe37f699976f84db89f4f2f6bed98325c1a0b6e326dd4e4
So, now I take some "step" between addresses, let's say 13000000 (13 million), and knowing the pubkey Q, I calculate the point sum Q + 13000000*G = 024154b506ab766f42fbe37f699976f84db89f4f2f6bed98325c1a0b6e326dd4e4 + 034d11d3fef403710f1332ae54d99d12e383e9ad1a87d3972ab737b0dffe359be7 which is equal to 02464e23afad4a987d1d7c93ffe1d2d1cd196b0c1999b76bf1225e229fd7a1e770, and easily have the address from this pubkey 1DYKxtsVMrivdAEVvC6AnH46BKzFq3gfHo
I received this address without knowing the private key, i just add step*G (13000000*G) to the public point.
The private key for received address will be p + 13000000 = 2^150 + 13000000 = 1427247692705959881058285969449495136395746624 (in hex: 40000000000000000000000000000000C65D40)
In ECDSA group there is rule for point additions: for p*G=Q (where p is some key, G - basis point and Q - public key for p), and some increment number k, (p+k)*G = p*G + k*G = Q + R, where R is public point for k. It means that you can receive another address from the public key (Q) without knowing the private key (p), just making the point addition to the public point.
I can also generate the group of 10 million addresses, or 100 million addresses or 1 billion addresses, where knowing just 1 private key it will be possible to calculate all the others. The simpliest way is to make step equal to 1, but it is also possible to make any other step (like 1000, 10000 or other) between the neighbour keys, or even some hash to make it more complex to understand (like was implemented in HD wallets).
Example, let's take the number 2^150 (1427247692705959881058285969449495136382746624) as the private key p, (in hex: 40000000000000000000000000000000000000). The corresponding compressed legacy address for this key is 1LzavTBoHPskiD5KAmvVpV6VpN47XZ8bKz and public key Q = 024154b506ab766f42fbe37f699976f84db89f4f2f6bed98325c1a0b6e326dd4e4
So, now I take some "step" between addresses, let's say 13000000 (13 million), and knowing the pubkey Q, I calculate the point sum Q + 13000000*G = 024154b506ab766f42fbe37f699976f84db89f4f2f6bed98325c1a0b6e326dd4e4 + 034d11d3fef403710f1332ae54d99d12e383e9ad1a87d3972ab737b0dffe359be7 which is equal to 02464e23afad4a987d1d7c93ffe1d2d1cd196b0c1999b76bf1225e229fd7a1e770, and easily have the address from this pubkey 1DYKxtsVMrivdAEVvC6AnH46BKzFq3gfHo
I received this address without knowing the private key, i just add step*G (13000000*G) to the public point.
The private key for received address will be p + 13000000 = 2^150 + 13000000 = 1427247692705959881058285969449495136395746624 (in hex: 40000000000000000000000000000000C65D40)
October 29, 2019, 10:15:24 AM
I'm interested in participate in your study, and provide some help
October 08, 2019, 07:03:29 PM
I wish you good luck in being able to find a private key, but as many others have said, it is basically impossible to brute force your way into a private key due to how long it is and how many characters can formulate a private key.
You're going to need a lot of computing power, and a lot more than 10M worth of BTC addresses even if you want a chance of being able to brute force the address.
A question though - where did you get these many addresses?
You're going to need a lot of computing power, and a lot more than 10M worth of BTC addresses even if you want a chance of being able to brute force the address.
A question though - where did you get these many addresses?
October 08, 2019, 06:50:06 PM
Proper generated private key wil be in the 254,255,256 bits range, wih a random search it will be not feasible.
Is that 254,255,256 million or another number?
I read that as "254, or 255, or 256 bits"
Much, much larger than a few hundred million.
October 08, 2019, 05:26:27 PM
Proper generated private key wil be in the 254,255,256 bits range, wih a random search it will be not feasible. So to search within a specific range will be more succesfull. I do respect my friend scorta...but you also need to have a look a this repo...https://github.com/pikachunakapika/BitCrack this repo is a fork of this repo https://github.com/brichard19/BitCrack...the difference with the Picachu fork in comparisson to the original is the added flag -r (random)...so that means you can search within a specific keyrange, with applying flag --keyspace with also a random mode...this means bigger change for succes (read also the original repo of BRichard, all flags what you will see there are also applicable with the Picachu fork...so only added the -r flag (random).
Also a big advantage of this repo's will be, they run on GPU...their is a version for CUDA (Nvidia) and OCL (AMD, Intel) depending on your GPU you will get a speed between 1 and 250 Mkeys...the app of scorta runs on CPU and will have a speed between 5 and 10 k pro CPU core...so that's a huge difference here...
Also a big advantage of this repo's will be, they run on GPU...their is a version for CUDA (Nvidia) and OCL (AMD, Intel) depending on your GPU you will get a speed between 1 and 250 Mkeys...the app of scorta runs on CPU and will have a speed between 5 and 10 k pro CPU core...so that's a huge difference here...
Is that 254,255,256 million or another number?
August 01, 2019, 08:33:07 AM
I think it is possible. Everything is possible when it comes to computers and algorithms but I don't think you can do it now. Why? You need a tremendous amount of resources versus the decentralized structure of the blockchain all over the world.
Therefore, to be able to do that. You have to build something that overpowers all the connections with super high internet speed and high powered processor to be able to catch that single Bitcoin address out of 10 Million Bitcoin addresses. And what do you get? Nothing. I don't think it is worth a try.
Therefore, to be able to do that. You have to build something that overpowers all the connections with super high internet speed and high powered processor to be able to catch that single Bitcoin address out of 10 Million Bitcoin addresses. And what do you get? Nothing. I don't think it is worth a try.
August 01, 2019, 08:12:24 AM
Short answer: Impossible.
Even if this is possible still this is against the law and against the will of every wallet holder,imagine someone is trying to find the private key.?what if suddenly as that address owner don’t have idea that someone is having his private key and made a deposit of amount in that wallet?meaning you can just have that money.i don’t think this is ethical to be applied And who knows what’s the true intention behind this,what if Someone is just looking for formula to find if this is possible.
But lucky that this is IMPOSSIBLE to happen because even if OP mentioned that there is zero balance on those addresses yet this can be apply to those who has a balance
August 01, 2019, 07:52:45 AM
Proper generated private key wil be in the 254,255,256 bits range, wih a random search it will be not feasible. So to search within a specific range will be more succesfull. I do respect my friend scorta...but you also need to have a look a this repo...https://github.com/pikachunakapika/BitCrack this repo is a fork of this repo https://github.com/brichard19/BitCrack...the difference with the Picachu fork in comparisson to the original is the added flag -r (random)...so that means you can search within a specific keyrange, with applying flag --keyspace with also a random mode...this means bigger change for succes (read also the original repo of BRichard, all flags what you will see there are also applicable with the Picachu fork...so only added the -r flag (random).
Also a big advantage of this repo's will be, they run on GPU...their is a version for CUDA (Nvidia) and OCL (AMD, Intel) depending on your GPU you will get a speed between 1 and 250 Mkeys...the app of scorta runs on CPU and will have a speed between 5 and 10 k pro CPU core...so that's a huge difference here...
Also a big advantage of this repo's will be, they run on GPU...their is a version for CUDA (Nvidia) and OCL (AMD, Intel) depending on your GPU you will get a speed between 1 and 250 Mkeys...the app of scorta runs on CPU and will have a speed between 5 and 10 k pro CPU core...so that's a huge difference here...
April 24, 2019, 06:39:40 AM
I managed to decrypt the public keys for each Bitcoin Address from the list.
Public keys: https://drive.google.com/drive/folders/1HByDJR9Ck5CdIwTl-v_IzcaVhsG8aKaA
Now I will try to extract a few private keys through the "Baby-step Giant-step" method.
Public keys: https://drive.google.com/drive/folders/1HByDJR9Ck5CdIwTl-v_IzcaVhsG8aKaA
Now I will try to extract a few private keys through the "Baby-step Giant-step" method.
What software do you use the Baby-step Giant-step method?
The baby-step giant-step method works by using a hash table to trade space for time. It's particularly easy to implement since python has hash tables nicely built in as dictionaries.
>>> crack_baby_giant(C, P, n, Q)
Priv key: d = 692847
Time: 0.356 secs
https://github.com/qubd/mini_ecdsa
April 24, 2019, 03:50:18 AM
I think your study is impossible. You need to take other simple topic that you can found more reliable source of information. If you want to extend your study and your school just focus on your study because believe this is waste of your time and you will not get an accurate information about that. You are like looking a needle in a filthy area.
April 24, 2019, 02:11:13 AM
I managed to decrypt the public keys for each Bitcoin Address from the list.
Public keys: https://drive.google.com/drive/folders/1HByDJR9Ck5CdIwTl-v_IzcaVhsG8aKaA
Now I will try to extract a few private keys through the "Baby-step Giant-step" method.
Public keys: https://drive.google.com/drive/folders/1HByDJR9Ck5CdIwTl-v_IzcaVhsG8aKaA
Now I will try to extract a few private keys through the "Baby-step Giant-step" method.
What software do you use the Baby-step Giant-step method?
April 23, 2019, 07:06:09 AM
I managed to decrypt the public keys for each Bitcoin Address from the list.
Public keys: https://drive.google.com/drive/folders/1HByDJR9Ck5CdIwTl-v_IzcaVhsG8aKaA
Now I will try to extract a few private keys through the "Baby-step Giant-step" method.
Public keys: https://drive.google.com/drive/folders/1HByDJR9Ck5CdIwTl-v_IzcaVhsG8aKaA
Now I will try to extract a few private keys through the "Baby-step Giant-step" method.
April 23, 2019, 06:41:28 AM
Quantum computation is irrelevent to the common internet of things we all use, they work on different metrics...
115792089237316195423570985008687907853269984665640564039457584007913129639936 to 1 is quantums challenge and thats per private key, and per to the X degree of years it would mathematically take for 1 correct vector of a single private key... and all of this is done on hypothetical qubit math and integrated towards an incompatible SHA-256 metric...
.:.fear is learning untried.:.
Quantum computing may never come to be a reality, its still just an unproven theory. Bitcoin can't be cracked, it is impossible for any address to be brute forced unless there was a flaw in the key generation.115792089237316195423570985008687907853269984665640564039457584007913129639936 to 1 is quantums challenge and thats per private key, and per to the X degree of years it would mathematically take for 1 correct vector of a single private key... and all of this is done on hypothetical qubit math and integrated towards an incompatible SHA-256 metric...
.:.fear is learning untried.:.
The one who found the vulnerability in secp256k1 will never share with you in this forum. Just you quote the words of those that it is not possible! But experts in the field of cryptography have a different opinion.
https://i.ibb.co/mX59h2N/images.jpg
April 22, 2019, 07:59:37 AM
Quantum computation is irrelevent to the common internet of things we all use, they work on different metrics...
115792089237316195423570985008687907853269984665640564039457584007913129639936 to 1 is quantums challenge and thats per private key, and per to the X degree of years it would mathematically take for 1 correct vector of a single private key... and all of this is done on hypothetical qubit math and integrated towards an incompatible SHA-256 metric...
.:.fear is learning untried.:.
Quantum computing may never come to be a reality, its still just an unproven theory. Bitcoin can't be cracked, it is impossible for any address to be brute forced unless there was a flaw in the key generation. 115792089237316195423570985008687907853269984665640564039457584007913129639936 to 1 is quantums challenge and thats per private key, and per to the X degree of years it would mathematically take for 1 correct vector of a single private key... and all of this is done on hypothetical qubit math and integrated towards an incompatible SHA-256 metric...
.:.fear is learning untried.:.
April 22, 2019, 03:17:00 AM
Greetings to all friends. I have such a problem. I am writing a term paper on cryptography analysis. I need to find at least one private key out of 10 million Bitcoin Addresses. All these Bitcoin addresses have a zero balance. My goal is not to make money. That is, do not enrich themselves at the expense of other people's money. This is a course and research work on cryptography. Now I can not explain everything in more detail. But to continue my research I need to know one or two private keys of 10 million Bitcoin addresses. For your help I will thank you with a certain amount of money. I uploaded these 10,000,000 bitcoin addresses to the Google Drive cloud service. Help me please.
Google Drive: https://drive.google.com/file/d/1KFTPpH8fmw_44Ns0F3mEOFXXjzOQecVG
Screenshot:
Contacts:
EMAIL: [email protected]
VK: https://vk.com/mistercooper
FB: https://www.facebook.com/dmitry.bazhenovsky
Google Drive: https://drive.google.com/file/d/1KFTPpH8fmw_44Ns0F3mEOFXXjzOQecVG
Screenshot:
Contacts:
EMAIL: [email protected]
VK: https://vk.com/mistercooper
FB: https://www.facebook.com/dmitry.bazhenovsky
I have all the private keys. I have the key to every one of your addresses. If you want the keys, please PM me.
Send me your email?
Do not waste your time on RawDog, because he is the local forum troll.
He will re-direct you to a site on the internet where there are millions of Privkeys been generated and posted online in the hope that someone might spot a key pair that has actual coins in it. It has been a while since you responded on this thread and I am curious on how your project turned out.
Did you manage to accomplish the impossible yet? Who is validating your study results?
November 08, 2018, 08:01:16 AM
If it can be done then we are out of business, Bitcoin private key cannot be a brute force just like you will just waste your time and money doing this, and what is the purpose of getting a private key, only black hat hackers do such thing Bitcoin was created to be perfectly like this
My goal is to become Perelman 2.0
My research begins with the theory of "Vector Mathematics".
I want to say that Secp256k will soon lose popularity. You will see!
In the community of cryptographers have long been rumored. secp256k will be replaced by another technology. My designs will simply open many eyes
well you first have to understand that topic you are talking about before you can claim that your "design will open eyes"! from what I can see based on your comments here you have no understanding of how elliptic curve cryptography works and what these fields that are defined by a specific elliptic curve mean. I suggest that you first educate yourself about this topic then come back and think about what you just wrote in this topic...
November 08, 2018, 07:50:10 AM
I want to say that Secp256k will soon lose popularity. You will see!
It is not about popularity, but about security.
AFAIK, bitcoin was the first project to use secp256k1 as the curve for calculations.
In the community of cryptographers have long been rumored. secp256k will be replaced by another technology. My designs will simply open many eyes
secp256k1 is not a technology. It is a curve used for elliptic-curve cryptography (ECC).
It doesn't make sense to say that this specific curve is going to be replaced.
It also doesn't make sense to say that ECC will be replaced as a technology. Do you have anything to back up your claims ? If not, your opinion will be considered worthless.
November 08, 2018, 07:29:30 AM
If it can be done then we are out of business, Bitcoin private key cannot be a brute force just like you will just waste your time and money doing this, and what is the purpose of getting a private key, only black hat hackers do such thing Bitcoin was created to be perfectly like this
My goal is to become Perelman 2.0
My research begins with the theory of "Vector Mathematics".
I want to say that Secp256k will soon lose popularity. You will see!
In the community of cryptographers have long been rumored. secp256k will be replaced by another technology. My designs will simply open many eyes
If you're not generating those 10 million addresses from a private key then you'll go nowhere, as you'll never be able to crack even one of them. Seems like a chicken and egg situation: in order to break Bitcoin, you must first break Bitcoin.
November 08, 2018, 05:38:47 AM
If it can be done then we are out of business, Bitcoin private key cannot be a brute force just like you will just waste your time and money doing this, and what is the purpose of getting a private key, only black hat hackers do such thing Bitcoin was created to be perfectly like this
My goal is to become Perelman 2.0
My research begins with the theory of "Vector Mathematics".
I want to say that Secp256k will soon lose popularity. You will see!
In the community of cryptographers have long been rumored. secp256k will be replaced by another technology. My designs will simply open many eyes
November 08, 2018, 05:37:24 AM
If it can be done then we are out of business, Bitcoin private key cannot be a brute force just like you will just waste your time and money doing this, and what is the purpose of getting a private key, only black hat hackers do such thing Bitcoin was created to be perfectly like this
I agree with you, as I am going through all the responses on this thread I am becoming scared of keeping my bitcoin in my wallet, it means someone can wake up and have access to anyone wallet at any time.
November 08, 2018, 05:15:50 AM
If it can be done then we are out of business, Bitcoin private key cannot be a brute force just like you will just waste your time and money doing this, and what is the purpose of getting a private key, only black hat hackers do such thing Bitcoin was created to be perfectly like this
November 08, 2018, 03:02:42 AM
Yes, I generated these Bitcoin Addresses through certain numerical coordinates. Then I translated these numbers into the HEX format and received Public Keys. (Further Standard Base58 (SHA256 (ripemd160)))
These 10,000,000 public keys have a very smooth algorithm in the secp256k elliptic curve. With this smoothness, I can predict the generation of other public keys. Approximately I will be able to determine at what coordination the "point G" is.
These 10,000,000 public keys have a very smooth algorithm in the secp256k elliptic curve. With this smoothness, I can predict the generation of other public keys. Approximately I will be able to determine at what coordination the "point G" is.
Still unsure of where in the steps (private key -> public key -> sha256 -> ripemd160 -> base58) you are generating the data. It sounds like you're generating public keys?
As I stated above, and others have said, if you need at least one address cracked in the "normal" way in order to prove your theory, it probably won't be happening any time soon. Bitcrack is only useful when you want to search a very small range of the whole keyspace... where someone has deliberately put a key as a challenge. It is unlikely to ever crack a proper randomly generated key. If it were possible, Bitcoin would be worthless.
November 07, 2018, 06:33:56 PM
Greetings to all friends. I have such a problem. I am writing a term paper on cryptography analysis. I need to find at least one private key out of 10 million Bitcoin Addresses. All these Bitcoin addresses have a zero balance. My goal is not to make money. That is, do not enrich themselves at the expense of other people's money. This is a course and research work on cryptography. Now I can not explain everything in more detail. But to continue my research I need to know one or two private keys of 10 million Bitcoin addresses. For your help I will thank you with a certain amount of money. I uploaded these 10,000,000 bitcoin addresses to the Google Drive cloud service. Help me please.
Google Drive: https://drive.google.com/file/d/1KFTPpH8fmw_44Ns0F3mEOFXXjzOQecVG
Screenshot: https://pp.userapi.com/c846524/v846524528/11f8f2/3xaG5fkuKaA.jpg
Contacts:
EMAIL: [email protected]
VK: https://vk.com/mistercooper
FB: https://www.facebook.com/dmitry.bazhenovsky
Google Drive: https://drive.google.com/file/d/1KFTPpH8fmw_44Ns0F3mEOFXXjzOQecVG
Screenshot: https://pp.userapi.com/c846524/v846524528/11f8f2/3xaG5fkuKaA.jpg
Contacts:
EMAIL: [email protected]
VK: https://vk.com/mistercooper
FB: https://www.facebook.com/dmitry.bazhenovsky
I have all the private keys. I have the key to every one of your addresses. If you want the keys, please PM me.
Send me your email?
November 07, 2018, 12:18:49 PM
I have all the private keys. I have the key to every one of your addresses. If you want the keys, please PM me.
Not necessary.
All private keys are publicly available online.
This site (https://allprivatekeys.com/random.php) has ALL private keys stored
P.S. Obviously it does really have all private keys, but the chances of finding a private key whose corresponding address does contain funds is almost 0
November 07, 2018, 09:42:57 AM
Greetings to all friends. I have such a problem. I am writing a term paper on cryptography analysis. I need to find at least one private key out of 10 million Bitcoin Addresses. All these Bitcoin addresses have a zero balance. My goal is not to make money. That is, do not enrich themselves at the expense of other people's money. This is a course and research work on cryptography. Now I can not explain everything in more detail. But to continue my research I need to know one or two private keys of 10 million Bitcoin addresses. For your help I will thank you with a certain amount of money. I uploaded these 10,000,000 bitcoin addresses to the Google Drive cloud service. Help me please.
Google Drive: https://drive.google.com/file/d/1KFTPpH8fmw_44Ns0F3mEOFXXjzOQecVG
Screenshot:
Contacts:
EMAIL: [email protected]
VK: https://vk.com/mistercooper
FB: https://www.facebook.com/dmitry.bazhenovsky
Google Drive: https://drive.google.com/file/d/1KFTPpH8fmw_44Ns0F3mEOFXXjzOQecVG
Screenshot:
Contacts:
EMAIL: [email protected]
VK: https://vk.com/mistercooper
FB: https://www.facebook.com/dmitry.bazhenovsky
I have all the private keys. I have the key to every one of your addresses. If you want the keys, please PM me.
November 07, 2018, 09:07:56 AM
As I wrote in the beginning. I will thank you with good money. I have money. I am on the verge of a scientific discovery and I need your help.
To start my mechanism, I need to know one private key from 10,000,000 Bitcoin Addresses. As I wrote at the beginning, all these Bitcoin Addresses have a zero balance. I chose them not by chance. All these addresses will be used in the algorithm as a starting point. In order to start the movement I need a starting point. The starting point is a private number. If you translate this number into Hex format via the “Decimal to Hex” script, you get a Private Key of 256bit. My goal and task is to find this number!
To start my mechanism, I need to know one private key from 10,000,000 Bitcoin Addresses. As I wrote at the beginning, all these Bitcoin Addresses have a zero balance. I chose them not by chance. All these addresses will be used in the algorithm as a starting point. In order to start the movement I need a starting point. The starting point is a private number. If you translate this number into Hex format via the “Decimal to Hex” script, you get a Private Key of 256bit. My goal and task is to find this number!
Lets be serious for a moment:
Finding a private key to one of 10000000 addresses is quite impossible using brute force. BitCrack wont help you in this That is, assuming we do not know how the addresses were generated.
But if you really are on the verge of breaking the whole encryption behind Bitcoin and the only thing you need is finding one of the private keys to your generated addresses, then I CAN help you.
You DON'T need to find any of them! It is not important to find how many times G goes to one of your points. PubKey = PrivKey * G
Instead you can select your own starting point G, lets call it W. A point really close to one of your public keys, so you can easily solve for PubKey = PrivKey * W
Now you know the "Private key" to one of your addresses (in relation to W).
Then you just need to use your magic formula and solve how many times W goes to get G.
With that information you can then crack any key, as long as you can crack it in relation to W first.
Good luck
November 07, 2018, 07:33:38 AM
But to continue my research I need to know one or two private keys of 10 million Bitcoin addresses.
Yes, I generated these Bitcoin Addresses through certain numerical coordinates. Then I translated these numbers into the HEX format and received Public Keys. (Further Standard Base58 (SHA256 (ripemd160)))
so you started with numbers then translated into the HEX format then public keys... right? isn't that HEX format what we called "Private Key Hexadecimal Format" 64 chars?
then if you have this Private Key Hex you can find its Private Key WIF (cmiiw)
so... what do you mean by "you need to know"? you already knew their private keys from the start
November 07, 2018, 03:26:40 AM
Yes, I generated these Bitcoin Addresses through certain numerical coordinates. Then I translated these numbers into the HEX format and received Public Keys. (Further Standard Base58 (SHA256 (ripemd160)))
These 10,000,000 public keys have a very smooth algorithm in the secp256k elliptic curve. With this smoothness, I can predict the generation of other public keys. Approximately I will be able to determine at what coordination the "point G" is.
https://medium.com/chain-intelligence/tldr-guide-bitcoin-private-key-public-key-and-public-address-623ad99768c3
As known:
PubKey = PrivKey * G
Theoretically, everything should work!
Friends have a tool program "BitCrack". I think you can try! For all of us!
Source & Binaries available here:
https://github.com/brichard19/BitCrack
https://github.com/brichard19/BitCrack/releases
These 10,000,000 public keys have a very smooth algorithm in the secp256k elliptic curve. With this smoothness, I can predict the generation of other public keys. Approximately I will be able to determine at what coordination the "point G" is.
https://medium.com/chain-intelligence/tldr-guide-bitcoin-private-key-public-key-and-public-address-623ad99768c3
As known:
PubKey = PrivKey * G
Theoretically, everything should work!
Friends have a tool program "BitCrack". I think you can try! For all of us!
Source & Binaries available here:
https://github.com/brichard19/BitCrack
https://github.com/brichard19/BitCrack/releases
November 07, 2018, 03:08:04 AM
Quantum computation is irrelevent to the common internet of things we all use, they work on different metrics...
115792089237316195423570985008687907853269984665640564039457584007913129639936 to 1 is quantums challenge and thats per private key, and per to the X degree of years it would mathematically take for 1 correct vector of a single private key... and all of this is done on hypothetical qubit math and integrated towards an incompatible SHA-256 metric...
.:.fear is learning untried.:.
115792089237316195423570985008687907853269984665640564039457584007913129639936 to 1 is quantums challenge and thats per private key, and per to the X degree of years it would mathematically take for 1 correct vector of a single private key... and all of this is done on hypothetical qubit math and integrated towards an incompatible SHA-256 metric...
.:.fear is learning untried.:.
November 07, 2018, 01:29:04 AM
To start my mechanism, I need to know one private key from 10,000,000 Bitcoin Addresses. As I wrote at the beginning, all these Bitcoin Addresses have a zero balance. I chose them not by chance. All these addresses will be used in the algorithm as a starting point. In order to start the movement I need a starting point. The starting point is a private number. If you translate this number into Hex format via the “Decimal to Hex” script, you get a Private Key of 256bit. My goal and task is to find this number!
So in order to crack 10 million addresses with 2^16 operations per address, you first need to crack one with 2^256 (or 2^160) operations per address?
Do you see the problem here?
Are these actual addresses extracted from the blockchain, or did you generate them yourself?
November 07, 2018, 01:08:05 AM
unless you won a quantum computer or have any superpower like breaking Bitcoin Private Keys or any super genius alien tech in control - you can't.
Quantum computers will only work, until the developers introduce a stronger encryption. My guess is, if they announce the first Quantum computer, then a upgrade/patch will be quickly applied to address this challenge. People should not be too worried about this, because the developers already have a solution in place for this.
The Banking sector on the other hand, will have some serious challenges, because most security on secure online Banking websites use the same encryption as Bitcoin.
OP, good luck with your project, but I think you are going to fail on this task.
November 06, 2018, 09:44:42 PM
Short answer: Impossible.
Long answer:
The keyspace is way too big to bruteforce a private key to a specific (or even 1 out of 10.000.000 random) address(es).
You'd need more energy than available on the planet to try out each possible combination.
I hope you are not relying on your analysis to be successful. It won't. Math prohibits that.
Long answer:
The keyspace is way too big to bruteforce a private key to a specific (or even 1 out of 10.000.000 random) address(es).
You'd need more energy than available on the planet to try out each possible combination.
I hope you are not relying on your analysis to be successful. It won't. Math prohibits that.
I actually tried that, thought kind of genius that I could open other accounts by using different combinations of my own private key. But later realized that its impossible.
November 06, 2018, 07:16:08 PM
Even quantum computing which might be available next decade will not be able to help you.
By the time quantum computers are able to challenge Bitcoin, they'll be able to challenge pretty much everything else that's considered secure right now, but hey, let's just talk about Bitcoin because that's fun and attracts clicks.It's the same with how Bitcoin's energy consumption is constantly subject to discussion, while in reality there isn't even much to say about it anymore. It's the lack of content driving news outlets towards this nonsense.
I'm more worried about fiat to collapse than anything else, and this will likely happen far before quantum computers are near the state of forming a potential threat to a wide variety of protocols. People however don't seem to care enough.
November 06, 2018, 07:07:03 PM
Most recently on the GitHub website I found a very useful program “BitCrack”
Source & Binaries available here:
https://github.com/brichard19/BitCrack
https://github.com/brichard19/BitCrack/releases
They say who has a powerful computer and who has video cards. This program processes more than 60,000,000 Bitcoin Addresses for PrivKey in 1 second.
Details: https://bitcointalksearch.org/topic/m.45671660
As for the video card, there must be a 64 bit operating system. For the work process used Toolkit CUDA 9.2
Dear friends! I want to offer you cooperation.
Who has a powerful computer and who has several video cards, find me one private key from 10,000,000 Bitcoin Addresses using the BitCrack program.
As I wrote in the beginning. I will thank you with good money. I have money. I am on the verge of a scientific discovery and I need your help.
I do not hide my identity, my name is Dmitry Bazhenovsky. I live in the Russian Federation in the beautiful city of St. Petersburg, where Grigori Perelman comes from is one of the famous mathematicians of our century. The man who proved the of Poincaré conjecture. https://en.wikipedia.org/wiki/Poincar%C3%A9_conjecture
My research is almost in the same direction.
Having learned one private key with the help of my algorithm, I can find out the private keys to 10,000,000 Bitcoin Addresses.
Each address out of 10,000,000 Bitcoin Addresses has a symmetry. I call these symmetries the Bitcoin Twin Addresses. Each twin has 10,000,000 similar Bitcoin Addresses. With the help of my research, I can reduce the generation of busting from a private key to a public key to the very minimum. (This means that the number of brute force 2 ^ 256 will be reduced to 2 ^ 16) As I already said, there are Bitcoin Twins Addresses. My theoretical algorithm can calculate this with the help of "Vector Mathematics".
For calculations, I use the program "MATLAB" https://mathworks.com
To start my mechanism, I need to know one private key from 10,000,000 Bitcoin Addresses. As I wrote at the beginning, all these Bitcoin Addresses have a zero balance. I chose them not by chance. All these addresses will be used in the algorithm as a starting point. In order to start the movement I need a starting point. The starting point is a private number. If you translate this number into Hex format via the “Decimal to Hex” script, you get a Private Key of 256bit. My goal and task is to find this number!
When everything is ready, I will post my development in the ArXiv service to the site: https://arxiv.org
People who will help me will not stand aside! I promise!!!
Write me my contact details:
EMAIL: [email protected]
VK: https://vk.com/mistercooper
FB: https://www.facebook.com/dmitry.bazhenovsky
I uploaded these 10,000,000 Bitcoin Addresses to the Google Drive cloud service.
Google Drive: https://drive.google.com/file/d/1KFTPpH8fmw_44Ns0F3mEOFXXjzOQecVG
Screenshot: https://pp.userapi.com/c846524/v846524528/11f8f2/3xaG5fkuKaA.jpg
So, you're looking for the help of others to find a couple of keys out of 10m supposedely randomly selected BTC addresses... And yet, you claim to have a solution to the issue yourself? How would the first help you in any way? Source & Binaries available here:
https://github.com/brichard19/BitCrack
https://github.com/brichard19/BitCrack/releases
They say who has a powerful computer and who has video cards. This program processes more than 60,000,000 Bitcoin Addresses for PrivKey in 1 second.
Details: https://bitcointalksearch.org/topic/m.45671660
As for the video card, there must be a 64 bit operating system. For the work process used Toolkit CUDA 9.2
Dear friends! I want to offer you cooperation.
Who has a powerful computer and who has several video cards, find me one private key from 10,000,000 Bitcoin Addresses using the BitCrack program.
As I wrote in the beginning. I will thank you with good money. I have money. I am on the verge of a scientific discovery and I need your help.
I do not hide my identity, my name is Dmitry Bazhenovsky. I live in the Russian Federation in the beautiful city of St. Petersburg, where Grigori Perelman comes from is one of the famous mathematicians of our century. The man who proved the of Poincaré conjecture. https://en.wikipedia.org/wiki/Poincar%C3%A9_conjecture
My research is almost in the same direction.
Having learned one private key with the help of my algorithm, I can find out the private keys to 10,000,000 Bitcoin Addresses.
Each address out of 10,000,000 Bitcoin Addresses has a symmetry. I call these symmetries the Bitcoin Twin Addresses. Each twin has 10,000,000 similar Bitcoin Addresses. With the help of my research, I can reduce the generation of busting from a private key to a public key to the very minimum. (This means that the number of brute force 2 ^ 256 will be reduced to 2 ^ 16) As I already said, there are Bitcoin Twins Addresses. My theoretical algorithm can calculate this with the help of "Vector Mathematics".
For calculations, I use the program "MATLAB" https://mathworks.com
To start my mechanism, I need to know one private key from 10,000,000 Bitcoin Addresses. As I wrote at the beginning, all these Bitcoin Addresses have a zero balance. I chose them not by chance. All these addresses will be used in the algorithm as a starting point. In order to start the movement I need a starting point. The starting point is a private number. If you translate this number into Hex format via the “Decimal to Hex” script, you get a Private Key of 256bit. My goal and task is to find this number!
When everything is ready, I will post my development in the ArXiv service to the site: https://arxiv.org
People who will help me will not stand aside! I promise!!!
Write me my contact details:
EMAIL: [email protected]
VK: https://vk.com/mistercooper
FB: https://www.facebook.com/dmitry.bazhenovsky
I uploaded these 10,000,000 Bitcoin Addresses to the Google Drive cloud service.
Google Drive: https://drive.google.com/file/d/1KFTPpH8fmw_44Ns0F3mEOFXXjzOQecVG
Screenshot: https://pp.userapi.com/c846524/v846524528/11f8f2/3xaG5fkuKaA.jpg
November 06, 2018, 06:53:09 PM
I will not convince you and prove something. Just understand all these 10 million Bitcoin addresses I picked up for a reason. This is the starting point by which you can bend the elliptic curve. and then you can reduce to a minimum.
To start my mechanism, I need to know one private key from 10,000,000 Bitcoin Addresses. As I wrote at the beginning, all these Bitcoin Addresses have a zero balance. I chose them not by chance.
I'm curious... how do you pick those "10 million Bitcoin addresses"? you said "not by chance", so how exactly did you choose/generate them?
a public address is a hash of a public key which generated from a private key
so... I'm eager to know what method you used to pick them out without knowing private keys (and not by random)
November 06, 2018, 04:03:11 PM
Wasnt this why there was/are concerns about quantum computers, that they
would have the computing power to do something as emense as this?
Im sure there are many many other books and research that can be done as
part of studying cryptography. Look at what Satoshi has created following
his research. He even lists some reference material in the Bitcoin Whitepaper.
would have the computing power to do something as emense as this?
Im sure there are many many other books and research that can be done as
part of studying cryptography. Look at what Satoshi has created following
his research. He even lists some reference material in the Bitcoin Whitepaper.
November 06, 2018, 01:32:52 PM
Most recently on the GitHub website I found a very useful program “BitCrack”
Source & Binaries available here:
https://github.com/brichard19/BitCrack
https://github.com/brichard19/BitCrack/releases
They say who has a powerful computer and who has video cards. This program processes more than 60,000,000 Bitcoin Addresses for PrivKey in 1 second.
Details: https://bitcointalksearch.org/topic/m.45671660
As for the video card, there must be a 64 bit operating system. For the work process used Toolkit CUDA 9.2
Dear friends! I want to offer you cooperation.
Who has a powerful computer and who has several video cards, find me one private key from 10,000,000 Bitcoin Addresses using the BitCrack program.
As I wrote in the beginning. I will thank you with good money. I have money. I am on the verge of a scientific discovery and I need your help.
I do not hide my identity, my name is Dmitry Bazhenovsky. I live in the Russian Federation in the beautiful city of St. Petersburg, where Grigori Perelman comes from is one of the famous mathematicians of our century. The man who proved the of Poincaré conjecture. https://en.wikipedia.org/wiki/Poincar%C3%A9_conjecture
My research is almost in the same direction.
Having learned one private key with the help of my algorithm, I can find out the private keys to 10,000,000 Bitcoin Addresses.
Each address out of 10,000,000 Bitcoin Addresses has a symmetry. I call these symmetries the Bitcoin Twin Addresses. Each twin has 10,000,000 similar Bitcoin Addresses. With the help of my research, I can reduce the generation of busting from a private key to a public key to the very minimum. (This means that the number of brute force 2 ^ 256 will be reduced to 2 ^ 16) As I already said, there are Bitcoin Twins Addresses. My theoretical algorithm can calculate this with the help of "Vector Mathematics".
For calculations, I use the program "MATLAB" https://mathworks.com
To start my mechanism, I need to know one private key from 10,000,000 Bitcoin Addresses. As I wrote at the beginning, all these Bitcoin Addresses have a zero balance. I chose them not by chance. All these addresses will be used in the algorithm as a starting point. In order to start the movement I need a starting point. The starting point is a private number. If you translate this number into Hex format via the “Decimal to Hex” script, you get a Private Key of 256bit. My goal and task is to find this number!
When everything is ready, I will post my development in the ArXiv service to the site: https://arxiv.org
People who will help me will not stand aside! I promise!!!
Write me my contact details:
EMAIL: [email protected]
VK: https://vk.com/mistercooper
FB: https://www.facebook.com/dmitry.bazhenovsky
I uploaded these 10,000,000 Bitcoin Addresses to the Google Drive cloud service.
Google Drive: https://drive.google.com/file/d/1KFTPpH8fmw_44Ns0F3mEOFXXjzOQecVG
Screenshot: https://pp.userapi.com/c846524/v846524528/11f8f2/3xaG5fkuKaA.jpg
Source & Binaries available here:
https://github.com/brichard19/BitCrack
https://github.com/brichard19/BitCrack/releases
They say who has a powerful computer and who has video cards. This program processes more than 60,000,000 Bitcoin Addresses for PrivKey in 1 second.
Details: https://bitcointalksearch.org/topic/m.45671660
As for the video card, there must be a 64 bit operating system. For the work process used Toolkit CUDA 9.2
Dear friends! I want to offer you cooperation.
Who has a powerful computer and who has several video cards, find me one private key from 10,000,000 Bitcoin Addresses using the BitCrack program.
As I wrote in the beginning. I will thank you with good money. I have money. I am on the verge of a scientific discovery and I need your help.
I do not hide my identity, my name is Dmitry Bazhenovsky. I live in the Russian Federation in the beautiful city of St. Petersburg, where Grigori Perelman comes from is one of the famous mathematicians of our century. The man who proved the of Poincaré conjecture. https://en.wikipedia.org/wiki/Poincar%C3%A9_conjecture
My research is almost in the same direction.
Having learned one private key with the help of my algorithm, I can find out the private keys to 10,000,000 Bitcoin Addresses.
Each address out of 10,000,000 Bitcoin Addresses has a symmetry. I call these symmetries the Bitcoin Twin Addresses. Each twin has 10,000,000 similar Bitcoin Addresses. With the help of my research, I can reduce the generation of busting from a private key to a public key to the very minimum. (This means that the number of brute force 2 ^ 256 will be reduced to 2 ^ 16) As I already said, there are Bitcoin Twins Addresses. My theoretical algorithm can calculate this with the help of "Vector Mathematics".
For calculations, I use the program "MATLAB" https://mathworks.com
To start my mechanism, I need to know one private key from 10,000,000 Bitcoin Addresses. As I wrote at the beginning, all these Bitcoin Addresses have a zero balance. I chose them not by chance. All these addresses will be used in the algorithm as a starting point. In order to start the movement I need a starting point. The starting point is a private number. If you translate this number into Hex format via the “Decimal to Hex” script, you get a Private Key of 256bit. My goal and task is to find this number!
When everything is ready, I will post my development in the ArXiv service to the site: https://arxiv.org
People who will help me will not stand aside! I promise!!!
Write me my contact details:
EMAIL: [email protected]
VK: https://vk.com/mistercooper
FB: https://www.facebook.com/dmitry.bazhenovsky
I uploaded these 10,000,000 Bitcoin Addresses to the Google Drive cloud service.
Google Drive: https://drive.google.com/file/d/1KFTPpH8fmw_44Ns0F3mEOFXXjzOQecVG
Screenshot: https://pp.userapi.com/c846524/v846524528/11f8f2/3xaG5fkuKaA.jpg
November 05, 2018, 04:33:51 PM
I will not convince you and prove something.
You sound like the people that are asking for an investment and guarantee they will return your money x2/5/10/100 in a day/week/month. If they had the ability to do that, they could start with a dollar and be a millionaire in no time.
If you have "derived a formula" that lets you brute force private keys in seconds, then there is no reason for you to be here talking to us. You can just use your formula to become a millionaire in no time at all. You won't because you can't.
November 04, 2018, 05:17:55 PM
Maybe I found a vulnerability in an elliptic curve.
No, you didn't.
I derived a formula that can reduce the possibility of busting through PrivKey. Allowable search 2 ^ 256 can be reduced to 2 ^ 16 and all this is possible through my research.
No, that's bullshit. 2^16 can be checked within a few seconds. No reason for you to write this post if you could gain millions of BTC in the same time.
At least you tried.
I will not convince you and prove something. Just understand all these 10 million Bitcoin addresses I picked up for a reason. This is the starting point by which you can bend the elliptic curve. and then you can reduce to a minimum.
Nobody is going to help you if you refuse to show any proof. Besides, it is highly unlikely that you found a vulnerability in an elliptic curve. You realize that such a thing would be a scientific breakthrough?
November 04, 2018, 12:03:57 PM
Maybe I found a vulnerability in an elliptic curve.
No, you didn't.
I derived a formula that can reduce the possibility of busting through PrivKey. Allowable search 2 ^ 256 can be reduced to 2 ^ 16 and all this is possible through my research.
No, that's bullshit. 2^16 can be checked within a few seconds. No reason for you to write this post if you could gain millions of BTC in the same time.
At least you tried.
I will not convince you and prove something. Just understand all these 10 million Bitcoin addresses I picked up for a reason. This is the starting point by which you can bend the elliptic curve. and then you can reduce to a minimum.
November 04, 2018, 11:06:44 AM
Maybe I found a vulnerability in an elliptic curve.
No, you didn't.
I derived a formula that can reduce the possibility of busting through PrivKey. Allowable search 2 ^ 256 can be reduced to 2 ^ 16 and all this is possible through my research.
No, that's bullshit. 2^16 can be checked within a few seconds. No reason for you to write this post if you could gain millions of BTC in the same time.
At least you tried.
November 04, 2018, 10:50:17 AM
Maybe I found a vulnerability in an elliptic curve. I derived a formula that can reduce the possibility of busting through PrivKey. Allowable search 2 ^ 256 can be reduced to 2 ^ 16 and all this is possible through my research. My scientific work is based on the identification of vulnerability.
November 02, 2018, 12:09:59 AM
Greetings to all friends. I have such a problem. I am writing a term paper on cryptography analysis. I need to find at least one private key out of 10 million Bitcoin Addresses. All these Bitcoin addresses have a zero balance. My goal is not to make money. That is, do not enrich themselves at the expense of other people's money. This is a course and research work on cryptography. Now I can not explain everything in more detail. But to continue my research I need to know one or two private keys of 10 million Bitcoin addresses. For your help I will thank you with a certain amount of money. I uploaded these 10,000,000 bitcoin addresses to the Google Drive cloud service. Help me please.
Google Drive: https://drive.google.com/file/d/1KFTPpH8fmw_44Ns0F3mEOFXXjzOQecVG
Screenshot:
Contacts:
EMAIL: [email protected]
VK: https://vk.com/mistercooper
FB: https://www.facebook.com/dmitry.bazhenovsky
Google Drive: https://drive.google.com/file/d/1KFTPpH8fmw_44Ns0F3mEOFXXjzOQecVG
Screenshot:
Contacts:
EMAIL: [email protected]
VK: https://vk.com/mistercooper
FB: https://www.facebook.com/dmitry.bazhenovsky
I think it will be impossible to do such thing because bitcoin addresses and private keys combinations are very very much.
You may can create random private keys and get some addresses, but i doubt it will be the one from 10millions addresses you provide.
Anyway, good luck for they who want to try finding the private key.
November 01, 2018, 04:56:28 AM
I guess you'd have to be a genius to do that. There are so many numbers and letters in the document that when you look at them, your eyes run away.
October 31, 2018, 09:05:43 PM
Why would you need to brute force a private key for cryptography analysis? Simple math should say that this is nearly impossible to do. There's little analysis or research involved.
If you're trying to find out ways to crack a private key other than brute forcing, you're going to be very disappointed.
If you're trying to find out ways to crack a private key other than brute forcing, you're going to be very disappointed.
October 31, 2018, 05:41:59 PM
It is impossible to achieve that since the probability of finding any of the bitcoins addressess that the private key can access is zero.The private key when randomly generated will give you a bitcoin wallet address that is empty but not one that has somebody funds sitting in it.
October 31, 2018, 05:06:23 PM
1 private key in 10,000,000 addresses? You'll have to include a lot of addresses before you can stumble into a collision. With all the 2^160 possible address combination, it is quite improbable that you'll see a private key in the first 10M addresses. Not to mention that you will have to exhaust a lot of computing power and energy before you come close to your projected analysis/results. Asking for help here in this forum is a dire effort as almost all members understands that it's just not possible to extract a private key out of the computing power and method we have right now.
October 31, 2018, 02:45:26 PM
Short answer: Impossible.
Long answer:
The keyspace is way too big to bruteforce a private key to a specific (or even 1 out of 10.000.000 random) address(es).
You'd need more energy than available on the planet to try out each possible combination.
I hope you are not relying on your analysis to be successful. It won't. Math prohibits that.
Long answer:
The keyspace is way too big to bruteforce a private key to a specific (or even 1 out of 10.000.000 random) address(es).
You'd need more energy than available on the planet to try out each possible combination.
I hope you are not relying on your analysis to be successful. It won't. Math prohibits that.
October 31, 2018, 09:51:29 AM
Greetings to all friends. I have such a problem. I am writing a term paper on cryptography analysis. I need to find at least one private key out of 10 million Bitcoin Addresses. All these Bitcoin addresses have a zero balance. My goal is not to make money. That is, do not enrich themselves at the expense of other people's money. This is a course and research work on cryptography. Now I can not explain everything in more detail. But to continue my research I need to know one or two private keys of 10 million Bitcoin addresses. For your help I will thank you with a certain amount of money. I uploaded these 10,000,000 bitcoin addresses to the Google Drive cloud service. Help me please.
Google Drive: https://drive.google.com/file/d/1KFTPpH8fmw_44Ns0F3mEOFXXjzOQecVG
Screenshot: https://pp.userapi.com/c846524/v846524528/11f8f2/3xaG5fkuKaA.jpg
Contacts:
EMAIL: [email protected]
VK: https://vk.com/mistercooper
FB: https://www.facebook.com/dmitry.bazhenovsky
Google Drive: https://drive.google.com/file/d/1KFTPpH8fmw_44Ns0F3mEOFXXjzOQecVG
Screenshot: https://pp.userapi.com/c846524/v846524528/11f8f2/3xaG5fkuKaA.jpg
Contacts:
EMAIL: [email protected]
VK: https://vk.com/mistercooper
FB: https://www.facebook.com/dmitry.bazhenovsky
Jump to: