 Show Posts
|
|
Pages: [1]
|
What’s it’s usecase aside from spamming the Bitcoin network. There’s a lot of blockchain which this kind of NFT can done instead they are spamming Bitcoin network by attaching useless piece of shit on every transaction and called a BRC20.
Go to marketplace. There’s tons of them available in the market being sold on a ridiculous hype price for a piece of garbage in blockchain network.
Don't you think bitcoin Mixers have done more damage to bitcoin than all others combined? |
|
|
|
NEVER SEND FUNDS TO UNKNOWN PEOPLE
Support only developers like Alberto or WanderingPhilosopher. These people are doing all the works development and improvement. Other people are just money beggers.
No one is begging here. OP himself asked if someone is in a position to solve the puzzle if he can upgrade the hardware. What makes you think like this. I respect all the developers, but it doesn't take someone else's right to take a chance on it. If I am not a developer, does it mean I should be dumped anyway. |
|
|
|
Nice to see this puzzle is still on going. It’s been years and I totally forgot about this.
So the conclusion until now is that it is only possible to crack the keys with brute force and no formula was found?
Was thinking to start working on this again but when I think of the amount of brain cells that are going to be destroyed I just shake it off.
What I could eventually do is provide some funds for funding of hardware or something needed.
Anyone thinks that with the help of some funds it can help to crack the case?
I've been using Core i7 with two 1tb hard drive. If can get a change to upgrade my hardware to a decent GPU coupled with eight 1 tb hard drives, that would be enough for me to hunt this puzzle down... Please ENABLE ME to. Here is my wallet address again 1AfQHpdtZtMyf4F1H4CrVuvCwtX41rTxob |
|
|
|
Nice to see this puzzle is still on going. It’s been years and I totally forgot about this.
So the conclusion until now is that it is only possible to crack the keys with brute force and no formula was found?
Was thinking to start working on this again but when I think of the amount of brain cells that are going to be destroyed I just shake it off.
What I could eventually do is provide some funds for funding of hardware or something needed.
Anyone thinks that with the help of some funds it can help to crack the case?
Bro, I have been working on this puzzle for almost a year and I discovered various assumptions and successfully tested, which I am unable to share with any one just because someone with improved hardware can quickly reach it. I need your funding to upgrade the hardware. I am continuously checking my address: 1AfQHpdtZtMyf4F1H4CrVuvCwtX41rTxob |
|
|
|
Nice to see this puzzle is still on going. It’s been years and I totally forgot about this.
So the conclusion until now is that it is only possible to crack the keys with brute force and no formula was found?
Was thinking to start working on this again but when I think of the amount of brain cells that are going to be destroyed I just shake it off.
What I could eventually do is provide some funds for funding of hardware or something needed.
Anyone thinks that with the help of some funds it can help to crack the case?
I can crack it with few funds, please enable me to do that,,, 1AfQHpdtZtMyf4F1H4CrVuvCwtX41rTxob |
|
|
|
|
Let me explain you all guy how one can reduce bit size from 2^130 to near to 2^103.
First of all you just focus on how much bits are reduced? around 26 bits right (The first one can always be subtracted from pub key). So how big is 2^26? 2**26 = 67108864
So these are the pub keys in which one of the key is under 2^103.
The moment to try to go one single bit further, things are gonna get a little bulky.
The trick is simple, you have 1 public key, add generator to it and now you have two public keys whose private keys for instance are 89 & 90 or 534354234384847 & 534354234384848.
Why we do this? because we want to divide our public key to reduce its size and we don't know whether it is odd or even so add one to it and and now you have both.
Now you divide both and you have one correct result and one incorrect.
In second step you repeat the process of adding 1 to both of them and dividing 4 of them..
So this is like dividing pubkeys, 2, 4, 8, 16, 32, .... yep,, you got it!!
|
|
|
|
|
If you look at the messages and ECC knowledge level of batareyka, you can easily figure that he is neither proficient in maths not in programming. For those who have been hammering around EC they can easily point out that EC has countless ways to surprise you when you think you got it but the very next level discovery shuts you down. I am convinced he has just found one of those surprises and didn't tried to reconfirm it. Whatever subtraction, addition, multiplication & division you do, Modular arithmetic will shut you down and at the end you are nowhere. Finally you don't get offended with Questions, the world we see today is a result of questioning.
|
|
|
|
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'd imagine finding the correct divisor is as difficult as solving the DLP, maybe solving DLP is exactly finding the correct divisor, I wouldn't know, because I never finished high school.🤣 Finally you reached the root problem or in other words security behind secp256k1. Figuring out Odd vs Even is literally the DLP itself. By far, any form of calculation on the curve won't work due to clock math nature of rounding around the resulting points. |
|
|
|
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 Private Key Public key 1090246098153987172547740458951748 # puzzle 110 0309976ba5570966bf889196b7fdf5a0f9a1e9ab340556ec29f8bb60599616167d 545123049076993586273870229475874 272561524538496793136935114737937 136280762269248396568467557368968 68140381134624198284233778684484 34070190567312099142116889342242 17035095283656049571058444671121 8517547641828024785529222335560 4258773820914012392764611167780 2129386910457006196382305583890 1064693455228503098191152791945 532346727614251549095576395972 266173363807125774547788197986 133086681903562887273894098993 66543340951781443636947049496 33271670475890721818473524748 16635835237945360909236762374 8317917618972680454618381187 4158958809486340227309190593 2079479404743170113654595296 1039739702371585056827297648 519869851185792528413648824 259934925592896264206824412 129967462796448132103412206 64983731398224066051706103 32491865699112033025853051 16245932849556016512926525 8122966424778008256463262 4061483212389004128231631 2030741606194502064115815 1015370803097251032057907 507685401548625516028953 253842700774312758014476 126921350387156379007238 63460675193578189503619 31730337596789094751809 15865168798394547375904 7932584399197273687952 3966292199598636843976 1983146099799318421988 991573049899659210994 495786524949829605497 247893262474914802748 123946631237457401374 61973315618728700687 30986657809364350343 15493328904682175171 7746664452341087585 3873332226170543792 1936666113085271896 968333056542635948 484166528271317974 242083264135658987 121041632067829493 60520816033914746 30260408016957373 15130204008478686 7565102004239343 3782551002119671 1891275501059835 945637750529917 472818875264958 236409437632479 118204718816239 59102359408119 29551179704059 14775589852029 7387794926014 3693897463007 1846948731503 923474365751 461737182875 230868591437 115434295718 57717147859 28858573929 14429286964 7214643482 3607321741 1803660870 901830435 450915217 225457608 112728804 56364402 28182201 14091100 7045550 3522775 1761387 880693 440346 220173 110086 55043 27521 13760 6880 3440 1720 860 430 215 107 53 26 13 6 3 1 0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798 He is just a breastfeeding baby and even haven't reached the feeder yet. He thinks he can perform division (with obvious no clue how badd_ASS division it is) |
|
|
|
|
Subtracting -70 from +50 is resulting in +120.
I am still not getting trangular thing, can you explain with a simple example pl
|
|
|
|
I guess you are way off the map! 2 trillion keys? The actual number is 5 to 6 public keys in order to form 2 triangles and solve the key, more than that will confuse you, as it has confused me with a few million keys, I see hexadecimal characters wherever I look, after working on them for hours. Lol.
LOL, these hexadecimals do often come into my dreams and dancing around as well. I sure didn't got your point of TRIANGLES. What I was referring to trillion thing is this.. Suppose we are searching the private key which is within bit range of 16:32. I made a list of initial 6 public keys like I have a file in which 1-6 public keys are stored. Now I subtract 16 from the puzzle public key. Suppose the hidden private key is 21. So when I subtract 16 from it the resulting key at the same position but in lower bit size. Now 21-16=5 and now I check whether this public key is in my file in which I saved initial public keys. So this is simple thing I am referring as 2 trillions... Can you explain your TRIANGLE THING?  ?? |
|
|
|
Can you tell me why is this happening? Ok, if I subtract this 02A1940074961CDF60CB2A0E7BC7157A7970B05469C58EEB5AD1C0462CE0C17811 from #125 puzzle, the result is : 02ed01ff219ed5c1afc12d991a82e3063ddcee1fd53b46f7cad52a0d87a7112aed And if I subtract this 0290ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4 which is actually 2^124 public key, if I subtract it from #125 puzzle the result is : 03ed01ff219ed5c1afc12d991a82e3063ddcee1fd53b46f7cad52a0d87a7112aed I know why this is happening though, because the first subtraction is actually inverse addition, the distance between the first public key and the second one is exactly the private key of #125. This is why I'm stuck and can't solve this puzzle, and this is one of the easiest of puzzles since we know exactly it starts with a 1. But I am close God willing, it should be solved soon. Ohh boy you are 100% correct. The real problem is one can only do first subtraction and after all, it doesn't reduces its size. Why? let me explain. The private key which we are looking for is between 2^124 : 2^125. Now you need to understand that amount of numbers or p.keys from 1 to 2^124 is equal to the amount between 2^124 : 2^125. So when we subtract 2^124 from the pubkey which is between 2^124 : 2^125, then we are actually making it fall between the range of 1 to 2^124. Let me take you to a step further. If the puzzle private key is above the half in range 2^124 : 2^125, then you can do one more subtraction. You can further subtract 2^123 from previous subtraction result. That's it. So far, I figured that to actually work with this subtraction thing, one need a data base of public key from 2 to 2 Trillion for that matter or more, and perform various models of subtraction from puzzle pub key and check if resulting pubkey is falling within that 2 to 2 trillion result. That's the best shot I've reached so far. |
|
|
|
Guys, I hope you are all doing great! Can anyone please refer some python script that can apply point halving on public keys and calculates its half? https://bitcointalk.org/index.php?topic=4455904.0Here it is explained but there is no python script there that can calculate it by taking the public key in question |
|
|
|
Guys, I hope you are all doing great! Can anyone please refer some python script that can apply this halving thing on public keys and calculates its half? ?? |
|
|
|
Bro thanks for replying, can you pl tell me How to run it in cmd with my particular range & pub key, plus can it take multiple pubkeys at a time, all within same range of 2^80?? |
|
|
|
Is there any python script for BSGS that can search 2^80 as you mentioned? https://github.com/Telariust/pollard-kangaroo/blob/master/pollard-kangaroo.py This one is useless, because I tested it by giving it a test public key within range of 2^50, 2^20,, it is not finding it.... I used it by giving it command like this /python kangaroo.py 00008:000ffffff 02049370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963 |
|
|
|
|
