diff --git a/.gitignore b/.gitignore
new file mode 100644
index 0000000..c4a847d
--- /dev/null
+++ b/.gitignore
@@ -0,0 +1 @@
+/result
diff --git a/.ipfsignore b/.ipfsignore
new file mode 100644
index 0000000..157ea12
--- /dev/null
+++ b/.ipfsignore
@@ -0,0 +1,2 @@
+/.git
+/result
diff --git a/deploy.sh b/deploy.sh
index 63ee0ea..6543b4d 100755
--- a/deploy.sh
+++ b/deploy.sh
@@ -3,44 +3,29 @@
set -euET -o pipefail
usage() {
- printf 'Usage: ./deploy.sh v1'\\n
- printf ' v1 will be used as the tag name for this version'\\n
+ printf 'Usage: ./deploy.sh v1.0.0'\\n
+ printf ' v1.0.0 will be used as the tag name for this version'\\n
}
if [ $# -ne 1 ]; then usage; exit 1; fi
-if [ "x$1" = "x-h" ] || [ "x$1" = "x--help" ]; then usage; exit 1; fi
+if [ "x$1" = "x-h" ] || [ "x$1" = "x--help" ]; then usage; exit 0; fi
-# e.g. v1
+# e.g. v1.0.0
version="$1"
-commit_hash="$(git log --format=%H -1 HEAD)"
-tempdir="$(mktemp -d)"
-tempdirgit="$(mktemp -d)"
-this_repo="$PWD"
-printf "Temporary directory: %s"\\n "$tempdir"
-
-# Clone this specific commit (could use a worktree, but I prefer not modifying the original repo if it can be avoided)
-git init "$tempdir"
-(cd "$tempdir"; git fetch --depth=1 "$this_repo" "$commit_hash")
-(cd "$tempdir"; git checkout "$commit_hash")
-(cd "$tempdir"; git log)
-(set -x; mv "$tempdir/.git" "$tempdirgit/")
-ls -a "$tempdir"
-
-if ! grep '<a id="this-version" href="https://github.com/jsmaniac/git-tutorial/tree/'"$version"'">'"$version"'</a>' "$tempdir/index.html"; then
+if ! grep '<a id="this-version" href="https://github.com/jsmaniac/git-tutorial/tree/'"$version"'">'"$version"'</a>' "index.html"; then
printf "Error: The version number given on the command-line does not match the one in the HTML source code."\\n
exit 1
fi
-# Add to IPFS and get the hash
-ipfs_hash="$(ipfs add --pin=true --recursive --hidden --progress --quieter "$tempdir")"
-ipfs_hash="$(ipfs cid base32 "$ipfs_hash")"
-printf \\n
+nix build
+diff result/www/directory_hashes.js directory_hashes.js
+diff result/www/favicon.ico favicon.ico
+# Add to IPFS and get the hash
+ipfs_hash="$(./result/www/ipfs-add.sh --pin=true)"
printf %s\\n "$ipfs_hash"
-ipfs name publish --key=git-tutorial "/ipfs/$ipfs_hash"
-
-sed -i -e 's~ipfs-this-hash-placeholder" href="#"~ipfs-this-hash-placeholder" href="ipfs://'"$ipfs_hash"'/"~' index.html
-git commit -m 'Stored IPFS hash of this version' index.html
git tag "$1"
git tag "ipfs-$1-${ipfs_hash}"
+
+ipfs name publish --key=git-tutorial "/ipfs/$ipfs_hash"
\ No newline at end of file
diff --git a/directory_hashes.js b/directory_hashes.js
new file mode 100644
index 0000000..6fe8ae7
--- /dev/null
+++ b/directory_hashes.js
@@ -0,0 +1 @@
+jsonp_ipfs_directory_hashes({"vanity_text":"soy","vanity_number":8104,"tree":{"Links":[{"Name":".gitignore","Hash":"QmW9iMXzmPqLSnzL4p6DKsvsL3nC1xKS3teRB4SRdukfrz","Size":16},{"Name":".ipfsignore","Hash":"QmPpQN29FbeaNwGsXbebbv588UZtSLCGRffa3Zrz68RAMp","Size":22},{"Name":"Blob.js","Hash":"QmSxKmtcBxBRkmkLGpnXAGrRc16kPrJx5Hmdsvt6LRWeSG","Size":21833},{"Name":"FileSaver.js","Hash":"QmUgg2HLo4W9bpf92CkHH6WWVFfg2DmNqJrz2Z46L7VmUq","Size":7367},{"Name":"JSZip","Hash":"QmWW2hDPrMU5e5KgSAMiqfM2YW5RSiZzWiNJSQ7w63ngiL","Size":422094},{"Name":"README","Hash":"QmPVpTsg2DmVqnCWRVua3vggVAoYLKzZPPgGf5ZQzzVUwf","Size":464},{"Name":"Viz.js","Hash":"QmaxUCu1gnFwTTpDoTAPB3fMQQav1NJZrZ7LGqLXECidKj","Size":3564410},{"Name":"codemirror-5.60.0","Hash":"QmXPbArMAid8MbC5G7HCyWz2PUkfSMWZaUQpnq63x8Dw2y","Size":4669604},{"Name":"deploy.sh","Hash":"QmTwid4ByPum8DdAcsGPaVpGuHcfr1GfXxbRpuPgabButs","Size":893},{"Name":"directory_hashes.js","Hash":"","Size":0},{"Name":"favicon.ico","Hash":"QmUq6pQamF58ZDNpPSvF3C2bcCWEJSjx3dFZZLjkSCrYpi","Size":32052},{"Name":"favicon.svg","Hash":"QmesnKGtStCZGpiTjoAcAETdSZgUUQ3wzekn1LSQMFtbgn","Size":3272},{"Name":"flake.lock","Hash":"QmdkX8PkV6j2sLH1JSPD1z4533rEGTa6JKSfsJcYAGSrvx","Size":1475},{"Name":"flake.nix","Hash":"QmVFaam6DfGDxQxWgWL2VdUaVtuQ9pj7W2aoopU8S26HKR","Size":1224},{"Name":"git-tutorial.css","Hash":"QmdsWg4RVZR3kRA7xFchoWLEQQzLpzVyspTtKwa9qttDMF","Size":10842},{"Name":"git-tutorial.js","Hash":"QmbcAMAuGyFumz4pHtKMnRY2VyRAr2tZoiYBLfNY3p2kCj","Size":47083},{"Name":"index.html","Hash":"QmehaJJ6fqMamiq2W17oP1zEb4kKWwEdUarRYBZweRnh3Q","Size":117132},{"Name":"ipfs-add.sh","Hash":"QmXSLYLy13efSFVEN3Ej3A3vyimH618Vrt82hoBKeKYgDB","Size":473},{"Name":"micro_ipfs.js","Hash":"QmeWPj4vzN66eCUwQkjjzTgfciBLBzNjQQdvqEBL8x1pmh","Size":16738},{"Name":"pako","Hash":"QmRtJhu2rJCe59JPS9UiyAja5iUZNmJ8nyBijdZpLLEgG9","Size":178431},{"Name":"sha1.js","Hash":"QmP7HPPYQqwKXYyDrkDm9vKt8FZE1WsDUJG8cLnjFf4a11","Size":7966},{"Name":"sha256.js","Hash":"QmRhgx5Fq4JqfCgsPcMxNSYwt8M9WRBkec9omPWzJ7gdwL","Size":8553}],"Data":"\b\u0001"}});
diff --git a/favicon.ico b/favicon.ico
new file mode 100644
index 0000000..e3df14f
Binary files /dev/null and b/favicon.ico differ
diff --git a/favicon.svg b/favicon.svg
new file mode 100644
index 0000000..8754804
--- /dev/null
+++ b/favicon.svg
@@ -0,0 +1,86 @@
+<?xml version="1.0" encoding="UTF-8" standalone="no"?>
+<!-- Created with Inkscape (http://www.inkscape.org/) -->
+
+<svg
+ xmlns:dc="http://purl.org/dc/elements/1.1/"
+ xmlns:cc="http://creativecommons.org/ns#"
+ xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
+ xmlns:svg="http://www.w3.org/2000/svg"
+ xmlns="http://www.w3.org/2000/svg"
+ xmlns:sodipodi="http://sodipodi.sourceforge.net/DTD/sodipodi-0.dtd"
+ xmlns:inkscape="http://www.inkscape.org/namespaces/inkscape"
+ width="256"
+ height="256"
+ viewBox="0 0 67.733332 67.733335"
+ version="1.1"
+ id="svg8"
+ inkscape:version="0.92.4 (5da689c313, 2019-01-14)"
+ sodipodi:docname="favigon.svg">
+ <defs
+ id="defs2" />
+ <sodipodi:namedview
+ id="base"
+ pagecolor="#ffffff"
+ bordercolor="#666666"
+ borderopacity="1.0"
+ inkscape:pageopacity="0.0"
+ inkscape:pageshadow="2"
+ inkscape:zoom="1.979899"
+ inkscape:cx="108.409"
+ inkscape:cy="84.650401"
+ inkscape:document-units="mm"
+ inkscape:current-layer="layer1"
+ showgrid="false"
+ units="px"
+ inkscape:snap-intersection-paths="true"
+ inkscape:window-width="1912"
+ inkscape:window-height="1001"
+ inkscape:window-x="4"
+ inkscape:window-y="75"
+ inkscape:window-maximized="1" />
+ <metadata
+ id="metadata5">
+ <rdf:RDF>
+ <cc:Work
+ rdf:about="">
+ <dc:format>image/svg+xml</dc:format>
+ <dc:type
+ rdf:resource="http://purl.org/dc/dcmitype/StillImage" />
+ <dc:title></dc:title>
+ </cc:Work>
+ </rdf:RDF>
+ </metadata>
+ <g
+ inkscape:label="Layer 1"
+ inkscape:groupmode="layer"
+ id="layer1"
+ transform="translate(0,-229.26665)">
+ <path
+ sodipodi:nodetypes="ccccc"
+ inkscape:connector-curvature="0"
+ id="path4550"
+ d="m 18.62666,299.6681 -4e-6,-8.84464 c 0,-16.66872 30.48,-16.66872 30.48,-31.04128 l 2e-6,-17.43416 -11.481026,11.48104"
+ style="fill:none;stroke:#3da425;stroke-width:5.715;stroke-linecap:round;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+ <path
+ sodipodi:nodetypes="ccccc"
+ inkscape:connector-curvature="0"
+ id="path4552"
+ d="m 60.587699,253.82906 -11.481041,-11.48104 -2e-6,17.43416 c 0,14.37256 -30.48,14.37256 -30.48,31.04128 l 4e-6,8.84464"
+ style="fill:none;stroke:#3da425;stroke-width:5.715;stroke-linecap:round;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1" />
+ <path
+ style="fill:none;stroke:#f69f0a;stroke-width:5.71500015;stroke-linecap:round;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+ d="M 18.62666,299.6681 V 242.34802 L 7.1456345,253.82906"
+ id="path4518"
+ inkscape:connector-curvature="0"
+ sodipodi:nodetypes="ccc" />
+ <path
+ style="fill:none;stroke:#f69f0a;stroke-width:5.71500015;stroke-linecap:round;stroke-linejoin:round;stroke-miterlimit:4;stroke-dasharray:none;stroke-opacity:1"
+ d="M 30.1077,253.82906 18.626656,242.34802 v 56.12952"
+ id="path4522"
+ inkscape:connector-curvature="0"
+ sodipodi:nodetypes="ccc" />
+ <g
+ id="g4546"
+ transform="matrix(7.2,0,0,7.2,3.3186256,-1842.984)" />
+ </g>
+</svg>
diff --git a/flake.lock b/flake.lock
new file mode 100644
index 0000000..69e41f9
--- /dev/null
+++ b/flake.lock
@@ -0,0 +1,59 @@
+{
+ "nodes": {
+ "archivable": {
+ "inputs": {
+ "nixpkgs": "nixpkgs"
+ },
+ "locked": {
+ "lastModified": 1700523797,
+ "narHash": "sha256-aY7CqvgpJ9TOGIWJjpu0PmMGzXe36GXMHTMgAVlzZ8o=",
+ "owner": "SuzanneSoy",
+ "repo": "archivable",
+ "rev": "c35dc8f760f5640e0c769a6814568d6fe71e5726",
+ "type": "github"
+ },
+ "original": {
+ "owner": "SuzanneSoy",
+ "repo": "archivable",
+ "rev": "c35dc8f760f5640e0c769a6814568d6fe71e5726",
+ "type": "github"
+ }
+ },
+ "nixpkgs": {
+ "locked": {
+ "lastModified": 1700108881,
+ "narHash": "sha256-+Lqybl8kj0+nD/IlAWPPG/RDTa47gff9nbei0u7BntE=",
+ "owner": "NixOS",
+ "repo": "nixpkgs",
+ "rev": "7414e9ee0b3e9903c24d3379f577a417f0aae5f1",
+ "type": "github"
+ },
+ "original": {
+ "id": "nixpkgs",
+ "type": "indirect"
+ }
+ },
+ "nixpkgs_2": {
+ "locked": {
+ "lastModified": 1700108881,
+ "narHash": "sha256-+Lqybl8kj0+nD/IlAWPPG/RDTa47gff9nbei0u7BntE=",
+ "owner": "NixOS",
+ "repo": "nixpkgs",
+ "rev": "7414e9ee0b3e9903c24d3379f577a417f0aae5f1",
+ "type": "github"
+ },
+ "original": {
+ "id": "nixpkgs",
+ "type": "indirect"
+ }
+ },
+ "root": {
+ "inputs": {
+ "archivable": "archivable",
+ "nixpkgs": "nixpkgs_2"
+ }
+ }
+ },
+ "root": "root",
+ "version": 7
+}
diff --git a/flake.nix b/flake.nix
new file mode 100644
index 0000000..b7ab8aa
--- /dev/null
+++ b/flake.nix
@@ -0,0 +1,31 @@
+{
+ description = "GIT tutorial";
+ inputs.archivable.url = github:SuzanneSoy/archivable/c35dc8f760f5640e0c769a6814568d6fe71e5726;
+ outputs = { self, nixpkgs, archivable }: {
+ defaultPackage.x86_64-linux = self.packages.x86_64-linux.website;
+ packages.x86_64-linux.website =
+ let pkgs = import nixpkgs { system = "x86_64-linux"; }; in
+ pkgs.stdenv.mkDerivation {
+ name = "git-tutorial";
+ src = self;
+ buildInputs = with pkgs; [kubo jq nodejs-slim imagemagick];
+ buildPhase = ''
+ convert -background none favicon.svg -define icon:auto-resize=64,48,32,16 favicon.ico
+
+ mkdir "$out"
+ cp -ai . "$out/www"
+
+ export HOME=.
+ ipfs init
+ ${archivable.packages.x86_64-linux.update-directory-hashes}/bin/update-directory-hashes "$out/www/" 'soy'
+ printf 'ipfs://%s\n' "$(ipfs cid base32 "$(ipfs add --ignore-rules-path "$out/www/.ipfsignore" --pin=false --hidden -Qr "$out/www")")" > "$out/ipfs.url" 2>&1
+ '';
+
+ # Prevent automatic modification of files in the output.
+ dontInstall = true;
+ dontFixup = true;
+ dontPatchELF = true;
+ dontPatchShebangs = true;
+ };
+ };
+}
diff --git a/index.html b/index.html
index 85dd90b..0ca12b6 100644
--- a/index.html
+++ b/index.html
@@ -4,13 +4,11 @@
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" lang="en-GB" xml:lang="en-GB" />
<title>GIT tutorial</title>
-<!-- Replace the "ipfs://…" string below with "#" to obtain the original copy as hosted on IPFS. -->
-<link rel="canonical" class="ipfs-this-hash-placeholder" href="ipfs://bafybeiciboq5zritmgkvmzucvuokajozit7hfwhmappxwmrh2p5zdovdie/" />
+<link rel="canonical" class="ipfs-permalink-href" href="#" />
<link rel="alternate" href="https://suzanne.soy/git-tutorial/" />
<!-- These rel="duplicate" links use an HTML encoding of the rfc6249 Metalink/HTTP -->
-<!-- Replace the "ipfs://…" string below with "#" to obtain the original copy as hosted on IPFS. -->
-<link rel="duplicate" class="ipfs-this-hash-placeholder" href="ipfs://bafybeiciboq5zritmgkvmzucvuokajozit7hfwhmappxwmrh2p5zdovdie/" />
+<link rel="duplicate" class="ipfs-permalink-href" href="#" />
<link rel="duplicate" href="https://suzanne.soy/git-tutorial/" />
<!-- Third-party libraries: -->
@@ -54,13 +52,14 @@ function ___example(id, f) {
<a href="#" class="permalink"><h1 itemprop="headline">Git tutorial: reimplementing part of GIT in JavaScript</h1></a>
<p class="article-metadata">By <a href="https://suzanne.soy/" itemprop="author" rel="author" itemscope="itemscope" itemtype="https://schema.org/Person">Suzanne Soy</a> for <a href="https://ligolang.org/" itemprop="copyrightHolder" itemscope="itemscope" itemtype="https://schema.org/Organization">LIGO</a>. <time itemprop="dateCreated datePublished" datetime="2021-06-29">02021-06-29</time>.</p>
<p>Please send remarks and suggestions to <a href="mailto:git-tutorial@suzanne.soy">git-tutorial@suzanne.soy</a> or simply fork <a href="https://github.com/jsmaniac/git-tutorial">this repository on GitHub</a>.</p>
-<p>This version of the site matches the tag <a id="this-version" href="https://github.com/jsmaniac/git-tutorial/tree/v1">v1</a> on GitHub.
- You can access snapshots of this site via IPFS:
- <!-- Replace the "ipfs://…" string below with "#" to obtain the original copy as hosted on IPFS. -->
- <a class="ipfs-this-hash-placeholder" href="ipfs://bafybeiciboq5zritmgkvmzucvuokajozit7hfwhmappxwmrh2p5zdovdie/" title="published shortly after 02021-06-29">v1 (permalink)</a>,
- or check the
- <a href="ipns://k51qzi5uqu5dggo2mzf6enn9dpcb2qmd4t9tipend4ikqvvmljo6i63lae4soy/">latest version via IPNS/IPFS</a> or
- <a href="https://suzanne.soy/git-tutorial/">via HTTPS</a>.</p>
+<p>This version of the site matches the tag <a id="this-version" href="https://github.com/jsmaniac/git-tutorial/tree/v1.0.1">v1.0.1</a> on GitHub.
+ Permalinks to snapshots of this site are available via IPFS:
+ <a class="ipfs-permalink-href" href="#" title="published on 2023-11-21">v1.0.1 (current version)<span class="while-computing-ipfs-permalink"> [computing URL…]</span></a>,
+ <a class="ipfs-this-hash-placeholder" href="ipfs://bafybeiciboq5zritmgkvmzucvuokajozit7hfwhmappxwmrh2p5zdovdie/" title="published shortly after 02021-06-29">v1 (02021-06-29)</a>,
+ Alternatively check the
+ <a href="ipns://git-tutorial.suzanne.soy/">latest version via IPNS/IPFS</a>
+ or
+ <a href="https://suzanne.soy/git-tutorial/">latest via HTTPS</a>.</p>
<section id="credits-license">
<h2>Credits and license</h2>
@@ -2451,5 +2450,19 @@ commands.</p>
})();
___git_tutorial_onload()
</script>
+<!-- IPFS -->
+<script src="sha256.js"></script>
+<script src="micro_ipfs.js"></script>
+<script src="directory_hashes.js"></script>
+<script>
+ (function() {
+ var hash = ipfs_self_hash.get_link();
+ var elts = document.getElementsByClassName('ipfs-permalink-href');
+ for (var i = 0; i < elts.length; i++) { elts[i].setAttribute('href', 'ipfs://' + hash); }
+ //.innerHTML = '<a href="ipfs://' + hash + '/">Permalink: ipfs://'+hash.substring(0,4)+'…'+hash.substring(53)+'/</a>';
+ var elts2 = document.getElementsByClassName('while-computing-ipfs-permalink');
+ for (var i = 0; i < elts2.length; i++) { elts2[i].remove(); }
+ })();
+</script>
</body>
</html>
diff --git a/ipfs-add.sh b/ipfs-add.sh
new file mode 100755
index 0000000..a65a3e3
--- /dev/null
+++ b/ipfs-add.sh
@@ -0,0 +1,14 @@
+#!/usr/bin/env bash
+
+set -euET -o pipefail
+
+usage() {
+ printf "Usage:\n"
+ printf " %s --pin=true\n" "$0"
+ printf " %s --pin=false\n" "$0"
+}
+if test $# -lt 1; then usage; exit 1; fi
+if test "x$1" = "x-h" || test "x$1" = "x--help"; then usage; exit 0; fi
+if test "x$1" != "x--pin=true" && test "x$1" != "x--pin=false"; then usage; exit 1; fi
+
+ipfs cid base32 "$(ipfs add --ignore-rules-path "$(dirname "$0")/.ipfsignore" "$1" --hidden -Qr "$(dirname "$0")")"
diff --git a/micro_ipfs.js b/micro_ipfs.js
new file mode 100644
index 0000000..2c2bb6d
--- /dev/null
+++ b/micro_ipfs.js
@@ -0,0 +1,437 @@
+// for nodejs
+if (typeof sha256 == 'undefined' && typeof require != 'undefined') { try { sha256 = require('./sha256.js').sha256; } catch (e) {console.log(e);} }
+
+var micro_ipfs = (function() {
+ var hexVarintToInteger = function(str) {
+ var s = String(str);
+ var total = 0;
+ var offset = 1;
+ for (var i = 0; i < s.length; i += 2) {
+ var byte = parseInt(s.substring(i, i+2), 16);
+ var isLast = null;
+ if (byte >= 128) {
+ byte -= 128;
+ isLast = false;
+ } else {
+ isLast = true;
+ }
+ total += byte * offset;
+ offset *= Math.pow(2,7);
+ }
+ return total;
+ };
+
+ var hexStringToIntegerList = function(str) {
+ var s = String(str);
+ var result = [];
+ for (var i = 0; i < s.length; i+=2) {
+ result[i/2] = parseInt(s.substring(i, i+2), 16);
+ }
+ return result;
+ };
+
+ var hexStringToString = function(str) {
+ var s = String(str);
+ var result = '';
+ for (var i = 0; i < s.length; i+=2) {
+ result += String.fromCharCode(parseInt(s.substring(i, i+2), 16));
+ }
+ return result;
+ };
+
+ var sha256IntegerListToMultihash = function(base, lst) {
+ // 0x20 is the length of the hash.
+ var i = 0;
+ var result = [];
+ if (base == 32) {
+ // For some reason these are present in the base32 CIDs but not in the base16 CIDs
+ result[i++] = parseInt('01', 16);
+ result[i++] = parseInt('70', 16);
+ }
+ result[i++] = parseInt('12', 16);
+ result[i++] = parseInt('20', 16);
+ for (var j = 0; j < lst.length; j++) {
+ result[j+i] = lst[j];
+ }
+ return result;
+ };
+
+ var integerListToLowercaseBase16Multibase = function(lst) {
+ var result = '';
+ for (var i = 0; i < lst.length; i++) {
+ var hex = lst[i].toString(16);
+ if (hex.length < 2) { hex = '0' + hex; }
+ result += hex;
+ }
+ return 'f' + result;
+ };
+
+ var int8ListToBitList = function(lst) {
+ var result = [];
+ for (var i = 0; i < lst.length; i++) {
+ result[i*8+0] = (lst[i] & 128) ? 1 : 0;
+ result[i*8+1] = (lst[i] & 64) ? 1 : 0;
+ result[i*8+2] = (lst[i] & 32) ? 1 : 0;
+ result[i*8+3] = (lst[i] & 16) ? 1 : 0;
+ result[i*8+4] = (lst[i] & 8) ? 1 : 0;
+ result[i*8+5] = (lst[i] & 4) ? 1 : 0;
+ result[i*8+6] = (lst[i] & 2) ? 1 : 0;
+ result[i*8+7] = (lst[i] & 1) ? 1 : 0;
+ }
+ return result;
+ };
+
+ var base32StringToBitList = function(str) {
+ var baseChars = 'abcdefghijklmnopqrstuvwxyz234567';
+ var s = String(str);
+ var result = [];
+ for (var i = 0; i < s.length; i++) {
+ var part = baseChars.indexOf(s[i]);
+ //for (var j = 0; j < 6; j++) {
+ // result[i*6+j] = (part & Math.pow(2, 6-1-j)) ? 1 : 0;
+ //}
+ result[i*5+0] = (part & 16) ? 1 : 0;
+ result[i*5+1] = (part & 8) ? 1 : 0;
+ result[i*5+2] = (part & 4) ? 1 : 0;
+ result[i*5+3] = (part & 2) ? 1 : 0;
+ result[i*5+4] = (part & 1) ? 1 : 0;
+ }
+ return result;
+ };
+
+ // https://gist.github.com/diafygi/90a3e80ca1c2793220e5/, license: wtfpl
+ var from_b58 = function(S,A){var d=[],b=[],i,j,c,n;for(i in S){j=0,c=A.indexOf(S[i]);if(c<0)return undefined;c||b.length^i?i:b.push(0);while(j in d||c){n=d[j];n=n?n*58+c:c;c=n>>8;d[j]=n%256;j++}}while(j--)b.push(d[j]);return new Uint8Array(b)};
+
+ var base58StringToHexString = function(str) {
+ var baseChars = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz';
+ var ints = from_b58(String(str), baseChars);
+ var result = '';
+ for (var i = 0; i < ints.length; i++) {
+ var hex = ints[i].toString(16);
+ if (hex.length < 2) { hex = '0' + hex; }
+ result += hex;
+ }
+ return result;
+ };
+
+ var integerListToLowercaseBase32Multibase = function(lst) {
+ var baseChars = 'abcdefghijklmnopqrstuvwxyz234567';
+ var result = '';
+ var l = int8ListToBitList(lst);
+
+ for (var i = 0; i < l.length; i+= 5) {
+ var get = function(j) { return ((i+j) < l.length) ? l[i+j] : 0; };
+ var part = get(0) * 16 + get(1) * 8 + get(2) * 4 + get(3) * 2 + get(4) * 1;
+ result += baseChars[part];
+ }
+ return 'b' + result;
+ };
+
+ var base32StringToBase16LowercaseMultibase = function(str) {
+ var baseChars = '0123456789abcdef';
+ var result = '';
+ var l = base32StringToBitList(str);
+
+ for (var i = 0; i < l.length; i+= 4) {
+ var get = function(j) { return ((i+j) < l.length) ? l[i+j] : 0; };
+ var part = get(0) * 8 + get(1) * 4 + get(2) * 2 + get(3) * 1;
+ result += baseChars[part];
+ }
+ return 'f' + result;
+ };
+
+ var integerToHexVarint = function(i) {
+ // This function takes a JavaScript integer and returns a hexadecimal string representing that integer encoded as a protobuf varint according to the rules explained at
+ // https://developers.google.com/protocol-buffers/docs/encoding
+ var result = '';
+ if (i < 0) {
+ throw "Negative integers are supported by Varints but not by this implementation.";
+ } else if (i == 0) {
+ return '00';
+ } else {
+ while (i > 0) {
+ // Get the least significant 7 bits (0..127) of the integer and shift the rest
+ var leastSignificantBits = i & 127;
+ i = i >> 7;
+ // if this is not the last chunk, set the most significant bit to indicate that the value will be continued in the next byte(s).
+ if (i > 0) { leastSignificantBits |= 128; }
+ // Convert to hexadecimal and pad with 0 to get two digits if needed
+ var hex = leastSignificantBits.toString(16);
+ if (hex.length < 2) { hex = '0' + hex; }
+ result += hex;
+ }
+ return result;
+ }
+ }
+
+ var utf8StringToHex = function(str) {
+ // The input must already be a string for which .charCodeAt() always returns a value <256 (i.e. a string encoded into utf-8 and those values re-encoded into javascript's internal utf-16)
+ var s = String(str);
+ var result = '';
+ for (var i = 0; i < s.length; i++) {
+ var hex = s.charCodeAt(i).toString(16);
+ if (hex.length < 2) { hex = '0' + hex; }
+ result += hex;
+ }
+ return result;
+ };
+
+ var ipfsBlockWithLinks = function(object) {
+ // object should be an { "Links": links, "Data": hex-encoded string } object
+ // Aside from encoding differences, it should match the contents of the "ipfs object get --data-encoding=base64 Qm…hash" command
+ //
+ // "Links" should be an array of { 'Hash': cidv1Base16Lowercase, 'Size': Integer } objects.
+ // This functions returns a hexadecimal string which encodes the ipfs block with the given links.
+ // This is a partial implementation which is barely sufficient for re-hashing a file, many of the configurable values are hardcoded.
+ // A Qm…hash can be converted to a "CIDv1 base16 lowercase" hash on the command-line using the following code:
+ // ipfs cid format -v 1 -b base16 -f='%m' Qm…hash
+ //
+ // "File" should be the hex-encoded (base 16, lowercase, no prefix) data, or "false" when the entry is not a DAG leaf
+ //
+ // The "Data" field as given by the following command
+ // ipfs object get --data-encoding=base64 Qm…hash | jq -r '.Data' | base64 -d | xxd -ps
+ // is automatically generated using the "File" field if present and the various sizes etc.
+
+ var links = object.Links;
+ var fileHex = object.File;
+ var result = '';
+
+ for (var i = 0; i < links.length; i++) {
+ var cid = links[i].Hash;
+ var size = links[i].Size;
+ var name = links[i].Name;
+ var fileHex = object.File;
+
+ result += '12';
+
+ var encodedLink = ''
+ // Some sort of separator or terminator
+ encodedLink += '0a';
+
+ // size of the CID (32 bytes + 2 bytes header = 34 bytes = 22 in hex)
+ encodedLink += '22';
+
+ if (cid[0] != 'f' || cid.length != 69) {
+ if (cid[0] == 'Q' && cid[1] == 'm' && cid.length == 46) {
+ cid = 'f' + base58StringToHexString(cid);
+ if (cid[0] != 'f' || cid.length != 69) {
+ throw "Internal error";
+ }
+ } else {
+ throw "Expected a lowercase base16 CIDv1 or a Qm…hash in base58 (length 46). The base16 encoding should start with 'f'" +
+ /*+*/ " and have a length of 32 bytes (64 hexadecimal characters) plus the leading prefix 'f1220' (length of 69 characters in total)" +
+ /*+*/ " as described in https://github.com/multiformats/multibase. The given hash started with " + cid[0] + " and had a length of " + cid.length;
+ }
+ }
+
+ // Add the CID.
+ encodedLink += cid.substring(1);
+
+ // Add a second hardcoded part of the encoding.
+ encodedLink += '12';
+ // length of filename
+ encodedLink += integerToHexVarint(name.length);
+ encodedLink += utf8StringToHex(name);
+
+ encodedLink += '18';
+
+ // Add the size.
+ encodedLink += integerToHexVarint(size);
+
+ var encodedLinkSize = encodedLink.length/2
+ result += integerToHexVarint(encodedLinkSize);
+ result += encodedLink;
+ }
+
+ // Generate the "Data" field
+
+ var totalSize = (fileHex || '').length / 2;
+ for (var i = 0; i < object.Links.length; i++) {
+ totalSize += object.Links[i].ContentSize;
+ }
+
+ var encodedData = '';
+ if (object.isFile) {
+ // '08' '02'
+ encodedData += '08' + '02';
+ // field 12 seems to be optional (for DAG nodes with links (groups of blocks and directories))
+ if (fileHex !== false) {
+ encodedData += '12';
+ encodedData += integerToHexVarint(totalSize);
+ encodedData += fileHex;
+ }
+ // '18' [8f b0 15 = total size of contents of the file = 35022300]
+ encodedData += '18' + integerToHexVarint(totalSize);
+ for (var j = 0; j < object.Links.length; j++) {
+ // 20 [80 80 10 = size of contents of block 1 = 262144]
+ // 20 [8f b0 05 = size of contents of block 2 = 88079]
+ encodedData += '20';
+ encodedData += integerToHexVarint(object.Links[j].ContentSize);
+ }
+ } else {
+ // directory
+ encodedData += '08' + '01';
+ }
+
+ // Some sort of separator or terminator
+ result += '0a';
+ var encodedDataSize = encodedData.length / 2;
+ result += integerToHexVarint(encodedDataSize);
+ result += encodedData;
+
+ return result;
+ };
+
+ var ipfsHashWithLinks = function(base, object) {
+ var block = hexStringToIntegerList(ipfsBlockWithLinks(object));
+ //console.time('sha256');
+ var sha = sha256(block);
+ //console.timeEnd('sha256');
+ var hash = sha256IntegerListToMultihash(base, sha);
+ if (base == 16) {
+ return { "hash" : integerListToLowercaseBase16Multibase(hash), "block" : block };
+ } else {
+ return { "hash" : integerListToLowercaseBase32Multibase(hash), "block" : block };
+ }
+ };
+
+ return {
+ utf8StringToHex: utf8StringToHex,
+ hashWithLinks: ipfsHashWithLinks
+ };
+})();
+
+var ipfs_self_hash = (function() {
+ var ipfs = micro_ipfs;
+ var get_root_with_vanity = function(vanity_attempt, ipfs_directory_hashes) {
+ var find_link_entry = function() {
+ for (var i = 0; i < ipfs_directory_hashes.tree.Links.length; i++) {
+ if (ipfs_directory_hashes.tree.Links[i].Name == 'directory_hashes.js') {
+ return i;
+ }
+ }
+ console.error(ipfs_directory_hashes);
+ console.error(ipfs_directory_hashes.tree.Links);
+ throw "Could not find entry for directory_hashes.js";
+ }
+ var foo_link_entry = find_link_entry();
+ ipfs_directory_hashes.tree.Links[foo_link_entry].Hash = "";
+ ipfs_directory_hashes.tree.Links[foo_link_entry].Size = 0;
+ ipfs_directory_hashes.vanity_number = vanity_attempt;
+
+ // TODO: using JSON.stringify to recreate the file is more brittle, better store the stringified version as a hex string, and then decode it?
+ var file_directory_hashes = 'jsonp_ipfs_directory_hashes(' + JSON.stringify(ipfs_directory_hashes) + ');\n';
+ var foo = ipfs.hashWithLinks(16, {
+ "Links": [],
+ "isFile": true,
+ "File": ipfs.utf8StringToHex(file_directory_hashes)
+ });
+
+ ipfs_directory_hashes.tree.Links[foo_link_entry].Hash = foo.hash;
+ ipfs_directory_hashes.tree.Links[foo_link_entry].Size = foo.block.length;
+
+ root = ipfs.hashWithLinks(32, ipfs_directory_hashes.tree);
+ return root;
+ };
+
+ var expected_vanity_attempt = 32*32*32;
+ var max_vanity_attempt = expected_vanity_attempt*10;
+ function find_vanity_node(vanity_text, vanity_attempt, ipfs_directory_hashes) {
+ if ((! (typeof vanity_text == 'string' || vanity_text instanceof String)) || vanity_text.length != 3) {
+ throw 'find_vanity_node(vanity_text, ...) : expected a string of length 3';
+ }
+ var offset = 1;
+ switch (vanity_text[2]) {
+ case '4':
+ case 'a':
+ case 'e':
+ case 'i':
+ case 'm':
+ case 'q':
+ case 'u':
+ case 'y':
+ offset = 0;
+ }
+ while (true) {
+ if (vanity_attempt > max_vanity_attempt) {
+ // give up:
+ throw 'Failed to brute-force a number that generates the desired vanity text.';
+ } else {
+ var root = get_root_with_vanity(vanity_attempt, ipfs_directory_hashes);
+ if (root.hash[root.hash.length-1-offset] == vanity_text[2] && root.hash[root.hash.length-2-offset] == vanity_text[1]) {
+ console.error(vanity_attempt + ' (' + Math.floor(100*vanity_attempt/expected_vanity_attempt) + '%)');
+ if (root.hash[root.hash.length-3-offset] == vanity_text[0]) {
+ return vanity_attempt;
+ }
+ }
+ vanity_attempt++;
+ }
+ }
+ };
+
+ function find_vanity_browser_(offset, old_root, vanity_text, vanity_attempt, callback, ipfs_directory_hashes) {
+ var root = get_root_with_vanity(vanity_attempt, ipfs_directory_hashes);
+ if (vanity_attempt > max_vanity_attempt) {
+ // give up:
+ root = get_root_with_vanity(ipfs_directory_hashes.vanity_number, ipfs_directory_hashes)
+ callback(root, 'timeout', false);
+ } else {
+ if (root.hash[root.hash.length-1-offset] == vanity_text[2]) {
+ callback(old_root, '… ' + vanity_attempt + ' (' + Math.floor(100*vanity_attempt/expected_vanity_attempt) + '%)', false);
+ if (root.hash[root.hash.length-2-offset] == vanity_text[1] && root.hash[root.hash.length-3-offset] == vanity_text[0]) {
+ callback(root, vanity_attempt, true);
+ } else {
+ window.setTimeout(function() { find_vanity_browser_(offset, old_root, vanity_text, vanity_attempt + 1, callback, ipfs_directory_hashes); }, 0);
+ }
+ } else {
+ window.setTimeout(function() { find_vanity_browser_(offset, old_root, vanity_text, vanity_attempt + 1, callback, ipfs_directory_hashes); }, 0);
+ }
+ }
+ };
+
+ var find_vanity_browser = function(old_root, vanity_text, vanity_attempt, callback, ipfs_directory_hashes) {
+ if ((! (typeof vanity_text == 'string' || vanity_text instanceof String)) || vanity_text.length != 3) {
+ throw 'find_vanity_node(vanity_text, ...) : expected a string of length 3';
+ }
+ var offset = 1;
+ switch (vanity_text[2]) {
+ case '4':
+ case 'a':
+ case 'e':
+ case 'i':
+ case 'm':
+ case 'q':
+ case 'u':
+ case 'y':
+ offset = 0;
+ }
+ return find_vanity_browser(offset, old_root, vanity_text, vanity_attempt, callback, ipfs_directory_hashes)
+ };
+
+ var debug = function(show_link) {
+ var root = get_root_with_vanity(ipfs_directory_hashes.vanity_number, ipfs_directory_hashes);
+ var vanity_text = ipfs_directory_hashes.vanity_text;
+
+ if (root.hash[root.hash.length-1] == vanity_text[2] && root.hash[root.hash.length-2] == vanity_text[1] && root.hash[root.hash.length-3] == vanity_text[0]) {
+ // vanity check is ok
+ show_link(root, ipfs_directory_hashes.vanity_number, true);
+ } else {
+ // Brute-force to try to find a number that gives the desired last 3 characters
+ show_link(root, '…', false);
+ find_vanity_browser(root, vanity_text, 0, show_link, ipfs_directory_hashes);
+ }
+ };
+
+ var get_link = function get_link() {
+ var root = get_root_with_vanity(ipfs_directory_hashes.vanity_number, ipfs_directory_hashes);
+ return root.hash;
+ };
+
+ return { get_link: get_link, find_vanity_browser: find_vanity_browser, find_vanity_node: find_vanity_node };
+ })();
+
+ function jsonp_ipfs_directory_hashes(arg) {
+ ipfs_directory_hashes = arg;
+ }
+
+ if (typeof module != 'undefined') { module.exports = { micro_ipfs : micro_ipfs, ipfs_self_hash : ipfs_self_hash }; }
\ No newline at end of file
diff --git a/sha256.js b/sha256.js
new file mode 100644
index 0000000..2775598
--- /dev/null
+++ b/sha256.js
@@ -0,0 +1,204 @@
+var sha256 = (function() {
+ // SHA-256 for JavaScript.
+ //
+ // Written in 2014-2016 by Dmitry Chestnykh.
+ // Modified from https://github.com/dchest/fast-sha256-js/blob/2cee3ccb977bd4b10e8eeb7fa95036b1d08f2529/sha256.js in 2021 by Suzanne Soy
+ // Unlicense
+ // Public domain, no warranty.
+ //
+ // Function sha256(message) -> hash accepts and returns an Uint8Array
+ var digestLength = 32;
+ var blockSize = 64;
+ // SHA-256 constants
+ var K = new Uint32Array([
+ 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b,
+ 0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01,
+ 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7,
+ 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,
+ 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152,
+ 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147,
+ 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc,
+ 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,
+ 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819,
+ 0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116, 0x1e376c08,
+ 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f,
+ 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,
+ 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2
+ ]);
+ var hashBlocks = function(w, v, p, pos, len) {
+ var a, b, c, d, e, f, g, h, u, i, j, t1, t2;
+ while (len >= 64) {
+ a = v[0];
+ b = v[1];
+ c = v[2];
+ d = v[3];
+ e = v[4];
+ f = v[5];
+ g = v[6];
+ h = v[7];
+ for (i = 0; i < 16; i++) {
+ j = pos + i * 4;
+ w[i] = (((p[j] & 0xff) << 24) | ((p[j + 1] & 0xff) << 16) |
+ ((p[j + 2] & 0xff) << 8) | (p[j + 3] & 0xff));
+ }
+ for (i = 16; i < 64; i++) {
+ u = w[i - 2];
+ t1 = (u >>> 17 | u << (32 - 17)) ^ (u >>> 19 | u << (32 - 19)) ^ (u >>> 10);
+ u = w[i - 15];
+ t2 = (u >>> 7 | u << (32 - 7)) ^ (u >>> 18 | u << (32 - 18)) ^ (u >>> 3);
+ w[i] = (t1 + w[i - 7] | 0) + (t2 + w[i - 16] | 0);
+ }
+ for (i = 0; i < 64; i++) {
+ t1 = (((((e >>> 6 | e << (32 - 6)) ^ (e >>> 11 | e << (32 - 11)) ^
+ (e >>> 25 | e << (32 - 25))) + ((e & f) ^ (~e & g))) | 0) +
+ ((h + ((K[i] + w[i]) | 0)) | 0)) | 0;
+ t2 = (((a >>> 2 | a << (32 - 2)) ^ (a >>> 13 | a << (32 - 13)) ^
+ (a >>> 22 | a << (32 - 22))) + ((a & b) ^ (a & c) ^ (b & c))) | 0;
+ h = g;
+ g = f;
+ f = e;
+ e = (d + t1) | 0;
+ d = c;
+ c = b;
+ b = a;
+ a = (t1 + t2) | 0;
+ }
+ v[0] += a;
+ v[1] += b;
+ v[2] += c;
+ v[3] += d;
+ v[4] += e;
+ v[5] += f;
+ v[6] += g;
+ v[7] += h;
+ pos += 64;
+ len -= 64;
+ }
+ return pos;
+ }
+ // Hash implements SHA256 hash algorithm.
+ var Hash = /** @class */ (function () {
+ function Hash() {
+ this.digestLength = digestLength;
+ this.blockSize = blockSize;
+ // Note: Int32Array is used instead of Uint32Array for performance reasons.
+ this.state = new Int32Array(8); // hash state
+ this.temp = new Int32Array(64); // temporary state
+ this.buffer = new Uint8Array(128); // buffer for data to hash
+ this.bufferLength = 0; // number of bytes in buffer
+ this.bytesHashed = 0; // number of total bytes hashed
+ this.finished = false; // indicates whether the hash was finalized
+ this.reset();
+ }
+ // Resets hash state making it possible
+ // to re-use this instance to hash other data.
+ Hash.prototype.reset = function () {
+ this.state[0] = 0x6a09e667;
+ this.state[1] = 0xbb67ae85;
+ this.state[2] = 0x3c6ef372;
+ this.state[3] = 0xa54ff53a;
+ this.state[4] = 0x510e527f;
+ this.state[5] = 0x9b05688c;
+ this.state[6] = 0x1f83d9ab;
+ this.state[7] = 0x5be0cd19;
+ this.bufferLength = 0;
+ this.bytesHashed = 0;
+ this.finished = false;
+ return this;
+ };
+ // Cleans internal buffers and re-initializes hash state.
+ Hash.prototype.clean = function () {
+ for (var i = 0; i < this.buffer.length; i++) {
+ this.buffer[i] = 0;
+ }
+ for (var i = 0; i < this.temp.length; i++) {
+ this.temp[i] = 0;
+ }
+ this.reset();
+ };
+ // Updates hash state with the given data.
+ //
+ // Optionally, length of the data can be specified to hash
+ // fewer bytes than data.length.
+ //
+ // Throws error when trying to update already finalized hash:
+ // instance must be reset to use it again.
+ Hash.prototype.update = function (data, dataLength) {
+ if (dataLength === void 0) { dataLength = data.length; }
+ if (this.finished) {
+ throw new Error("SHA256: can't update because hash was finished.");
+ }
+ var dataPos = 0;
+ this.bytesHashed += dataLength;
+ if (this.bufferLength > 0) {
+ while (this.bufferLength < 64 && dataLength > 0) {
+ this.buffer[this.bufferLength++] = data[dataPos++];
+ dataLength--;
+ }
+ if (this.bufferLength === 64) {
+ hashBlocks(this.temp, this.state, this.buffer, 0, 64);
+ this.bufferLength = 0;
+ }
+ }
+ if (dataLength >= 64) {
+ dataPos = hashBlocks(this.temp, this.state, data, dataPos, dataLength);
+ dataLength %= 64;
+ }
+ while (dataLength > 0) {
+ this.buffer[this.bufferLength++] = data[dataPos++];
+ dataLength--;
+ }
+ return this;
+ };
+ // Finalizes hash state and puts hash into out.
+ //
+ // If hash was already finalized, puts the same value.
+ Hash.prototype.finish = function (out) {
+ if (!this.finished) {
+ var bytesHashed = this.bytesHashed;
+ var left = this.bufferLength;
+ var bitLenHi = (bytesHashed / 0x20000000) | 0;
+ var bitLenLo = bytesHashed << 3;
+ var padLength = (bytesHashed % 64 < 56) ? 64 : 128;
+ this.buffer[left] = 0x80;
+ for (var i = left + 1; i < padLength - 8; i++) {
+ this.buffer[i] = 0;
+ }
+ this.buffer[padLength - 8] = (bitLenHi >>> 24) & 0xff;
+ this.buffer[padLength - 7] = (bitLenHi >>> 16) & 0xff;
+ this.buffer[padLength - 6] = (bitLenHi >>> 8) & 0xff;
+ this.buffer[padLength - 5] = (bitLenHi >>> 0) & 0xff;
+ this.buffer[padLength - 4] = (bitLenLo >>> 24) & 0xff;
+ this.buffer[padLength - 3] = (bitLenLo >>> 16) & 0xff;
+ this.buffer[padLength - 2] = (bitLenLo >>> 8) & 0xff;
+ this.buffer[padLength - 1] = (bitLenLo >>> 0) & 0xff;
+ hashBlocks(this.temp, this.state, this.buffer, 0, padLength);
+ this.finished = true;
+ }
+ for (var i = 0; i < 8; i++) {
+ out[i * 4 + 0] = (this.state[i] >>> 24) & 0xff;
+ out[i * 4 + 1] = (this.state[i] >>> 16) & 0xff;
+ out[i * 4 + 2] = (this.state[i] >>> 8) & 0xff;
+ out[i * 4 + 3] = (this.state[i] >>> 0) & 0xff;
+ }
+ return this;
+ };
+ // Returns the final hash digest.
+ Hash.prototype.digest = function () {
+ var out = new Uint8Array(this.digestLength);
+ this.finish(out);
+ return out;
+ };
+ return Hash;
+ }());
+ // Returns SHA256 hash of data.
+ var hash = function(data) {
+ var h = (new Hash()).update(data);
+ var digest = h.digest();
+ h.clean();
+ return digest;
+ }
+ return hash;
+})();
+
+if (typeof module != 'undefined') { module.exports = { sha256 : sha256 }; }
\ No newline at end of file