3 ms·
Unless I am mistaken, you can verify arbitrary computations[0]. [0] http://arxiv.org/abs/1105.2003 http://arxiv.org/abs/1105.2003
by reginaldjcooper 13y ago
Unless I am mistaken, you can verify arbitrary computations[0].
[0] http://arxiv.org/abs/1105.2003 http://arxiv.org/abs/1105.2003
- lukifer 13y agoThe abstract says that "a practical general-purpose protocol for verifiable computation may be significantly closer to reality than previously realized". This should be interesting though, thanks for sharing!
- reginaldjcooper 13y agoYou have a fair point, but I claim for a proof-of-work computation it might be good for it to be a bit unpractical. (Depending on the parameters, this paper is on my reading list but I haven't gone through it yet.) I think it's incredibly interesting also, in any case I hope you enjoy the paper :)