OpenSourceOptimist on Nostr: So if the checksum does not match we know to stop paying. But at that point we have ...
So if the checksum does not match we know to stop paying. But at that point we have data loss.
If this file is of any importance it need to be stored in multiple places. If it is not important at all, why pay to store it...
If it is stored in multiple independent places we should be able to check the copies against each other.
No need for this subset selection.
Also, if my math maths, 32 bytes is the exact same size of the sha256 hash. Why do the hash?
Published at
2024-10-05 04:23:56Event JSON
{
"id": "8fee8fff79be697417adfc381bf1b4b7e1091a019077af5511c1583a84955506",
"pubkey": "ff4f4392ab4ac9d8c7c9ab6dc8ae50d4bf4bb19053928f28f1f737fbfced164b",
"created_at": 1728102236,
"kind": 1,
"tags": [
[
"e",
"a11de9ebe00bf2f42973c897a955c70765a4af43109bd595fab2a48e6ac82626",
"",
"root"
],
[
"p",
"32e1827635450ebb3c5a7d12c1f8e7b2b514439ac10a67eef3d9fd9c5c68e245"
],
[
"p",
"7b3f7803750746f455413a221f80965eecb69ef308f2ead1da89cc2c8912e968"
]
],
"content": "So if the checksum does not match we know to stop paying. But at that point we have data loss. \n\nIf this file is of any importance it need to be stored in multiple places. If it is not important at all, why pay to store it... \n\nIf it is stored in multiple independent places we should be able to check the copies against each other.\n\nNo need for this subset selection. \n\nAlso, if my math maths, 32 bytes is the exact same size of the sha256 hash. Why do the hash? ",
"sig": "2c066908444614b51e365aa1d74e6366b6b1cbd4b9862b511dcfae1161c7970feaf4ddafb5eb526262c76c7093fc3a1a2ea115e3c1bc7d219a5b49815bcb1d67"
}