You can't set the price. The price is determined in the market by supply and demand. As for coming up with some formula for determining its value, good luck with that.
|
|
|
Casino grade dice are the only dice that should be used. ...
If feel like that is major overkill. Randomness is not the primary goal. In a brute force attack, the attacker uses their knowledge of any biases to reduce the search space. A purely random number has no biases, so it is an effective tool. But, it is not a necessary condition since a lack of randomness does not necessarily give the attacker any information. Suppose, I have a hardware random number generator that tends to set some bits to 1 and some other bits to 0. If the attacker does not know which bits are biased and what their biases are, they have no information that will help them. You can say that flipping a coin is not truly random, but it is effectively random to the attacker unless they know the exact conditions that were present when the coin was flipped. Suppose I take 256 coins and set a number of of them to heads and the rest to tails, and then I arrange them in a certain order. Assuming that the number of heads vs. tails and the order of the coins makes no difference to me (i.e., I have no obvious biases), the result is effectively random to the attacker even though it is not random at all.
|
|
|
You forgot the most important one: be skeptical. Most of the claims that you will read are misguided, unsupported, or just wishful thinking.
|
|
|
I have no doubt that if a central bank develops a cryptocurrency, it will be centralized (or at least federated) and they will track every cent that you spend.
|
|
|
Hi everybody! Is it possible to express SHA256 output bits as MATHEMATICAL function of input bits? If so, which is the minimum subset of needed mathematical operators? Over which numeric set (e.g. Real or Complex field instead of binary to exploit more freedom degrees)? Any news about it already out there on the Internet?
The are many explanations of the SHA-256 algorithm. Here is one: https://steemit.com/cryptocurrency/@f4tca7/introduction-to-the-sha-256-hash-functionKeep in mind that the input is arbitrary and unbounded. I suppose that it might be possible to describe each bit of the output as an explicit function of the inputs in some standard mathematical notation, but I doubt it would be practical or even insightful.
|
|
|
Question #3: The whitepaper says, in section 7: "Once the latest transaction in a coin is buried under enough blocks, the spent transactions before it can be discarded to save disk space." The wording "transaction in a coin" confuses me here because I would have thought it should have said "block" instead of "coin". Perhaps this would be answered by question #2.
I believe that the word "coin" was originally used to mean what we now call a "transaction output". That seems to explain why the original uses of the word here and in other contexts may seem odd.
|
|
|
Is it possible to calculate (theoretically) , how many common addresses could derive from the seeds?
If there are 2048^12 different seed combinations (in 12-word BIP39) and each has 2^256 keys then we have 6.3X10^116 different addresses. We have altogether in Bitcoin 2^160=1,46x10^48 different addresses, which is a smaller number than the first one.
How many of them are common?
A BIP-39 12-word phrase can represent 2 128 seeds (it contains a checksum). As noted above, an HD wallet can normally generate 2 65 private keys from a seed. Thus, the 12-word phrase can generate 2 193 private keys, which is 2 33 times the 2 160 possible addresses.
|
|
|
Hello everyone! I am writing a school essay about mathematics in cryptocurrency. I would want to show the SHA-256 coding,... however I am not sure about the input data. As I know I need: ...
SHA-256 can be used on any data. I suggest that you avoid the details of the block header. Otherwise, your essay could get out of control. ...Then, as I understand, I should divide the sum of those into 8 parts, which will be mine a,b,c,d,e,f,g,h; then 128 round of coding and I will receive my hash. Also, theoretically, if I would get a correct hash, how can I attach it to the blockchain and receive the coins?
It is much more complicated than that. Another suggestion: narrow your topic down to how a hash such as SHA-256 can be used to prove something, and just mention its uses in Bitcoin as examples.
|
|
|
I think there has to be a way to create a tracking system for bitcoin. Every wallet must contain ids. Otherwise, bitcoin can be always used for money laundering. If you want to launder money, you can find a cash seller everywhere. After bitcoin is bought, noone can prove whose bitcoin it is. I think this is the only think that preventing bitcoin to become a global currency. Do you think it would worth this much if it is trackable. I dont think so. There will be altcoins that work with tracking system and ids. They will become a global currency. Bitcoin? I think never. What do you think?
The ability to be used for money laundering won't prevent its use as a global currency because only governments care if money can be used for money laundering, and Bitcoin exists outside of the control of any government.
|
|
|
Bitcoin and Other crypto bots controlling the btc price.
I'm skeptical of your claim. Do you have any evidence to support it? Are you one of those "look at the price -- it must be manipulation!" people, or are you one of those "everyone knows it's manipulated!" people? Who ever created Bitcoin knows how to manipulate.
Simple:)
Oh, I see. You're one of those people who don't realize how little they know.
|
|
|
Knowing that the human eye has an angular resolution limit of 1 minute allows for the calculation of the diameter of the Sun.
I don't understand how the angular resolution of the eye can be a factor in the diameter of the sun. Also, every eye's angular resolution is different and a camera can have a higher resolution than the eye, so, wouldn't that affect the diameter? Sorry if you have explained it already. A summary would suffice.
|
|
|
I think it is a mistake to assume that OTC trades don't affect the prices on exchanges, and vice-versa. The two markets are not exclusive, and supply and demand in one affects the supply and demand in the other.
|
|
|
I understand that its not good security and privacy practice to reuse addresses after a spend due to the fact that the public key becomes available for that address during the spend and it essentially weakens the security and privacy.
The primary issue with address reuse is privacy, though there is also a small security risk. There is no benefit to reusing addresses, so why do it?
|
|
|
Noob/first post - appreciate some help. I'm doing some basic modelling and would like to know if I have the following logic right:
If the current network hash rate is 360,000,000,000 TH/h; one has a 244,800 TH/h miner; and, the network reward is 75 (BTC/h) one would theoretically expect to mine 0.000051 BTC/h, correct?
Roughly speaking, your portion of the block reward is equal to your portion of the total hash rate. If your hash rate is 244,800 TH/h and the total hash rate is 360,000,000,000 TH/h, then your portion is 0.00000068 of the block reward, or 0.000051 BTC. However, that calculation makes several assumptions. xhomerx10 describes how to get the actual expectation.
|
|
|
What about flipping 256 coins all at once? I would expect that to be a lot faster.
|
|
|
You don't seem to understand how close to 0 it is.
It is literally impossible to have the probability of collision be exactly 0 because that would require an infinite search space which is literally impossible (would require infinite matter and infinite energy which do not exist).
Got it, I'm just thinking there might be just 1 collision happening at one point in the future, even with the chances so small. I mean, again, it's VERY close to 0 but there still is that one very little chance of collision, right? Please watch this: https://www.youtube.com/watch?v=nFTRwD85AQ4
|
|
|
It depends on the token. Bitcoin, no. EOS, yes. Others, maybe.
|
|
|
My thoughts:
I believe that the slowest operations are the signature checking operations. So, the most time consuming transaction would simply do OP_CHECKSIG repeatedly (with a couple of stack operations in between).
Since there are no loops, each instruction is executed at most once. So, the execution time is roughly proportional to the size of the transaction, which means that if you want to be a nuisance, you are going to have to pay for it. Furthermore, ss cryptography becomes more prevalent, we are going to start seeing cryptographic operations in hardware, which should speed up the signature checking operations greatly.
|
|
|
I believe the second quote is just saying that enforcing a valid UOT requires a hard fork.
|
|
|
If 8333 is blocked, you can use a different port, but if the router or ISP allows only white-listed ports, then you are probably stuck.
|
|
|
|