my dear friends everything in this world have footprint, just need to reverse your brain for find root get bitcoin core first version v1.0, install and run, and use firewall monitor, you will see v1.0 try to connect server, server root is brazil country, mean, when satoshi (nickname, and i know his real name too  ) create v1.0 and try to connect local server, for geenrate block 0 if server connection is brazil ip, you can investigate further, ip city state, and university too then collect university prof..'s names, in subject math and others, and check their history, more tips, person in brazil, phd, came from california/usa, visited japan, and why went to japan  , rest you can research yourself and dont ask me more Q about this subject Thankx |
|
|
|
if you see secp256k1 (c++) lib - something going on. not sure if they're using sse at least but i see some progress
yes secp256k1 (c++) lib and pure c script/tools for basic point addition/mul/sub other saying we write c code for python, but only could run over python, mean slow speeds, actually engine loaded on donkey and saying enging speed, they need load donkey over engine, then say engine speed pure c speed 100x over python and then c to cuda, speed 10000x over python/c let see who catch idea'a |
|
|
|
Did you find the key?
I thought you found the key.  64 puzzle found by this command, and modify rotar cuda from 1b to 6m keys search at cpu level (13-6100) uses gpu inside cpu where speed is 6m keys/s ./Rotor -t 4 -m address --coin BTC -r 2 -o newout.txt --range 8000000000000000:ffffffffffffffff 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN modify file Rotar.cpp line 3289 if ((count - lastrKey) > (1000000000 * rKey)) { to if ((count - lastrKey) > (6000000 * rKey)) { depand at your gpu speed, check whats your speed by run bitcrack, if its about 500m/s, then adjust your keys at line 3289 compile, and run for others puzzle |
|
|
|
Did you find the key?
I thought you found the key. 64 puzzle found by this command, and modify rotar cuda from 2b to 6m keys search at cpu level (13-6100) uses gpu inside cpu where speed is 6m keys/s ./Rotor -t 4 -m address --coin BTC -r 2 -o newout.txt --range 8000000000000000:ffffffffffffffff 16jY7qLJnxb7CHZyqBP8qca9d51gAjyXQN |
|
|
|
don't wait for someone to code CUDA GPU try test https://github.com/iceland2k14/secp256k1still use CPU but better than simple python but the result get is pubkey base I know CUDA GPU fast than 1000x time how fast between compare speed python ecdsa+gmpy2 (pip install ecdsa[gmpy2]) python + fastecdsa (can use only on Linux or WSL2, can not use in windows) python + iceland2k14/secp256k1 (dll on windows) have other options available for fast point addition , multiplication on CPU tried but not fruitful , most similar to fastecdsa speed, only gpu based speed will increase, and all gpu developers are just copy paste each other source code for just increament from privatekeys to addresses/hash160, maybe they dont have time to build as per different calc based, above is very simple basic of point add/sub/mul by intg or pubkey(point), let see which one developer jump with creative mind |
|
|
|
compress to uncompress import binascii
p = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F
def decompress_pubkey(pk):
x = int.from_bytes(pk[1:33], byteorder='big')
y_sq = (pow(x, 3, p) + 7) % p
y = pow(y_sq, (p + 1) // 4, p)
if y % 2 != pk[0] % 2:
y = p - y
y = y.to_bytes(32, byteorder='big')
return b'\x04' + pk[1:33] + y
with open('add.txt') as f:
for line in f:
line=line.strip()
print(binascii.hexlify(decompress_pubkey(binascii.unhexlify(line))).decode(),file=open("uncomp.txt", "a")) uncompress to compress def cpub(x,y):
prefix = '02' if y % 2 == 0 else '03'
c = prefix+ hex(x)[2:].zfill(64)
return c
with open('add.txt') as f:
for line in f:
line=line.strip()
x = int(line[2:66], 16)
y = int(line[66:], 16)
pub04=cpub(x,y)
print(pub04,file=open("comp.txt", "a"))
|
|
|
|
compress to uncompress import binascii
p = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F
def decompress_pubkey(pk):
x = int.from_bytes(pk[1:33], byteorder='big')
y_sq = (pow(x, 3, p) + 7) % p
y = pow(y_sq, (p + 1) // 4, p)
if y % 2 != pk[0] % 2:
y = p - y
y = y.to_bytes(32, byteorder='big')
return b'\x04' + pk[1:33] + y
with open('add.txt') as f:
for line in f:
line=line.strip()
print(binascii.hexlify(decompress_pubkey(binascii.unhexlify(line))).decode(),file=open("uncomp.txt", "a")) uncompress to compress def cpub(x,y):
prefix = '02' if y % 2 == 0 else '03'
c = prefix+ hex(x)[2:].zfill(64)
return c
with open('add.txt') as f:
for line in f:
line=line.strip()
x = int(line[2:66], 16)
y = int(line[66:], 16)
pub04=cpub(x,y)
print(pub04,file=open("comp.txt", "a"))
|
|
|
|
python scripts, peoples have from more then 8 years, its always seems slow against c++ and more cuda, maybe peoples dont have time or logic to play trillions keys calc, max they need to calc (not to play) few hundrds or thousands
but as i need to calc key for 125 and 130 puzzle, i need little bit more fast calc, only cuda could help on this stage
Optimize whatever CUDA code you find, but in the long run, you gotta either run a distributed CUDA cracker, or write one for FPGAs. Think of it like 2013 mining difficulty becoming too high for GPUs. no need distributed CUDA cracker, simple python do is by lib fastecdsa or ecdsa where you do pubkey + pubkey, pubkey - pubkey, pubkey * 123 int value etc same no advancement, no hard programming, rgis logic to cuda process cpu process like 200k/s etc and cuda run millions/s or 2g/s, depand on cuda device hope cuda developer understand about this simple method on ecdsa workout |
|
|
|
I think the next calculation maybe need CUDA GPU to calculate with massive number calculate (maybe style like brute force calculate)
maybe you can find cheap coder CUDA on Fiverr
another way fast calculate without GPU is to try using python with multiprocess (multi-core CPU) to replace
of course, it is still slower than using CUDA GPU to calculate
AMD Ryzen Threadripper 3990X 64-Core, 128-Thread cost over $7000 still expensive same cust of hi-end 2GPU)
programmer CUDA will be coded if they interesting in that idea
python scripts, peoples have from more then 8 years, its always seems slow against c++ and more cuda, maybe peoples dont have time or logic to play trillions keys calc, max they need to calc (not to play) few hundrds or thousands but as i need to calc key for 125 and 130 puzzle, i need little bit more fast calc, only cuda could help on this stage |
|
|
|
with reference of old post https://bitcointalk.org/index.php?topic=5244940.msg55421924#msg55421924if i explain your word in easy example commands for new gpu based develop application/repo, by jean luc or other developer, could be develop, or if any one know already developed can post links and refferance here are some example aspected commands ./vs-pub -c -gpu -input in.txt -output out.txt -add 0250863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B2352 #pubkey ./vs-pub -c -gpu -input in.txt -output out.txt -mul 123456789 # its privatekey in num (not hex) ./vs-pub -c -gpu -input in.txt -output out.txt -sub 0250863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B2352 #pubkey ./vs-pub -c -gpu -input in.txt -output out.txt -sub 0250863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B2352 -r (reverse like 02508... pubkey substract to all listed pubkey inside in.txt -c is compressed pubkey -u is uncompressed pubkey -input is load of compressed/uncompressed pubkeys list -output is results output to file -r is reverse of sub ( listed pubkey in command minus(-) in.txt (pubkeys) had any one worked and created ? |
|
|
|
-snip- I have some functions in Python and it runs very slow compared to C. The sage I want to do with the GPU is as follows Pr = 115792089237316195423570985008687907853269984665640564039457584007908834671663
E = EllipticCurve (GF (P), [0,7])
N = E.order ()
G = E(55066263022277343669578718895168534326250603453777594175500187360389116729240,32670510020758816978083085130507043184471273380659243275938904335757337482424) # on E
T = E(26864879445837655118481716049217967286489564259939711339119540571911158650839,29571359081268663540055655726653840143920402820693420787986280659961264797165) # on E
numInt = 5646546546563131314723897429834729834798237429837498237498237489273948728934798237489723489723984729837489237498237498237498237498273493729847
numMod = numInt %N
numInv = pow(numMod ,N-2,N) # detail -> https://stackoverflow.com/questions/59234775/how-to-calculate-2-to-the-power-of-a-large-number-modulo-another-large-number
numMod * G
numMod * T
(T-G) * numInv
print (5*T)
print (2*G)
print (numMod * G)
print (numMod * (-G))
print (numMod * T)
print ((numMod-3) * (T-G)) Do you have any suggestions? What should I do ? I wrote my question here because it is indirectly related to this project. Please forgive. Hi! The slowest part in your python is inverse function. Try to implement gmpy2 inverse function (included in gmpy2) - it is C-based and very fast: https://www.lfd.uci.edu/~gohlke/pythonlibs/#gmpyYou can find the details here: https://bitcointalk.org/index.php?topic=5245379.msg55214449#msg55214449When using Python, I use FastEcdsa( https://github.com/AntonKueltz/fastecdsa) library and mathematics similar to Sage. But can I do the math faster? I want to understand. The FastEcdsa Library is fast, but I don't know if it uses the gmpy2 you suggested. My python script uses 17% of the CPU as a result. I wanted to write with Anaconda (for GPU), but I could not find a gpu running as fast as C or I could not. Thank you MrFreeDragon . No. you can't be faster then GPU on your CPU. if i explain your word in easy example commands for new gpu based develop application/repo, by jean luc or other developer, could be develop, or if any one know already developed can post links and refferance here are some example aspected commands ./vs-pub -c -gpu -input in.txt -output out.txt -add 0250863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B2352 #pubkey ./vs-pub -c -gpu -input in.txt -output out.txt -mul 123456789 # its privatekey in num (not hex) ./vs-pub -c -gpu -input in.txt -output out.txt -sub 0250863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B2352 #pubkey ./vs-pub -c -gpu -input in.txt -output out.txt -sub 0250863AD64A87AE8A2FE83C1AF1A8403CB53F53E486D8511DAD8A04887E5B2352 -r (reverse like 02508... pubkey substract to all listed pubkey inside in.txt -c is compressed pubkey -u is uncompressed pubkey -input is load of compressed/uncompressed pubkeys list -output is results output to file -r is reverse of sub ( listed pubkey in command minus(-) in.txt (pubkeys) had any cuda dev worked on these commnand based some scripts ? |
|
|
|
Don't use -u switch Why? sort --help
-u, --unique with -c, check for strict ordering;
without -c, output only the first of an equal run This has the same result as sort | uniq, and gets the job done. -u, --unique this mean you have more then same addresses at different lines, actually mean duplicate, btw you dont have duplicate as i see last year your files without -u your sort will be right in order for duplicate remove you can use perl command for big files, no memory issue/error perl -ne'print unless $_{$_}++' big-file.txt >> dup-remove.txt for duplicate awk command will give errors, even you have big ram, but perl work best sort -u will no right in order results, better use simple sort |
|
|
|
But the file you've downloaded from me should have been sorted already. Indeed I can see that the file is sorted, but different-case-sensitive than the expected by comm program. Can you share what you did exactly? I tested it, and comm didn't complain about the sorting order: comm -12 all_Bitcoin_addresses_ever_used_sorted.txt test.txt I create all_Bitcoin_addresses_ever_used_sorted.txt.gz by piping all data through sort -u -S30%, so no additional sort should be necessary. Don't use -u switch |
|
|
|
|
first sort used big file of addresses , if you have already sorted, thats good
2nd your dumped addresses from your wallet file
3rd sort your dumped addresses
simple command will let you get result
join your-dump-sorted-file.txt your full-big-sorted-list.txt >> result.txt
extra note if you have latest addresses files from web, its look example
1111111111111111111114oLvT2 28314777925
111111111111111111112BEH2ro 10940
111111111111111111112czxoHN 282440
111111111111111111112xT3273 5945
then extract addresses command
awk '{print $1}' addresses-list-18-gb.txt >> result-addresses.txt
then sort
sort result-addresses.txt >> result-addresses-sorted.txt
then start from top
|
|
|
|
i don;t understand I can make valid new transactions from valid transaction but need pubkey and r,s,z from this transaction if you give me pubkey and r,s,z then I will give you sample few transactions as valid original RSZ from 120 R: 00a285a9151ac1f9c40e88a2a80b79c702336536462a9390fd00dda999da45420a S: 1844883eb808df18a9138ee2c13439ecf716799edcf073772f2696e4f9384f58 Z: 7e17cf7c5b7ccfaa4c7c05874e4fb4f12661662b8e33188e2e62b3739931ade5 PubKey: 02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630 |
|
|
|
Each one can scan 23 TKey/s using CuBitcrack or the whole 16 Tesla's GPUs?
I don't think there's a method to crack puzzles fast, unless of course if you have public key.
All you can do in my opinion is to search randomly in puzzle 64 using 16 Tesla's GPUs with the speed of 23TKey/s and hope for luck to get the private key.
if you perform 23 TKey/s you need modified bitcrack and my list that will take 7 days to find |
|
|
|
Thank u brother.
Have you checked which address type the codes you have written give you? compressed? not compressed?
I'm new to this puzzle. but
For 4 years I started to think that's why puzzle 64 was not solved.
You're welcome! all addresses we are looking for are compressed... Greetings guys, unrelated to the topic, but I have a question. I have 3000 publickey data. and I am looking for python code to convert them to btc address in bulk. can you help. |
|
|
|
paniker this is meaning that you can change the n's
modular elliptic curve
Total of all the wallets n is the last number. n= 115792089237316195423570985008687907852837564279074904382605163141518161494337 (In Dec)
n = 0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141 (In HEX)
Half way of n n//2 = 57896044618658097711785492504343953926418782139537452191302581570759080747169
57896044618658097711785492504343953926418782139537452191302581570759080747169 Lenght Bits = 255
very nice and thanks to boris.. you still here..
yes I am still here, this was the only thing I have found so far. Half way of n n//2 is wrong, check in above posts, mention clearly formula for div thankx do you mean the last "6" , 115792089237316195423570985008687907852837564279074904382605163141518161494337 ? here is script for div for 2 import gmpy p = 115792089237316195423570985008687907852837564279074904382605163141518161494337 c = gmpy.invert(2,p) %p print (c) for div 10 import gmpy p = 115792089237316195423570985008687907852837564279074904382605163141518161494337 c = gmpy.invert(10,p) %p print (c) same modify for your requirements |
|
|
|
|
Show Posts
