Hi, aj. Thanks for taking a look!
> "O(n log n)" sounds wrong? Isn't it O(P + log(N)) where P is the size
> of the program, and N is the number of steps (rounded up to a power of 2)?
Thanks, you are right. That's a typo, it should indeed be O(log n). n
being the number of steps in the program. I
Hi, Antoine.
It sounds like perhaps OP_CHECKCONTRACTVERIFY can achieve what you are
looking for:
https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2023-May/021719.html
By committing the participants' pubkeys and balances in the dynamic
data instead of the taptree one can imagine a subset o
