How did a nobel prize winner made a so basic mistake on a topic that has been covered before by him so many times?
Bet one Btc that he did that on purpose.
How did a nobel prize winner made a so basic mistake on a topic that has been covered before by him so many times?
Bet one Btc that he did that on purpose.
Therefore any competing ideas (e.g. gold, bitcoin) need to be disregarded, especially as economists by now have realized the importance of trust and its cognitive impact on markets.
I'd prefer the opinions of PhD economists with a special emphasis on currency transactions over yours or anyone else's, actually.
(a) ideological, (b) partisan, or (c) a smokescreen.
I thought it was used to analyze the relationship between investment, interest rates, and economic production. It's been able to (for example), explain why inflation would be nowhere in sight in the face of government borrowing or quantitative easing given the current state of our economy. Or why any finite currency (gold, bitcoin) would lead to rampant deflation and thus depression conditions.
Can you please elaborate as to why IS-LM the ideological ruse you claim it to be? Krugman may be a hack, but I start to believe the hacks who are continuously right most of the time, and ignore the ones who are often wrong. Just the empiricist in me.
I ask because I know I've heard about people building huge computers with lots of expensive video cards for the purpose of mining bitcoins. Why would so much computing power be required to perform a simple task like processing transactions? Isn't there additional work necessitated by the intentional complexity of the mechanics of bitcoin mining?
I don't know very much about how bitcoins are mined, so I'm speaking from ignorance here, but I'm hoping you can see why the layman observer would need more of an explanation than "Because, of course!"
In short: no, it doesn't really need so much computing power; miners upgrade to improve their relative chances of finding the solution first (which gives them the newly minted coins), and the software automatically increases the difficulty of the process in response. The result is an arms race among miners.
A block contains several pieces of information: a list of transactions, a link to the previous block, some other stuff and a nonce. The nonce is a value used by the mining process. "Solving" a block means finding the value for the nonce that, together with the proper contents of the block, hashes to a hash value that starts with a given number of zeroes. You can't really find a correct nonce any other way than by trying new nonces until you find a correct one, hashing the block each time. This is what the mining process is, in short.
As to the question how Bitcoins come into existence, the miners are in control of the accounting and by design whoever "finds a new block," is allowed to create some Bitcoins (currently 25) out of thin air. The advantage of this is, that even if some very large miner is considering that he could try a 50+1 % attack, he has a strong incentive to stay honest because that way he earns half of the newly mined Bitcoins.
As computing power is a function of the expenditure of wealth, this is equivalent to saying "as long as you trust the people who have thrown the most money at having power over the bitcoin system are honest."
Are you saying that each transaction that is verified has many miners competing to verify it and the one with the most gpu power wins the race? And if so, does that mean that the gpu that won the race an then say it is verified even if to say it is an incorrect transaction would be the truth?
If instead you are merely referring to the 50%> effect, the solution to that is way easier than the potential for abuse intrinsic if the statement quoted above is correct, i.e. simply have more miners.
B1 -> Bx -> Bx3 -> Bx4 branch (with non valid block Bx)
\
->B2->... branch with all valid blocks (the miners work on this one)
The trick is then, that the longest block chain (without an invalid block) is assumed to be correct, and the honest miners are all working on this longest chain. ( That is what I meant with 'backed by most computing power.') For a transaction to be verified, there is actually no hard standard but in the Bitcoin paper [1] it is suggested to wait, until the transaction is 6 blocks removed from the newest block, since a malicious transaction could be introduced into the top of the block chain, e.g. at block Bx above. But the honest miners would not accept the block, continue to try to extend B1, and eventually they will find B2. ( And extend this branch.) The attacker ( who is working on the Bx chain) can then perhaps beat the network by luck for a few blocks ( Bx3, Bx4), but assuming the honest miners control most of the computing power at some point they will win. ( It should be noted that AFAIK there are no known deterministic algorithms for creating a valid block. Because of this, who solves the next block is a probabilistic process. So it is not the guy with the most computing power, but some random guy who had a chance proportional to his computing power just like everyone else.)Yes, resources are required, but the amount of resources used far and away exceeds the amount of resources required.
Yes, there's a computational power threshold to perform certain attacks against the network, and removing your node marginally decreases that threshold.
Is it necessary? That depends on your priorities and your threat model.
Your argument neatly cancels out your conclusion.
The network is made of the nodes.