Bitcoin Forum
May 10, 2024, 08:33:21 AM *
News: Latest Bitcoin Core release: 27.0 [Torrent]
 
  Home Help Search Login Register More  
  Show Posts
Pages: « 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 [43]
841  Bitcoin / Bitcoin Discussion / Re: == Bitcoin challenge transaction: ~100 BTC total bounty to solvers! ==UPDATED== on: March 09, 2021, 04:23:27 PM
Quote from: fxsniper on March 08, 2021, 07:29:03 AM
if scan all it use a time too much

Depent of your speed, i made some calculations based on the speed, the time is for scan all the range in that bit space:

Code:
Puzzle 120 @ 1 Terakeys/s :     21074771622667996 years
Puzzle 120 @ 1 Petakeys/s :     21074771622667 years
Puzzle 120 @ 1 Exakeys/s :      21074771622 years
Puzzle 120 @ 1 Zettakeys/s :    21074771 years
Puzzle 120 @ 1 Yottakeys/s :    21074 years
Puzzle 160 @ 1 Terakeys/s :     23171956451847141650870193314 years
Puzzle 160 @ 1 Petakeys/s :     23171956451847141650870193 years
Puzzle 160 @ 1 Exakeys/s :      23171956451847141650870 years
Puzzle 160 @ 1 Zettakeys/s :    23171956451847141650 years
Puzzle 160 @ 1 Yottakeys/s :    23171956451847141 years
Puzzle 256 @ 1 Terakeys/s :     1835871531540401373407708412745559168131740612197318060720 years
Puzzle 256 @ 1 Petakeys/s :     1835871531540401373407708412745559168131740612197318060 years
Puzzle 256 @ 1 Exakeys/s :      1835871531540401373407708412745559168131740612197318 years
Puzzle 256 @ 1 Zettakeys/s :    1835871531540401373407708412745559168131740612197 years
Puzzle 256 @ 1 Yottakeys/s :    1835871531540401373407708412745559168131740612 years

I know there is no puzzle 256, but that is the exact time for the real wallets.


Quote from: fxsniper on March 08, 2021, 07:29:03 AM
if can fine keyspace  low than 2^30 to 2^40 may be better ot less 1 days scan complate (Max 2^50)

(2^ 60 too high)

I also implement BSGS in C, in my tool Keyhunt, is not so fast, but the puzzle 63 can be solved in one hour or two. Also in minutes is you have some luck with  Random mode.

Quote from: fxsniper on March 08, 2021, 07:29:03 AM
other puzzle no pubkey  still no idea what to do?

Puzzles without publickey are more slow, that is why puzzle 64 is stll not found.

Regards!
842  Bitcoin / Project Development / Re: Keyhunt - development requests - bug reports on: March 06, 2021, 09:37:21 PM
Quote from: WanderingPhilospher on March 06, 2021, 09:20:23 PM
Work on windows?


Only with the Ubuntu shell for windows, or maybe some cgywin enviroment.

Yes speed is a little slow, but is CPU and RAM only, i can get the double of that speed wit the double of threads and RAM but my server is running some other things.

I can reach to some 2 Petaleys/s and some other friends with highend servers can reach more that 10 Petakeys/s.

I'm working in some other approach and trying to get a better performance but is still a work in development.

Best regards!
843  Bitcoin / Project Development / Re: Keyhunt - development requests - bug reports on: March 06, 2021, 08:23:30 PM
you can use the bPfile.c to generate your .bin file ( this is the baby step table)


Code:
./bPfile 1048576000 Pfile.bin
[+] precalculating 1048576000 bP elements in file Pfile.bin

This process can take some time, please be patient, maybe some hour depent of your speed.

Once that the file is already created, execute:

Code:
albertobsd $ ./keyhunt -m bsgs -f 120.txt -r 800000000000000000000000000000:FFFFFFFFFFFFFFFFFFFFFFFFFFFFFF -t 4 -k 250 -R -p ./bPfile.bin
[+] Version 0.1.20210306 K*BSGS
[+] Setting mode BSGS
[+] Setting 4 threads
[+] Setting k factor to 250
[+] Setting random mode.
[+] Opening file 120.txt
[+] Added 1 points from file
[+] Setting N up to 17593008128000.
[+] Init bloom filter for 1048576000 elements : 1797.00 MB
[+] Allocating 0.00 MB for aMP Points
[+] Precalculating 16778 aMP points
[+] Allocating 16000.00 MB for bP Points
[+] Reading 1048576000 bP points from file ./bPfile.bin

-k 250 is new factor of speed, 250 use some more of 17 GB of RAM.

But the speed will be huge:

Quote
Total 155574970875904000 keys in 180 seconds: 864305393755022 keys/s

864 Terakeys/s

Best regards!
844  Bitcoin / Development & Technical Discussion / Re: Could a new type of Bitcoin encryption be put over the old one if necessary? on: March 06, 2021, 04:23:39 PM
Well, yes that can happen some day, but far in the future, maybe in some 100 or 200 years

If that happen the bitcoin will need a new fork to keep working. And yes maybe work with another Curve Size or a new kind of quantum computation-resistant cryptography.
845  Bitcoin / Development & Technical Discussion / Re: Pollards kangaroo method to reverse engineer private keys on: March 06, 2021, 04:16:50 PM
Quote from: Phillwilk on March 06, 2021, 03:51:44 PM
Thanks for the info, is there a consolidated list of the puzzles that have been solved and the likely method used to solve them?

This is one of the list:

https://bitcointalk.org/index.php?topic=5166284.0

But is not update. let me search the updated one.

Edit: this is the last update topic:

https://bitcointalk.org/index.php?topic=5218972

Best Regards!
846  Bitcoin / Development & Technical Discussion / Re: How to verify btc transactio signature with site like https://tools.qz.sg ? on: March 06, 2021, 02:52:50 PM
what kind of message are you trying to verify?

Maybe you can verify it manually with sage and follow the Signtaure verification Algorimth

https://cryptobook.nakov.com/digital-signatures/ecdsa-sign-verify-messages#ecdsa-verify-signature
847  Bitcoin / Project Development / Keyhunt - development requests - bug reports on: March 06, 2021, 02:13:56 PM
I want to open this thread to talk about the tool that i develop Keyhunt available on github.

https://github.com/albertobsd/keyhunt

Keyhunt use the BSGS algorimth to find privatekeys with the publickey, the program runs on CPU and make several use of RAM to boost the speed.

Current Version 0.2.230430 Satoshi Quest
Lastest changes on development branch


How to use

Download and build
Run againts puzzle 66 (addres mode) 13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so 6.6 BTC

Code:
./keyhunt -m address -f tests/66.txt -b 66 -l compress -R -q -s 10

You need to add -t numberThreads to get better speed

Run againts Puzzle 130 (bsgs mode) 1Fo65aKq8s8iquMt6weF1rku1moWVEd5Ua 13 BTC

Code:
./keyhunt -m bsgs -f tests/130.txt -b 130 -q -s 10 -R

You need to add -t numberThreads and -k factor to get better speed

Best regards!
848  Local / Español (Spanish) / Re: Granja de minería en Mar del Plata, Argentina on: March 06, 2021, 06:22:12 AM
Una noticia realmente buena, últimamente ya se están escuchando noticias como esta en español.

Saben si es cara la energía eléctrica en Mar del Plata?

Saludos!
849  Bitcoin / Bitcoin Discussion / Re: Where does Elon and Saylor store their bitcoins? on: March 06, 2021, 06:14:53 AM
Yes, such amount of investment need to keep some secret, in the case of the bitcoin wallets i think that the best approach is to have small amounts distributed in a lot of wallets and maybe linked to address with multisignature.
850  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle (3,350.00 BTC's ) on: March 06, 2021, 06:02:21 AM
Quote from: bytcoin on March 05, 2021, 07:52:17 PM
Clearly the newbie created an account just for this thread

Yes im new in this forum, but im moderator in other important forum, im developer i create a tool called keyhunt in C language I know more o less what im doing

At the beginning i trust in you, check my first reply i say that the signature is valid.

Quote from: albert0bsd on March 04, 2021, 11:10:38 PM
I perform a signature validation with your Nonce values r,s,h of K2 and yes your Signature is valid enough to know the K2 value, that signature is not public that is why some people get confused.

But then I realize that the signature was made from the a previous one.

I need to thank you, becuase to you i learn how to make a signature that look "different" but is mathematically the same signature. That signature can be made with public data.

Quote from: BurtW on March 05, 2021, 10:04:32 PM
... in fact, mathematically it is the same signature.


Look i'm not attacking you as a person, I'm demostrating that your signature (K2) is made from the a previous one, im using real values

Quote from: albert0bsd on March 04, 2021, 11:10:38 PM
is the same signature because:

Quote
2*r2*s1 % n = 4d27b04d19bb13563dc45d9d768a13f53f02970024759081601c4bd59aba5f76
r1*s2 % n = 4d27b04d19bb13563dc45d9d768a13f53f02970024759081601c4bd59aba5f76

and

r2*z1 % n = 3d6319695748c424ef2a249456c3a198a6ea34933ba345a8118703ef82d28977
r1*z2 % n = 3d6319695748c424ef2a249456c3a198a6ea34933ba345a8118703ef82d28977

both sides of the equation get canceled like 0=k1*0 or k1= 0/0....

Is not enogh? Well then please prove otherwise.

I really wish that you was rigth.

thank you, best regards
851  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle (3,350.00 BTC's ) on: March 05, 2021, 10:35:58 AM
Quote from: SUPERMANULTRA on March 05, 2021, 06:27:21 AM
so this means none won this yet?? Maybe I am gonna get it to some university professor and let's see if he can calculate it
.

Please do it.
852  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle (3,350.00 BTC's ) on: March 04, 2021, 11:10:38 PM
Quote from: COBRAS on March 03, 2021, 08:59:53 PM
why your second P is differert from first P ?

I think that the different P point is the previous point but halving if you see its the same n value, so the only way to get (K1 / 2 = K2) , is halving N or halving the point.

the challenge look interesting at my first try i get 0/0 so i need to check my math.

Quote from: bytcoin on March 04, 2021, 04:48:38 PM

Signature 2:
The methods are practically the same as the first, the difference is that I created this signature with the nonce k being the half of the nonce k of the first signature
And to find out if the nonce k2 is really half of the nonce k1 ... A simple multiplication of points will tell you
The second signature was verified in the same way as the first



I perform a signature validation with your Nonce values r,s,h of K2 and yes your Signature is valid enough to know the K2 value, that signature is not public that is why some people get confused.

The formula to calculate a signature validatarion is in the next link: https://cryptobook.nakov.com/digital-signatures/ecdsa-sign-verify-messages#ecdsa-sign

BTW here is the relevant text:

Quote
The algorithm to verify a ECDSA signature takes as input the signed message msg + the signature {r, s} produced from the signing algorithm + the public key pubKey, corresponding to the signer's private key. The output is boolean value: valid or invalid signature. The ECDSA signature verify algorithm works as follows (with minor simplifications):
  • Calculate the message hash, with the same cryptographic hash function used during the signing: h = hash(msg)
  • Calculate the modular inverse of the signature proof: s1 =
  • Recover the random point used during the signing: R' = (h * s1) * G + (r * s1) * pubKey
  • Take from R' its x-coordinate: r' = R'.x
  • Calculate the signature validation result by comparing whether r' == r
The general idea of the signature verification is to recover the point R' using the public key and check whether it is same point R, generated randomly during the signing process.

The R' Point calculated is (b0c147a4046a541d051fa5f17906bc01aeb46fbe273ef9226610d2e0579dad88, 9ad7d585e8252cd19e6364203cfb29ac1962390b6b8122da679b53c37963316e)

Only one question, is solvable?

I get some 0 value while i was working with the ecuations i get some values like:

r1*z2 - r2*z1 = 0

Best regards

Edit is not solvable because the OP crafted the signature from a previous one.

is the same signature because:

Quote
2*r2*s1 % n = 4d27b04d19bb13563dc45d9d768a13f53f02970024759081601c4bd59aba5f76
r1*s2 % n = 4d27b04d19bb13563dc45d9d768a13f53f02970024759081601c4bd59aba5f76

and

r2*z1 % n = 3d6319695748c424ef2a249456c3a198a6ea34933ba345a8118703ef82d28977
r1*z2 % n = 3d6319695748c424ef2a249456c3a198a6ea34933ba345a8118703ef82d28977

both sides of the equation get canceled like 0=k1*0 or k1= 0/0....

Don't waste your time with this user anymore
Pages: « 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 [43]
Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!