如何解决我如何生成串行wif密钥,程序在python中只生成一个密钥
如何生成至少包含 1000 个密钥的串行 Wif 密钥?我使用的代码只生成一个键,我想要更多。请你能帮帮我吗?我尝试更改它,但它仍然有效。我想要的只是产生更多。
我用来生成 1 个 wif 密钥的代码可以在下面找到,
import os
import hashlib
def run(name):
print("{} started!".format(name))
def sha256(data):
digest = hashlib.new("sha256")
digest.update(data)
return digest.digest()
def ripemd160(x):
d = hashlib.new("ripemd160")
d.update(x)
return d.digest()
def b58(data):
B58 = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"
if data[1] == 1:
return "1" + b58(data[1:])
x = sum([v * (256 ** i) for i,v in enumerate(data[::-1])])
ret = ""
while x > 0:
ret = B58[x % 58] + ret
x = x // 58
return ret
class Point:
def __init__(self,x=0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798,y=0x483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8,p=2**256 - 2**32 - 2**9 - 2**8 - 2**7 - 2**6 - 2**4 - 1):
self.x = x
self.y = y
self.p = p
def __add__(self,other):
return self.__radd__(other)
def __mul__(self,other):
return self.__rmul__(other)
def __rmul__(self,other):
n = self
q = None
for i in range(256):
if other & (1 << i):
q = q + n
n = n + n
return q
def __radd__(self,other):
if other is None:
return self
x1 = other.x
y1 = other.y
x2 = self.x
y2 = self.y
p = self.p
if self == other:
l = pow(2 * y2 % p,p-2,p) * (3 * x2 * x2) % p
else:
l = pow(x1 - x2,p) * (y1 - y2) % p
newX = (l ** 2 - x2 - x1) % p
newY = (l * x2 - l * newX - y2) % p
return Point(newX,newY)
def toBytes(self):
x = self.x.to_bytes(32,"big")
y = self.y.to_bytes(32,"big")
return b"\x04" + x + y
def getWif(privkey):
wif = b"\x80" + privkey
wif = b58(wif + sha256(sha256(wif))[:4])
return wif
if __name__ == "__main__":
randomBytes = os.urandom(32)
print(" " + getWif(randomBytes))
提前致谢!
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。