Show Posts
|
Pages: [1]
|
Hello guys.. My cousin leads a research team and they have a huge set up.. They have about 900 rtx4090 gpus for research.. I have been trying to convince him to grant me permission to use the set for 12 hours straight.. And finally did... Now I need a strategy to figure out the puzzle 135 or 67 which one would work fastest? I need someone to give me a plan and once it's solved I will give the person who gave me a solid plan a reward.. I need someone who is just as passionate as I am so work with in solving atleast one puzzle...
1. This is steeling and your cousin can get into trouble. 2. With a single rtx4090 you can achieve about 4000MKey/sec. So with 900 GPUs in 12 hour you have one in 2**66/4_000_000_000/900/3600/12 = 474.45 chance to solve Puzzle 67. That is about 0.21% chance.
|
|
|
I'm already provide good scrypt,in my previous post but no one interested. I was little modify and script was moree good, but no one interested I mot provide fool modification code.
What a smart move. You noticed no one is interested. You were ask no to do so. So what are you doing? Spamming more sh*tty codes and lucky numbers.
|
|
|
Hello.
First thing first: i am the solver of Puzzle 66. But i lost it soon as it was spend.
Sign a message with the first address that tried to withdraw puzzle 66 because I don't believe you, I think you're a scammer. He IS a scammer. He shows no proofs. The original solver address is 1Jvv4yWkE9MhbuwGUoqFYzDjRVQHaLWuJd and there is no use to beg using any other address. Anyone can send to the proper address. The one who stole the fund was sending a mocking message to there. I don't think he is willing to send half of the stack.
|
|
|
Basically zero. You can easily create properly formatted addresses, only the few last positions is a hash.
You have no idea what you're talking about. Try creating '1AndCausingClimateChange6666' and let me know when you succeed in getting the private key. Try to read and understand again what I was writing, it was not that difficult.
|
|
|
Can someone tell me how much computing power would be needed for someone to hit the 28-characters "AndCausingCLimateChange6666" in address ? With Tools like Vanitygen or VanitySearch. That is an enormous number of possible combinations, roughly equal to 7.5 × 10^48. To generate a 28-characters in address, it could take trillions of years on a single consumer-grade GPU. Holy shit, I didn't even think about this. Basically zero. You can easily create properly formatted addresses, only the few last positions is a hash. When creating addresses this way, even you don't know the private key (or even the public key) for the address. Basically these are burner addresses. Noone can send the funds. Most famous burner address is: 1111111111111111111114oLvT2 with almost 640 BTC on it.
|
|
|
Information!!!! As per above discussion and blam on developers unfair They provide you best freeware Only mindset at public they want ready to eat They don't have ability to create such app not able to apply math, nor able to apply brain How they can use such app Let me give u 1 more tip Don't use start to end full bit range Example 134bit to 135bit don't use What to use Split 135bit in parts of 70bit to 100 bits for run kangaroo in between, depand your gpu power Or Generate random number in 135 bit range and to set +100 bit for adjust range for checking key A = 135 random generator B = a+ 100bit range Adjust a and b in your kangaroo command Hope above small tips help you for use kangaroo and such app, It's also help your mindset of kangaroo 125bit max etc Enjoy!!!
Somewhat this approach can work (I was thinking about it too), but kangaroo is a probability algorithm, meaning it never finishes a range. You can never rule out a range. The only thing you can do is to search for a while and if you think you searched enough you try to search another range. ** diamond mining meme **
|
|
|
bro can i talk about 1000 Btc puzzle i am using python but can't use my gpu i have rtx 4070 plz help
I am using Rotor-Cuda with relatively small blocks driven by my python script.
|
|
|
https://privatekeys.pw/address/bitcoin/1BY8GQbnueYofwSuFAT3USAhGjPrkxDdW9For other addresses you can check using hash: Public Key Hash (Hash 160): 739437bb3dd6d1983e66629c5f08c70e52769371 Based on the puzzle's statistics, the private key for 67 is likely around 95XXXXXX. If anyone finds it within this range, I’d be more than happy to accept some gifts! bc1q4xj4maw4csvn084zwjtrgzg8tk08660mxj6wnw Your statistics must be fantastic (none of them are working because the you was generated randomly), but it is very unlikely the private key for 67 is likely around 95XXXXXX because it is out if it's range. If I were you I wouldn't expect too much gifts.
|
|
|
I am a fool, and the 66 puzzle seems to have been taken away by a robot. I have no idea why this happened. Please tell me how to avoid being snatched away by robots if I crack the private key.
Yes, unfortunately it seems it has been snatched. At least https://privatekeys.pw/puzzles/bitcoin-puzzle-tx directly states that. I don't know if they have proofs. And based on that, the original address is one of that was the target of the mocking transaction. To avoid this you need to keep the public key (of this low range keys) in secret. Unfortunately public key is designed to be public, so it is not so easy to transact without making them public. Option 1: Mine your own block or have a deal with a mining pool. Option 2: Mara Slipstream. But Mara still can stole it in this case.
|
|
|
The more private keys we have, the smaller the error would be....5% deviation on puzzle 130 is too big.
Hello, can you share the guess range or decimal number of puzzle 130 python3 predict.py 130 Puzzle 130 Predicted Value: 794791040024653568798270036743662075904.00 🔮🔮🔮
|
|
|
Heyho, I couldn't find any Info on this. I'm using VanitySearch and it says [compressed] next to the address - is this right? Are the addresses compressed or not?
Ty guys!
They are compressed.
|
|
|
Can an actual expert in EC confirm or deny this simple statement?
Considering the secp256k1 curve, and the existence of symmetry and lambda endomorphism, there can not exist any algorithm that solves the ECDLP over an interval in less than sqrt(b) group operations (with no precomputation required).
From what I "know" the complexity cofactors are something like: BSGS: 1, Rho: 1.25, normal kangaroo: 2, four-kangaroo: 1.71, Gaudry-Schost: 1.36
If the answer is no, what can happen if it is proven otherwise? If the answer is yes, is there a known lower bound? And maybe a research paper?
Since we don't know if P=NP the most we can state is a weak probably not.
|
|
|
If it is not a secret how many keys have you checked total, per sec? I started 4 month ago with an obsolete GPU and it only runs when I am home and I feel like that. I have checked 576_006_654_001_152 keys with about 150 MKeys/sec speed. I know these are rookie numbers.
|
|
|
They probably don't know how to Export the Raw Transaction from Electrum and copy/paste it to Mara slipstream window. But anyway, if someone wants to pay for copy/paste 10%, I'm here. Maybe he tries to sell the key with a discount. That is a different situation, it is not just help to copy-paste. It is about the risk of failure.
|
|
|
What is better probability to find a key? To search 66-puzzle only or search 66-67-68-69-puzzles simultaneously?
puzzle-67 is twice as difficult as puzzle-66. puzzle-68 is twice as difficult as puzzle-67. and so on. The best chance to find a key is when you focus on the easiest available puzzle, that is puzzle-66 now. But after you find a key you may have difficulties claiming it, it even can be stolen as soon as you try to move it. Maybe there is a work-around but that isn't 100% secure either.
|
|
|
Perfect, we are looking forward to another live test, remembering that if the transaction of puzzle 66 goes well and the winner comes here to the forum to inform us, it would be a mega positive marketing for MARAPOOL, the company that saved the puzzle from the BOTs. Is MARAPOOL a public pool? The problem is that you need to trust not just the employees of MARAPOOL but each member of the pool. The block template is broadcasted to them and the public key is clearly part of it.
|
|
|
It's sad to see that people who are looking for a solution to the puzzle have switched to stealing them from the one who finds it first and tries to withdraw it. without hiding this fact. And with a very high chance the miner pool mining the block will rob them too.
|
|
|
You can use nomachine's Rust Kangaroo a few posts back, or write a Python script that does the job according to your requirements (e.g. "that actually works"). Too slow? Well, don't expect to find something that "actually works", is fast, and solves 130, sitting out there for you to snug up and inherit 13 BTC tomorrow.
Not in Rust. Pure C++ with GMP. Here is the latest version that goes 470K Hops per second. Theoretically, with 12 cores, it can achieve 5 million hops per second. The more cores you have, the better the result will be. However, it's not worth using this for a puzzle above 70bit. A GPU must be used instead.... Pure self-contained Python Kangaroo with no libraries required. 225K Hops per second. DO NOT USE THIS TO SEARCH FOR 130. It is just an educational, reference-only example. All the math uses Python integers. kangaroo.py import math, os, sys, time ....
Puzzle 48: processors: 2048 num jump distances: 38 max jumps per tame kangaroo: 6899 max jumps per wild kangaroo: 11586 expected total jumps: 18927375 24.17 bits avg real jump distance: 7233629130 32.75 bits avg expected jump distance: 6074001000 32.50 bits expected max tame distance: 190638869267657 47.44 bits ... Ops: 17607859 Table size: 68719 Speed: 225400 ops/s Key: 0x2de6d7ce3b9b Group ops: 18288933 Ops: 18288933 Stored: 71317 Speed: 222616 ops/s
You need to add the lower boundary of the original search range to the found key to get the correct answer (because of the range was shifted to start at 0).
|
|
|
In regards to all the RBF issues lately, would it not be more productive to push on the Bitcoin developers themselves to fix it? What's so bad about making no RBF actually mean NO RBF? You know, the first-seen spend transaction with NO-RBF/Opt-out-of-RBF flag is the only transaction that the network accepts and cannot be replaced/modified by any other means? It will either get mined into a block eventually, or in the case the fees are too low, sit in the mempool for an indefinite amount of time. Or does their say not even matter because the mining pools themselves would not adopt such a fix, given that it is actually not in their best interest to do so?
Bitcoin is not broken on it's full strength. The thing that is broken is this puzzle on this restricted range. It would be wiser if the reward was placed on a regular address and you could calculate the private key of the reward address from the private key of the restricted address with a published deterministic algorithm.
|
|
|
|