Fossil SCM
Updated the paragraph on SHA1 hashes in www/concepts.wiki to also talk about SHA3-256.
Commit
ac2c2c77ff10f9cb1d0a43ebd5a8dccbcd898d1fb87401f9a020c62c443d81ee
Parent
f143b606a0da672…
1 file changed
+13
-10
+13
-10
| --- www/concepts.wiki | ||
| +++ www/concepts.wiki | ||
| @@ -82,20 +82,23 @@ | ||
| 82 | 82 | at a repository and get human-readable status, history, and tracking |
| 83 | 83 | information about the project. |
| 84 | 84 | |
| 85 | 85 | <h3>2.1 Identification Of Artifacts</h3> |
| 86 | 86 | |
| 87 | -A particular version of a particular file is called an "artifact". | |
| 88 | -Each artifact has a universally unique name which is the | |
| 89 | -<a href="http://en.wikipedia.org/wiki/SHA1">SHA1</a> hash of the content | |
| 90 | -of that file expressed as 40 characters of lower-case hexadecimal. Such | |
| 91 | -a hash is referred to as the Artifact Identifier or Artifact ID | |
| 92 | -for the artifact. The SHA1 algorithm is created with the purpose of | |
| 93 | -providing a highly forgery-resistant identifier for a file. Given any | |
| 94 | -file it is simple to find the artifact ID for that file. But given a | |
| 95 | -artifact ID it is computationally intractable to generate a file that will | |
| 96 | -have that Artifact ID. | |
| 87 | +A particular version of a particular file is called an "artifact". Each | |
| 88 | +artifact has a universally unique name which is the <a | |
| 89 | +href="http://en.wikipedia.org/wiki/SHA1">SHA1</a> or <a | |
| 90 | +href="http://en.wikipedia.org/wiki/SHA3">SHA3-256</a> hash of the | |
| 91 | +content of that file expressed as either 40 or 64 characters of | |
| 92 | +lower-case hexadecimal. (See the [./hashpolicy.wiki|hash policy | |
| 93 | +document] for information on which algorithm is used, when.) Such a hash | |
| 94 | +is referred to as the Artifact ID. These hash algorithms were created | |
| 95 | +with Fossil's purpose in mind: to provide a highly forgery-resistant | |
| 96 | +identifier for a blob of data, such as a file. Given any file, it is | |
| 97 | +simple to find the artifact ID for that file. But given an artifact ID, | |
| 98 | +it is computationally intractable to generate a file that will have that | |
| 99 | +same artifact ID. | |
| 97 | 100 | |
| 98 | 101 | Artifact IDs look something like this: |
| 99 | 102 | |
| 100 | 103 | <blockquote><b> |
| 101 | 104 | 6089f0b563a9db0a6d90682fe47fd7161ff867c8<br> |
| 102 | 105 |
| --- www/concepts.wiki | |
| +++ www/concepts.wiki | |
| @@ -82,20 +82,23 @@ | |
| 82 | at a repository and get human-readable status, history, and tracking |
| 83 | information about the project. |
| 84 | |
| 85 | <h3>2.1 Identification Of Artifacts</h3> |
| 86 | |
| 87 | A particular version of a particular file is called an "artifact". |
| 88 | Each artifact has a universally unique name which is the |
| 89 | <a href="http://en.wikipedia.org/wiki/SHA1">SHA1</a> hash of the content |
| 90 | of that file expressed as 40 characters of lower-case hexadecimal. Such |
| 91 | a hash is referred to as the Artifact Identifier or Artifact ID |
| 92 | for the artifact. The SHA1 algorithm is created with the purpose of |
| 93 | providing a highly forgery-resistant identifier for a file. Given any |
| 94 | file it is simple to find the artifact ID for that file. But given a |
| 95 | artifact ID it is computationally intractable to generate a file that will |
| 96 | have that Artifact ID. |
| 97 | |
| 98 | Artifact IDs look something like this: |
| 99 | |
| 100 | <blockquote><b> |
| 101 | 6089f0b563a9db0a6d90682fe47fd7161ff867c8<br> |
| 102 |
| --- www/concepts.wiki | |
| +++ www/concepts.wiki | |
| @@ -82,20 +82,23 @@ | |
| 82 | at a repository and get human-readable status, history, and tracking |
| 83 | information about the project. |
| 84 | |
| 85 | <h3>2.1 Identification Of Artifacts</h3> |
| 86 | |
| 87 | A particular version of a particular file is called an "artifact". Each |
| 88 | artifact has a universally unique name which is the <a |
| 89 | href="http://en.wikipedia.org/wiki/SHA1">SHA1</a> or <a |
| 90 | href="http://en.wikipedia.org/wiki/SHA3">SHA3-256</a> hash of the |
| 91 | content of that file expressed as either 40 or 64 characters of |
| 92 | lower-case hexadecimal. (See the [./hashpolicy.wiki|hash policy |
| 93 | document] for information on which algorithm is used, when.) Such a hash |
| 94 | is referred to as the Artifact ID. These hash algorithms were created |
| 95 | with Fossil's purpose in mind: to provide a highly forgery-resistant |
| 96 | identifier for a blob of data, such as a file. Given any file, it is |
| 97 | simple to find the artifact ID for that file. But given an artifact ID, |
| 98 | it is computationally intractable to generate a file that will have that |
| 99 | same artifact ID. |
| 100 | |
| 101 | Artifact IDs look something like this: |
| 102 | |
| 103 | <blockquote><b> |
| 104 | 6089f0b563a9db0a6d90682fe47fd7161ff867c8<br> |
| 105 |