3 ms·

Okay, maybe I should have posted the link to the Merkle tree page[0] instead. The basic idea is, you have a chain of 'transactions' (like in bitcoin or think g

by moehm 4y ago

Okay, maybe I should have posted the link to the Merkle tree page[0] instead. The basic idea is, you have a chain of 'transactions' (like in bitcoin or think git commits) und you store the hash of the content + the hash of the member before as a checksum. This way, if you alter the log file, the hash for the modified entry is suddenly different, and the chain breaks, because the next member used your hash as input to calculate their checksum. So you can not only see that the file was tampered with, you can also say which entry was modified. Edit: Merkle trees[0] generalize this concept into trees, which are e.g. used in ZFS (the file system), git and in the blockchain. [0] https://en.wikipedia.org/wiki/Merkle_tree https://en.wikipedia.org/wiki/Merkle_tree

presidentender 4y ago
It seems to me that if you have a copy of the information locally and compare it to the remote, you can see whether they diverged with or without a hash - the hash certainly makes it faster, but it's not clear to me that a hash chain or a Merkle tree offers a guarantee that's as powerful as the blockchain's promise. (Social factors and forks to change our minds on blockchains notwithstanding)