Re:Peter Todd (Bitcoin core dev) set up a SHA-1 “Pinata” and...
by mikeash on Thursday February 23, 2017 @11:51AM
(#13715352)
I'm really interested in the comment about someone else running a bot that tries a double-spend based on the answer in the original transaction. It sounds like it didn't work, but it could have. Is there a way to set up these sorts of automated challenges in a way that isn't vulnerable to that?
[ Parent
| on HN ]
Re:Peter Todd (Bitcoin core dev) set up a SHA-1 “Pinata” and...
by ikeboy on Thursday February 23, 2017 @12:03PM
(#13715468)
Discussed in https://www.reddit.com/r/Bitcoin/comments/1mavh9/trustless_b...
You'd need a system supporting zero knowledge proofs.
Re:Peter Todd (Bitcoin core dev) set up a SHA-1 “Pinata” and...
by mikeash on Thursday February 23, 2017 @12:19PM
(#13715638)
Excellent post, thanks for linking to it.
Re:Peter Todd (Bitcoin core dev) set up a SHA-1 “Pinata” and...
by DINKDINK on Saturday February 25, 2017 @10:26AM
(#13731925)
In addition to the zero knowledge proof points discussed below, one could (if they had the mean) to not publish the tx but include it in a block that they work on privately. It's not fool proof (once you announce the block, you've only given yourself one block worth of proof of work lead and an attacker could copy your proof and include it in a competing chain)
ZKCP is a much more robust solution.
Re:Peter Todd (Bitcoin core dev) set up a SHA-1 “Pinata” and...
by jstanley on Thursday February 23, 2017 @11:57AM
(#13715414)
I can't see how you'd do it for a case like this.
The script is just checking that the spender knows 2 pieces of data that are different but have the same SHA1 hash. I can't see a way to do that that can't be easily replayed by somebody else spending to a different address.
As soon as the transaction is broadcast, you reveal your 2 pieces of data that are different but have the same SHA1 hash.
Re:Peter Todd (Bitcoin core dev) set up a SHA-1 “Pinata” and...
by nullc on Thursday February 23, 2017 @12:48PM
(#13715926)
Either by using interaction (with a ZKCP) or by using a two phase redemption and a covenant (https://blockstream.com/2016/11/02/covenants-in-elements-alp... which requires OP_CAT and friends which are disabled but could easily be reenabled after the segwit improvement to Bitcoin).
Re:Peter Todd (Bitcoin core dev) set up a SHA-1 “Pinata” and...
by jstanley on Thursday February 23, 2017 @01:32PM
(#13716383)
Fascinating stuff, thanks!
Re:Peter Todd (Bitcoin core dev) set up a SHA-1 “Pinata” and...
by kolinko on Thursday February 23, 2017 @12:02PM
(#13715458)
It's possible in Ethereum. You set a two-step process, in the first step you claim the solution - providing a hash of it, and your address. In the second step (in the next block), you provide the solution, and a smart contract can only send money to the address you provided in the first step.
Re:Peter Todd (Bitcoin core dev) set up a SHA-1 “Pinata” and...
by nullc on Thursday February 23, 2017 @12:46PM
(#13715902)
It's possible in Bitcoin too and not just for the kind of trivial program you could plausible execute in a public blockchain. https://bitcoincore.org/en/2016/02/26/zero-knowledge-conting...
(And to not put too fine a point on it: the existing track record of ethereum smart contracts suggests that if such a bounty had been created there it would have simply been stolen due to contract/vm flaws by now.)