I define Off-chain contracts as contracts whose code is not run by all the miners and state transition is proved by consensus, in this way we can (1) run computation with a lot of data cheaply (2) run computation with high computational time without clogging the network (3) write code that is not bound to a cryptocurrency incentive structure.
Smart contracts that run on data and operations that are timestamped on an auditable and authenticated log (or merkle DAG). How can we prove the consistency of a state transition?
[ ] Versum quorum (the idea is to timestamp the result of a computation, versum provers sign the checkpoint and put some money at stake, new provers can come along and re-prove & confirm, if they reject the timestamp and the user agrees, initial set of provers gets penalized)
I define Off-chain contracts as contracts whose code is not run by all the miners and state transition is proved by consensus, in this way we can (1) run computation with a lot of data cheaply (2) run computation with high computational time without clogging the network (3) write code that is not bound to a cryptocurrency incentive structure.
Smart contracts that run on data and operations that are timestamped on an auditable and authenticated log (or merkle DAG). How can we prove the consistency of a state transition?
(Background: #14, #4, Shea's simple contracts)
General
Incentive-based
Computational Sound proofs (Verifiable computation)
Authenticated Data Structures
4
State Channels