moonsettler

So, how do you implement something like a Reed-Solomon decoder without CAT? How do you create relationships between transactions? cc: @weikengchen

> I think for PAIRCOMMIT to be very useful, you will need at least another opcode that handles covenants LNhance has CTV (and CSFS as well), does that change the...

And without CTV you can use presigned transactions... But with each piece missing it gets less practical I guess. Okay so here what I gather is, PC+CSFS materially extends what...

Guys, I'm sorry, but this doesn't really add up. Yes you can verify arbitrary Merkle inclusion with PC in an arbitrary root hash, but that will not prove anything meaningful...

So @rot13maxi came to the rescue, and explained a bit about what could be going on. I will try summarize where I'm at: 1. Merkle inclusion proofs are trivial with...

Switched back to markdown. Header now in BIP-2 format.

The original create date of OP_PAIRCOMMIT is 2024-03-15 this is the latest revision based on feedback from Anthony Towns. https://gist.github.com/moonsettler/d7f1fb88e3e54ee7ecb6d69ff126433b/revisions What date should go to the header?

> Has this proposal been sent to the mailing list? ~~Not yet. Wanted to get it into an acceptable shape before I post it there.~~ Proposed to the mailing list,...

It looks like we gonna have to amend the `PAIRCOMMIT` BIP with some new use cases. Turns out within certain practical limitations any computational function can be proven out in...

> ### Proving general computation > > Merkle trees can be used to prove out computation where the root of the tree > represents the *function* and the leaves represent...