BitVM

[nud3l]

Is your feature request related to a problem? Please describe.
With BitVM, we can likely build a Bitcoin bridge that only requires 1 of n honest parties. That is much better than the trust assumptions of current bridges and offsets the opportunity cost of locked collateral as in iBTC.

There are many open questions around BitVM and how exactly to implement a bridge. I see the core issue as being able to write a light client for another chain in BitVM - or rather a fraud proof to verify the light client in BitVM.

Describe the solution you'd like
I think an interesting first step would be to implement a toy program in BitVM. This could be something quite simple by verifying that a value is 0 in BitVM. A more complex example would be to implement a SHA256 checker. There are already a couple of these examples here: https://techmix.github.io/tapleaf-circuits/

Outcome of this issue would be to have a a working toy example and a knowledge sharing session how to implement programs in BitVM.

After this, we can break down the requirements for a light client for BOB into its individual parts and try start to implement the relay in BitVM.

Additional context
I found the youtube videos most helpful to get an initial understanding and then the interactive BitVM examples:

• https://www.youtube.com/watch?v=9aBuGObjEHs
• https://www.youtube.com/watch?v=IRU83gRcw3Y
• https://github.com/BitVM/BitVM
• https://techmix.github.io/tapleaf-circuits/
• https://magical-frangipane-149aba.netlify.app/compiler
• https://supertestnet.github.io/8bit-cpu-for-bitvm/#

The BitVM TG chat is very active: https://t.me/bitVM_chat