Re:Bitcoin and the Byzantine Generals Problem
by reginaldjcooper on Monday December 16, 2013 @12:02AM
(#6913018)
Unless I am mistaken, you can verify arbitrary computations[0].
Re:Bitcoin and the Byzantine Generals Problem
by lukifer on Monday December 16, 2013 @05:26AM
(#6913899)
The 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!
Re:Bitcoin and the Byzantine Generals Problem
by reginaldjcooper on Monday December 16, 2013 @09:28AM
(#6914855)
You 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 :)
Re:Bitcoin and the Byzantine Generals Problem
by 3rd3 on Sunday December 15, 2013 @08:47PM
(#6912199)
What about Primecoin?
Re:Bitcoin and the Byzantine Generals Problem
by lukifer on Sunday December 15, 2013 @09:21PM
(#6912337)
See the discussion above. :) Prime number sequences are unlikely to be "useful" in the same sense as protein folding.
Re:Bitcoin and the Byzantine Generals Problem
by gnaritas on Sunday December 15, 2013 @10:46PM
(#6912711)
Another possibility.
I sincerely hope that a truly useful proof-of-work can be discovered. It would be a very big deal.
The problem is, the work has to be reliably verifiable, and easier to verify than just doing the work over again, which is why hashes are a good fit.