AVERAGE_GARY on Nostr: So hash a thing. Cat to next thing. Repeat hash. Repeat. I follow how we can ...
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.
rot13maxi (npub1mxr…0htc)
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?
Rob1Ham (npub1emd…c9aw) NVK (npub1az9…m8y8)
PS poelstra nostr? 🤔
Published at
2024-06-23 18:13:24Event JSON
{
"id": "6f73d2b8dc34999c046a4cb5e323e6338987a49fc17770b9cadfe90d8fa32968",
"pubkey": "d3d74124ddfb5bdc61b8f18d17c3335bbb4f8c71182a35ee27314a49a4eb7b1d",
"created_at": 1719166404,
"kind": 1,
"tags": [
[
"e",
"37602ab921c95be844ade612c4adf2bb4b0e2ca416255d91e247045c4d01c79b",
"",
"mention"
],
[
"p",
"d3d74124ddfb5bdc61b8f18d17c3335bbb4f8c71182a35ee27314a49a4eb7b1d",
"",
"mention"
],
[
"q",
"37602ab921c95be844ade612c4adf2bb4b0e2ca416255d91e247045c4d01c79b"
]
],
"content": "So hash a thing. Cat to next thing. Repeat hash. Repeat.\n\n I follow how we can determine inclusion in a Merkle tree. \n\nStill curious how this differs from Taproot? Might hear it again but pondering aloud.\n\nnostr:nevent1qqsrwcp2hysujklggjk7vyky4hetkjcw9jjpvf2aj83ywpzuf5qu0xcpz4mhxue69uhkummnw3ezummcw3ezuer9wchsygxn6aqjfh0mt0wxrw8335tuxv6mhd8ccugc9g67ufe3ffy6f6mmr5psgqqqqqqs2h80t2",
"sig": "64e433d56fe01603830dd65b38aa2d1a91ae614b29fe9fb22822a90395fa65b83684799a9f350510295d8993313477d5669bd38a16acac52fec78ebed5b55d2d"
}
