h4sh3d / xmr-btc-atomic-swap Goto Github PK

thus making the worst case scenario a redund with fee costs on each chain

"redund" should presumably be "refund".

Great work.
Why is not possible to make one transaction script for three possible withdrawals?

1. Swap as expected
2. Bob refund by timelock
3. Alice takes bitcoins after time lock

Smth like?

OP_IF  
   OP_SHA256 <h_a> OP_VERIFY
   OP_SHA256 <h_s> OP_VERIFY
   <B_a> OP_CHECKSIG
OP_ELSE
   <t_0> OP_CHECK
   OP_SHA256 <h_b> OP_VERIFY
   <B_b> OP_CHECKSIG
OP_ElSE
   <t_1> OP_CHECK
   <B_a> OP_CHECKSIG
OP_ENDIF

When I raised the question on IRC, I was wondering specifically if folks had more thoughts on the zkp part of your proposal. The usual bitcoin ZKCP example that gets thrown around is the pay-for-sudoku-solution and that was a nontrivial amount of work. I'm unclear of how much work this particular ZK proof would be. It seems like a fairly mechanical "shape" of proof, but I don't have a good sense for how much data would be involved.

Did you plan to implement it in JavaScript or Go?

https://monero.stackexchange.com/a/895

It seems like a very similar idea, and I'm wondering how it differs. Yours is obviously more detailed but the major steps seem pretty similar.