Bitcoin Forum
May 28, 2024, 12:13:28 PM *
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 »
121  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: March 08, 2023, 09:18:45 AM
Your response clearly shows a lack of Qubit-related knowledge. Quantum computers are not magical beings. They consist of qubits which are different from classical bits. However, you CAN estimate how much bits in a bitcoin pvt key would be cracked by counting how many qubits you have .. you need 1 million Qubits to crack a full sha256 private key. So again, neither time nor resources are enough to make one such computer with that gigantic amount of qubits. Hence, from 3k qubits to 1mil qubits, there will be a huge time difference to close the gap between those two numbers. You basically can start worrying at 500k qubits. As for resources, checkout how much a small portable quantum computer costs and you might get a feel of how much resources you need to even start creating a quantum device with such amount of qubits.

Keep your patronizing tone for yourself.

Reserach is currently underway on a way to scale quantum computers through connecting them. So everything points rather into direction of connecting many smaller quantum machines into one than building giant quantum computer.

I can only agree that we don't know when it will occur - but im sure at some point IT WILL OCCUR.

BTW I never said  such machines will be available for average person soon. I meant more about government agencies or military where cost isn't such a big problem (the same way you can't buy and any private corporation dosen't have nuclear weapon despite it clearly exists).

I can also agree that we are still far away from a machine that could crack private keys from public keys getting them from unconfirmed txs (there is a small time limit to make it) - but there is a ton of loaded addresses with available public key which you can try to crack for as long as you need (exactly the same way you crack bitcoin puzzles now).









No patronizing intended at all. Just stating a fact. Some research about qubits will reveal how extremely unlikely for it to act as a threat to current strong hashing algorithms (except for the media, which is using naiive headlines to gain attention through generating doubt). And i know for sure that you're not talking about individuals, because an individual cannot even afford a portable quantum computer let alone a 1mil qubit one. And I'm not seeing the advantage of concatenating several quantums into one coz if you can't create more noisy or stable qubits, then you're just creating a chain of server-like computers. Also don't let those revealed pub keys deceive you into thinking it's getting any easier to crack. Knowing a pub key of puzzle 120 is nothing like knowing a pub key of a well randomized pvt key for an address. Which is the case with all those rich addresses you see now. Never expect to find an address with 2 million bucks worth of bitcoin that uses a public key for a private key of more than 3 leading zeros. Good luck trying to calculate that using a pub key on a quantum device or any device for that matter. Sure, quantum is insanely faster than classic PCs, but most people don't know the fact that numbers will still beat the difference in performance between the two. If govs know that all it takes to break sha256 is spending a few billions, then this would have happened already. Lucky for Satoshi and us, it should cost way WAY more than that.

Now let's talk numbers to put things in perspective:

- a typical quantum device is 158 million times faster than the strongest computer on earth
- say you have a supercomputer that goes through 1000 TRILLION private keys per sec.
- you would need 3671743063080802746815416825491118336290905145409708398 years to crack every bitcoin address.
- with quantum device you would need less than that... Only  23238880146081030043135549528424799596777880667 years lol.
- say you did something to quantum tech and moved it up so fast .. like insanely fast that it gave you a critical advantage and shortened this period down and you're 1000 TRILLION times faster, then, and only then, you'll be able to do the cracking job in just under 23238880146081030043135549528425 years
- Say that when using a pub key calc. Instead of private key cracking, you are now saving time and you're 1 BILLION TRILLION times faster, awesome! Now you can easily calculate the keys in only 23 Million years.

Fun fact: If one day you find out that any bitcoin burn addresses got emptied, you can be 100% sure someone found a way to break sha256 😃 Because you know, obviously no one is supposed to know the private key for a burn address.. even Satoshi.
122  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: March 08, 2023, 02:36:20 AM
The biggest quantum computer ever exists is merely 3k qubits .. find me a quantum computer with at least 500k qubits and then we could talk about Bitcoin vulnerability 👍 and it's not a matter of time until it gets broken because that time is more than enough for all algorithms in the world to migrate to quantum-safe tech. Bitcoin will not be an exception then.

This is what we officially know. It hasn't to be true.

Quantum computer is kinda like weapon. It's smarter not to tell how far you are with that technology.

It will not be announced in media like: " Attention ! We have a quantum computer powerful enough to crack your cryptography. Please move everything into post quantum cryptography and stay safe. Thank you."

Nobody would tell you if such possibility would exist.

BTW... I bet in that case it will be not used to simply steal bitcoins. I guess it can be used to DESTROY bitcoin by slowly destroy trust into bitcoin by cracking some addresses in a way you cant be sure if it was a quantum computer or something else.

So , no ... you will not have enough time to move everything into post quantum cryptography cause you simply don't know the REAL progress in that area. Additionally it's much easier to move banking and other FULLY CENTRALIZED systems into PQ cryptography than moving something decentralized like bitcoin.



Your response clearly shows a lack of Qubit-related knowledge. Quantum computers are not magical beings. They consist of qubits which are different from classical bits. However, you CAN estimate how much bits in a bitcoin pvt key would be cracked by counting how many qubits you have .. you need 1 million Qubits to crack a full sha256 private key. So again, neither time nor resources are enough to make one such computer with that gigantic amount of qubits. Hence, from 3k qubits to 1mil qubits, there will be a huge time difference to close the gap between those two numbers. You basically can start worrying at 500k qubits. As for resources, checkout how much a small portable quantum computer costs and you might get a feel of how much resources you need to even start creating a quantum device with such amount of qubits.
123  Bitcoin / Development & Technical Discussion / Re: Pollard's kangaroo ECDLP solver on: March 05, 2023, 02:43:49 PM
Hi guys, any news about who solve p64 and p120 ?

I just want to know the hardware that they use, this only to make calculations about how much will cost solve the p66 and p125.


"I just want to know the hardware that they use,"

Answer: you wil never know ... Sorry

"how much will cost solve the p66 and p125"

Answer: Cost is much MUCH more than the prize of 0.66 or 1.25 BTC .... Sorry
124  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: March 05, 2023, 02:35:18 PM
the one who broke 120 will be someone new because he forgot to take bitcoin cash and other coin

Maybe he/she is taking the time to do that and that's why he/she haven't revealed the privet key

Let this be an indication of how secure Bitcoin really is .. as small as 120 bits out of  the entire 160 bits range, 120 is still merely hackable by only 1 person on the planet with either unbelievable luck or rediculous resources. And that with the public key revealed. Imagine not knowing the public key. Imagine 121 bits or 122 up to 160 bits of difficulty. Satoshi really did think this whole Bitcoin security concept through. Hats off to the legend.

I can see it in completely different way ... It shows how UNSAFE Bitcoin really is.

The whole Bitcoin security lies in the fact that currently it is quite hard to bruteforce the whole range used for creating HEX private key.

So i could assume that Bitcoins security lies in currently used hardware weakness.

But that state will not last forever. In the end quantum computers will be able to crack all private keys where the public key is known (and there are many of such addresses).

Bitcoin security in its current form is TEMPORARY ... It's a matter of time.

Don't forget that every transaction you put into mempool means revealing public key ... so with quantum computer powerful enough to crack the private key from the public key in time-window when the transaction isn't confirmed  shows that bitcoin is CURRENTLY safe ... but in long term its security will definitelly be cracked.

Seeing how hard is to acheive any change in BTC code now  i would say that migrating BTC into quantum secure signatures can take too long to consider bitcoin safe.



The biggest quantum computer ever exists is merely 3k qubits .. find me a quantum computer with at least 500k qubits and then we could talk about Bitcoin vulnerability 👍 and it's not a matter of time until it gets broken because that time is more than enough for all algorithms in the world to migrate to quantum-safe tech. Bitcoin will not be an exception then.



The best and fastest program that was developed to solve puzzles until now is and will stay Kangaroo developed by Jean_Luc based on Vanitysearch.

Now unfortunately Jean_Luc seems to be retired or dead. We dont even know if we will ever get a ECDLP solver that is faster than Kangaroo.

Only time will tell

JeanLucPons is alive.
I received information from him that he does not currently have time to deal with this project.
It remains to believe that when he has this time - he will improve his priceless tools.

JeanLuc is a God. He doesn't die.
125  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: March 04, 2023, 11:35:56 PM
#125 & #130 would be solved before #66

Now that's a practical thinking.

You would simply search the range of 66 with a brute forcer along your entire life and not even land on the same first 18 prefix characters let alone the entire address of that puzzle.
Easier to look for the priv key "characters". There are only 17 of those.

And honestly, if people were to pool resources, it would not take that long to find #66. I have a 6 card rig (plain 3070s) that can go through a complete 53 bit range in about 10 days.

If we assume the worst case scenario and it takes searching the entire range (2^65) ... if a mining farm really wanted to attack these challenges, it could be done rather quickly.
Or if people would pool resources, take your novice miners, gamers, etc. around 25,000 GPUs could solve in less than 10 days.

As for #125, #130, #66, comparing or estimating which one would be found first; in theory, #125 would take less computations than #66, but #130 would take more than #66. And that is based on program (theory, Kangaroo vs brute) run times, not speculation.

Good insight thanks 👍 .. i still don't think we'll ever be able to gather 25000 GPUs in a group of people as guess what.. not so many people are searching that enthusiastically for puzzles. Large BTC collider was a massive pool and yet couldn't make it far enough and ppl quickly abandoned it.. and even with nowadays faster techniques, nobody seems to trust or willing to try and help grow a huge pool.. it makes you wonder if human nature is greedy: "i" wanna be the winner .. not "Us"

most likely the only scenario for finding 66 is that one guy in boxers will wake up in the morning one day only to find out that he was a lucky bastard. Such range can't be deliberately scanned.
126  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: March 04, 2023, 11:35:05 AM
#125 & #130 would be solved before #66

Now that's a practical thinking.

You would simply search the range of 66 with a brute forcer along your entire life and not even land on the same first 18 prefix characters let alone the entire address of that puzzle.
127  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: March 04, 2023, 11:26:31 AM
the one who broke 120 will be someone new because he forgot to take bitcoin cash and other coin

Maybe he/she is taking the time to do that and that's why he/she haven't revealed the privet key

Let this be an indication of how secure Bitcoin really is .. as small as 120 bits out of  the entire 160 bits range, 120 is still merely hackable by only 1 person on the planet with either unbelievable luck or rediculous resources. And that with the public key revealed. Imagine not knowing the public key. Imagine 121 bits or 122 up to 160 bits of difficulty. Satoshi really did think this whole Bitcoin security concept through. Hats off to the legend.
128  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: March 03, 2023, 05:45:43 AM
Ignore the dude it was his pure speculation for sure.

Now for the serious part, if the puzzle solver is not the creator, then it won't matter who solved it because it means they are using the conventional ways known to all. UNLESS, (and that's a crazy theory) .. the solver was using quantum technology and using it very cleverly. In that case, we're all doomed because it means solving any subsequent puzzle before the guy would be impossible.

Remember Alberto in a post when i said 120 would be easier to solve than 66 because typical brute force cracking can not beat BSGS jumps due to its lack of efficiency? And then you told me that's not correct? Here i am .. right as hell .. but who cares if I'm right when I'm talking to one of my role models lol, I'm a big BIG fan of yours, man .. actually your work plus WanderingPhilosopher's is beating the genius of JeanLuc's, especially your CPU-based BSGS mode.. simply amazing.

Well if that's the case, then #125 will also be found quickly then.

I better scrap my entire hashtable implementation and just make a new Kangaroo build with 160 bits hash table instead of 128. I actually feel kinda bad I didn't have a chance to work on it for some time.

people might call me crazy but I strongly believe 125 would still be solved before 66 .. I'm kinda familiar with brute force as a concept since the late 90s .. so i know how inefficient it is.. in fact, even the strongest hardware would struggle to brute force its way into a range as big as 66 .. and if it does, the owner of that hardware would be stupid to spend so much money only to land on 0.66 BTC .. although maths says I'm wrong about which of the two puzzles is easier than the other.. but maths won't solve the dilemma of getting lucky when random searching .. so basically what I'm saying is: i would rather random-BSGS-jump my way to puzzle 125 than just random-brute-force my way to puzzle 66. Someone gets me 100x RTX4090s and only then i would be more than happy to go back to bitcrack. And even then i would still be very pessimistic about the outcome.

I'm looking forward to see a new Kangaroo build from you 😍
129  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: March 03, 2023, 05:05:07 AM
not any programs pure mathematics

You know something or it is pure especulation ?

64 took years .. statistically speaking, 66 will take 4 times that time .. unless someone gets very VERY lucky VERY quickly by using the random range search technique.

yes, but actually we don't know who solve puzzle 64 or 120 sad  Cry

Regards!

Ignore the dude it was his pure speculation for sure.

Now for the serious part, if the puzzle solver is not the creator, then it won't matter who solved it because it means they are using the conventional ways known to all. UNLESS, (and that's a crazy theory) .. the solver was using quantum technology and using it very cleverly. In that case, we're all doomed because it means solving any subsequent puzzle before the guy would be impossible.

Remember Alberto in a post when i said 120 would be easier to solve than 66 because typical brute force cracking can not beat BSGS jumps due to its lack of efficiency? And then you told me that's not correct? Here i am .. right as hell .. but who cares if I'm right when I'm talking to one of my role models lol, I'm a big BIG fan of yours, man .. actually your work plus WanderingPhilosopher's is beating the genius of JeanLuc's, especially your CPU-based BSGS mode.. simply amazing.

130  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: February 28, 2023, 10:04:17 PM
Actually #66 is very feasible. It just needs a little time like puzzle 64. it will eventually be cracked before year 2025.

64 took years .. statistically speaking, 66 will take 4 times that time .. unless someone gets very VERY lucky VERY quickly by using the random range search technique.
131  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: February 28, 2023, 02:14:45 PM
If the method used was indeed Kangaroo in this case the #125 will not be touched before 10 or 15 years according to current programs and technology  Grin
The smallest keys from 66 are already starting to be unreachable without pubkey

Correct.. Neither 66 and above.. nor 125,130,135 etc... are crackable any time soon .. we have long years to work for these babies .. good luck to everyone involved .. it's still fun and enriching experience 😎
132  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: January 24, 2023, 01:15:44 AM

bitcoins security is literally based on how many numbers it is

This should be made as a banner in all Bitcoin related websites for newbies to see over and over until sunk deep in their subsconscious.
133  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: January 21, 2023, 12:40:00 AM
For half a year I use my cpu to scan for the #67 puzzle. I am 0.000039% scanned addresses of the range ;( A lifetime more to wait. I wonder how many supercomputers out there scan the bitcoin chain for these keys every minute. If you remember the pipeline hack, the FBI had already the privkey for the address used and it was not obtain during a hack or seize.
But Why the 67th puzzle ?.. why not the easier one? I mean the amount of private keys in 66 is unbelievably enormous already .. why go for the double of that gigantic range?
because someone is more likely to find 66 before 67 he doesnt wanna spend a shit ton of time on 66 and someone find it before him so he does 67 by time someone does find 66 he will be at head start( to most people anyway ) thats what i think at least

This analogy may seem smart if we're dealing with normal amounts like million or even billions. But when talking about tens of million trillions, that "head start" gets engulfed to almost nothing. The human mind can't grasp how extremely improbable it is to find ONE address among 73 million trillion ones, let alone double that digit. That being said, why are we still searching?
Because luck and coincidence do happen. But that's just that, you don't need to try outsmarting your odds in order to land on the key. The only factor you need is luck, and you're surely not doing yourself any more favours by doubling the odds against yourself, aka: puzz 67
134  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: January 13, 2023, 03:20:03 PM

Can i ask what did you mean by "bitcrack doesn't work when workspace is larger than 999.999" ?
135  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: December 27, 2022, 08:15:53 PM
For half a year I use my cpu to scan for the #67 puzzle. I am 0.000039% scanned addresses of the range ;( A lifetime more to wait. I wonder how many supercomputers out there scan the bitcoin chain for these keys every minute. If you remember the pipeline hack, the FBI had already the privkey for the address used and it was not obtain during a hack or seize.
But Why the 67th puzzle ?.. why not the easier one? I mean the amount of private keys in 66 is unbelievably enormous already .. why go for the double of that gigantic range?

It's all about luck isn't it? Everyone is on the 66th puzzle. I just wanted to go on a different one. And the mining power cost is arround 15-20$ a month, I don't even feel it or me being disturbed about it.

The factor that you're forgetting here is "probability" .. when you target the 67th, you are basically cutting your probability of being lucky in half .. I'm just saying, but you can do whatever you want of course
136  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: December 27, 2022, 06:16:27 AM
For half a year I use my cpu to scan for the #67 puzzle. I am 0.000039% scanned addresses of the range ;( A lifetime more to wait. I wonder how many supercomputers out there scan the bitcoin chain for these keys every minute. If you remember the pipeline hack, the FBI had already the privkey for the address used and it was not obtain during a hack or seize.
But Why the 67th puzzle ?.. why not the easier one? I mean the amount of private keys in 66 is unbelievably enormous already .. why go for the double of that gigantic range?
137  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: December 08, 2022, 01:22:42 AM
I cannot get your @jolly_jocker code to run correctly.

However, I think what you are trying to achieve is using the known WIF key part and tumble searching the remaining characters to find the WIF private key. I am able to again, use the known key part and add a randomize search for the remaining part and output this in hexadecimal format. It is not any faster than a general hexadecimal search.

I am not sure if you can generate a WIF private key with a check sum and convert/compare ; and then print the WIF key again in the same script.
I do agree that this puzzle is about testing the strength and secure-ness of bitcoin with new, creative code.

This is a basic python script and variation of VanityGen:
Code:
import secrets
import base58
import binascii
from bitcoin import privtopub, pubtoaddr
import sys

vanity = "13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so"
btc_addr = ""

while btc_addr[:len(vanity)] != vanity:
    prefix = "KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa"
    alphabet = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"
    postfix = ''.join(secrets.choice(alphabet) for i in range(18))
    first_encode = base58.b58decode(prefix + postfix)
    private_key_full = binascii.hexlify(first_encode)
    private_key = private_key_full[2:-8]
    btc_pubkey = privtopub(private_key.decode())
    btc_addr = pubtoaddr(btc_pubkey)
    
print(private_key.decode())
print(btc_pubkey)
print(btc_addr)

sys.exit()


Hello, Thanks for all your posts !
I modified your script a little, so that it loads the database of all BTC addresses plus searches for puzzle patterns at the same time. Grin
Code:
import os
import time
import secrets
import base58
import binascii
from bitcoin import privtopub, pubtoaddr
import sys
import multiprocessing
from halo import Halo
import random, string
import threading

print("Loading TXT Please Wait and Good Luck...")  
filename ='list.txt'
with open(filename) as f:
    add = f.read().split()
add = set(add)

spinner = Halo(text='Loading', spinner='dots')

r = 0
cores=1 #CPU Control Set Cores
def seek(r):
        F = []
        while True:
            prefix = "KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa"
            alphabet = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"
            postfix = ''.join(secrets.choice(alphabet) for i in range(18))
            first_encode = base58.b58decode(f'{prefix}{postfix}')
            private_key_full = binascii.hexlify(first_encode)
            private_key = private_key_full[2:-8]
            btc_pubkey = privtopub(private_key.decode())
            btc_addr = pubtoaddr(btc_pubkey)
            spinner.start()
              
            if btc_addr.startswith("13zb1"):
               t = time.ctime()
               spinner.stop()
               print("Pattern Found:",t, btc_addr, private_key)
               print("\n continue...\n")
               spinner.start()

            if btc_addr in add:
               t = time.ctime()
               spinner.stop()
               print("Winner Found!:",t, btc_addr, private_key)  
               f=open(u"Winner.txt","a") #Output File
               f.write('WIF private key: ' + str(private_key) + '\n' +
                            'public key: ' + str(btc_pubkey) + '\n' +
                            'BTC address: ' + str(btc_addr) + '\n\n')
               f.close()
               sleep(1)
               break

#CPU Control Command
if __name__ == '__main__':
        os.system('clear')
        t = time.ctime()
        print(t, "GOOD LUCK AND HAPPY HUNTING...")
        
        jobs = []
        for r in range(cores):
                p = multiprocessing.Process(target=seek, args=(r,))
                jobs.append(p)
                p.start()

Cool thanks .. Can you test speed and post results for us?
138  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: November 26, 2022, 11:32:56 PM
I get the same performance as you, but EC_POINT_add isn't the slowest step, it's the call to EC_POINT_point2oct.

So what if I am a newbie just glance at please?

x = int('11db93e1dcdb8a016b49840f8c53bc1eb68a382e97b1482ecad7b148a6909a5c, 16) y = int('b2e0eaddfb84ccf9744464f82e160bfa9b8b64f9d4c03f999b8643f656b412a3', 16)

point = ecdsa.ellipticcurve.Point(SECP256k1.curve, x, y) pubkey = Verifyingkey.from public point(point, SECP256k1)

def verify signature(hash, signature):

17 global pubkey

return pubkey.pubkey.verifies(hash, signature)

Do you know why EC_POINT_point2oct is slow? I called EC_POINT_get_affine_coordinates_GFp instead, but they seem to do the same thing. If EC_POINT_add stores the point in Cartesian coordination (X-Y), will extracting the public key be a trivial task?

Guys with brute force we won't go anywhere.

How precise is this formula?

I think all of us know that brute force is not viable for sure, but it is fun to estimate how long it will take to break the 51st, 52nd, ... addresses.

That division isn't the conventional division. It has perfect precision (http://www.johannes-bauer.com/compsci/ecc/#anchor07).

Well we wont get 5 TH/s or anything close for sure, but if we were able to generate 100 million keys per second we would break the #51 in about 3.5 months... And I believe it will be very hard to get to 100 million / s even with GPU.

Yes of course we can try it for the fun, but it wont be much fun when you get home and your GPU is burning plus your electricity bill Cheesy

But of course if your formula brings down the range of keys to generate then we can have some chance.

So, basically I was wrong because we have to calculate λ to add the two points.

If you find the right formula can you post the results for each address so we know exactly what ranges we can count with?


Lol it's entertaining to imagine those days when people thought 100mil keys per sec was impossible to get .. a good 8g GPU now can you over 600 mil keys per sec thanks to some great tools available like Bitcrack and programs inspired by vanity search.
139  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: November 02, 2022, 09:16:20 AM
Well, thanks for the link. However I am not interested in pool bruteforcing because I don't like the idea to possibly receive nothing although invested hard work into finding the correct key (range). The idea is good but the software/pool used therefore is something centralized and I consider it as bad. Sorry, just my 2 satoshis. However, thanks for the link
You are Welcome,
We have same opinion for this pool(They miss the 64-bit when they nearly scan 1/4 of range).
I working in divide the range and search it randomly, and if you like me then I don't think knowing range that scanned will be helpful because the will be always high change he/she will miss the key. its random after all.

True .. Random search won't have to worry about finished ranges .. why? Because maths! All private keys residing in the 66 bit range are so many that even stumbling upon a certain already-searched range randomly is probabilistically too low .. it's easy to realize this when you visualize the randomized range .. in fact, it's the same exact reason why you are searching billions of keys everyday and still not finding the desired private key .. it's the massive amount of keys cluttering the space that makes meeting the same key (or subrange for that matter) highly unlikely. So yeah, you can search comfortably randomly and not worry about meeting an already searched range.
140  Bitcoin / Bitcoin Discussion / Re: Bitcoin puzzle transaction ~32 BTC prize to who solves it on: October 26, 2022, 07:59:57 PM
I cannot get your @jolly_jocker code to run correctly.

However, I think what you are trying to achieve is using the known WIF key part and tumble searching the remaining characters to find the WIF private key. I am able to again, use the known key part and add a randomize search for the remaining part and output this in hexadecimal format. It is not any faster than a general hexadecimal search.

I am not sure if you can generate a WIF private key with a check sum and convert/compare ; and then print the WIF key again in the same script.
I do agree that this puzzle is about testing the strength and secure-ness of bitcoin with new, creative code.

This is a basic python script and variation of VanityGen:
Code:
import secrets
import base58
import binascii
from bitcoin import privtopub, pubtoaddr
import sys

vanity = "13zb1hQbWVsc2S7ZTZnP2G4undNNpdh5so"
btc_addr = ""

while btc_addr[:len(vanity)] != vanity:
    prefix = "KwDiBf89QgGbjEhKnhXJuH7LrciVrZi3qa"
    alphabet = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"
    postfix = ''.join(secrets.choice(alphabet) for i in range(18))
    first_encode = base58.b58decode(prefix + postfix)
    private_key_full = binascii.hexlify(first_encode)
    private_key = private_key_full[2:-8]
    btc_pubkey = privtopub(private_key.decode())
    btc_addr = pubtoaddr(btc_pubkey)
    
print(private_key.decode())
print(btc_pubkey)
print(btc_addr)

sys.exit()


I genuinely would like to know .. are any of these python scripts working any faster than known C programs like keyhunt or vanitygen etc? I mean the slowest I've ever seen to date was Brainflayer as it starts with pass->key->...... but to be honest i would be surprised if i see a fast python one getting the same speed as for example keyhunt .. plz post your speed results .. much appreciated
Pages: « 1 2 3 4 5 6 [7] 8 9 10 »
Powered by MySQL Powered by PHP Powered by SMF 1.1.19 | SMF © 2006-2009, Simple Machines Valid XHTML 1.0! Valid CSS!