TrueBit: Scalable Computation - Christian Reitwiessner
Channel: Ethereum Foundation
Date: 2017-03-29

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.