So hash a thing. Cat to next thing. Repeat hash. Repeat.
I follow how we can determine inclusion in a Merkle tree.
Still curious how this differs from Taproot? Might hear it again but pondering aloud.
nostr:npub1mxrssnzg8y9zjr6a9g6xqwhxfa23xlvmftluakxqatsrp6ez9gjssu0htc
For op_cat, its purely byte weighted for limits? Like a const somewhere?
It doesnot use the modeling stuff discussed toward the end by Andrew?
nostr:npub1emdtsxly9m68m00x206t574jttp65vk0c2m89ms038q047yz7ylqcac9aw nostr:npub1az9xj85cmxv8e9j9y80lvqp97crsqdu2fpu3srwthd99qfu9qsgstam8y8
PS poelstra nostr? 🤔
Discussion
Want to check a merkle inclusion proof *in* your script? Need CAT. Want to check that your script itself was included in the address commitment? Thats taproot
I'll have to poke around Inquisition scripts. I think my mental model for Taproot was checking in script for merkle inclusion. Need to separate thid nuance in my head.