4 ms·
Last time the Casper fork was discussed on HN I read through a very long and very dense document only to find out that Vitalik, or someone similar, had a key th
by xorcist 9y ago
Last time the Casper fork was discussed on HN I read through a very long and very dense document only to find out that Vitalik, or someone similar, had a key that decided which blocks were genuine, in case of dispute. I take it that design has not changed? In that case I am surprised the design could not be simplified further.
- DennisP 9y agoEh, no, there's no special Vitalik key.
- xorcist 9y agoThat was a bit tongue in cheek, it's probably the Foundation. The documentation doesn't specify really how it's done, only that the nodes "authenticate out of band" to determine state when necessary.
- DennisP 9y agoThere's no key with special privileges. You're probably remembering "weak subjectivity," which is basically an acceptance of things like publicly known checkpoints every now and then. Anyone who's online continually doesn't need to rely on a checkpoint, but in PoS someone new coming in would need it...but this isn't all that different from needing to find out what software they need to run. E.g. Vitalik writes: "It solves the long-range problems with proof of stake by relying on human-driven social information, but leaves to a consensus algorithm the role of increasing the speed of consensus from many weeks to twelve seconds and of allowing the use of highly complex rulesets and a large state. The role of human-driven consensus is relegated to maintaining consensus on block hashes over long periods of time, something which people are perfectly good at. A hypothetical oppressive government which is powerful enough to actually cause confusion over the true value of a block hash from one year ago would also be powerful enough to overpower any proof of work algorithm, or cause confusion about the rules of blockchain protocol." https://blog.ethereum.org/2014/11/25/proof-stake-learned-love-weak-subjectivity/ https://blog.ethereum.org/2014/11/25/proof-stake-learned-lov...
- xorcist 9y agoHow do you know which checkpoints to trust, unless they are signed? And if you have trusted checkpoints I fail to see the point of proof-of-stake (or proof-of-anything really). Just call every block a checkpoint and you're done. Any remaining use cases probably centers around availability, but we know how to build highly available systems and can build them to any degree. Trustless and decentralized systems are much harder.
- runeks 9y agoHow do nodes choose which fork — past the latest checkpoint — to view as the main chain? E.g. let’s say I take the main chain, go back to the first block past the latest checkpoint, and remove the competing staking-transactions so that only my staking-transaction is present in that block. The I build on top of this, without competition, because I can selectively remove competing staking transactions simply by constructing new blocks that don’t contain them. Let’s say hundreds, or thousands, of stakers do this. How do nodes decide which chain is the right one?
- DennisP 9y agoIf I understand this right, in Casper the right chain is the one in which the least stake is destroyed. In one version, stakers are heavily penalized for going offline, so the chain you describe would destroy a fair amount of stake. This is Vlad Zamfir's version; Vlad is the lead Casper esearcher, and takes a more long-term theoretical approach, while Vitalik is more focused on near-term practicality. Vitalik's version doesn't penalize dropping offline as heavily; I don't know whether there's some other mechanism to cover this, or he just thinks a lighter penalty is sufficient. Thanks for the question! Until now I didn't realize the reason for the offline penalty.