|
One sure way to ensure randomness is to generate 2 keys.
First generate one with whatever way you like, eg, coin, dice or manually by pencil.
Then generate the 2.nd one with urandom.
And combine the 2 keys with XOR.
Eg. If your keys are
1.st: 01101001...
2.nd: 01011011...
result: 00110010...
(in XOR you add binary bits together bit by bit. if they are the same the result is 0, if one is 0 and other is 1 the result is 1)
In this way, even if only one of your keys is truly random, the result is still random.
|
|
|
|
|
Edit:
Noticed that they are talking just about generating public&private key pairs and not about generating addresses.
When generating a key pair you do get uncompressed and compressed addresses with the same work
Uncompressed and compressed addresses both have the same public point on the curve.
The only difference is that they are presented differently. Uncompressed public point has both the X and Y-coordinates, while compressed has only the X-coordinate and a byte that tells if we have the odd or even Y-coordinate. That makes the compressed key shorter by half.
Using symmetry you can get another point, with the same X and the opposite Y-coordinate. and both compressed and uncompressed addresses for that point.
In addition you can also make SewWit addresses for all of those points.
However, you cannot double the amount of generated addresses without additional work. To get an address from a public key (compressed, uncompressed or SegWit) you will need to do 3* SHA256 hashes and 1* RIPEMOD160 hash and then convert the result to base58
Doing the 4 hashes requires a lot of calculations so you wont be getting any extra addresses without doing a lot of extra calculations.
|
|
|
|
I will suggest you start with python. Python is object oriented language and very easy to learn unlike others like Java or even C+. The syntax is close to everyday English, its what you can easily relate it and before you know it, you've started developing your own applications. Meanwhile, it's not that simple you need passion to survive.
+1 to Python I have been a professional C++ developer. When I learned Python (just for fun) I was really surprised how easy language it is. Things that take a long time to implement in C++ can be really really simple in Python. There are lots of easy to use and well implemented libraries written in python. One problem with C++ is that it can be confusing and time consuming to begin using some new library. Meaning you have to study a lot to be able to use it properly. One example is openssl.. |
|
|
|
|
The biggest problem is storing hydrogen. IT is difficult to store efficiently.
That is why methane is more interesting. Easier to store, and almost as good as hydrogen as a source of energy. Methane has one carbon and 4 hydrogen atoms. It can be produced using renewable energy.
Some new space rocket engines are being designed to use methane just for that reason. More stable and easier to store in smaller containers. And it burns quite cleanly too. Compared to hydrogen, while burning, it does produce some co², which hydrogen does not , but is does burn cleanly.
Wonder when we will have cars that burn methane?
|
|
|
|
How technically is difficult this? My purpose is generate infinite Addresses + Private Keys  Not difficult at all  But why make 2 different programs? It would be more efficient if the same program creates an address and then checks it. Then save the address + private key only if it finds some balance. I would bet you wont be needing much space on your disk for the addresses  Wonder why no-one else has thought of this. PS. Infinity is quite a big number |
|
|
|
So, is there any demand for regular exports of this data? I worked some days on the first one i made at 2018-10-10, the latest one was from 2018-10-15, is there any demand for regular updated files? I will usually put them just in a torrent because i don't want to set up a website for it or so.... Aynone?  There is demand. I am one of those, who is interested in downloading that data regularly. But only about once in 3-6 months. it looks like a nice project, although I find it mostly "helpful" to the dreamers that think they can brute force wallets Examining blockchain has other uses too. I used the data in studying "Satoshis mining pattern" and things like that. Was quite interesting. I also find it interesting to monitor really old bitcoin addresses for unusual traffic. Eg. Following old zombie coins coming back to life, which sometimes happen. For those things I have separate files of old addresses that are easy to go through with a script comparing them to the "current" chainstate. For my small needs it would be enough to get a smaller database of only the addresses containing more than 10 BTC (most really old addresses have more than 10BTC in them.) Filesize of such a smaller database is only about 7Mb Unfortunately I am currently in a country that has expensive internet and wont be downloading much until things get better. (I have to pay 1€/Gb for the net.) Otherwise I would have my own node and get the data myself. But yes. there is demand, and thanks for the good work |
|
|
|
I think you are trying to read in to what I did not intend to say. I just want to know if there are any explicit regulations around sending cryptos out of the country.
You cannot send bitcoins "out of the country", because bitcoins do not exist in any country, as I am sure you already know very well. They are just numbers in a ledger that is distributed all over the world. In my opinion it cant be illegal. However your country might think otherwise. Possible problems could arise when you register to some exchange abroad and sell your coins. Localbitcoins would be safer in selling the coins, because that can be done more anonymously. |
|
|
|
When merit was implemented everyone automatically received Merit based on activity, so why is it now different?
Before Merit system was first implemented it was NOT possible to get any merit even from excellent posts. I believe it was because of this, that the old users were given merit from the activity they had at that point. There are lots of old and really excellent and informative posts from many old users ( eg. Gmaxwell, Dannyhamilton & Satoshi just to mention a few ) and it would be a shame if those posts had not been "merited" at all. Of-course it is true, that those old users who did not make many useful posts benefited from it too. Giving those users 1000 merits is quite a lot in today's standards. The "new" Jr members however have been able to earn merits from day 1. That is, IF they have made good posts.
But in fact we could be more fair... Let's rise every rank requirements for 1 merit
I think it would be really FUN to see some high ranked users fighting to "EARN" their first merit ever ;-)
Now, that would be interesting |
|
|
|
Hi, I send you a PM with the private key to this address mvwXQY1FAm9BsVdUZ7YaZhpCBnJwT17D5v IF you do not move them in a week or so, I might give them to a faucet or someone else... Have fun |
|
|
|
Do you have unused test bitcoins? IF yes. Could you give me some coins?
Please send a little amount of (approximately 0.8B) to 2N464wccQ57yAzY61Gc9pPPYfYxMqQ2nZUt
I need test bitcoins for development.But some testnet faucet maybe is wrong and I can't get test bitcoins.
I have a private key to a testnet address containing 1 BTC. You can have it if you still need it. |
|
|
|
Interesting challenge I did not succeed in verifying your signature, probably because your address starts with 3. Is that a multisig or a P2SH-segwit address? |
|
|
|
Is it possible to generate a pair (A,P) where P is an ECC-public key, and A is some data from which a private key corresponding to P is computable if and only if a certain time passed?
The way this is related to bitcoin is that bitcoin uses a time-stamped proof-of-work, so it can provide some data which only becomes available if a certain amount of time has passed. This data is of the form:
(x_0,y_0,x_1,y_1,...,y_n) where n is fixed, x_0 is the hash of the last block, SHA256(x_i,y_i)=x_{i+1}, and x_is are "small".
This kind of data is automatically generated on the Bitcoin blockchain, and you cannot generate such a data faster, because in order to do so you would need at least as much hash power as the whole bitcoin network, in which case you would be able to 51% attack (which we can exclude).
Now because of the argument above, my question can be translated to a purely cryptographic question:
Is it possible to generate a pair as above where a private key can only be computed if and only if we know a solution to an equation of the above form?
Would not work. The solution of proof of work cant be known in advance. The solution requires finding a SHA256 hash that fulfils the requirement that it starts with atleast the required amount of zeroes, but other than that the solution can be anything. You cannot use something you do not know as an input for creating a private key . And if you use something you DO know, then an attacker can have the same info too. And you need to first have the private key in order to be able to calculate the public key. Cant be done the other way around. Would be great if that would work |
|
|
|
my question is, if its possible to calculate the pub key with uG then since you are doing u computations already, can't you just calculate the private key from P?
Just brute force G as many times as needed until you arrive at P.
The numbers are so big that brute forcing is not possible with the technology that we currently have. Even if all the existing computers would be used simultaneously for only that purpose, it would still take more than 10000 years to brute force ONE bitcoin key. (Much, much more than 10000 years.) Yes; u*G is computed in time logarithmic in u, not linear in u as you seem to think.
For instance 13*G is computed as 2 * (2 * (2 * G + G)) + G.
Correct, but I think the same can be more clearly explained in the way it is actually done: First pre-calculate the values: G, 2*G, 4*G, 8*G, 16*G, 32*G ....... 2²⁵⁶*G Then these pre-calculated values are used for getting any desired value by using only addition. eg: 13*G= 8*G+4*G+G This is faster, because you do not have to do the same multiplications every time. You can just use addition. And to do this you only need to keep the 256 precalculated values in memory. |
|
|
|
Do you think SpaceX will make it? Wonder when it will happen?
Im really curious what you guys think about
I truly hope spaceX and BFR will make it to Mars. But Elon Musk is playing a risky game. Hope not too risky. Raptor engine has chamber pressure of 300bar, which is more than any other rocket engine has ever had -Risky Composite fuel tanks have never been used in such a scale and with so cold O2. -Risky |
|
|
|
So in theory it could work but we will all be dead before the computer could solve it.
Cool.
Pretty much. The scale of difficulty is similar than finding the exactly right 1mm x1mm square from the whole Milky Way Galaxy. The diameter of Milky Way is about 150000 light years. One light year is 9460730472580800000 mm The (2D) area of Milky Way is (PI*((150000*9460730472580800000)/2)^2) #(PI=3.1425...) = 1581691349841256110761018035871634520600000000000 mm^2 Which is about the same scale than 2^160 = 1461501637330902918203684832716283019655932542976 These are pretty big numbers. |
|
|
|
The coins they mined are intact, never been spent, but do they hodl the private keys to these addresses ?
Not all of them are intact. Satoshi did the first ever bitcoin transaction, 10 BTC to Hal Finleys address. And Hal has used those coins. Any other Satoshi-pattern coin has never been moved. But those are just the Satoshi pattern coins. I bet he did mine some coins with another computer(s) too and is a rich man now. |
|
|
|
The crypto behind Bitcoin does not use primes, so not a worry for us Eg. RSA encryption does use primes, but in cracking RSA the challenge is finding the correct prime and that wont become much easier even if there is a formula for finding primes. There are so many primes that finding the correct one will always be hard. |
|
|
|
When I insert my 3.0 pen-drive in 2.0 port I get almost same speed around 16mbps to 21mbps as I get in 3.0 port what is the reason behind it?
I have a 32gb pen-drive 3.0 brand new I was expected 30mbps write speed from 3.0 USB
If you want a high speed usb3 drive, you have to buy one. Many slow usb3 drives are still being sold. That a drive is a usb3 drive does NOT mean that the memory inside the drive is actually any faster than an usb2 drive. If I remember correctly the speed of usb2 port is about 20mb/s. Usb3 is much much faster. |
|
|
|
I still convinced that Satoshi was the late Hal Finney (died in 2014). At least he knew more than he was willing to tell. He is by far the best candidate in my view. Only thing pulling down is the emails between Satoshi and Hal. You got to be really foreseeing and calculating to fake email correspondence between yourself and not be detected in writing analyses. On all other matters, he seems to fit perfect.
Best support for a one man and one that has died, is the million bitcoin on the same account. Either you are terrible rich to begin with, lost your private keys / password or are dead; else the coins would have been accessed at one point. It is also a testimony to the strength / security of the private key. Probably a few 1000 people out there right now trying to get access to this account in one way or another. As long as they remain untouched, you private keys are still very safe. Once movement on the account happens, worry!
I also believe Hal was Satoshi, but who knows. If he could have accessed those coins I believe he would have done it.. After all, he had lots of hospital bills to pay. Satoshis coins are not in one single address. They are in 20000 different addresses. |
|
|
|
LOL. The true purpose of school is not to educate. It is a place to store those noisy underage people, who are too young to be accepted to workplaces And at the same time they are taught how to behave and be QUIET! I have to say I agree with PrinceEa.. |
|
|
|
|
Show Posts
