up to the world. 1 billion dishonest claims? Doesn't matter. The adversary has an immense advantage in computer power & financial resources? Dave will defeat this Goliath with a few stakes on a laptop. Let’s dive in 👇
https://x.com/cartesiproject/status/1704481028067274987
Scaling without compromising security and decentralization in programmable blockchains is a hot topic, and for good reason! With increasing Web3 adoption, the demand for secure methods to handle intensive computations on the blockchain is growing.
One preferred solution involves off-chain computers competing to prove that theirs is the correct result of a given intensive computation.
But hold on, there's a problem here. The cost of defending an honest claim grows linearly with the number of competing claims. So, disputes involving a significant number of parties become impractical and open to Sybil attacks.
That’s where Dave comes in! Cartesi’s Research & Reference units are working on a game-changing dispute resolution algorithm, where the cost of disputes for a single honest competitor grows logarithmically with the number of opponents.
Dave is more than just a solution. Dave is a novel, stronger primitive for building permissionless fraud-proof protocols. What's more, Dave doesn't rely on complex economic incentives to be enforced!
The potential here is enormous. It's not just about scalability; it's about creating a secure and efficient ecosystem for programmable blockchains. Honest parties can fight together, sharing costs (which will be refunded) and the system is made safer through redundancy.
Check out the Permissionless Refereed Tournaments paper Dave is based on to learn more: https://arxiv.org/abs/2212.12439
What is Dave to you? Decentralized Arbitration for Verifiable Execution? Distributed Approach to Verified Enforcement? Decentralized Arbitration with Validated Evidence?
Help find an acronym for Dave 👶 - share yours below!
Retweet: https://x.com/cartesiproject/status/1704481028067274987
In case anyone missed it, let’s welcome DAVE to the Cartesi ecosystem. Learn how interactive disputes work and how a single computation instruction can be reprocessed on a Cartesi VM emulator. In this case, one single honest node can enforce the correct result, and this is crucial for the verifiability of any processing taking place in the rollups architecture. Any questions? Cartesi’s contributors are eager to engage with our community and discuss everything about it: https://x.com/gcdepaula_/status/1704495528862429340
Обсуждают сегодня