Video wird geladen...

Video konnte nicht geladen werden

Zur Startseite

On proof-of-work, miners can collude to reorder settled transactions. On proof-of-stake, the biggest pools can reorder or roll back the chain. Settlement finality isn't a given on most networks, it's a property you have to verify before you trust it.

22,702 Aufrufe • vor 1 Monat •via X (Twitter)

0 Kommentare

Keine Kommentare verfügbar

Kommentare vom Original-Post werden hier angezeigt

Ähnliche Videos

Vitalik Buterin explains why proof-of-stake is more secure than proof-of-work “I think proof of stake is very secure because to attack the system, you need to have basically as much stake as the rest of the network. Right now, for example, we have 5 million ETH staking, which means you have to come up with 5 million ETH and then join the network.” At the time of this writing, more than 37 million ETH are being staked, with 3 million ETH waiting to join via the validator queue. At today’s prices, that’s more than $80 billion of ETH someone would have to acquire to attack the network and revert finalized blocks, which is more than the cost of attacking even the Bitcoin network by some estimates. The other defense mechanism that proof-of-stake has that proof-of-work doesn’t is slashing, which makes Ethereum antifragile. Vitalik explains: “Recovering from attacks is much easier in proof-of-stake than proof-of-work. For many kinds of attacks you do against [the Ethereum] network, we have this concept of automatic slashing. In order to revert a finalized block, you basically have to have a big portion of your validators sign two conflicting messages. This is something where once these messages are on the network, you can go and prove ‘these people did it.’ So we have this feature in the protocol where you basically take all these people who provably misbehaved and you burn their coins.” Vitalik also acknowledges the possibility of censoring attacks, where if 1/3rd of validators refuse to attest, the chain can’t finalize. But, as he explains, Ethereum has a contingency plan for this as well: “Everyone who got censored would create a minority chain, and the community would have to do a soft fork. The would have to say, ‘this chain is clearly attacking us and this one is not attacking us, so we’re going to join this chain.’ Then what happens is, on that new chain, the attackers also lose a lot of coins. The difference between proof-of-stake and proof-of-work is that in a proof-of-stake system, you can identify specific participants — and this isn’t a human going in and saying ‘I don’t like you’. It’s all automated.” One last benefit of proof-of-stake is that security scales with the value of the network. As Vitalik put it five years ago, it is really relative security, and not absolute security, that matters: “The security needs of a thing have to be proportional to the size of that thing, because as a thing gets bigger, its enemies become bigger and more well-motivated. If BTC were 100x as big as it is today, the value from destroying it would be 100x higher, and the kinds of actors that would want to care about destroying it would be much bigger and scarier. This is also why countries of all sizes have roughly similarly sized militaries as a percentage of GDP. Hence, cost of attack divided by market cap really is the correct statistic to measure, and in the long run issuance-free PoW really does look not that good." Source: Lex Fridman (Jun 2021)

Etherealize

102,091 Aufrufe • vor 5 Monaten

Axiom Math's Carina Hong on why verification isn't about catching mistakes, it's how you drive the cost of a proof to zero: "Formal verification is going to make your life slightly better if you're facing a proof with one million lines. Remember the Erdős unit distance problem, the chain of thought being generated? There are actual mathematicians trying to follow it step by step and scrutinize it. That seems very difficult if you're not in that very niche domain of discrete geometry intersecting with algebraic number theory." "But if you have a Lean proof accompanying it, you can just run it. And running the Lean proof gives you that provable guarantee that this proof is sound." "I have a hot take. People think Lean is this library built on the existing Mathlib. I think it's going to grow significantly. A lot of the hurdles where Lean is difficult is that the basic definitions of some mathematical fields are just not in the library." "My hot take is the scaling law, if you go down the formal mathematics path, is going to be a lot steeper than informal mathematics. So it's not just for verification, for trust, it's also for performance, it's also for optimal generation." "Verification is not like insurance. It's not something where, oh, we want to make sure there's no flaw. That's great, but it also helps you generate mathematics, both proofs and conjectures and theories, a lot better." "So imagine the cost of proof goes to zero. Then you can massage the problem statements, and even if it's an open problem, a lot more easily, flexibly, and adaptively." Carina Hong Axiom

MTS

13,248 Aufrufe • vor 1 Monat