TrueBit: Scalable Computation - Christian Reitwiessner
2,604 views · Published 29 March 2017 · 47:27 · Indexed 1 November 2026
Channel: Ethereum Foundation · 2017 · Science & Technology
Slides: http://chriseth.github.io/notes/talks/truebit_meetup_2017-03/#/ Interactive verification is one solution to the scalability problem. The idea is that large computations are proven to be faulty by chopping them up into smaller and smaller pieces until a tiny step remains that can be easily checked by smart contracts. The difficulty lies in motivating Verifiers to watch the process: Verifiers are hard to reward if they do not find an error and the desired situation is precisely the one where nobody cheats and thus no computation contains an error. This talk will introduce an incentive layer that properly rewards verifiers "even" in the case where everyone is honest.
More from this channel
-
14:55
State Channels Systemic Security Considerations and Solutions
-
21:20
A Correct by Construction Asynchronous Casper Protocol
-
14:57
Integrating Ethereum Into Our Daily Lives - Jarrad Hope
-
10:13
Decentralized Commercial Banking
-
20:37
Mist Vision and Demo UPDATED - Alex Van de Sande
-
31:53
Panel - Ethereum Enterprise
-
11:32
Dapple Dev Workflow - Nikolai Mushegian
-
14:55
Developing Scalable Decentralized Applications for Swarm & Ethereum - Dr. Daniel Nagy