7 ms·
>programmatically determined and changes Ethereum's Solidity is a great real world example. The instructions are compiled into a binary, and that binary can b
by Zamicol 5y ago
>programmatically determined and changes
Ethereum's Solidity is a great real world example. The instructions are compiled into a binary, and that binary can be addressed via its cryptographic digest.
Changes in state are easily represented as instructions.
>multiple versions, translations, or updates, strictly using hashes?
The same way a git repo does it now: Good software design.
>is not a strict use of hashes
Huh? I'm not sure what your trying to convey. Are you referring to the fact that git uses diffs between commits? At any commit, a repo may be re-hashed and the current state completely represented by a digest.
Of all things to worry about being represented as a digest, software seems to be one of the smallest concerns.
- dredmorbius 5y agoGit chain hashes. Merkle trees are useful. They include hashes. They are not simply hashes. Content-addressable storage robust against variations is another approach.
- Zamicol 5y agoI'm at a loss for your criticism. Didn't the original post say, "How they [hashes] get implemented in solving this problem is the question"? Merkle trees implement cryptographic hashes. >Git chain hashes. Git chains hashes? Yes, of course, along with diffs. How the permanent web will implement digests in various applications is the question. Whatever the answer is for link rot, the guaranteed solution will implement and depend upon cryptographic hashing algorithms. There are already many examples of this class of problem being solved by utilizing hashes.
- dredmorbius 5y agoYou may be trying to read too much into my statement. It's simply that hashes, alone, do little, and that hash-free solutions might well exist as well. Bald assertions of simple necessary and sufficient solutions are almost always mistaken.