|
602
|
Bitcoin / Project Development / Re: Keyhunt - development requests - bug reports
|
on: July 13, 2023, 08:37:34 PM
|
|
There is an example of the address format in the documentation, please check it.
About the speed, the hashing process for eth it is more slow than the process for Bitcoin. Also there are some calculations that can't be avoided for eth, and those calcs can be avoided for Bitcoin address then it will be more slow for eth than bitcoin
|
|
|
|
|
603
|
Bitcoin / Project Development / Small puzzle about ECDSA and other ECC things (Solved)
|
on: July 13, 2023, 03:12:46 PM
|
Hi everyone. To keep me some busy i made a small Puzzle for the members of my group in telegram. The Prize is in this Address: 17hxfkNjHb2d68PFcUKHeLLwbcwnXBTa9C it have near 100$ USD at current price. The puzzle is contained here: -----BEGIN BITCOIN SIGNED MESSAGE-----
Easy puzzle with 0.0016 BTC @ https://t.me/keyhunters
-----BEGIN SIGNATURE-----
1HZwkjkeaoZfTSaJxDw6aKkxp45agDiEzN
G8jtdFo0RCjSNC8p8qoaE/rhNh9k4uhuF2TqNgBEl2fpP71GjtKC1C3y4yxk54lKutNHH7BoGQQ5SNY2YISNGmU=
-----END BITCOIN SIGNED MESSAGE-----
I did this yesterday and it bring some spark of interest so here are some clues -----BEGIN BITCOIN SIGNED MESSAGE-----
Clues
Behind the result of the equations there are some variables that should Be also a secret
Beyond all the discussions, it is worth mentioning that all the possible legacy addresses amount is 2Λ160
Every single Byte counts, how many Bytes have this message?
This is a signed message with ECDSA. There may be some questions about it.
- How do we know the math used in ECDSA is right?
- Can someone cheat or change a signed message made with ECDSA?
- Is it possible for two different messages to have the same signature?
- How can we be sure that the person who signs a message is the real owner of the secret key and not pretending?
AlbertoBSD
-----BEGIN SIGNATURE-----
17hxfkNjHb2d68PFcUKHeLLwbcwnXBTa9C
H+a3NLPvRfoVgYgZBhvSiGY1001ylS8D5IjRbkrJ/MjlsSTCZ+rC8OIHyCFRwSHwGtIWx+xGIeR4x3nTpl1FUvY=
-----END BITCOIN SIGNED MESSAGE-----
In case that the forum messup the message here is the previous signed message in a text file https://drive.google.com/file/d/1cWlCo7ycY2-jTg575wIukx1p9YJFS2If/view?usp=sharing i already checked it and it is valid I sugest to you read ALL the documentation available.  The ECDSA documentation is here: https://cryptobook.nakov.com/digital-signatures/ecdsa-sign-verify-messagesHere is a tool to verify the signatures easily https://reinproject.org/bitcoin-signature-tool/#verifyAbout this puzzle it don't need any big computer power, but some small calcualtions are needed. There is not a single tool that solve this puzzle with a single line command you need to know what are you doing. If someone found the solution notify me here or in telegram. Regards
SolvedMessages with their signatures: @cryptobank_miki https://t.me/keyhunters/25845-----BEGIN BITCOIN SIGNED MESSAGE-----
I redeemed the puzzle, thanks Alberto!
-----BEGIN SIGNATURE-----
17hxfkNjHb2d68PFcUKHeLLwbcwnXBTa9C
IOxI39y3LonkrRkxh87shzE2b93OjKbpiVQ87lR2bUIbtD7t3vuy1vfeJpN92doYWxkWmUG8JQTxBypjb+XZ5z8=
-----END BITCOIN SIGNED MESSAGE-----
@sazilariel https://t.me/keyhunters/26241-----BEGIN BITCOIN SIGNED MESSAGE-----
Thank you Alberto for the fun!
-----BEGIN SIGNATURE-----
17hxfkNjHb2d68PFcUKHeLLwbcwnXBTa9C
H3+k7aiNOw/oXNjf9cuvQ+4aRd0QCLWWBgQ4epnYf4upO5DhsL/DB4qlD7ngEY6gqQExNw5MgZBqW2716p8BNVA=
-----END BITCOIN SIGNED MESSAGE-----
|
|
|
|
|
605
|
Bitcoin / Project Development / Re: Keyhunt - development requests - bug reports
|
on: July 10, 2023, 05:53:11 PM
|
Any output transaction? Aren't the new transaction scripts protocols avoiding exposing public keys at all? I had the idea that only in very old transactions outputs could you find public keys.
Yes any output Transaction expose the Publickey (a set of data TX script, R,S and "P" where P is the publickey ), I've not checked new Transaactions but all need to expose publickey, if the publickeys is not there maybe there is enough information to calculate the possible Keys (a set of data TX script, R,S and V, where V is some byte that can calculate the P value, just like the Ethereum network), but that is beyond of this topic. |
|
|
|
|
608
|
Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
|
on: June 12, 2023, 05:39:42 PM
|
I wonder if 20, 30 years ago there was any incentive for the math guy to try things harder
You should try to read some book of cryptography written 30 years ago, they are more close to something that US Example: A Course in Number Theory and cryptography by Neal Koblitz That have more complex and cool Math exercises to solve, that our rudimentary calculations. But yes they don't have at that moment our incentives, but they still did a really good job. |
|
|
|
|
609
|
Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
|
on: June 12, 2023, 11:17:18 AM
|
If the target key is not a prime number, you could find a divisor for it, it could either be an even number or an odd number, I guess nobody has ever tried it yet.😉
i try it two years ago, don't believe that you are the only guy who can think, i guess that some math guy already try all this some 30 or 20 years ago. |
|
|
|
|
610
|
Bitcoin / Bitcoin Discussion / Re: == Bitcoin challenge transaction: ~1000 BTC total bounty to solvers! ==UPDATED==
|
on: June 10, 2023, 05:09:43 PM
|
I am very confused about the subtracting of private keys from public keys and vice versa and also adding the private keys to the public keys. I was able to add the private keys together to get 2^125 and vice versa but where the confusion came in was when I needed to add and subtract private keys from public keys and vice versa. can you please explain more. I'm very new here. Thanks.
You can't add or subtract directly a privatekey (K) to a publickey (B). You need first calculte the publickey of K (A) and them you need to do the Add or substraction operation bewteen the publcikeys A + B or A - B etc.. |
|
|
|
|
612
|
Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
|
on: June 05, 2023, 09:51:54 PM
|
Private Key Public key
1090246098153987172547740458951748 # puzzle 110 0309976ba5570966bf889196b7fdf5a0f9a1e9ab340556ec29f8bb60599616167d
...
1 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798
That is easy if you have the privatekey (X = X % 2 ? X/2 : (X-1)/2), but we can't do that if we don't have the privatekey, because there is no way that know if the publickey belongs to an even or odd privatekey. But proof your self and show us.. here is a Publickey in the 110 bit range: 0301040c4e33b6ab297ba2a9c2858d15be5f6844febfc003ef7646796608f7f819 |
|
|
|
|
613
|
Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
|
on: June 05, 2023, 12:38:20 AM
|
Hello.
Could you share your algorithm?
I wonder how you managed this: "Puzzle 115 pubkey and reduced it to 2**28 bits in 2 seconds".
Sincerely,
be healthy.
Don't believe in that, it is fake. fake
Agree. Why from 115 to 28 bits? in that case why not up to 1 bit? Guys please don't believe in that, in any case we only need to know one bit on the right side to break ECDSA |
|
|
|
|
614
|
Bitcoin / Project Development / Re: keysubtracter - test - development requests - bug reports
|
on: June 03, 2023, 11:37:38 AM
|
Uhh! hey there team mates! I was wondering what is the reason to select an even -n to add and subtract, if I set -n 5, what happens? Also selecting an even number which is a combination of 2 odd numbers will add/subtract odd numbers. Or is it OK to do that?
The program create the same amount of keys In both sides of your target example: +Key M
+Key ...
+Key 3
+Key 2
+Key 1
Target
-Key 1
-Key 2
-Key 3
-Key ...
-Key M
That is why N should be Even: if you want some subtract some odd numbers you need to play a little with the size of the range -r from:to divided bewteen the number N example: Range 25 (19 Hex) divided bewteen 10 ./keysubtracter -p 02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630 -n 10 -r 0:19
02231c58426010a60de22090bf73cc0ea14f1040273d5be74bc425cf7a82bb9c00 # - 5
033cdd67ebf89b79c953c8ca9b248a859aff02ebd69a4f17a850fa037cde0723b2 # + 5
023e40191ed19ba1c82d3948ffad7d11efc7352e8a071b09750fc0a62cba295f15 # - 10
02ad82cfd538d8f9a98ea7d2393a958962d3dd783456284353084ad74e459ca98c # + 10
02fca272f04368cc4e00cf283e075f1e6cace4754a4319c34258867f73c479f883 # - 15
0210bc32a1bcb978121653cfb6eba088969c3a7271cef1000e355da9785c74cf57 # + 15
029649575661e11d5c7c277d008c7a6d6a56c14824e31673a5a49809f94777858e # - 20
02a1c7e1fffa740388689234491047208e0f7c23a9bee61b61ef035a6d016a709c # + 20
020cbbd8790c965eab7f5ea396fe65e1ca3eb2e41febcc1a372159277adb8f8dd6 # - 25
033d21a2c11b8b32afeac80d3f1b391d98b388dd4ab78ca3926571114d7cc28ad8 # + 25
02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630 # target
Odd numbers every ending 5 Range 15 (F Hex) divided bewteen 10 ./keysubtracter -p 02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630 -n 10 -r 0:F
0379c92f7fca55ac0710de44e86e31cf50742e63206af99e19d69a2fb9a179b82e # - 3
035738dc2e02ce16ab3d169ecd252154c763e5c9daaa8497ac3f0b8636ced8e6bd # + 3
02c88af07db06461a231177c827e43c8fe3d8aa5a19ba067b76d5ef41c8a29e4e0 # - 6
03b7d0c69eb53fa7008224d802e6bc2e56e9e11d00c575b91a9bde5f44556d3469 # + 6
03f3d29f5ec05cff300fc951e6e85b4707998473707d0a3e27f3ec0b3f5aab41e6 # - 9
03bc31bb00836f096f24cf8b8382e68011e71081919360dace116701074aa64684 # + 9
03d132cb27b0d70ee54c853eb4373b993847dca55ee66a1bb6f5b95a63db7eed8e # - 12
02e3ebf6a1ebf608fd9c70127d4f1f9da9adba02a3a3f1dee38d6396d2f0ac3aa4 # + 12
02fca272f04368cc4e00cf283e075f1e6cace4754a4319c34258867f73c479f883 # - 15
0210bc32a1bcb978121653cfb6eba088969c3a7271cef1000e355da9785c74cf57 # + 15
02ceb6cbbcdbdf5ef7150682150f4ce2c6f4807b349827dcdbdd1f2efa885a2630 # target
Odd numbers 3,9,15 I hope this examples help you |
|
|
|
|
615
|
Bitcoin / Project Development / Re: Keyhunt - development requests - bug reports
|
on: June 01, 2023, 04:54:23 AM
|
Still no words about the system you were supposed to buy with a few grands you received as a donation a couple of months ago? Maybe you live far far away from civilization, that's why it has taken you so long!
~regards.😉
I'm going to go for the computer tomorrow, they already assembled it. I hope start the developing for GPU ASAP
Guys i release some kind of server for BSGS if some of you want to test it. I did some separate readme for it BSGSD.md I hope you like it |
|
|
|
|
618
|
Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
|
on: May 26, 2023, 05:23:28 PM
|
in the range
decimals
400000000000000000000000000000000000000000000000000000000000:500000000000000000000000000000000000000000000000000000000000
find an address whose first digits in red match yours.
target= 4975641556000000000000000000000000000000000000000000000000000
finds an address whose first red digits match another private key in the same range.
well seems pretty obvios that you range is going to match easy with full random This is my counter propose is target= 4975641556000000000000000000000000000000000000000000000123456 |
|
|
|
|
619
|
Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
|
on: May 26, 2023, 05:01:27 PM
|
OK i got your point and it maybe be a reasonable point if those operations need the same amount of time but that is not always the case, let me explaint to you why almost all the programs implement Random range choice + Sequential N keys Every time that you need to get the publickey from a Privatekey public_key = bitcoin_privkey_to_pubkey(pk) it performe a Scalar multiplication also knows as "Double and add" algorithm depeding of the implementation it can do from 32 to 256 Publickey additions internally So every random key that you want to convert to publickey do in average that amount of operations In the other case if you go random + sequential you only do that operation once per random choice, but every next sequential key only need One Publickey addition per key. Example: Full true random for 1024 keys needs 32768 Publickey additions in average (using a implementation that do 32 Publickey operations per Scalar multiplication) Fake Random (as you call it) for 1024 keys, only need 1055 Publickeys additions (1 for Scalar multiplication and 1023 for subsequent publickey additions) So in the time that the full true random do 1024, the "fake random" can do some near 32768 keys. And this is only the tip of the iceberg, for some libraries sequential operations are highly optimized and the performance can be some Factors the previos example, that is why most program do random + sequential. So Only if those two variants have the same speed, you will be right
|
|
|
|
|
620
|
Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it
|
on: May 26, 2023, 02:47:13 PM
|
I disagree with you totally. But that is OK no? I can't imagine a world where all the people think in the same way. Some people can debate with you that there is not such thing like true random... I like the random values that /dev/urandom give... It's not a question of speed, due to current computing limitations sequential search is a lost cause.
It is totally a question of speed i bet that you python script don't get more thant 50 thousand keys per second. We can do some test in some 32-36 bit range i guess that the fake randomness can beat your proposal Have a good day. |
|
|
|
|
Show Posts
