AVERAGE_GARY on Nostr: I am familiar with PoL. It was a key concept for eHash. Does merkleization make it so ...
I am familiar with PoL. It was a key concept for eHash.
Does merkleization make it so every burn Perot isn't nrccessary for auditing the entire set? Just using a subset of the merkle tree to validate inclusion should give assurances?
Published at
2025-02-06 14:26:44Event JSON
{
"id": "1866a330fdab47c27c8ea166b6c8fe41a60af515d755639a38308bac1a40a2e3",
"pubkey": "d3d74124ddfb5bdc61b8f18d17c3335bbb4f8c71182a35ee27314a49a4eb7b1d",
"created_at": 1738852004,
"kind": 1,
"tags": [
[
"e",
"8180ee76065eecefc878f4d50415e8b55581b7b569937c34b54101da2d58bbaf",
"",
"root"
],
[
"e",
"27399d1f7cea94ab7e51bf01b2480b9336cba9f859abb7ef5fae658afb2778e0"
],
[
"e",
"819086626e14d0e39f7ba21889f1fe45c552ecc583a5a9c69730b32e8c350c71",
"",
"reply"
],
[
"p",
"50d94fc2d8580c682b071a542f8b1e31a200b0508bab95a33bef0855df281d63"
],
[
"p",
"d3d74124ddfb5bdc61b8f18d17c3335bbb4f8c71182a35ee27314a49a4eb7b1d"
]
],
"content": "I am familiar with PoL. It was a key concept for eHash. \n\nDoes merkleization make it so every burn Perot isn't nrccessary for auditing the entire set? Just using a subset of the merkle tree to validate inclusion should give assurances?",
"sig": "eaaaad6c1fe338f8e61f7f828d2cd1e37798bef3e964e7f977fe93ae3ed81be15fed320d7236774fa2731da786dac1ec7e2a7a73e77dd805d12de99c8a6b3405"
}
